Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r240-tall-174915589800436.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is TriangularGrid-PT-5020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-tall-174915589800436
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 8.8K May 29 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 29 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 29 14:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 29 14:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 29 14:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rwxr-xr-x 1 mcc users 183K May 29 14:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1749233689509

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TriangularGrid-PT-5020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 18:14:50] [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]
[2025-06-06 18:14:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 18:14:51] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2025-06-06 18:14:51] [INFO ] Transformed 280 places.
[2025-06-06 18:14:51] [INFO ] Transformed 240 transitions.
[2025-06-06 18:14:51] [INFO ] Parsed PT model containing 280 places and 240 transitions and 960 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA TriangularGrid-PT-5020-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TriangularGrid-PT-5020-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 36 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
// Phase 1: matrix 240 rows 280 cols
[2025-06-06 18:14:51] [INFO ] Computed 116 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:14:51] [INFO ] Implicit Places using invariants in 395 ms returned []
[2025-06-06 18:14:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:14:52] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:14:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11661 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28792 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40525ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40543ms
Finished structural reductions in LTL mode , in 1 iterations and 41326 ms. Remains : 280/280 places, 240/240 transitions.
Support contains 60 out of 280 places after structural reductions.
[2025-06-06 18:15:32] [INFO ] Flatten gal took : 43 ms
[2025-06-06 18:15:32] [INFO ] Flatten gal took : 20 ms
[2025-06-06 18:15:32] [INFO ] Input system was already deterministic with 240 transitions.
Support contains 58 out of 280 places (down from 60) after GAL structural reductions.
RANDOM walk for 1961 steps (0 resets) in 257 ms. (7 steps per ms) remains 0/30 properties
FORMULA TriangularGrid-PT-5020-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA TriangularGrid-PT-5020-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 21 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:15:33] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-06 18:15:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:15:33] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 449 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:15:34] [INFO ] Redundant transitions in 10 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:15:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11078 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 29171 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40277ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40770 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-00
Product exploration explored 100000 steps with 534 reset in 1238 ms.
Product exploration explored 100000 steps with 526 reset in 1268 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 356 steps (0 resets) in 16 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 16 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:16:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:16:17] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-06 18:16:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:16:18] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:16:18] [INFO ] Redundant transitions in 10 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:16:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11293 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28589 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39905ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40412 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 271 steps (0 resets) in 12 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 535 reset in 1126 ms.
Product exploration explored 100000 steps with 504 reset in 1180 ms.
Built C files in :
/tmp/ltsmin832058386128955378
[2025-06-06 18:17:01] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:17:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:17:01] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:17:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:17:01] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:17:01] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:17:01] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin832058386128955378
Running compilation step : cd /tmp/ltsmin832058386128955378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 634 ms.
Running link step : cd /tmp/ltsmin832058386128955378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin832058386128955378;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17953035557007382468.hoa' '--buchi-type=spotba'
LTSmin run took 1521 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-00 finished in 90007 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(F(!p0))))) U (X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:17:03] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-06 18:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:17:03] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10847 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28526 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39396ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39396ms
Finished structural reductions in LTL mode , in 1 iterations and 39845 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 512 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-01
Product exploration explored 100000 steps with 29719 reset in 868 ms.
Product exploration explored 100000 steps with 29683 reset in 895 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 604 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 512 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 4542 steps (2 resets) in 63 ms. (70 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 5 factoid took 821 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 547 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 541 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 2 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:17:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:17:48] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-06 18:17:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:17:49] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:17:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10744 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28269 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39031ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39031ms
Finished structural reductions in LTL mode , in 1 iterations and 39474 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 592 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 498 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
RANDOM walk for 4166 steps (1 resets) in 73 ms. (56 steps per ms) remains 0/10 properties
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p2 p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND p2 (NOT p1)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (AND p2 (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p2) (NOT p1) (NOT p0)))), (F p0), (F (NOT (OR (NOT p2) p1 (NOT p0)))), (F p1)]
Knowledge based reduction with 5 factoid took 919 ms. Reduced automaton from 13 states, 26 edges and 3 AP (stutter sensitive) to 13 states, 26 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 522 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 515 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Stuttering acceptance computed with spot in 511 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Product exploration explored 100000 steps with 29577 reset in 824 ms.
Product exploration explored 100000 steps with 29709 reset in 893 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, false, false, true, false, true, false]
Stuttering acceptance computed with spot in 524 ms :[(AND p1 p0), p1, (AND p0 p1), p1, p0, p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 24 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:18:34] [INFO ] Redundant transitions in 3 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:18:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10741 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28953 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39711ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39712ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39750 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin16772908975236837551
[2025-06-06 18:19:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16772908975236837551
Running compilation step : cd /tmp/ltsmin16772908975236837551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 400 ms.
Running link step : cd /tmp/ltsmin16772908975236837551;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16772908975236837551;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2544916171847404874.hoa' '--buchi-type=spotba'
LTSmin run took 2338 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-01 finished in 133450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((!p0 U (p1||G(!p0))))))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:19:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:19:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2025-06-06 18:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:19:17] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10961 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28583 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39561ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39574ms
Finished structural reductions in LTL mode , in 1 iterations and 39997 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-02
Product exploration explored 100000 steps with 1144 reset in 1195 ms.
Product exploration explored 100000 steps with 1105 reset in 1253 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 564 steps (0 resets) in 17 ms. (31 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 164 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2025-06-06 18:20:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:20:00] [INFO ] [Real]Absence check using 115 positive place invariants in 36 ms returned sat
[2025-06-06 18:20:01] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 18:20:03] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2769 ms returned sat
[2025-06-06 18:20:04] [INFO ] [Real]Absence check using state equation in 1581 ms returned sat
[2025-06-06 18:20:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:20:05] [INFO ] [Nat]Absence check using 115 positive place invariants in 303 ms returned sat
[2025-06-06 18:20:05] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 261 ms returned sat
[2025-06-06 18:20:06] [INFO ] [Nat]Absence check using state equation in 574 ms returned sat
[2025-06-06 18:20:06] [INFO ] Computed and/alt/rep : 165/615/165 causal constraints (skipped 0 transitions) in 26 ms.
[2025-06-06 18:20:06] [INFO ] Added : 101 causal constraints over 21 iterations in 550 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:20:06] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-06 18:20:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:20:07] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11007 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28266 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39301ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39301ms
Finished structural reductions in LTL mode , in 1 iterations and 39765 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 464 steps (0 resets) in 14 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
[2025-06-06 18:20:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:20:47] [INFO ] [Real]Absence check using 115 positive place invariants in 33 ms returned sat
[2025-06-06 18:20:48] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-06 18:20:49] [INFO ] [Real]Absence check using 115 positive and 1 generalized place invariants in 2242 ms returned sat
[2025-06-06 18:20:50] [INFO ] [Real]Absence check using state equation in 817 ms returned sat
[2025-06-06 18:20:50] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:20:50] [INFO ] [Nat]Absence check using 115 positive place invariants in 302 ms returned sat
[2025-06-06 18:20:50] [INFO ] [Nat]Absence check using 115 positive and 1 generalized place invariants in 270 ms returned sat
[2025-06-06 18:20:51] [INFO ] [Nat]Absence check using state equation in 602 ms returned sat
[2025-06-06 18:20:51] [INFO ] Computed and/alt/rep : 165/615/165 causal constraints (skipped 0 transitions) in 13 ms.
[2025-06-06 18:20:52] [INFO ] Added : 101 causal constraints over 21 iterations in 530 ms. Result :sat
Could not prove EG (AND p0 (NOT p1))
Stuttering acceptance computed with spot in 140 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 1095 reset in 1170 ms.
Product exploration explored 100000 steps with 1054 reset in 1240 ms.
Applying partial POR strategy [false, false, false, true]
Stuttering acceptance computed with spot in 151 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 15 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:20:54] [INFO ] Redundant transitions in 2 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:20:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10977 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28779 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39772ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39773ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39796 ms. Remains : 280/280 places, 240/240 transitions.
Built C files in :
/tmp/ltsmin5444953876469937879
[2025-06-06 18:21:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5444953876469937879
Running compilation step : cd /tmp/ltsmin5444953876469937879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 416 ms.
Running link step : cd /tmp/ltsmin5444953876469937879;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5444953876469937879;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9170674591000986047.hoa' '--buchi-type=spotba'
LTSmin run took 1344 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-02 finished in 139639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X((p1 U X(X((!p2&&X((!p2 U (!p3||G(!p2))))))))))))'
Support contains 8 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 1 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:21:36] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-06 18:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:21:37] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10648 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28508 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39169ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39170ms
Finished structural reductions in LTL mode , in 1 iterations and 39595 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 608 ms :[p2, p2, p2, p2, p2, p2, true, (AND p2 p3), p2, p2, p2, p2, (AND p2 p3), (AND p2 p3), (AND p2 p3)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-03
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 2 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-03 finished in 40240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||G(p1)))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:22:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:22:16] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-06 18:22:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:22:17] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 417 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:22:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11128 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28879 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40023ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 40027ms
Finished structural reductions in LTL mode , in 1 iterations and 40447 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-04
Entered a terminal (fully accepting) state of product in 215 steps with 0 reset in 6 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-04 finished in 40618 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0) U p1) U X(!p2))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:22:57] [INFO ] Implicit Places using invariants in 171 ms returned []
[2025-06-06 18:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:22:57] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:22:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10662 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28968 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39646ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39647ms
Finished structural reductions in LTL mode , in 1 iterations and 40100 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 277 ms :[p2, p2, p2, p2, (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), true, (NOT p0), (NOT p1)]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-05
Entered a terminal (fully accepting) state of product in 4991 steps with 1663 reset in 41 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-05 finished in 40441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:23:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:23:38] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-06 18:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:23:38] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:23:38] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:23:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10762 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28716 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39492ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39492ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39912 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-06
Product exploration explored 100000 steps with 221 reset in 1064 ms.
Product exploration explored 100000 steps with 227 reset in 1111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 240 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 838 steps (0 resets) in 26 ms. (31 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 442 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 10 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:24:21] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-06 18:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:24:21] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:24:21] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:24:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10987 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28632 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39635ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39635ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40050 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 270 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 2593 steps (0 resets) in 67 ms. (38 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 417 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 218 reset in 1041 ms.
Product exploration explored 100000 steps with 202 reset in 1091 ms.
Built C files in :
/tmp/ltsmin4265875267954905603
[2025-06-06 18:25:04] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:25:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:25:04] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:25:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:25:04] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:25:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:25:04] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4265875267954905603
Running compilation step : cd /tmp/ltsmin4265875267954905603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 495 ms.
Running link step : cd /tmp/ltsmin4265875267954905603;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin4265875267954905603;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1605445061928693074.hoa' '--buchi-type=spotba'
LTSmin run took 1544 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-06 finished in 88498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p1))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:25:06] [INFO ] Implicit Places using invariants in 174 ms returned []
[2025-06-06 18:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:25:06] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:25:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10987 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28288 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39290ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39290ms
Finished structural reductions in LTL mode , in 1 iterations and 39734 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 80 ms :[p1, p1, true]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-07
Entered a terminal (fully accepting) state of product in 163 steps with 0 reset in 3 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-07 finished in 39831 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(X(G(p1)))))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 3 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:25:46] [INFO ] Implicit Places using invariants in 176 ms returned []
[2025-06-06 18:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:25:46] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10813 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28690 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39518ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39520ms
Finished structural reductions in LTL mode , in 1 iterations and 39952 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 352 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 70 steps with 0 reset in 3 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TriangularGrid-PT-5020-LTLFireability-10 finished in 40329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(!p1 U p2))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 8 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:26:26] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-06 18:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:26:26] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:26:26] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11176 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28750 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39939ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39939ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 40372 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p2))]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-11
Product exploration explored 100000 steps with 1975 reset in 1171 ms.
Product exploration explored 100000 steps with 2026 reset in 1239 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 386 steps (0 resets) in 13 ms. (27 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2)]
Knowledge based reduction with 4 factoid took 229 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
[2025-06-06 18:27:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:27:11] [INFO ] [Real]Absence check using 115 positive place invariants in 1533 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 4 out of 280 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 14 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:27:11] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-06 18:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:27:11] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:27:11] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:27:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11206 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28306 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39527ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39529ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39949 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p2))]
RANDOM walk for 629 steps (0 resets) in 24 ms. (25 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p0), (F p2)]
Knowledge based reduction with 4 factoid took 262 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p2))]
[2025-06-06 18:27:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:27:53] [INFO ] [Real]Absence check using 115 positive place invariants in 1533 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2046 reset in 1127 ms.
Product exploration explored 100000 steps with 2002 reset in 1222 ms.
Built C files in :
/tmp/ltsmin8002129960195806076
[2025-06-06 18:27:56] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:27:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:27:56] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:27:56] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:27:56] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:27:56] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:27:56] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8002129960195806076
Running compilation step : cd /tmp/ltsmin8002129960195806076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 480 ms.
Running link step : cd /tmp/ltsmin8002129960195806076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin8002129960195806076;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12668198740149874261.hoa' '--buchi-type=spotba'
LTSmin run took 1063 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-11 finished in 91261 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U X(!p1)))))'
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:27:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:27:57] [INFO ] Implicit Places using invariants in 170 ms returned []
[2025-06-06 18:27:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:27:58] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:27:58] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:27:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10711 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28273 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39000ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39001ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 39454 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 237 ms :[p1, p1, (AND (NOT p0) p1), p1, false]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-12
Product exploration explored 100000 steps with 32844 reset in 762 ms.
Product exploration explored 100000 steps with 32709 reset in 819 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 420 ms. Reduced automaton from 5 states, 19 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 259 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 1411 steps (0 resets) in 47 ms. (29 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 695 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 266 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Stuttering acceptance computed with spot in 254 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Support contains 4 out of 280 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 9 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:28:41] [INFO ] Implicit Places using invariants in 179 ms returned []
[2025-06-06 18:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:28:41] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 18:28:41] [INFO ] Redundant transitions in 0 ms returned []
Running 165 sub problems to find dead transitions.
[2025-06-06 18:28:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10624 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 27693 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38334ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 38334ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 38796 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 495 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 1485 steps (0 resets) in 40 ms. (36 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (OR p0 (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (OR p0 (NOT p1)))), (X (X (NOT (OR p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 666 ms. Reduced automaton from 6 states, 22 edges and 2 AP (stutter insensitive) to 6 states, 22 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 224 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Stuttering acceptance computed with spot in 217 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Stuttering acceptance computed with spot in 241 ms :[p1, p1, (AND (NOT p0) p1), p1, false, false]
Product exploration explored 100000 steps with 32810 reset in 813 ms.
Product exploration explored 100000 steps with 32713 reset in 852 ms.
Built C files in :
/tmp/ltsmin8663405646425054355
[2025-06-06 18:29:23] [INFO ] Computing symmetric may disable matrix : 240 transitions.
[2025-06-06 18:29:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:29:23] [INFO ] Computing symmetric may enable matrix : 240 transitions.
[2025-06-06 18:29:23] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:29:23] [INFO ] Computing Do-Not-Accords matrix : 240 transitions.
[2025-06-06 18:29:23] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 18:29:23] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8663405646425054355
Running compilation step : cd /tmp/ltsmin8663405646425054355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 464 ms.
Running link step : cd /tmp/ltsmin8663405646425054355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8663405646425054355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9808369386109436419.hoa' '--buchi-type=spotba'
LTSmin run took 1845 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-12 finished in 88252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))'
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:29:26] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-06 18:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:29:26] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 10717 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28685 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39418ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39418ms
Finished structural reductions in LTL mode , in 1 iterations and 39849 ms. Remains : 280/280 places, 240/240 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (AND (NOT p0) (NOT p1)), p1, false]
Running random walk in product with property : TriangularGrid-PT-5020-LTLFireability-14
Product exploration explored 100000 steps with 28440 reset in 791 ms.
Product exploration explored 100000 steps with 28457 reset in 865 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 387 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
RANDOM walk for 2124 steps (0 resets) in 57 ms. (36 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 p0 p1), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 3 factoid took 563 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Stuttering acceptance computed with spot in 192 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
[2025-06-06 18:30:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:30:11] [INFO ] [Real]Absence check using 115 positive place invariants in 1531 ms returned unknown
Could not prove EG p1
Support contains 6 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 240/240 transitions.
Applied a total of 0 rules in 6 ms. Remains 280 /280 variables (removed 0) and now considering 240/240 (removed 0) transitions.
[2025-06-06 18:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:30:11] [INFO ] Implicit Places using invariants in 168 ms returned []
[2025-06-06 18:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 18:30:11] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 165 sub problems to find dead transitions.
[2025-06-06 18:30:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (OVERLAPS) 0/520 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 520/520 variables, and 396 constraints, problems are : Problem set: 0 solved, 165 unsolved in 11060 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (OVERLAPS) 147/277 variables, 100/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (OVERLAPS) 3/280 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 240/520 variables, 280/396 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/520 variables, 165/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (OVERLAPS) 0/520 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 520/520 variables, and 561 constraints, problems are : Problem set: 0 solved, 165 unsolved in 28580 ms.
Refiners :[Positive P Invariants (semi-flows): 115/115 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 280/280 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39653ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 39654ms
Finished structural reductions in LTL mode , in 1 iterations and 40086 ms. Remains : 280/280 places, 240/240 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
Knowledge based reduction with 1 factoid took 328 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
RANDOM walk for 592 steps (0 resets) in 29 ms. (19 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p2 p0 p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p0 p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 487 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Stuttering acceptance computed with spot in 213 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
[2025-06-06 18:30:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 18:30:54] [INFO ] [Real]Absence check using 115 positive place invariants in 1532 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 176 ms :[p1, p1, (AND (NOT p0) (NOT p1)), p1, false]
Product exploration explored 100000 steps with 26440 reset in 813 ms.
Product exploration explored 100000 steps with 26506 reset in 888 ms.
Built C files in :
/tmp/ltsmin2309240667799185923
[2025-06-06 18:30:56] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2309240667799185923
Running compilation step : cd /tmp/ltsmin2309240667799185923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 407 ms.
Running link step : cd /tmp/ltsmin2309240667799185923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin2309240667799185923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8180113163928564585.hoa' '--buchi-type=spotba'
LTSmin run took 1925 ms.
FORMULA TriangularGrid-PT-5020-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TriangularGrid-PT-5020-LTLFireability-14 finished in 92657 ms.
All properties solved by simple procedures.
Total runtime 967790 ms.

BK_STOP 1749234658743

--------------------
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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="TriangularGrid-PT-5020"
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-5832"
echo " Executing tool itstools"
echo " Input is TriangularGrid-PT-5020, 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 r240-tall-174915589800436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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