Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 9.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K 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 69K 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-10-LTLCardinality-00
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-01
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-02
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-03
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-04
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-05
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-06
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-07
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-08
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-09
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-10
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-11
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-12
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-13
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-14
FORMULA_NAME HealthRecord-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749001713564

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-04 01:48:36] [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 01:48:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:48:36] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2025-06-04 01:48:36] [INFO ] Transformed 158 places.
[2025-06-04 01:48:36] [INFO ] Transformed 333 transitions.
[2025-06-04 01:48:36] [INFO ] Found NUPN structural information;
[2025-06-04 01:48:36] [INFO ] Parsed PT model containing 158 places and 333 transitions and 875 arcs in 417 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
FORMULA HealthRecord-PT-10-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 306/306 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 94 transition count 183
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 94 transition count 183
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 131 place count 91 transition count 177
Iterating global reduction 0 with 3 rules applied. Total rules applied 134 place count 91 transition count 177
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 137 place count 91 transition count 174
Applied a total of 137 rules in 65 ms. Remains 91 /158 variables (removed 67) and now considering 174/306 (removed 132) transitions.
[2025-06-04 01:48:37] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
// Phase 1: matrix 167 rows 91 cols
[2025-06-04 01:48:37] [INFO ] Computed 13 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:48:37] [INFO ] Implicit Places using invariants in 435 ms returned []
[2025-06-04 01:48:37] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2025-06-04 01:48:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:48:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:48:37] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 827 ms to find 0 implicit places.
Running 173 sub problems to find dead transitions.
[2025-06-04 01:48:37] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2025-06-04 01:48:37] [INFO ] Invariant cache hit.
[2025-06-04 01:48:37] [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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:41] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:41] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:41] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:41] [INFO ] Deduced a trap composed of 11 places in 105 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:41] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:41] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:42] [INFO ] Deduced a trap composed of 16 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 01:48:42] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:42] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:42] [INFO ] Deduced a trap composed of 20 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 01:48:42] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:42] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 5 (OVERLAPS) 166/257 variables, 91/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (OVERLAPS) 1/258 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 173 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 117 constraints, problems are : Problem set: 0 solved, 173 unsolved in 16470 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 12/25 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:55] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:56] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:48:57] [INFO ] Deduced a trap composed of 21 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 01:48:57] [INFO ] Deduced a trap composed of 21 places in 84 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 8 (OVERLAPS) 166/257 variables, 91/120 constraints. Problems are: Problem set: 0 solved, 173 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 173/293 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:01] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:01] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:03] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 3/296 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:09] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:12] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:12] [INFO ] Deduced a trap composed of 29 places in 76 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 173 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/258 variables, and 299 constraints, problems are : Problem set: 0 solved, 173 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 173/173 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46782ms problems are : Problem set: 0 solved, 173 unsolved
Search for dead transitions found 0 dead transitions in 46837ms
Starting structural reductions in LTL mode, iteration 1 : 91/158 places, 174/306 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47769 ms. Remains : 91/158 places, 174/306 transitions.
Support contains 42 out of 91 places after structural reductions.
[2025-06-04 01:49:25] [INFO ] Flatten gal took : 84 ms
[2025-06-04 01:49:25] [INFO ] Flatten gal took : 39 ms
[2025-06-04 01:49:25] [INFO ] Input system was already deterministic with 174 transitions.
RANDOM walk for 40000 steps (2504 resets) in 2341 ms. (17 steps per ms) remains 10/23 properties
BEST_FIRST walk for 40003 steps (327 resets) in 274 ms. (145 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (330 resets) in 244 ms. (163 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (323 resets) in 122 ms. (325 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (332 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (322 resets) in 138 ms. (287 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (319 resets) in 64 ms. (615 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (332 resets) in 68 ms. (579 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (318 resets) in 63 ms. (625 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (316 resets) in 80 ms. (493 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (319 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
[2025-06-04 01:49:26] [INFO ] Flow matrix only has 167 transitions (discarded 7 similar events)
[2025-06-04 01:49:26] [INFO ] Invariant cache hit.
[2025-06-04 01:49:26] [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/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 34/91 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 166/257 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 1/258 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/258 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 105 constraints, problems are : Problem set: 0 solved, 8 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 41/57 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:26] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:26] [INFO ] Deduced a trap composed of 28 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 01:49:27] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 34/91 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 16 places in 83 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 27 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:27] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 10 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 15/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:28] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 166/257 variables, 91/123 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 8/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:29] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:29] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:29] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:29] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 8 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 4/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 1/258 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:30] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 10 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/258 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 0/258 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 258/258 variables, and 137 constraints, problems are : Problem set: 0 solved, 8 unsolved in 4015 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 91/91 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4403ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 7 properties in 427 ms.
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 174/174 transitions.
Graph (trivial) has 114 edges and 91 vertex of which 8 / 91 are part of one of the 4 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Graph (complete) has 387 edges and 87 vertex of which 82 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 156
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 80 transition count 155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 7 place count 80 transition count 153
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 12 place count 77 transition count 153
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 40 place count 49 transition count 97
Iterating global reduction 2 with 28 rules applied. Total rules applied 68 place count 49 transition count 97
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 74 place count 43 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 80 place count 43 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 86 place count 43 transition count 78
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 89 place count 40 transition count 70
Iterating global reduction 3 with 3 rules applied. Total rules applied 92 place count 40 transition count 70
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 95 place count 40 transition count 67
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 97 place count 38 transition count 63
Iterating global reduction 4 with 2 rules applied. Total rules applied 99 place count 38 transition count 63
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 105 place count 38 transition count 57
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 115 place count 33 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 116 place count 33 transition count 87
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 119 place count 33 transition count 84
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 122 place count 30 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 124 place count 30 transition count 82
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 6 with 3 rules applied. Total rules applied 127 place count 30 transition count 141
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 131 place count 27 transition count 140
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 134 place count 27 transition count 137
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 135 place count 26 transition count 104
Iterating global reduction 7 with 1 rules applied. Total rules applied 136 place count 26 transition count 104
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 137 place count 25 transition count 102
Iterating global reduction 7 with 1 rules applied. Total rules applied 138 place count 25 transition count 102
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 148 place count 25 transition count 92
Applied a total of 148 rules in 114 ms. Remains 25 /91 variables (removed 66) and now considering 92/174 (removed 82) transitions.
Running 76 sub problems to find dead transitions.
[2025-06-04 01:49:31] [INFO ] Flow matrix only has 74 transitions (discarded 18 similar events)
// Phase 1: matrix 74 rows 25 cols
[2025-06-04 01:49:31] [INFO ] Computed 7 invariants in 2 ms
[2025-06-04 01:49:31] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
At refinement iteration 3 (OVERLAPS) 74/99 variables, 25/32 constraints. Problems are: Problem set: 8 solved, 68 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 20/52 constraints. Problems are: Problem set: 8 solved, 68 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:32] [INFO ] Deduced a trap composed of 10 places in 62 ms of which 4 ms to minimize.
Problem TDEAD30 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 1/53 constraints. Problems are: Problem set: 9 solved, 67 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/53 constraints. Problems are: Problem set: 9 solved, 67 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/53 constraints. Problems are: Problem set: 9 solved, 67 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 53 constraints, problems are : Problem set: 9 solved, 67 unsolved in 2937 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 67 unsolved
Starting Z3 with timeout 20.0 s and query timeout 2000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 67 unsolved
At refinement iteration 1 (OVERLAPS) 1/25 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 67 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 9 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 9 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 74/99 variables, 25/33 constraints. Problems are: Problem set: 9 solved, 67 unsolved
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/99 variables, 20/53 constraints. Problems are: Problem set: 11 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 65/118 constraints. Problems are: Problem set: 11 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:35] [INFO ] Deduced a trap along path composed of 2 places in 18 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/119 constraints. Problems are: Problem set: 11 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/119 constraints. Problems are: Problem set: 11 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/119 constraints. Problems are: Problem set: 11 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 119 constraints, problems are : Problem set: 11 solved, 65 unsolved in 5361 ms.
Refiners :[Generalized P Invariants (flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 65/76 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 8376ms problems are : Problem set: 11 solved, 65 unsolved
Search for dead transitions found 11 dead transitions in 8378ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/91 places, 81/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 81
Applied a total of 1 rules in 14 ms. Remains 25 /25 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8507 ms. Remains : 25/91 places, 81/174 transitions.
RANDOM walk for 40000 steps (25 resets) in 835 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (13 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 389 steps, run visited all 1 properties in 9 ms. (steps per millisecond=43 )
Probabilistic random walk after 389 steps, saw 169 distinct states, run finished after 14 ms. (steps per millisecond=27 ) properties seen :1
FORMULA HealthRecord-PT-10-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HealthRecord-PT-10-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(X(!p1))) U !p2))'
Support contains 8 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 66 transition count 126
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 66 transition count 126
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 54 place count 62 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 58 place count 62 transition count 118
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 64 place count 62 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 61 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 61 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 60 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 60 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 71 place count 60 transition count 104
Applied a total of 71 rules in 16 ms. Remains 60 /91 variables (removed 31) and now considering 104/174 (removed 70) transitions.
[2025-06-04 01:49:40] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
// Phase 1: matrix 99 rows 60 cols
[2025-06-04 01:49:40] [INFO ] Computed 11 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-04 01:49:40] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-04 01:49:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:49:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:49:40] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-04 01:49:40] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-04 01:49:40] [INFO ] Invariant cache hit.
[2025-06-04 01:49:40] [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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 8/11 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 01:49:41] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:41] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:49:42] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 98/158 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (OVERLAPS) 1/159 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 75 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6999 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 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/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/60 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 98/158 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 103/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 178 constraints, problems are : Problem set: 0 solved, 103 unsolved in 11308 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18359ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 18360ms
Starting structural reductions in LTL mode, iteration 1 : 60/91 places, 104/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18637 ms. Remains : 60/91 places, 104/174 transitions.
Stuttering acceptance computed with spot in 594 ms :[p2, p1, p1, p1, true, p1, (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 362 ms.
Product exploration explored 100000 steps with 0 reset in 262 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X p0), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 235 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[p2, p1, p1, p1, true, p1, (NOT p0)]
RANDOM walk for 40000 steps (2502 resets) in 739 ms. (54 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (321 resets) in 277 ms. (143 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (319 resets) in 337 ms. (118 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (330 resets) in 591 ms. (67 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (329 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (336 resets) in 134 ms. (296 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40003 steps (330 resets) in 104 ms. (380 steps per ms) remains 5/5 properties
[2025-06-04 01:50:01] [INFO ] Flow matrix only has 99 transitions (discarded 5 similar events)
[2025-06-04 01:50:01] [INFO ] Invariant cache hit.
[2025-06-04 01:50:01] [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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 26/60 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 98/158 variables, 60/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/159 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 72 constraints, problems are : Problem set: 0 solved, 5 unsolved in 306 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:02] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:02] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/60 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:02] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 98/158 variables, 60/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/159 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/159 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/159 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 80 constraints, problems are : Problem set: 0 solved, 5 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1115ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1966 steps, including 95 resets, run visited all 3 properties in 43 ms. (steps per millisecond=45 )
Parikh walk visited 5 properties in 150 ms.
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p0)), (X p0), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (AND p2 p0))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (AND p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (AND p0 p2))), (F (NOT (OR p0 (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 12 factoid took 351 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLCardinality-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLCardinality-01 finished in 22893 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Graph (trivial) has 106 edges and 91 vertex of which 10 / 91 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 32 place count 54 transition count 110
Iterating global reduction 0 with 31 rules applied. Total rules applied 63 place count 54 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 64 place count 54 transition count 109
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 70 place count 48 transition count 96
Iterating global reduction 1 with 6 rules applied. Total rules applied 76 place count 48 transition count 96
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 82 place count 48 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 85 place count 45 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 88 place count 45 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 91 place count 45 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 93 place count 43 transition count 75
Iterating global reduction 3 with 2 rules applied. Total rules applied 95 place count 43 transition count 75
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 101 place count 43 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 103 place count 42 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 105 place count 41 transition count 71
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 106 place count 41 transition count 70
Applied a total of 106 rules in 45 ms. Remains 41 /91 variables (removed 50) and now considering 70/174 (removed 104) transitions.
[2025-06-04 01:50:03] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
// Phase 1: matrix 63 rows 41 cols
[2025-06-04 01:50:03] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:03] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 01:50:03] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2025-06-04 01:50:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:03] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-04 01:50:03] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:50:03] [INFO ] Redundant transitions in 27 ms returned []
Running 54 sub problems to find dead transitions.
[2025-06-04 01:50:03] [INFO ] Flow matrix only has 63 transitions (discarded 7 similar events)
[2025-06-04 01:50:03] [INFO ] Invariant cache hit.
[2025-06-04 01:50:03] [INFO ] State equation strengthened by 4 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:03] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:04] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:04] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:04] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (OVERLAPS) 62/103 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 58 constraints, problems are : Problem set: 0 solved, 54 unsolved in 2482 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (OVERLAPS) 8/41 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 54 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:06] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (OVERLAPS) 62/103 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 54/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 113 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3107 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5611ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 5611ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/91 places, 70/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5863 ms. Remains : 41/91 places, 70/174 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-02 finished in 5938 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 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 61 transition count 118
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 61 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 56 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 56 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 54 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 83 place count 54 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 53 transition count 91
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 53 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 88 place count 53 transition count 88
Applied a total of 88 rules in 14 ms. Remains 53 /91 variables (removed 38) and now considering 88/174 (removed 86) transitions.
[2025-06-04 01:50:09] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
// Phase 1: matrix 85 rows 53 cols
[2025-06-04 01:50:09] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:09] [INFO ] Implicit Places using invariants in 83 ms returned []
[2025-06-04 01:50:09] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 01:50:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:50:09] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2025-06-04 01:50:09] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2025-06-04 01:50:09] [INFO ] Invariant cache hit.
[2025-06-04 01:50:09] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/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 01:50:10] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:10] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/137 variables, 53/64 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 01:50:11] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/137 variables, 1/65 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 01:50:11] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:12] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/137 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/138 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/138 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 138/138 variables, and 68 constraints, problems are : Problem set: 0 solved, 87 unsolved in 6699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 5/5 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/14 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 01:50:16] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/15 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 01:50:17] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 1/16 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 01:50:17] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 84/137 variables, 53/70 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 87/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 1/138 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 12 (OVERLAPS) 0/138 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 138/138 variables, and 158 constraints, problems are : Problem set: 0 solved, 87 unsolved in 10170 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 16894ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 16894ms
Starting structural reductions in LTL mode, iteration 1 : 53/91 places, 88/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17141 ms. Remains : 53/91 places, 88/174 transitions.
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-04 finished in 17270 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(X((X(p2)&&p1)))))))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 61 transition count 118
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 61 transition count 118
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 65 place count 56 transition count 107
Iterating global reduction 0 with 5 rules applied. Total rules applied 70 place count 56 transition count 107
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 56 transition count 101
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 78 place count 54 transition count 96
Iterating global reduction 1 with 2 rules applied. Total rules applied 80 place count 54 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 54 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 53 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 53 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 87 place count 53 transition count 89
Applied a total of 87 rules in 13 ms. Remains 53 /91 variables (removed 38) and now considering 89/174 (removed 85) transitions.
[2025-06-04 01:50:26] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2025-06-04 01:50:26] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:26] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 01:50:26] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:50:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:50:26] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 01:50:26] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:50:26] [INFO ] Invariant cache hit.
[2025-06-04 01:50:26] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 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 01:50:27] [INFO ] Deduced a trap composed of 16 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 01:50:27] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 65 constraints, problems are : Problem set: 0 solved, 88 unsolved in 4799 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 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 01:50:32] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:32] [INFO ] Deduced a trap composed of 13 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 01:50:32] [INFO ] Deduced a trap composed of 17 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 01:50:32] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:32] [INFO ] Deduced a trap composed of 12 places in 82 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/69 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 88/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 158 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9610 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14438ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 14439ms
Starting structural reductions in LTL mode, iteration 1 : 53/91 places, 89/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14632 ms. Remains : 53/91 places, 89/174 transitions.
Stuttering acceptance computed with spot in 392 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-06
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-06 finished in 15051 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)))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Graph (trivial) has 109 edges and 91 vertex of which 10 / 91 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 29 place count 57 transition count 116
Iterating global reduction 0 with 28 rules applied. Total rules applied 57 place count 57 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 58 place count 57 transition count 115
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 52 transition count 104
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 52 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 70 place count 52 transition count 102
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 73 place count 49 transition count 94
Iterating global reduction 2 with 3 rules applied. Total rules applied 76 place count 49 transition count 94
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 78 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 80 place count 47 transition count 88
Iterating global reduction 3 with 2 rules applied. Total rules applied 82 place count 47 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 88 place count 47 transition count 82
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 4 with 2 rules applied. Total rules applied 90 place count 46 transition count 81
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
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 94 place count 44 transition count 97
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 96 place count 44 transition count 95
Applied a total of 96 rules in 45 ms. Remains 44 /91 variables (removed 47) and now considering 95/174 (removed 79) transitions.
[2025-06-04 01:50:41] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
// Phase 1: matrix 85 rows 44 cols
[2025-06-04 01:50:41] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:41] [INFO ] Implicit Places using invariants in 84 ms returned []
[2025-06-04 01:50:41] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
[2025-06-04 01:50:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 01:50:41] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:50:41] [INFO ] Redundant transitions in 41 ms returned []
Running 79 sub problems to find dead transitions.
[2025-06-04 01:50:41] [INFO ] Flow matrix only has 85 transitions (discarded 10 similar events)
[2025-06-04 01:50:41] [INFO ] Invariant cache hit.
[2025-06-04 01:50:41] [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/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:42] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 84/128 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/129 variables, and 69 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3564 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:45] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:46] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 84/128 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 79/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/129 variables, and 150 constraints, problems are : Problem set: 0 solved, 79 unsolved in 6019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9618ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 9618ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/91 places, 95/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9926 ms. Remains : 44/91 places, 95/174 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-07
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-07 finished in 10061 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(F(p0)) U (p1 U p2))))'
Support contains 6 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 64 transition count 124
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 64 transition count 124
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 58 place count 60 transition count 115
Iterating global reduction 0 with 4 rules applied. Total rules applied 62 place count 60 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 65 place count 60 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 59 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 59 transition count 109
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 68 place count 58 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 69 place count 58 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 72 place count 58 transition count 104
Applied a total of 72 rules in 6 ms. Remains 58 /91 variables (removed 33) and now considering 104/174 (removed 70) transitions.
[2025-06-04 01:50:51] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
// Phase 1: matrix 101 rows 58 cols
[2025-06-04 01:50:51] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:51] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 01:50:51] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 01:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:50:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:50:51] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2025-06-04 01:50:51] [INFO ] Flow matrix only has 101 transitions (discarded 3 similar events)
[2025-06-04 01:50:51] [INFO ] Invariant cache hit.
[2025-06-04 01:50: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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 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 01:50:52] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:53] [INFO ] Deduced a trap composed of 16 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 01:50:53] [INFO ] Deduced a trap composed of 16 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 01:50:53] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 100/158 variables, 58/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (OVERLAPS) 1/159 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/159 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 72 constraints, problems are : Problem set: 0 solved, 103 unsolved in 6167 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 4/4 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 4/13 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 01:50:58] [INFO ] Deduced a trap composed of 13 places in 63 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:50:58] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 100/158 variables, 58/73 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 103/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 1/159 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/159 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 177 constraints, problems are : Problem set: 0 solved, 103 unsolved in 12532 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18721ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 18722ms
Starting structural reductions in LTL mode, iteration 1 : 58/91 places, 104/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18947 ms. Remains : 58/91 places, 104/174 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 419 ms.
Product exploration explored 100000 steps with 50000 reset in 350 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLCardinality-09 finished in 19887 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)&&F(G(p1)))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Graph (trivial) has 112 edges and 91 vertex of which 10 / 91 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 31 place count 55 transition count 112
Iterating global reduction 0 with 30 rules applied. Total rules applied 61 place count 55 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 62 place count 55 transition count 111
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 67 place count 50 transition count 100
Iterating global reduction 1 with 5 rules applied. Total rules applied 72 place count 50 transition count 100
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 78 place count 50 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 80 place count 48 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 48 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 85 place count 48 transition count 86
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 47 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 47 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 90 place count 47 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 92 place count 46 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
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 96 place count 44 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 98 place count 44 transition count 96
Applied a total of 98 rules in 30 ms. Remains 44 /91 variables (removed 47) and now considering 96/174 (removed 78) transitions.
[2025-06-04 01:51:11] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
// Phase 1: matrix 87 rows 44 cols
[2025-06-04 01:51:11] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:11] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 01:51:11] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2025-06-04 01:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2025-06-04 01:51:11] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:51:11] [INFO ] Redundant transitions in 42 ms returned []
Running 80 sub problems to find dead transitions.
[2025-06-04 01:51:11] [INFO ] Flow matrix only has 87 transitions (discarded 9 similar events)
[2025-06-04 01:51:11] [INFO ] Invariant cache hit.
[2025-06-04 01:51:11] [INFO ] State equation strengthened by 17 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:12] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:12] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:12] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 86/130 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 17/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/131 variables, and 73 constraints, problems are : Problem set: 0 solved, 80 unsolved in 3634 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:15] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:15] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:16] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/44 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 86/130 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 17/76 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 80/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 11 (OVERLAPS) 0/130 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/131 variables, and 156 constraints, problems are : Problem set: 0 solved, 80 unsolved in 6279 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9942ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 9942ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/91 places, 96/174 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10220 ms. Remains : 44/91 places, 96/174 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-10 finished in 10396 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X((G(p0)||X(p1)))))))'
Support contains 3 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 62 transition count 120
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 62 transition count 120
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 63 place count 57 transition count 110
Iterating global reduction 0 with 5 rules applied. Total rules applied 68 place count 57 transition count 110
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 74 place count 57 transition count 104
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 55 transition count 98
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 55 transition count 98
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 80 place count 53 transition count 94
Iterating global reduction 1 with 2 rules applied. Total rules applied 82 place count 53 transition count 94
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 53 transition count 89
Applied a total of 87 rules in 9 ms. Remains 53 /91 variables (removed 38) and now considering 89/174 (removed 85) transitions.
[2025-06-04 01:51:21] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 53 cols
[2025-06-04 01:51:21] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:21] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 01:51:21] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:51:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:51:22] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 01:51:22] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:51:22] [INFO ] Invariant cache hit.
[2025-06-04 01:51:22] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 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 01:51:23] [INFO ] Deduced a trap composed of 15 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 01:51:23] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 65 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5607 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 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 01:51:28] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:28] [INFO ] Deduced a trap composed of 9 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 01:51:28] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:28] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 88/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 157 constraints, problems are : Problem set: 0 solved, 88 unsolved in 10340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15967ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 15968ms
Starting structural reductions in LTL mode, iteration 1 : 53/91 places, 89/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16200 ms. Remains : 53/91 places, 89/174 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-11
Product exploration explored 100000 steps with 25000 reset in 240 ms.
Product exploration explored 100000 steps with 25000 reset in 267 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2532 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (329 resets) in 76 ms. (519 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (329 resets) in 73 ms. (540 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (333 resets) in 129 ms. (307 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 263960 steps, run visited all 3 properties in 998 ms. (steps per millisecond=264 )
Probabilistic random walk after 263960 steps, saw 36878 distinct states, run finished after 998 ms. (steps per millisecond=264 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 3 factoid took 199 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2025-06-04 01:51:40] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:51:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:40] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 01:51:40] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:51:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:51:41] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 01:51:41] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:51:41] [INFO ] Invariant cache hit.
[2025-06-04 01:51:41] [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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 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 01:51:42] [INFO ] Deduced a trap composed of 15 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 01:51:42] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (OVERLAPS) 85/138 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 1/139 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 65 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5456 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 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/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 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 01:51:47] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:51:47] [INFO ] Deduced a trap composed of 9 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 01:51:47] [INFO ] Deduced a trap composed of 17 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 01:51:47] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/138 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 88/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 157 constraints, problems are : Problem set: 0 solved, 88 unsolved in 9907 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15381ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 15381ms
Finished structural reductions in LTL mode , in 1 iterations and 15589 ms. Remains : 53/53 places, 89/89 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2533 resets) in 117 ms. (338 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (324 resets) in 42 ms. (930 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (329 resets) in 35 ms. (1111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (327 resets) in 29 ms. (1333 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 263960 steps, run visited all 3 properties in 788 ms. (steps per millisecond=334 )
Probabilistic random walk after 263960 steps, saw 36878 distinct states, run finished after 789 ms. (steps per millisecond=334 ) properties seen :3
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 1 factoid took 149 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 231 ms.
Product exploration explored 100000 steps with 25000 reset in 253 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 53 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 53/53 places, 89/89 transitions.
Graph (trivial) has 48 edges and 53 vertex of which 10 / 53 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 47 transition count 82
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 82
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 47 transition count 81
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -58
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 47 transition count 139
Deduced a syphon composed of 6 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 47 transition count 135
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 14 rules in 28 ms. Remains 47 /53 variables (removed 6) and now considering 135/89 (removed -46) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:51:59] [INFO ] Redundant transitions in 56 ms returned []
Running 119 sub problems to find dead transitions.
[2025-06-04 01:51:59] [INFO ] Flow matrix only has 115 transitions (discarded 20 similar events)
// Phase 1: matrix 115 rows 47 cols
[2025-06-04 01:51:59] [INFO ] Computed 9 invariants in 1 ms
[2025-06-04 01:51:59] [INFO ] State equation strengthened by 25 read => feed constraints.
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: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/47 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:00] [INFO ] Deduced a trap composed of 5 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 01:52:00] [INFO ] Deduced a trap composed of 15 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 01:52:00] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 3 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:00] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 3 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:00] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 4 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 01:52:00] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 4 ms to minimize.
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:01] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 3 ms to minimize.
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:01] [INFO ] Deduced a trap composed of 16 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 01:52:01] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:01] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 11/20 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 4 (OVERLAPS) 114/161 variables, 47/67 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 24/91 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/91 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 1/162 variables, 1/92 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/92 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 0/162 variables, 0/92 constraints. Problems are: Problem set: 12 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 162/162 variables, and 92 constraints, problems are : Problem set: 12 solved, 107 unsolved in 7731 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 107 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 1 (OVERLAPS) 7/47 variables, 9/9 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 11/20 constraints. Problems are: Problem set: 12 solved, 107 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:07] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/21 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/21 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 5 (OVERLAPS) 114/161 variables, 47/68 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 24/92 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 107/199 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/199 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 9 (OVERLAPS) 1/162 variables, 1/200 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/200 constraints. Problems are: Problem set: 12 solved, 107 unsolved
At refinement iteration 11 (OVERLAPS) 0/162 variables, 0/200 constraints. Problems are: Problem set: 12 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 162/162 variables, and 200 constraints, problems are : Problem set: 12 solved, 107 unsolved in 17295 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 107/119 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25095ms problems are : Problem set: 12 solved, 107 unsolved
Search for dead transitions found 12 dead transitions in 25096ms
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 : 47/53 places, 123/89 transitions.
Graph (complete) has 198 edges and 47 vertex of which 41 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 41 /47 variables (removed 6) and now considering 123/123 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/53 places, 123/89 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25199 ms. Remains : 41/53 places, 123/89 transitions.
Built C files in :
/tmp/ltsmin10510631245350820961
[2025-06-04 01:52:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10510631245350820961
Running compilation step : cd /tmp/ltsmin10510631245350820961;'/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 563 ms.
Running link step : cd /tmp/ltsmin10510631245350820961;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 83 ms.
Running LTSmin : cd /tmp/ltsmin10510631245350820961;'/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/stateBased13536971385049819930.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-10-LTLCardinality-11 finished in 63546 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((p0&&F(p1))))'
Support contains 4 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 61 transition count 117
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 61 transition count 117
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 55 transition count 104
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 55 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 78 place count 55 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 81 place count 52 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 84 place count 52 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 87 place count 52 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 89 place count 50 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 91 place count 50 transition count 83
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 96 place count 50 transition count 78
Applied a total of 96 rules in 5 ms. Remains 50 /91 variables (removed 41) and now considering 78/174 (removed 96) transitions.
[2025-06-04 01:52:25] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
// Phase 1: matrix 74 rows 50 cols
[2025-06-04 01:52:25] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:52:25] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-06-04 01:52:25] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
[2025-06-04 01:52:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:52:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:52:25] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2025-06-04 01:52:25] [INFO ] Flow matrix only has 74 transitions (discarded 4 similar events)
[2025-06-04 01:52:25] [INFO ] Invariant cache hit.
[2025-06-04 01:52:25] [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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:26] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:26] [INFO ] Deduced a trap composed of 5 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 01:52:26] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:26] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 4774 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 77/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 142 constraints, problems are : Problem set: 0 solved, 77 unsolved in 6638 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11435ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 11436ms
Starting structural reductions in LTL mode, iteration 1 : 50/91 places, 78/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11642 ms. Remains : 50/91 places, 78/174 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-10-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-10-LTLCardinality-13 finished in 11833 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(F(p0))))'
Support contains 1 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 174/174 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 59 transition count 114
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 59 transition count 114
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 70 place count 53 transition count 101
Iterating global reduction 0 with 6 rules applied. Total rules applied 76 place count 53 transition count 101
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 53 transition count 95
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 85 place count 50 transition count 87
Iterating global reduction 1 with 3 rules applied. Total rules applied 88 place count 50 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 91 place count 50 transition count 84
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 48 transition count 80
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 48 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 101 place count 48 transition count 74
Applied a total of 101 rules in 5 ms. Remains 48 /91 variables (removed 43) and now considering 74/174 (removed 100) transitions.
[2025-06-04 01:52:37] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
// Phase 1: matrix 71 rows 48 cols
[2025-06-04 01:52:37] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:52:37] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 01:52:37] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2025-06-04 01:52:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:52:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:52:37] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 73 sub problems to find dead transitions.
[2025-06-04 01:52:37] [INFO ] Flow matrix only has 71 transitions (discarded 3 similar events)
[2025-06-04 01:52:37] [INFO ] Invariant cache hit.
[2025-06-04 01:52:37] [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/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:38] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:38] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (OVERLAPS) 70/118 variables, 48/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/119 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 60 constraints, problems are : Problem set: 0 solved, 73 unsolved in 4295 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
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, 73 unsolved
At refinement iteration 1 (OVERLAPS) 1/48 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:42] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:42] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/48 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 73 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:52:42] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 70/118 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/118 variables, 73/135 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/118 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 9 (OVERLAPS) 1/119 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 136 constraints, problems are : Problem set: 0 solved, 73 unsolved in 7494 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11807ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 11807ms
Starting structural reductions in LTL mode, iteration 1 : 48/91 places, 74/174 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12013 ms. Remains : 48/91 places, 74/174 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-10-LTLCardinality-14
Product exploration explored 100000 steps with 33333 reset in 176 ms.
Product exploration explored 100000 steps with 33333 reset in 191 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 16 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-10-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-10-LTLCardinality-14 finished in 12551 ms.
All properties solved by simple procedures.
Total runtime 253687 ms.

BK_STOP 1749001969820

--------------------
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-10"
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-10, 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-174867008200611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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