Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008300651.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 HealthRecord-PT-15, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008300651
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 73K May 29 14:32 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 HealthRecord-PT-15-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-15-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749005867691

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 02:57:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 02:57:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 02:57:50] [INFO ] Load time of PNML (sax parser for PT used): 131 ms
[2025-06-04 02:57:50] [INFO ] Transformed 163 places.
[2025-06-04 02:57:50] [INFO ] Transformed 348 transitions.
[2025-06-04 02:57:50] [INFO ] Found NUPN structural information;
[2025-06-04 02:57:50] [INFO ] Parsed PT model containing 163 places and 348 transitions and 919 arcs in 297 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 29 transitions
Reduce redundant transitions removed 29 transitions.
FORMULA HealthRecord-PT-15-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-15-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 319/319 transitions.
Discarding 84 places :
Symmetric choice reduction at 0 with 84 rule applications. Total rules 84 place count 79 transition count 160
Iterating global reduction 0 with 84 rules applied. Total rules applied 168 place count 79 transition count 160
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 173 place count 74 transition count 150
Iterating global reduction 0 with 5 rules applied. Total rules applied 178 place count 74 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 183 place count 74 transition count 145
Applied a total of 183 rules in 46 ms. Remains 74 /163 variables (removed 89) and now considering 145/319 (removed 174) transitions.
[2025-06-04 02:57:50] [INFO ] Flow matrix only has 142 transitions (discarded 3 similar events)
// Phase 1: matrix 142 rows 74 cols
[2025-06-04 02:57:50] [INFO ] Computed 9 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:57:50] [INFO ] Implicit Places using invariants in 355 ms returned []
[2025-06-04 02:57:50] [INFO ] Flow matrix only has 142 transitions (discarded 3 similar events)
[2025-06-04 02:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:57:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:57:51] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2025-06-04 02:57:51] [INFO ] Flow matrix only has 142 transitions (discarded 3 similar events)
[2025-06-04 02:57:51] [INFO ] Invariant cache hit.
[2025-06-04 02:57:51] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:57:53] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:57:53] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:57:53] [INFO ] Deduced a trap composed of 9 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:57:54] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (OVERLAPS) 141/215 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/215 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 1/216 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 0/216 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 88 constraints, problems are : Problem set: 0 solved, 144 unsolved in 11424 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/73 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (OVERLAPS) 1/74 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:03] [INFO ] Deduced a trap composed of 12 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 27 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:04] [INFO ] Deduced a trap composed of 23 places in 85 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:05] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:05] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:05] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:06] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:06] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:07] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/74 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/74 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 141/215 variables, 74/103 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 144/247 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (OVERLAPS) 1/216 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:20] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 144 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:31] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:31] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 216/216 variables, and 251 constraints, problems are : Problem set: 0 solved, 144 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41661ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 41679ms
Starting structural reductions in LTL mode, iteration 1 : 74/163 places, 145/319 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42368 ms. Remains : 74/163 places, 145/319 transitions.
Support contains 23 out of 74 places after structural reductions.
[2025-06-04 02:58:33] [INFO ] Flatten gal took : 69 ms
[2025-06-04 02:58:33] [INFO ] Flatten gal took : 27 ms
[2025-06-04 02:58:33] [INFO ] Input system was already deterministic with 145 transitions.
RANDOM walk for 40000 steps (3690 resets) in 2008 ms. (19 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (467 resets) in 305 ms. (130 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40003 steps (479 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (477 resets) in 158 ms. (251 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (471 resets) in 112 ms. (354 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (477 resets) in 62 ms. (634 steps per ms) remains 4/4 properties
[2025-06-04 02:58:34] [INFO ] Flow matrix only has 142 transitions (discarded 3 similar events)
[2025-06-04 02:58:34] [INFO ] Invariant cache hit.
[2025-06-04 02:58:34] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 24/74 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 141/215 variables, 74/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/215 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 1/216 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/216 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 216/216 variables, and 84 constraints, problems are : Problem set: 0 solved, 4 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 43/50 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:34] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:34] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:34] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:34] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 24/74 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/74 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 141/215 variables, 74/87 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/215 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/215 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/216 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:35] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:35] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 5 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/216 variables, 2/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/216 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 216/216 variables, and 94 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1089 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 74/74 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1288ms problems are : Problem set: 0 solved, 4 unsolved
Finished Parikh walk after 2700 steps, including 117 resets, run visited all 4 properties in 22 ms. (steps per millisecond=122 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 4 properties in 30 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 7 stabilizing places and 10 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' '!(X(F(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 60 transition count 116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 60 transition count 116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 60 transition count 115
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 54 transition count 102
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 54 transition count 102
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 46 place count 54 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 48 place count 52 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 52 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 51 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 51 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 51 transition count 84
Applied a total of 58 rules in 15 ms. Remains 51 /74 variables (removed 23) and now considering 84/145 (removed 61) transitions.
[2025-06-04 02:58:35] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
// Phase 1: matrix 81 rows 51 cols
[2025-06-04 02:58:35] [INFO ] Computed 9 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:58:36] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-04 02:58:36] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2025-06-04 02:58:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:58:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:58:36] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2025-06-04 02:58:36] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2025-06-04 02:58:36] [INFO ] Invariant cache hit.
[2025-06-04 02:58:36] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:37] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:37] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/131 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:38] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (OVERLAPS) 1/132 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/132 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 132/132 variables, and 64 constraints, problems are : Problem set: 0 solved, 83 unsolved in 5391 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:42] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:42] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:42] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 80/131 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 83/149 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/131 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 1/132 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 132/132 variables, and 150 constraints, problems are : Problem set: 0 solved, 83 unsolved in 7852 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13282ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 13284ms
Starting structural reductions in LTL mode, iteration 1 : 51/74 places, 84/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13523 ms. Remains : 51/74 places, 84/145 transitions.
Stuttering acceptance computed with spot in 343 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-00
Stuttering criterion allowed to conclude after 29 steps with 3 reset in 3 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-00 finished in 13979 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((G(p0)&&X(p1))))))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 61 transition count 119
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 61 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 61 transition count 118
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 30 place count 58 transition count 112
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 58 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 57 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 57 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 56 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 56 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 40 place count 56 transition count 104
Applied a total of 40 rules in 15 ms. Remains 56 /74 variables (removed 18) and now considering 104/145 (removed 41) transitions.
[2025-06-04 02:58:49] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
// Phase 1: matrix 101 rows 56 cols
[2025-06-04 02:58:49] [INFO ] Computed 9 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:58:49] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-04 02:58:49] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:58:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:58:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:58:50] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-04 02:58:50] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:58:50] [INFO ] Invariant cache hit.
[2025-06-04 02:58:50] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:51] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:51] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 100/156 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:54] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 6 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/157 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 69 constraints, problems are : Problem set: 0 solved, 103 unsolved in 7742 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:58] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:58] [INFO ] Deduced a trap composed of 21 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:58:58] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 100/156 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 103/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 175 constraints, problems are : Problem set: 0 solved, 103 unsolved in 10050 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17833ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 17835ms
Starting structural reductions in LTL mode, iteration 1 : 56/74 places, 104/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18077 ms. Remains : 56/74 places, 104/145 transitions.
Stuttering acceptance computed with spot in 338 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-01
Product exploration explored 100000 steps with 16 reset in 450 ms.
Product exploration explored 100000 steps with 8 reset in 206 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 326 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3689 resets) in 1001 ms. (39 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (476 resets) in 189 ms. (210 steps per ms) remains 1/1 properties
[2025-06-04 02:59:09] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:59:09] [INFO ] Invariant cache hit.
[2025-06-04 02:59:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:09] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/56 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 100/156 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:10] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/56 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/156 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/157 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:10] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 104/104 transitions.
Graph (trivial) has 50 edges and 56 vertex of which 6 / 56 are part of one of the 3 SCC in 4 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 212 edges and 53 vertex of which 39 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.2 ms
Discarding 14 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 39 transition count 65
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 28 place count 39 transition count 57
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 44 place count 31 transition count 57
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 25 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 25 transition count 43
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 23 transition count 41
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 23 transition count 41
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 23 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 22 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 22 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 22 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 19 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 2 / 17 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 16 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 82 place count 15 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 82 place count 15 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 86 place count 13 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 13 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 12 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 93 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 96 place count 11 transition count 16
Applied a total of 96 rules in 89 ms. Remains 11 /56 variables (removed 45) and now considering 16/104 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 11/56 places, 16/104 transitions.
RANDOM walk for 193 steps (13 resets) in 6 ms. (27 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 339 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 334 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 104/104 transitions.
Applied a total of 0 rules in 2 ms. Remains 56 /56 variables (removed 0) and now considering 104/104 (removed 0) transitions.
[2025-06-04 02:59:11] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:59:11] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-06-04 02:59:11] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 02:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 02:59:11] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-04 02:59:11] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:59:11] [INFO ] Invariant cache hit.
[2025-06-04 02:59:11] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:12] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:12] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 100/156 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/157 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:17] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 7 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/157 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 69 constraints, problems are : Problem set: 0 solved, 103 unsolved in 8548 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 103 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:20] [INFO ] Deduced a trap composed of 11 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:21] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:21] [INFO ] Deduced a trap composed of 12 places in 74 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 100/156 variables, 56/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 103/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 175 constraints, problems are : Problem set: 0 solved, 103 unsolved in 10209 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18820ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 18822ms
Finished structural reductions in LTL mode , in 1 iterations and 19125 ms. Remains : 56/56 places, 104/104 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (3679 resets) in 661 ms. (60 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (485 resets) in 237 ms. (168 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (471 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
[2025-06-04 02:59:31] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 02:59:31] [INFO ] Invariant cache hit.
[2025-06-04 02:59:31] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:31] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 23/56 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 100/156 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:31] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/56 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 100/156 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/156 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/157 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:31] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/157 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/157 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 70 constraints, problems are : Problem set: 0 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 104/104 transitions.
Graph (trivial) has 50 edges and 56 vertex of which 6 / 56 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 212 edges and 53 vertex of which 39 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 39 transition count 65
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 28 place count 39 transition count 57
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 44 place count 31 transition count 57
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 25 transition count 43
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 25 transition count 43
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 23 transition count 41
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 23 transition count 41
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 23 transition count 38
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 22 transition count 37
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 22 transition count 37
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 22 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 20 transition count 33
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 19 transition count 32
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 8 edges and 17 vertex of which 2 / 17 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 76 place count 16 transition count 31
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 82 place count 15 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 82 place count 15 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 86 place count 13 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 88 place count 13 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 12 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 93 place count 12 transition count 18
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 12 transition count 17
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 96 place count 11 transition count 16
Applied a total of 96 rules in 17 ms. Remains 11 /56 variables (removed 45) and now considering 16/104 (removed 88) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 11/56 places, 16/104 transitions.
RANDOM walk for 125 steps (8 resets) in 5 ms. (20 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 1 factoid took 245 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 337 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 295 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 7 reset in 198 ms.
Product exploration explored 100000 steps with 16 reset in 292 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 308 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 104/104 transitions.
Graph (trivial) has 47 edges and 56 vertex of which 6 / 56 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 52 transition count 99
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 52 transition count 99
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 52 transition count 98
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -39
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 52 transition count 137
Deduced a syphon composed of 5 places in 1 ms
Applied a total of 9 rules in 21 ms. Remains 52 /56 variables (removed 4) and now considering 137/104 (removed -33) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 02:59:34] [INFO ] Redundant transitions in 27 ms returned []
Running 121 sub problems to find dead transitions.
[2025-06-04 02:59:34] [INFO ] Flow matrix only has 122 transitions (discarded 15 similar events)
// Phase 1: matrix 122 rows 52 cols
[2025-06-04 02:59:34] [INFO ] Computed 9 invariants in 3 ms
[2025-06-04 02:59:34] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 4 ms to minimize.
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 3 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:35] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 3 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 121/173 variables, 52/68 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 13/81 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/81 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/82 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/174 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 174/174 variables, and 82 constraints, problems are : Problem set: 10 solved, 111 unsolved in 7940 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 111 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 6/52 variables, 9/9 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 7/16 constraints. Problems are: Problem set: 10 solved, 111 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 02:59:42] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/17 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 121/173 variables, 52/69 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 13/82 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 111/193 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/193 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/194 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/194 constraints. Problems are: Problem set: 10 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/174 variables, 0/194 constraints. Problems are: Problem set: 10 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 174/174 variables, and 194 constraints, problems are : Problem set: 10 solved, 111 unsolved in 19149 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 111/121 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 27162ms problems are : Problem set: 10 solved, 111 unsolved
Search for dead transitions found 10 dead transitions in 27163ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 52/56 places, 127/104 transitions.
Graph (complete) has 218 edges and 52 vertex of which 47 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 47 /52 variables (removed 5) and now considering 127/127 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 47/56 places, 127/104 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 27230 ms. Remains : 47/56 places, 127/104 transitions.
Built C files in :
/tmp/ltsmin8821316645720199218
[2025-06-04 03:00:01] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8821316645720199218
Running compilation step : cd /tmp/ltsmin8821316645720199218;'/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 616 ms.
Running link step : cd /tmp/ltsmin8821316645720199218;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin8821316645720199218;'/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/stateBased7449563112808909713.hoa' '--buchi-type=spotba'
LTSmin run took 1110 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLCardinality-01 finished in 73264 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(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Graph (trivial) has 79 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 17 place count 54 transition count 108
Iterating global reduction 0 with 16 rules applied. Total rules applied 33 place count 54 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 35 place count 54 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 49 transition count 95
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 49 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 49 transition count 89
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 47 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 47 transition count 81
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 46 transition count 79
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 46 transition count 79
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 46 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 44 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 68 place count 44 transition count 89
Applied a total of 68 rules in 24 ms. Remains 44 /74 variables (removed 30) and now considering 89/145 (removed 56) transitions.
[2025-06-04 03:00:03] [INFO ] Flow matrix only has 82 transitions (discarded 7 similar events)
// Phase 1: matrix 82 rows 44 cols
[2025-06-04 03:00:03] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:03] [INFO ] Implicit Places using invariants in 58 ms returned []
[2025-06-04 03:00:03] [INFO ] Flow matrix only has 82 transitions (discarded 7 similar events)
[2025-06-04 03:00:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 03:00:03] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:00:03] [INFO ] Redundant transitions in 28 ms returned []
Running 75 sub problems to find dead transitions.
[2025-06-04 03:00:03] [INFO ] Flow matrix only has 82 transitions (discarded 7 similar events)
[2025-06-04 03:00:03] [INFO ] Invariant cache hit.
[2025-06-04 03:00:03] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:04] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:04] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:04] [INFO ] Deduced a trap composed of 14 places in 39 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 81/125 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 71 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:07] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:07] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 81/125 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 75/147 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 1/126 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 0/126 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 148 constraints, problems are : Problem set: 0 solved, 75 unsolved in 7744 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11793ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 11794ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/74 places, 89/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12000 ms. Remains : 44/74 places, 89/145 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-02
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-02 finished in 12051 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(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Graph (trivial) has 81 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 55 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 55 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 33 place count 55 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 50 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 50 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 50 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 49 transition count 89
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 48 transition count 87
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 48 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 56 place count 48 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 60 place count 46 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 46 transition count 100
Applied a total of 61 rules in 23 ms. Remains 46 /74 variables (removed 28) and now considering 100/145 (removed 45) transitions.
[2025-06-04 03:00:15] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
// Phase 1: matrix 92 rows 46 cols
[2025-06-04 03:00:15] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:15] [INFO ] Implicit Places using invariants in 51 ms returned []
[2025-06-04 03:00:15] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:00:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:15] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 03:00:15] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:00:15] [INFO ] Redundant transitions in 25 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 03:00:15] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:00:15] [INFO ] Invariant cache hit.
[2025-06-04 03:00:15] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 14 places in 81 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 13 places in 76 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 9 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:16] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 91/137 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 78 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4823 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:20] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:20] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:20] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:21] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:21] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 91/137 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 86/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 1/138 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/138 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 169 constraints, problems are : Problem set: 0 solved, 86 unsolved in 11287 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16136ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 16137ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/74 places, 100/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16323 ms. Remains : 46/74 places, 100/145 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-04
Product exploration explored 100000 steps with 7 reset in 93 ms.
Product exploration explored 100000 steps with 0 reset in 238 ms.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 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 75 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4172 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (485 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1111571 steps, run visited all 1 properties in 1197 ms. (steps per millisecond=928 )
Probabilistic random walk after 1111571 steps, saw 137646 distinct states, run finished after 1204 ms. (steps per millisecond=923 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 101 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 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 100/100 transitions.
Applied a total of 0 rules in 8 ms. Remains 46 /46 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-06-04 03:00:33] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:33] [INFO ] Implicit Places using invariants in 92 ms returned []
[2025-06-04 03:00:33] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:33] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 03:00:33] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:00:33] [INFO ] Redundant transitions in 42 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 03:00:33] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:00:33] [INFO ] Invariant cache hit.
[2025-06-04 03:00:33] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:34] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:34] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:35] [INFO ] Deduced a trap composed of 14 places in 83 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:35] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:35] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:35] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:35] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 91/137 variables, 46/62 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 15/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 78 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4967 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:39] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:39] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:39] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:40] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:40] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (OVERLAPS) 91/137 variables, 46/67 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 15/82 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 86/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/137 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (OVERLAPS) 1/138 variables, 1/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 13 (OVERLAPS) 0/138 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 169 constraints, problems are : Problem set: 0 solved, 86 unsolved in 11210 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16217ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 16218ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 16503 ms. Remains : 46/46 places, 100/100 transitions.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 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 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (4148 resets) in 206 ms. (193 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (494 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1111571 steps, run visited all 1 properties in 1334 ms. (steps per millisecond=833 )
Probabilistic random walk after 1111571 steps, saw 137646 distinct states, run finished after 1334 ms. (steps per millisecond=833 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 105 ms.
Product exploration explored 100000 steps with 7 reset in 124 ms.
Built C files in :
/tmp/ltsmin1436612888648860084
[2025-06-04 03:00:52] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2025-06-04 03:00:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:00:52] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2025-06-04 03:00:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:00:52] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2025-06-04 03:00:52] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:00:52] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1436612888648860084
Running compilation step : cd /tmp/ltsmin1436612888648860084;'/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 503 ms.
Running link step : cd /tmp/ltsmin1436612888648860084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin1436612888648860084;'/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/stateBased7326864049794638996.hoa' '--buchi-type=spotba'
LTSmin run took 257 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLCardinality-04 finished in 38049 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))))))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 59 transition count 114
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 59 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 59 transition count 113
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 54 transition count 103
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 54 transition count 103
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 47 place count 54 transition count 97
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 53 transition count 94
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 53 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 52 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 52 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 52 transition count 89
Applied a total of 54 rules in 12 ms. Remains 52 /74 variables (removed 22) and now considering 89/145 (removed 56) transitions.
[2025-06-04 03:00:53] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 52 cols
[2025-06-04 03:00:53] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:53] [INFO ] Implicit Places using invariants in 78 ms returned []
[2025-06-04 03:00:53] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 03:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:00:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:00:53] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 03:00:53] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 03:00:53] [INFO ] Invariant cache hit.
[2025-06-04 03:00:53] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:54] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:54] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/137 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 64 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5561 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:59] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:00:59] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/137 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 88/153 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 154 constraints, problems are : Problem set: 0 solved, 88 unsolved in 10186 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15771ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 15771ms
Starting structural reductions in LTL mode, iteration 1 : 52/74 places, 89/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15990 ms. Remains : 52/74 places, 89/145 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-07
Product exploration explored 100000 steps with 20000 reset in 313 ms.
Product exploration explored 100000 steps with 20000 reset in 404 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3689 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (479 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1312225 steps, run visited all 1 properties in 1268 ms. (steps per millisecond=1034 )
Probabilistic random walk after 1312225 steps, saw 159335 distinct states, run finished after 1268 ms. (steps per millisecond=1034 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2025-06-04 03:01:12] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 03:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:01:12] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 03:01:12] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 03:01:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:01:12] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 03:01:12] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 03:01:12] [INFO ] Invariant cache hit.
[2025-06-04 03:01:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:13] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:13] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/137 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/138 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 64 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5220 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:18] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:18] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/137 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 88/153 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 154 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8985 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14227ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 14227ms
Finished structural reductions in LTL mode , in 1 iterations and 14438 ms. Remains : 52/52 places, 89/89 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 71 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (3703 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (471 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1312225 steps, run visited all 1 properties in 1425 ms. (steps per millisecond=920 )
Probabilistic random walk after 1312225 steps, saw 159335 distinct states, run finished after 1425 ms. (steps per millisecond=920 ) properties seen :1
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 237 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 232 ms.
Product exploration explored 100000 steps with 20000 reset in 242 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 52/52 places, 89/89 transitions.
Graph (trivial) has 46 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 48 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 84
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 48 transition count 83
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -50
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 48 transition count 133
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 48 transition count 132
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 11 rules in 27 ms. Remains 48 /52 variables (removed 4) and now considering 132/89 (removed -43) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:01:30] [INFO ] Redundant transitions in 47 ms returned []
Running 116 sub problems to find dead transitions.
[2025-06-04 03:01:30] [INFO ] Flow matrix only has 114 transitions (discarded 18 similar events)
// Phase 1: matrix 114 rows 48 cols
[2025-06-04 03:01:30] [INFO ] Computed 9 invariants in 2 ms
[2025-06-04 03:01:30] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 4 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 3 ms to minimize.
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:31] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 113/161 variables, 48/65 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 19/84 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/84 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/85 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/85 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/85 constraints. Problems are: Problem set: 12 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 85 constraints, problems are : Problem set: 12 solved, 104 unsolved in 7439 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 104 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 7/48 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 8/17 constraints. Problems are: Problem set: 12 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:38] [INFO ] Deduced a trap composed of 7 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:38] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/19 constraints. Problems are: Problem set: 12 solved, 104 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:38] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/20 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 113/161 variables, 48/68 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 19/87 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 104/191 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/191 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 1/162 variables, 1/192 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/162 variables, 0/192 constraints. Problems are: Problem set: 12 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/162 variables, 0/192 constraints. Problems are: Problem set: 12 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 192 constraints, problems are : Problem set: 12 solved, 104 unsolved in 16782 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 104/116 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24275ms problems are : Problem set: 12 solved, 104 unsolved
Search for dead transitions found 12 dead transitions in 24277ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 48/52 places, 120/89 transitions.
Graph (complete) has 200 edges and 48 vertex of which 42 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 42 /48 variables (removed 6) and now considering 120/120 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 42/52 places, 120/89 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 24367 ms. Remains : 42/52 places, 120/89 transitions.
Built C files in :
/tmp/ltsmin18093338334748604681
[2025-06-04 03:01:54] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18093338334748604681
Running compilation step : cd /tmp/ltsmin18093338334748604681;'/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 389 ms.
Running link step : cd /tmp/ltsmin18093338334748604681;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin18093338334748604681;'/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/stateBased4552361709555732929.hoa' '--buchi-type=spotba'
LTSmin run took 240 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLCardinality-07 finished in 61998 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(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Graph (trivial) has 81 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 55 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 55 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 32 place count 55 transition count 109
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 37 place count 50 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 42 place count 50 transition count 99
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 48 place count 50 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 49 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 49 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 51 place count 48 transition count 88
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 48 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 55 place count 48 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 59 place count 46 transition count 102
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 46 transition count 101
Applied a total of 60 rules in 20 ms. Remains 46 /74 variables (removed 28) and now considering 101/145 (removed 44) transitions.
[2025-06-04 03:01:55] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
// Phase 1: matrix 93 rows 46 cols
[2025-06-04 03:01:55] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:01:55] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 03:01:55] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2025-06-04 03:01:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:01:55] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 03:01:55] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:01:55] [INFO ] Redundant transitions in 36 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-04 03:01:55] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2025-06-04 03:01:55] [INFO ] Invariant cache hit.
[2025-06-04 03:01:55] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:56] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:01:56] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 92/138 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 73 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5314 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 92/138 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 87/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 160 constraints, problems are : Problem set: 0 solved, 87 unsolved in 8794 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14151ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 14151ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/74 places, 101/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14421 ms. Remains : 46/74 places, 101/145 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-08
Product exploration explored 100000 steps with 5 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 65 ms.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 29004 steps (3009 resets) in 53 ms. (537 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 121 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 96 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 46 /46 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2025-06-04 03:02:10] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2025-06-04 03:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:02:10] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 03:02:10] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2025-06-04 03:02:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:02:10] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-04 03:02:10] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:02:10] [INFO ] Redundant transitions in 28 ms returned []
Running 87 sub problems to find dead transitions.
[2025-06-04 03:02:10] [INFO ] Flow matrix only has 93 transitions (discarded 8 similar events)
[2025-06-04 03:02:10] [INFO ] Invariant cache hit.
[2025-06-04 03:02:10] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:11] [INFO ] Deduced a trap composed of 4 places in 62 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:11] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 92/138 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 73 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (OVERLAPS) 7/46 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 92/138 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 15/72 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 87/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 160 constraints, problems are : Problem set: 0 solved, 87 unsolved in 8192 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13472ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 13473ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13720 ms. Remains : 46/46 places, 101/101 transitions.
Computed a total of 8 stabilizing places and 21 stable transitions
Computed a total of 8 stabilizing places and 21 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 30971 steps (3221 resets) in 51 ms. (595 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 87 ms.
Product exploration explored 100000 steps with 3 reset in 114 ms.
Built C files in :
/tmp/ltsmin7902838398994649918
[2025-06-04 03:02:24] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2025-06-04 03:02:24] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:02:24] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2025-06-04 03:02:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:02:24] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2025-06-04 03:02:24] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:02:24] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7902838398994649918
Running compilation step : cd /tmp/ltsmin7902838398994649918;'/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 514 ms.
Running link step : cd /tmp/ltsmin7902838398994649918;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin7902838398994649918;'/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/stateBased17462211992491582933.hoa' '--buchi-type=spotba'
LTSmin run took 212 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLCardinality-08 finished in 30383 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(p1))||p0) U p2))'
Support contains 4 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Graph (trivial) has 78 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 15 place count 57 transition count 113
Iterating global reduction 0 with 14 rules applied. Total rules applied 29 place count 57 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 31 place count 57 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 52 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 52 transition count 100
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 44 place count 52 transition count 97
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 50 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 50 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 51 place count 50 transition count 89
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 52 place count 49 transition count 87
Iterating global reduction 3 with 1 rules applied. Total rules applied 53 place count 49 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 49 transition count 85
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 69 place count 42 transition count 121
Applied a total of 69 rules in 20 ms. Remains 42 /74 variables (removed 32) and now considering 121/145 (removed 24) transitions.
[2025-06-04 03:02:25] [INFO ] Flow matrix only has 100 transitions (discarded 21 similar events)
// Phase 1: matrix 100 rows 42 cols
[2025-06-04 03:02:25] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:02:25] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-04 03:02:25] [INFO ] Flow matrix only has 100 transitions (discarded 21 similar events)
[2025-06-04 03:02:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:02:25] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-04 03:02:25] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:02:25] [INFO ] Redundant transitions in 37 ms returned []
Running 105 sub problems to find dead transitions.
[2025-06-04 03:02:25] [INFO ] Flow matrix only has 100 transitions (discarded 21 similar events)
[2025-06-04 03:02:25] [INFO ] Invariant cache hit.
[2025-06-04 03:02:25] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:26] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:27] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (OVERLAPS) 99/141 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 17/70 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (OVERLAPS) 1/142 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 71 constraints, problems are : Problem set: 0 solved, 105 unsolved in 6699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 105 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:33] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 5 (OVERLAPS) 99/141 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 17/71 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 105/176 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 9 (OVERLAPS) 1/142 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/142 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 105 unsolved
At refinement iteration 11 (OVERLAPS) 0/142 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 105 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 177 constraints, problems are : Problem set: 0 solved, 105 unsolved in 13666 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 105/105 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20421ms problems are : Problem set: 0 solved, 105 unsolved
Search for dead transitions found 0 dead transitions in 20422ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/74 places, 121/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20723 ms. Remains : 42/74 places, 121/145 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-10
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-10 finished in 20852 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(p0)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Graph (trivial) has 81 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 16 place count 55 transition count 110
Iterating global reduction 0 with 15 rules applied. Total rules applied 31 place count 55 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 33 place count 55 transition count 108
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 38 place count 50 transition count 97
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 50 transition count 97
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 50 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 49 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 49 transition count 89
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 54 place count 49 transition count 86
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 58 place count 47 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 47 transition count 100
Applied a total of 59 rules in 21 ms. Remains 47 /74 variables (removed 27) and now considering 100/145 (removed 45) transitions.
[2025-06-04 03:02:46] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
// Phase 1: matrix 92 rows 47 cols
[2025-06-04 03:02:46] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:02:46] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 03:02:46] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:02:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:02:46] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 03:02:46] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:02:46] [INFO ] Redundant transitions in 31 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 03:02:46] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:02:46] [INFO ] Invariant cache hit.
[2025-06-04 03:02:46] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:47] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:47] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:47] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 91/138 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 73 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4572 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:51] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:52] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:02:52] [INFO ] Deduced a trap composed of 7 places in 92 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 91/138 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 13/76 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 86/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/139 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 86 unsolved in 8473 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13079ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13080ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/74 places, 100/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13354 ms. Remains : 47/74 places, 100/145 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-12
Product exploration explored 100000 steps with 1 reset in 94 ms.
Product exploration explored 100000 steps with 24 reset in 107 ms.
Computed a total of 8 stabilizing places and 20 stable transitions
Computed a total of 8 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4152 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (496 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1134300 steps, run visited all 1 properties in 1363 ms. (steps per millisecond=832 )
Probabilistic random walk after 1134300 steps, saw 140174 distinct states, run finished after 1363 ms. (steps per millisecond=832 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2025-06-04 03:03:01] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:03:01] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-06-04 03:03:01] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:03:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:03:01] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 03:03:02] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:03:02] [INFO ] Redundant transitions in 27 ms returned []
Running 86 sub problems to find dead transitions.
[2025-06-04 03:03:02] [INFO ] Flow matrix only has 92 transitions (discarded 8 similar events)
[2025-06-04 03:03:02] [INFO ] Invariant cache hit.
[2025-06-04 03:03:02] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:02] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:02] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:03] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (OVERLAPS) 91/138 variables, 47/59 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 13/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 73 constraints, problems are : Problem set: 0 solved, 86 unsolved in 4840 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 2 (OVERLAPS) 7/47 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 86 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:07] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:07] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:07] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:07] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 4/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 6 (OVERLAPS) 91/138 variables, 47/63 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 13/76 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 86/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 10 (OVERLAPS) 1/139 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
At refinement iteration 12 (OVERLAPS) 0/139 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 86 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 163 constraints, problems are : Problem set: 0 solved, 86 unsolved in 8260 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 86/86 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13143ms problems are : Problem set: 0 solved, 86 unsolved
Search for dead transitions found 0 dead transitions in 13143ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 13340 ms. Remains : 47/47 places, 100/100 transitions.
Computed a total of 8 stabilizing places and 20 stable transitions
Computed a total of 8 stabilizing places and 20 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (4154 resets) in 75 ms. (526 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (489 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1134300 steps, run visited all 1 properties in 1272 ms. (steps per millisecond=891 )
Probabilistic random walk after 1134300 steps, saw 140174 distinct states, run finished after 1272 ms. (steps per millisecond=891 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6 reset in 60 ms.
Product exploration explored 100000 steps with 2 reset in 65 ms.
Built C files in :
/tmp/ltsmin14863672291692007113
[2025-06-04 03:03:16] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2025-06-04 03:03:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:03:17] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2025-06-04 03:03:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:03:17] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2025-06-04 03:03:17] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 03:03:17] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14863672291692007113
Running compilation step : cd /tmp/ltsmin14863672291692007113;'/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 470 ms.
Running link step : cd /tmp/ltsmin14863672291692007113;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin14863672291692007113;'/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/stateBased6950982641846709553.hoa' '--buchi-type=spotba'
LTSmin run took 424 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-15-LTLCardinality-12 finished in 31505 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)))'
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 145/145 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 58 transition count 112
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 58 transition count 112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 58 transition count 111
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 39 place count 52 transition count 98
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 52 transition count 98
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 51 place count 52 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 50 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 50 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 49 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 49 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 63 place count 49 transition count 79
Applied a total of 63 rules in 4 ms. Remains 49 /74 variables (removed 25) and now considering 79/145 (removed 66) transitions.
[2025-06-04 03:03:17] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
// Phase 1: matrix 76 rows 49 cols
[2025-06-04 03:03:17] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:03:18] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 03:03:18] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 03:03:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:03:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 03:03:18] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2025-06-04 03:03:18] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2025-06-04 03:03:18] [INFO ] Invariant cache hit.
[2025-06-04 03:03:18] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:19] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:19] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/124 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/124 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/125 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/125 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 125/125 variables, and 61 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4404 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:23] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:23] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:03:23] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/124 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/124 variables, 78/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/125 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 125/125 variables, and 143 constraints, problems are : Problem set: 0 solved, 78 unsolved in 7152 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11573ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 11574ms
Starting structural reductions in LTL mode, iteration 1 : 49/74 places, 79/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11758 ms. Remains : 49/74 places, 79/145 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-15-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-15-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-15-LTLCardinality-14 finished in 11861 ms.
All properties solved by simple procedures.
Total runtime 339866 ms.

BK_STOP 1749006209865

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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