Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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 125K 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-16-LTLFireability-00
FORMULA_NAME HealthRecord-PT-16-LTLFireability-01
FORMULA_NAME HealthRecord-PT-16-LTLFireability-02
FORMULA_NAME HealthRecord-PT-16-LTLFireability-03
FORMULA_NAME HealthRecord-PT-16-LTLFireability-04
FORMULA_NAME HealthRecord-PT-16-LTLFireability-05
FORMULA_NAME HealthRecord-PT-16-LTLFireability-06
FORMULA_NAME HealthRecord-PT-16-LTLFireability-07
FORMULA_NAME HealthRecord-PT-16-LTLFireability-08
FORMULA_NAME HealthRecord-PT-16-LTLFireability-09
FORMULA_NAME HealthRecord-PT-16-LTLFireability-10
FORMULA_NAME HealthRecord-PT-16-LTLFireability-11
FORMULA_NAME HealthRecord-PT-16-LTLFireability-12
FORMULA_NAME HealthRecord-PT-16-LTLFireability-13
FORMULA_NAME HealthRecord-PT-16-LTLFireability-14
FORMULA_NAME HealthRecord-PT-16-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749008178779

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 03:36:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-04 03:36:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 03:36:21] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2025-06-04 03:36:21] [INFO ] Transformed 453 places.
[2025-06-04 03:36:21] [INFO ] Transformed 594 transitions.
[2025-06-04 03:36:21] [INFO ] Found NUPN structural information;
[2025-06-04 03:36:21] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA HealthRecord-PT-16-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 78 places :
Symmetric choice reduction at 0 with 78 rule applications. Total rules 78 place count 375 transition count 505
Iterating global reduction 0 with 78 rules applied. Total rules applied 156 place count 375 transition count 505
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 192 place count 339 transition count 458
Iterating global reduction 0 with 36 rules applied. Total rules applied 228 place count 339 transition count 458
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 232 place count 339 transition count 454
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 246 place count 325 transition count 428
Iterating global reduction 1 with 14 rules applied. Total rules applied 260 place count 325 transition count 428
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 269 place count 316 transition count 412
Iterating global reduction 1 with 9 rules applied. Total rules applied 278 place count 316 transition count 412
Applied a total of 278 rules in 237 ms. Remains 316 /453 variables (removed 137) and now considering 412/594 (removed 182) transitions.
// Phase 1: matrix 412 rows 316 cols
[2025-06-04 03:36:22] [INFO ] Computed 14 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:36:23] [INFO ] Implicit Places using invariants in 609 ms returned []
[2025-06-04 03:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:36:23] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2025-06-04 03:36:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:38] [INFO ] Deduced a trap composed of 35 places in 358 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:38] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:39] [INFO ] Deduced a trap composed of 47 places in 416 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:39] [INFO ] Deduced a trap composed of 148 places in 296 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:40] [INFO ] Deduced a trap composed of 39 places in 331 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:40] [INFO ] Deduced a trap composed of 48 places in 336 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:40] [INFO ] Deduced a trap composed of 54 places in 234 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:41] [INFO ] Deduced a trap composed of 58 places in 254 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:42] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:42] [INFO ] Deduced a trap composed of 76 places in 238 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:42] [INFO ] Deduced a trap composed of 51 places in 343 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:43] [INFO ] Deduced a trap composed of 61 places in 253 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:44] [INFO ] Deduced a trap composed of 143 places in 277 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:44] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:45] [INFO ] Deduced a trap composed of 65 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:45] [INFO ] Deduced a trap composed of 65 places in 224 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:47] [INFO ] Deduced a trap composed of 59 places in 258 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:47] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:48] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:53] [INFO ] Deduced a trap composed of 143 places in 325 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:54] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 42 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 316/728 variables, and 35 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30055 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 411/411 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/315 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (OVERLAPS) 1/316 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/316 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:59] [INFO ] Deduced a trap composed of 49 places in 256 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:36:59] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:00] [INFO ] Deduced a trap composed of 61 places in 211 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:00] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:01] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:01] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:02] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:02] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:02] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:03] [INFO ] Deduced a trap composed of 54 places in 277 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:03] [INFO ] Deduced a trap composed of 59 places in 260 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:04] [INFO ] Deduced a trap composed of 65 places in 219 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:06] [INFO ] Deduced a trap composed of 35 places in 330 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:06] [INFO ] Deduced a trap composed of 60 places in 272 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:06] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:07] [INFO ] Deduced a trap composed of 75 places in 257 ms of which 49 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:10] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:11] [INFO ] Deduced a trap composed of 53 places in 244 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:12] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:14] [INFO ] Deduced a trap composed of 60 places in 336 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:14] [INFO ] Deduced a trap composed of 141 places in 288 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:15] [INFO ] Deduced a trap composed of 61 places in 294 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:15] [INFO ] Deduced a trap composed of 62 places in 284 ms of which 34 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:22] [INFO ] Deduced a trap composed of 43 places in 284 ms of which 53 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 316/728 variables, and 59 constraints, problems are : Problem set: 0 solved, 411 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/316 constraints, PredecessorRefiner: 0/411 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60364ms problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 60396ms
Starting structural reductions in LTL mode, iteration 1 : 316/453 places, 412/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61966 ms. Remains : 316/453 places, 412/594 transitions.
Support contains 34 out of 316 places after structural reductions.
[2025-06-04 03:37:24] [INFO ] Flatten gal took : 112 ms
[2025-06-04 03:37:24] [INFO ] Flatten gal took : 51 ms
[2025-06-04 03:37:24] [INFO ] Input system was already deterministic with 412 transitions.
Support contains 33 out of 316 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (248 resets) in 3315 ms. (12 steps per ms) remains 15/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
[2025-06-04 03:37:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp7 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 107/124 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 192/316 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 412/728 variables, 316/330 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:26] [INFO ] Deduced a trap composed of 58 places in 172 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:27] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 22 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/728 variables, 2/332 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/728 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 0/728 variables, 0/332 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 728/728 variables, and 332 constraints, problems are : Problem set: 1 solved, 14 unsolved in 1830 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 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: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 108/124 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/124 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 192/316 variables, 6/14 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 2/16 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:28] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:28] [INFO ] Deduced a trap composed of 82 places in 140 ms of which 17 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 412/728 variables, 316/334 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/728 variables, 14/348 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:29] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 11 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/728 variables, 1/349 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:30] [INFO ] Deduced a trap composed of 61 places in 197 ms of which 39 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 1/350 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/728 variables, 0/350 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 0/728 variables, 0/350 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 728/728 variables, and 350 constraints, problems are : Problem set: 1 solved, 14 unsolved in 4738 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 316/316 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6584ms problems are : Problem set: 1 solved, 14 unsolved
Parikh walk visited 11 properties in 4676 ms.
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 412/412 transitions.
Graph (trivial) has 353 edges and 316 vertex of which 46 / 316 are part of one of the 17 SCC in 4 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 570 edges and 287 vertex of which 252 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.2 ms
Discarding 35 places :
Also discarding 21 output transitions
Drop transitions (Output transitions of discarded places.) removed 21 transitions
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 175 rules applied. Total rules applied 177 place count 252 transition count 167
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 133 rules applied. Total rules applied 310 place count 134 transition count 152
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 319 place count 126 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 125 transition count 151
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 320 place count 125 transition count 131
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 360 place count 105 transition count 131
Discarding 21 places :
Symmetric choice reduction at 4 with 21 rule applications. Total rules 381 place count 84 transition count 110
Iterating global reduction 4 with 21 rules applied. Total rules applied 402 place count 84 transition count 110
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 402 place count 84 transition count 103
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 416 place count 77 transition count 103
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 419 place count 74 transition count 100
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 74 transition count 100
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 424 place count 72 transition count 98
Iterating global reduction 4 with 2 rules applied. Total rules applied 426 place count 72 transition count 98
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 428 place count 72 transition count 96
Performed 22 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 5 with 44 rules applied. Total rules applied 472 place count 50 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 473 place count 50 transition count 71
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 475 place count 48 transition count 69
Iterating global reduction 6 with 2 rules applied. Total rules applied 477 place count 48 transition count 69
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 483 place count 42 transition count 62
Iterating global reduction 6 with 6 rules applied. Total rules applied 489 place count 42 transition count 62
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 494 place count 42 transition count 57
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 7 with 2 rules applied. Total rules applied 496 place count 41 transition count 56
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 497 place count 40 transition count 55
Iterating global reduction 7 with 1 rules applied. Total rules applied 498 place count 40 transition count 55
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 499 place count 39 transition count 53
Iterating global reduction 7 with 1 rules applied. Total rules applied 500 place count 39 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 501 place count 39 transition count 52
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 509 place count 35 transition count 67
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 510 place count 35 transition count 66
Free-agglomeration rule applied 7 times with reduction of 1 identical transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 517 place count 35 transition count 58
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 524 place count 28 transition count 58
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 525 place count 28 transition count 57
Applied a total of 525 rules in 91 ms. Remains 28 /316 variables (removed 288) and now considering 57/412 (removed 355) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 28/316 places, 57/412 transitions.
RANDOM walk for 40000 steps (2421 resets) in 844 ms. (47 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (454 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
[2025-06-04 03:37:37] [INFO ] Flow matrix only has 49 transitions (discarded 8 similar events)
// Phase 1: matrix 49 rows 28 cols
[2025-06-04 03:37:37] [INFO ] Computed 6 invariants in 2 ms
[2025-06-04 03:37:37] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/50 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/58 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 9/67 variables, 5/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/67 variables, 9/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 10/77 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/77 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/77 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 47 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/50 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 9/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/58 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 9/67 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/67 variables, 9/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/67 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 10/77 variables, 11/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/77 variables, 4/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/77 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 48 constraints, problems are : Problem set: 0 solved, 1 unsolved in 93 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 28/28 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 214ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 57/57 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 27 transition count 55
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 4 place count 26 transition count 54
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 26 transition count 54
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 26 transition count 53
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 3 with 2 rules applied. Total rules applied 8 place count 25 transition count 52
Applied a total of 8 rules in 8 ms. Remains 25 /28 variables (removed 3) and now considering 52/57 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 25/28 places, 52/57 transitions.
RANDOM walk for 40000 steps (1568 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (315 resets) in 79 ms. (500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 497 states, properties seen :0
Probabilistic random walk after 1745 steps, saw 497 distinct states, run finished after 19 ms. (steps per millisecond=91 ) properties seen :0
Explored full state space saw : 497 states, properties seen :0
Exhaustive walk after 1745 steps, saw 497 distinct states, run finished after 5 ms. (steps per millisecond=349 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-16-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 90 stabilizing places and 95 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X((!p1 U (G(!p1)||(!p1&&(G(p2)||F(!p0)))))))))'
Support contains 3 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 303 transition count 391
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 303 transition count 391
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 297 transition count 379
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 297 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 39 place count 297 transition count 378
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 43 place count 293 transition count 374
Iterating global reduction 1 with 4 rules applied. Total rules applied 47 place count 293 transition count 374
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 50 place count 290 transition count 368
Iterating global reduction 1 with 3 rules applied. Total rules applied 53 place count 290 transition count 368
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 56 place count 287 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 59 place count 287 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 284 transition count 360
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 284 transition count 360
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 67 place count 284 transition count 358
Applied a total of 67 rules in 69 ms. Remains 284 /316 variables (removed 32) and now considering 358/412 (removed 54) transitions.
// Phase 1: matrix 358 rows 284 cols
[2025-06-04 03:37:38] [INFO ] Computed 14 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:37:38] [INFO ] Implicit Places using invariants in 213 ms returned []
[2025-06-04 03:37:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:37:39] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2025-06-04 03:37:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:49] [INFO ] Deduced a trap composed of 28 places in 280 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:50] [INFO ] Deduced a trap composed of 134 places in 286 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:50] [INFO ] Deduced a trap composed of 107 places in 279 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:50] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:51] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:52] [INFO ] Deduced a trap composed of 133 places in 279 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:52] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:52] [INFO ] Deduced a trap composed of 40 places in 245 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:53] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:53] [INFO ] Deduced a trap composed of 51 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:54] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:54] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:54] [INFO ] Deduced a trap composed of 57 places in 191 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:55] [INFO ] Deduced a trap composed of 52 places in 242 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:55] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:55] [INFO ] Deduced a trap composed of 58 places in 215 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:56] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:56] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:57] [INFO ] Deduced a trap composed of 111 places in 270 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:37:57] [INFO ] Deduced a trap composed of 46 places in 226 ms of which 37 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:02] [INFO ] Deduced a trap composed of 136 places in 270 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:03] [INFO ] Deduced a trap composed of 113 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:03] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:03] [INFO ] Deduced a trap composed of 70 places in 260 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:04] [INFO ] Deduced a trap composed of 70 places in 253 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:04] [INFO ] Deduced a trap composed of 71 places in 243 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:04] [INFO ] Deduced a trap composed of 72 places in 212 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:04] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:05] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 20 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 284/642 variables, and 43 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/284 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (OVERLAPS) 1/284 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/284 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 29/43 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:15] [INFO ] Deduced a trap composed of 135 places in 243 ms of which 21 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:19] [INFO ] Deduced a trap composed of 52 places in 184 ms of which 20 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (OVERLAPS) 358/642 variables, 284/329 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 357/686 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 686 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Starting structural reductions in LTL mode, iteration 1 : 284/316 places, 358/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60889 ms. Remains : 284/316 places, 358/412 transitions.
Stuttering acceptance computed with spot in 704 ms :[true, p0, (OR (NOT p0) p1), (OR (NOT p0) p1), p1, (AND p0 p1), (AND p0 p1 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA HealthRecord-PT-16-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-02 finished in 61726 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Graph (trivial) has 360 edges and 316 vertex of which 46 / 316 are part of one of the 17 SCC in 2 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 286 transition count 258
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 258 place count 165 transition count 243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 266 place count 157 transition count 243
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 157 transition count 239
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 153 transition count 239
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 297 place count 130 transition count 199
Iterating global reduction 3 with 23 rules applied. Total rules applied 320 place count 130 transition count 199
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 325 place count 130 transition count 194
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 330 place count 125 transition count 194
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 341 place count 114 transition count 174
Iterating global reduction 5 with 11 rules applied. Total rules applied 352 place count 114 transition count 174
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 354 place count 114 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 355 place count 113 transition count 172
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 360 place count 108 transition count 166
Iterating global reduction 7 with 5 rules applied. Total rules applied 365 place count 108 transition count 166
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 367 place count 108 transition count 164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 368 place count 107 transition count 162
Iterating global reduction 8 with 1 rules applied. Total rules applied 369 place count 107 transition count 162
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 370 place count 106 transition count 160
Iterating global reduction 8 with 1 rules applied. Total rules applied 371 place count 106 transition count 160
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 372 place count 105 transition count 158
Iterating global reduction 8 with 1 rules applied. Total rules applied 373 place count 105 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 374 place count 105 transition count 157
Performed 44 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 9 with 88 rules applied. Total rules applied 462 place count 61 transition count 109
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 464 place count 59 transition count 105
Iterating global reduction 9 with 2 rules applied. Total rules applied 466 place count 59 transition count 105
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 467 place count 58 transition count 101
Iterating global reduction 9 with 1 rules applied. Total rules applied 468 place count 58 transition count 101
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 476 place count 54 transition count 130
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 477 place count 53 transition count 128
Iterating global reduction 9 with 1 rules applied. Total rules applied 478 place count 53 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 9 with 17 rules applied. Total rules applied 495 place count 53 transition count 111
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 496 place count 52 transition count 108
Iterating global reduction 9 with 1 rules applied. Total rules applied 497 place count 52 transition count 108
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 498 place count 51 transition count 106
Iterating global reduction 9 with 1 rules applied. Total rules applied 499 place count 51 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 500 place count 51 transition count 105
Applied a total of 500 rules in 116 ms. Remains 51 /316 variables (removed 265) and now considering 105/412 (removed 307) transitions.
[2025-06-04 03:38:40] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
// Phase 1: matrix 97 rows 51 cols
[2025-06-04 03:38:40] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:38:40] [INFO ] Implicit Places using invariants in 74 ms returned []
[2025-06-04 03:38:40] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 03:38:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:38:40] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-04 03:38:40] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:38:40] [INFO ] Redundant transitions in 3 ms returned []
Running 101 sub problems to find dead transitions.
[2025-06-04 03:38:40] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 03:38:40] [INFO ] Invariant cache hit.
[2025-06-04 03:38:40] [INFO ] State equation strengthened by 11 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:41] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:41] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 96/147 variables, 51/60 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/148 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/148 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 148/148 variables, and 71 constraints, problems are : Problem set: 0 solved, 101 unsolved in 5587 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:38:46] [INFO ] Deduced a trap composed of 8 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 03:38:47] [INFO ] Deduced a trap composed of 9 places in 72 ms of which 7 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 96/147 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 10/72 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 101/173 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/148 variables, 1/174 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/148 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/148 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 148/148 variables, and 174 constraints, problems are : Problem set: 0 solved, 101 unsolved in 11680 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 17323ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 17324ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/316 places, 105/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17659 ms. Remains : 51/316 places, 105/412 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-03 finished in 17785 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((G(p0)||(X(X((p1&&G(p2)))) U ((G(p3)&&X(X((p1&&G(p2)))))||G(X(X((p1&&G(p2))))))))))'
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 305 transition count 394
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 305 transition count 394
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 28 place count 299 transition count 382
Iterating global reduction 0 with 6 rules applied. Total rules applied 34 place count 299 transition count 382
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 299 transition count 381
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 295 transition count 377
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 295 transition count 377
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 292 transition count 371
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 292 transition count 371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 289 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 289 transition count 367
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 286 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 286 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 286 transition count 361
Applied a total of 63 rules in 86 ms. Remains 286 /316 variables (removed 30) and now considering 361/412 (removed 51) transitions.
// Phase 1: matrix 361 rows 286 cols
[2025-06-04 03:38:58] [INFO ] Computed 14 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:38:58] [INFO ] Implicit Places using invariants in 188 ms returned []
[2025-06-04 03:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:38:58] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2025-06-04 03:38:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:09] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:10] [INFO ] Deduced a trap composed of 43 places in 288 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:10] [INFO ] Deduced a trap composed of 137 places in 328 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:10] [INFO ] Deduced a trap composed of 31 places in 278 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:11] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:12] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:14] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:15] [INFO ] Deduced a trap composed of 48 places in 151 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:19] [INFO ] Deduced a trap composed of 134 places in 266 ms of which 27 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:24] [INFO ] Deduced a trap composed of 135 places in 277 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:24] [INFO ] Deduced a trap composed of 111 places in 288 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:24] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 286/647 variables, and 26 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/286 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:33] [INFO ] Deduced a trap composed of 40 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 03:39:33] [INFO ] Deduced a trap composed of 51 places in 180 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:34] [INFO ] Deduced a trap composed of 70 places in 298 ms of which 22 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (OVERLAPS) 361/647 variables, 286/315 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/647 variables, 360/675 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:47] [INFO ] Deduced a trap composed of 52 places in 263 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:48] [INFO ] Deduced a trap composed of 53 places in 237 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:48] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:49] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:39:56] [INFO ] Deduced a trap composed of 71 places in 164 ms of which 24 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 647/647 variables, and 680 constraints, problems are : Problem set: 0 solved, 360 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 286/316 places, 361/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60851 ms. Remains : 286/316 places, 361/412 transitions.
Stuttering acceptance computed with spot in 853 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-05
Product exploration explored 100000 steps with 60 reset in 669 ms.
Product exploration explored 100000 steps with 29 reset in 289 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) p2 p1), (X (NOT (AND (NOT p0) p3))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 p1 (NOT p3)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 186 ms. Reduced automaton from 12 states, 37 edges and 4 AP (stutter sensitive) to 10 states, 28 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 628 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (NOT p0) (NOT p2) (NOT p3)), (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)), (OR (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (237 resets) in 571 ms. (69 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 352231 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :10 out of 16
Probabilistic random walk after 352231 steps, saw 81401 distinct states, run finished after 3004 ms. (steps per millisecond=117 ) properties seen :10
[2025-06-04 03:40:05] [INFO ] Invariant cache hit.
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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/103 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/103 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 183/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf15 is UNSAT
At refinement iteration 7 (OVERLAPS) 361/647 variables, 286/300 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/647 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/647 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 300 constraints, problems are : Problem set: 1 solved, 5 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/101 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:05] [INFO ] Deduced a trap composed of 45 places in 100 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:05] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 2/103 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/103 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 183/286 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:06] [INFO ] Deduced a trap composed of 26 places in 236 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:06] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:06] [INFO ] Deduced a trap composed of 48 places in 181 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:06] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:07] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 17 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/286 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/286 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 361/647 variables, 286/307 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/647 variables, 5/312 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/647 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/647 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 647/647 variables, and 312 constraints, problems are : Problem set: 1 solved, 5 unsolved in 2645 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 286/286 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3249ms problems are : Problem set: 1 solved, 5 unsolved
Finished Parikh walk after 812 steps, including 6 resets, run visited all 1 properties in 3 ms. (steps per millisecond=270 )
Parikh walk visited 5 properties in 607 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) p2 p1), (X (NOT (AND (NOT p0) p3))), (X (NOT p3)), (X (NOT (AND p0 p3))), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1 p3)))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p1)))))), (X (X (NOT (AND p2 p1 p3)))), (X (X (NOT (AND p0 p2 p1 p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (AND p2 p1 (NOT p3)))), (X (X p0)), (X (X p1)), (G (OR (NOT p0) (NOT p3) p1 (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (OR p0 p1) (OR p3 p1) p2))), (F (NOT (OR p0 p3 (NOT p1) (NOT p2)))), (F (NOT (AND (OR p0 p1) (OR p0 p2)))), (F (NOT (AND (OR (NOT p0) p1) (OR (NOT p0) p2)))), (F (NOT (AND p1 p2))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p3) (NOT p2)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)))), (F (NOT p2)), (F p3), (F (NOT (OR (NOT p3) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p3) p1 p2))), (F (NOT (AND p0 p1 p2))), (F (NOT (OR p0 (NOT p3) (NOT p1) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (NOT (AND (OR p0 p1) (OR p0 p2))))
Knowledge based reduction with 20 factoid took 343 ms. Reduced automaton from 10 states, 28 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLFireability-05 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLFireability-05 finished in 71230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Graph (trivial) has 357 edges and 316 vertex of which 46 / 316 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 286 transition count 258
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 258 place count 165 transition count 243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 266 place count 157 transition count 243
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 157 transition count 239
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 153 transition count 239
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 295 place count 132 transition count 203
Iterating global reduction 3 with 21 rules applied. Total rules applied 316 place count 132 transition count 203
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 132 transition count 199
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 324 place count 128 transition count 199
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 333 place count 119 transition count 182
Iterating global reduction 5 with 9 rules applied. Total rules applied 342 place count 119 transition count 182
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 346 place count 115 transition count 178
Iterating global reduction 5 with 4 rules applied. Total rules applied 350 place count 115 transition count 178
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 352 place count 115 transition count 176
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 353 place count 114 transition count 174
Iterating global reduction 6 with 1 rules applied. Total rules applied 354 place count 114 transition count 174
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 355 place count 113 transition count 172
Iterating global reduction 6 with 1 rules applied. Total rules applied 356 place count 113 transition count 172
Performed 44 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 444 place count 69 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 445 place count 69 transition count 124
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 448 place count 66 transition count 118
Iterating global reduction 7 with 3 rules applied. Total rules applied 451 place count 66 transition count 118
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 452 place count 65 transition count 114
Iterating global reduction 7 with 1 rules applied. Total rules applied 453 place count 65 transition count 114
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 7 with 14 rules applied. Total rules applied 467 place count 58 transition count 166
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 469 place count 56 transition count 154
Iterating global reduction 7 with 2 rules applied. Total rules applied 471 place count 56 transition count 154
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 473 place count 56 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 8 with 18 rules applied. Total rules applied 491 place count 56 transition count 134
Applied a total of 491 rules in 93 ms. Remains 56 /316 variables (removed 260) and now considering 134/412 (removed 278) transitions.
[2025-06-04 03:40:09] [INFO ] Flow matrix only has 126 transitions (discarded 8 similar events)
// Phase 1: matrix 126 rows 56 cols
[2025-06-04 03:40:09] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:40:09] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 03:40:09] [INFO ] Flow matrix only has 126 transitions (discarded 8 similar events)
[2025-06-04 03:40:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:40:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 03:40:09] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:40:09] [INFO ] Redundant transitions in 7 ms returned []
Running 122 sub problems to find dead transitions.
[2025-06-04 03:40:09] [INFO ] Flow matrix only has 126 transitions (discarded 8 similar events)
[2025-06-04 03:40:09] [INFO ] Invariant cache hit.
[2025-06-04 03:40:09] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:10] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:10] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (OVERLAPS) 125/181 variables, 56/65 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 14/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (OVERLAPS) 1/182 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (OVERLAPS) 0/182 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 80 constraints, problems are : Problem set: 0 solved, 122 unsolved in 8526 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:19] [INFO ] Deduced a trap composed of 8 places in 95 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:19] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 125/181 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 122/203 constraints. Problems are: Problem set: 0 solved, 122 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:22] [INFO ] Deduced a trap composed of 13 places in 91 ms of which 5 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/181 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 10 (OVERLAPS) 1/182 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 12 (OVERLAPS) 0/182 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 205 constraints, problems are : Problem set: 0 solved, 122 unsolved in 18297 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 26907ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 26908ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/316 places, 134/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27267 ms. Remains : 56/316 places, 134/412 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-08
Product exploration explored 100000 steps with 9424 reset in 534 ms.
Product exploration explored 100000 steps with 9433 reset in 471 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 215 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
RANDOM walk for 40000 steps (4203 resets) in 922 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (422 resets) in 36 ms. (1081 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (423 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (418 resets) in 38 ms. (1025 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (422 resets) in 36 ms. (1081 steps per ms) remains 3/3 properties
[2025-06-04 03:40:38] [INFO ] Flow matrix only has 126 transitions (discarded 8 similar events)
[2025-06-04 03:40:38] [INFO ] Invariant cache hit.
[2025-06-04 03:40:38] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/56 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/181 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 78 constraints, problems are : Problem set: 0 solved, 3 unsolved in 200 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 25/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 29/56 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 125/181 variables, 56/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/182 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/182 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/182 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 81 constraints, problems are : Problem set: 0 solved, 3 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 2 properties in 22 ms.
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 134/134 transitions.
Graph (complete) has 185 edges and 56 vertex of which 38 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 17 output transitions
Drop transitions (Output transitions of discarded places.) removed 17 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 30 place count 38 transition count 88
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 1 with 2 rules applied. Total rules applied 32 place count 37 transition count 87
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 36 transition count 85
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 36 transition count 85
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 35 transition count 83
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 35 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 35 transition count 82
Free-agglomeration rule applied 15 times.
Iterating global reduction 1 with 15 rules applied. Total rules applied 52 place count 35 transition count 67
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 69 place count 20 transition count 65
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 72 place count 17 transition count 53
Iterating global reduction 2 with 3 rules applied. Total rules applied 75 place count 17 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 77 place count 17 transition count 51
Applied a total of 77 rules in 21 ms. Remains 17 /56 variables (removed 39) and now considering 51/134 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 17/56 places, 51/134 transitions.
RANDOM walk for 32602 steps (8276 resets) in 958 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 13 factoid took 498 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLFireability-08 finished in 30546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X(F(p0))))||(p1&&X(F(p2))))))'
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 303 transition count 391
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 303 transition count 391
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 298 transition count 381
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 298 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 298 transition count 380
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 295 transition count 377
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 295 transition count 377
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 45 place count 293 transition count 373
Iterating global reduction 1 with 2 rules applied. Total rules applied 47 place count 293 transition count 373
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 291 transition count 370
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 291 transition count 370
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 289 transition count 367
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 289 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 289 transition count 366
Applied a total of 56 rules in 56 ms. Remains 289 /316 variables (removed 27) and now considering 366/412 (removed 46) transitions.
// Phase 1: matrix 366 rows 289 cols
[2025-06-04 03:40:39] [INFO ] Computed 14 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:40:40] [INFO ] Implicit Places using invariants in 182 ms returned []
[2025-06-04 03:40:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:40:40] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-04 03:40:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:50] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:51] [INFO ] Deduced a trap composed of 136 places in 289 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:51] [INFO ] Deduced a trap composed of 109 places in 286 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:51] [INFO ] Deduced a trap composed of 55 places in 301 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:52] [INFO ] Deduced a trap composed of 43 places in 300 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:52] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:53] [INFO ] Deduced a trap composed of 134 places in 274 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:53] [INFO ] Deduced a trap composed of 112 places in 265 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:53] [INFO ] Deduced a trap composed of 41 places in 234 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:54] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:55] [INFO ] Deduced a trap composed of 57 places in 245 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:55] [INFO ] Deduced a trap composed of 114 places in 338 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:56] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:56] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:57] [INFO ] Deduced a trap composed of 54 places in 229 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:57] [INFO ] Deduced a trap composed of 59 places in 224 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:57] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:58] [INFO ] Deduced a trap composed of 59 places in 225 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:58] [INFO ] Deduced a trap composed of 48 places in 219 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:40:58] [INFO ] Deduced a trap composed of 27 places in 198 ms of which 18 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:04] [INFO ] Deduced a trap composed of 140 places in 349 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:07] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:09] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:10] [INFO ] Deduced a trap composed of 72 places in 216 ms of which 28 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/655 variables, and 38 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:15] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:20] [INFO ] Deduced a trap composed of 136 places in 257 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:22] [INFO ] Deduced a trap composed of 73 places in 196 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:23] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:23] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 27 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/655 variables, 289/332 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 365/697 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:40] [INFO ] Deduced a trap composed of 72 places in 240 ms of which 32 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 1)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 1)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 1)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 1)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 1)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 698 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Starting structural reductions in LTL mode, iteration 1 : 289/316 places, 366/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60758 ms. Remains : 289/316 places, 366/412 transitions.
Stuttering acceptance computed with spot in 442 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-09
Product exploration explored 100000 steps with 20000 reset in 256 ms.
Product exploration explored 100000 steps with 20000 reset in 380 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Detected a total of 88/289 stabilizing places and 92/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p1), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 8 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (222 resets) in 347 ms. (114 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (56 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (57 resets) in 91 ms. (434 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (73 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 67948 steps, run visited all 3 properties in 456 ms. (steps per millisecond=149 )
Probabilistic random walk after 67948 steps, saw 18895 distinct states, run finished after 462 ms. (steps per millisecond=147 ) properties seen :3
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X p1), (X (X (NOT p2))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F p2), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 290 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 289 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 366/366 transitions.
Applied a total of 0 rules in 7 ms. Remains 289 /289 variables (removed 0) and now considering 366/366 (removed 0) transitions.
[2025-06-04 03:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:41:43] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-04 03:41:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:41:44] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 644 ms to find 0 implicit places.
Running 365 sub problems to find dead transitions.
[2025-06-04 03:41:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:55] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:55] [INFO ] Deduced a trap composed of 136 places in 301 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:55] [INFO ] Deduced a trap composed of 109 places in 254 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:56] [INFO ] Deduced a trap composed of 55 places in 277 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:56] [INFO ] Deduced a trap composed of 43 places in 291 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:57] [INFO ] Deduced a trap composed of 45 places in 267 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:57] [INFO ] Deduced a trap composed of 134 places in 282 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:57] [INFO ] Deduced a trap composed of 112 places in 271 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:58] [INFO ] Deduced a trap composed of 41 places in 239 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:59] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:59] [INFO ] Deduced a trap composed of 57 places in 232 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:41:59] [INFO ] Deduced a trap composed of 114 places in 326 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:00] [INFO ] Deduced a trap composed of 53 places in 254 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:00] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:01] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:01] [INFO ] Deduced a trap composed of 59 places in 236 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:02] [INFO ] Deduced a trap composed of 54 places in 239 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:02] [INFO ] Deduced a trap composed of 59 places in 238 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:02] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:03] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 19 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:08] [INFO ] Deduced a trap composed of 140 places in 340 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:11] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 17 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:14] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 22 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 289/655 variables, and 37 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/289 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/288 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 1 (OVERLAPS) 1/289 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/289 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/289 variables, 23/37 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:18] [INFO ] Deduced a trap composed of 136 places in 172 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:22] [INFO ] Deduced a trap composed of 71 places in 225 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:22] [INFO ] Deduced a trap composed of 56 places in 263 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:24] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 13 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 7 (OVERLAPS) 366/655 variables, 289/330 constraints. Problems are: Problem set: 0 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 365/695 constraints. Problems are: Problem set: 0 solved, 365 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:42] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 32 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 655/655 variables, and 696 constraints, problems are : Problem set: 0 solved, 365 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 365/365 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 365 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in LTL mode , in 1 iterations and 60771 ms. Remains : 289/289 places, 366/366 transitions.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (101 resets) in 164 ms. (242 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (57 resets) in 79 ms. (500 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (51 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2025-06-04 03:42:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:45] [INFO ] Deduced a trap composed of 47 places in 103 ms of which 15 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 188/289 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 366/655 variables, 289/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/655 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 655/655 variables, and 304 constraints, problems are : Problem set: 0 solved, 1 unsolved in 589 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 98/99 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2/101 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 188/289 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 366/655 variables, 289/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/655 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/655 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 655/655 variables, and 305 constraints, problems are : Problem set: 0 solved, 1 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 289/289 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1054ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 289 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 289/289 places, 366/366 transitions.
Graph (trivial) has 320 edges and 289 vertex of which 43 / 289 are part of one of the 17 SCC in 1 ms
Free SCC test removed 26 places
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Graph (complete) has 504 edges and 263 vertex of which 231 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Drop transitions (Empty/Sink Transition effects.) removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 164 rules applied. Total rules applied 166 place count 231 transition count 140
Reduce places removed 118 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 131 rules applied. Total rules applied 297 place count 113 transition count 127
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 304 place count 106 transition count 127
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 304 place count 106 transition count 108
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 342 place count 87 transition count 108
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 358 place count 71 transition count 92
Iterating global reduction 3 with 16 rules applied. Total rules applied 374 place count 71 transition count 92
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 374 place count 71 transition count 85
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 388 place count 64 transition count 85
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 390 place count 62 transition count 83
Iterating global reduction 3 with 2 rules applied. Total rules applied 392 place count 62 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 393 place count 62 transition count 82
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 394 place count 61 transition count 81
Iterating global reduction 4 with 1 rules applied. Total rules applied 395 place count 61 transition count 81
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 400 place count 56 transition count 76
Iterating global reduction 4 with 5 rules applied. Total rules applied 405 place count 56 transition count 76
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 410 place count 56 transition count 71
Performed 21 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 452 place count 35 transition count 47
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 455 place count 32 transition count 44
Iterating global reduction 5 with 3 rules applied. Total rules applied 458 place count 32 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 460 place count 30 transition count 40
Iterating global reduction 5 with 2 rules applied. Total rules applied 462 place count 30 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 463 place count 30 transition count 39
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 471 place count 26 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 472 place count 26 transition count 53
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 473 place count 25 transition count 52
Iterating global reduction 6 with 1 rules applied. Total rules applied 474 place count 25 transition count 52
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 475 place count 24 transition count 51
Iterating global reduction 6 with 1 rules applied. Total rules applied 476 place count 24 transition count 51
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 477 place count 24 transition count 50
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 482 place count 24 transition count 45
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 488 place count 19 transition count 44
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 489 place count 19 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 490 place count 19 transition count 43
Applied a total of 490 rules in 34 ms. Remains 19 /289 variables (removed 270) and now considering 43/366 (removed 323) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 19/289 places, 43/366 transitions.
RANDOM walk for 83 steps (5 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) p0)]
False Knowledge obtained : [(F (NOT (OR p0 p2))), (F p2), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 215 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 20000 reset in 128 ms.
Product exploration explored 100000 steps with 20000 reset in 163 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 3 out of 289 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 289/289 places, 366/366 transitions.
Graph (trivial) has 316 edges and 289 vertex of which 43 / 289 are part of one of the 17 SCC in 1 ms
Free SCC test removed 26 places
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 263 transition count 337
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 122 place count 263 transition count 331
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 122 place count 263 transition count 331
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 263 transition count 331
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 207 place count 184 transition count 250
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 286 place count 184 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 287 place count 183 transition count 249
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 288 place count 183 transition count 249
Performed 51 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 102 places in 0 ms
Iterating global reduction 2 with 51 rules applied. Total rules applied 339 place count 183 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 342 place count 183 transition count 273
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 381 place count 144 transition count 223
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 3 with 39 rules applied. Total rules applied 420 place count 144 transition count 223
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 427 place count 137 transition count 204
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 434 place count 137 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 435 place count 137 transition count 203
Performed 15 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 4 with 15 rules applied. Total rules applied 450 place count 137 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 451 place count 137 transition count 317
Discarding 17 places :
Symmetric choice reduction at 5 with 17 rule applications. Total rules 468 place count 120 transition count 272
Deduced a syphon composed of 61 places in 0 ms
Iterating global reduction 5 with 17 rules applied. Total rules applied 485 place count 120 transition count 272
Deduced a syphon composed of 61 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 5 with 12 rules applied. Total rules applied 497 place count 120 transition count 260
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 500 place count 117 transition count 248
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 5 with 3 rules applied. Total rules applied 503 place count 117 transition count 248
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 503 rules in 75 ms. Remains 117 /289 variables (removed 172) and now considering 248/366 (removed 118) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:42:47] [INFO ] Redundant transitions in 18 ms returned []
Running 244 sub problems to find dead transitions.
[2025-06-04 03:42:47] [INFO ] Flow matrix only has 236 transitions (discarded 12 similar events)
// Phase 1: matrix 236 rows 117 cols
[2025-06-04 03:42:47] [INFO ] Computed 7 invariants in 2 ms
[2025-06-04 03:42:47] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/116 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (OVERLAPS) 1/117 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 244 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 4 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Problem TDEAD32 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 4 ms to minimize.
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 4 ms to minimize.
Problem TDEAD42 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Problem TDEAD47 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:42:52] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 5 ms to minimize.
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 10/17 constraints. Problems are: Problem set: 81 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 0/17 constraints. Problems are: Problem set: 81 solved, 163 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
At refinement iteration 4 (OVERLAPS) 235/352 variables, 117/134 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 8/142 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/142 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 7 (OVERLAPS) 1/353 variables, 1/143 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/353 variables, 0/143 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 0/353 variables, 0/143 constraints. Problems are: Problem set: 108 solved, 136 unsolved
No progress, stopping.
After SMT solving in domain Real declared 353/353 variables, and 143 constraints, problems are : Problem set: 108 solved, 136 unsolved in 19741 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 108 solved, 136 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 1 (OVERLAPS) 59/117 variables, 7/7 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/117 variables, 10/17 constraints. Problems are: Problem set: 108 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:43:08] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:43:08] [INFO ] Deduced a trap composed of 11 places in 161 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/117 variables, 2/19 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/19 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 5 (OVERLAPS) 235/352 variables, 117/136 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 8/144 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 136/280 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/280 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 9 (OVERLAPS) 1/353 variables, 1/281 constraints. Problems are: Problem set: 108 solved, 136 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/353 variables, 0/281 constraints. Problems are: Problem set: 108 solved, 136 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 353/353 variables, and 281 constraints, problems are : Problem set: 108 solved, 136 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 117/117 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 136/244 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49817ms problems are : Problem set: 108 solved, 136 unsolved
Search for dead transitions found 108 dead transitions in 49819ms
Found 108 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 108 transitions
Dead transitions reduction (with SMT) removed 108 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 117/289 places, 140/366 transitions.
Graph (complete) has 228 edges and 117 vertex of which 59 are kept as prefixes of interest. Removing 58 places using SCC suffix rule.1 ms
Discarding 58 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 158
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 59 transition count 152
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 8 rules in 9 ms. Remains 59 /117 variables (removed 58) and now considering 152/140 (removed -12) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/289 places, 152/366 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49930 ms. Remains : 59/289 places, 152/366 transitions.
Built C files in :
/tmp/ltsmin6901646088879184004
[2025-06-04 03:43:37] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6901646088879184004
Running compilation step : cd /tmp/ltsmin6901646088879184004;'/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 1531 ms.
Running link step : cd /tmp/ltsmin6901646088879184004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin6901646088879184004;'/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/stateBased17411125685456155286.hoa' '--buchi-type=spotba'
LTSmin run took 837 ms.
FORMULA HealthRecord-PT-16-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-16-LTLFireability-09 finished in 180329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(F((p0&&X(X(F((!p0&&F(G(p1))))))))))))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Graph (trivial) has 357 edges and 316 vertex of which 46 / 316 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 122 place count 286 transition count 258
Reduce places removed 121 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 136 rules applied. Total rules applied 258 place count 165 transition count 243
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 266 place count 157 transition count 243
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 266 place count 157 transition count 239
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 274 place count 153 transition count 239
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 295 place count 132 transition count 203
Iterating global reduction 3 with 21 rules applied. Total rules applied 316 place count 132 transition count 203
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 4 rules applied. Total rules applied 320 place count 132 transition count 199
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 324 place count 128 transition count 199
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 333 place count 119 transition count 183
Iterating global reduction 5 with 9 rules applied. Total rules applied 342 place count 119 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 343 place count 119 transition count 182
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 346 place count 116 transition count 179
Iterating global reduction 6 with 3 rules applied. Total rules applied 349 place count 116 transition count 179
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 350 place count 116 transition count 178
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 351 place count 115 transition count 176
Iterating global reduction 7 with 1 rules applied. Total rules applied 352 place count 115 transition count 176
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 353 place count 114 transition count 174
Iterating global reduction 7 with 1 rules applied. Total rules applied 354 place count 114 transition count 174
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 355 place count 113 transition count 172
Iterating global reduction 7 with 1 rules applied. Total rules applied 356 place count 113 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 357 place count 113 transition count 171
Performed 45 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 8 with 90 rules applied. Total rules applied 447 place count 68 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 448 place count 68 transition count 122
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 451 place count 65 transition count 116
Iterating global reduction 9 with 3 rules applied. Total rules applied 454 place count 65 transition count 116
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 455 place count 64 transition count 112
Iterating global reduction 9 with 1 rules applied. Total rules applied 456 place count 64 transition count 112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -46
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 468 place count 58 transition count 158
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 469 place count 57 transition count 156
Iterating global reduction 9 with 1 rules applied. Total rules applied 470 place count 57 transition count 156
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 9 with 18 rules applied. Total rules applied 488 place count 57 transition count 138
Applied a total of 488 rules in 40 ms. Remains 57 /316 variables (removed 259) and now considering 138/412 (removed 274) transitions.
[2025-06-04 03:43:40] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
// Phase 1: matrix 130 rows 57 cols
[2025-06-04 03:43:40] [INFO ] Computed 7 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:43:40] [INFO ] Implicit Places using invariants in 55 ms returned []
[2025-06-04 03:43:40] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2025-06-04 03:43:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:43:40] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-04 03:43:40] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:43:40] [INFO ] Redundant transitions in 1 ms returned []
Running 126 sub problems to find dead transitions.
[2025-06-04 03:43:40] [INFO ] Flow matrix only has 130 transitions (discarded 8 similar events)
[2025-06-04 03:43:40] [INFO ] Invariant cache hit.
[2025-06-04 03:43:40] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:43:41] [INFO ] Deduced a trap composed of 7 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 03:43:41] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (OVERLAPS) 129/186 variables, 57/66 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/186 variables, 14/80 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (OVERLAPS) 1/187 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 0/187 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Real declared 187/187 variables, and 81 constraints, problems are : Problem set: 0 solved, 126 unsolved in 9186 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/57 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:43:50] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:43:50] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:43:50] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 5 (OVERLAPS) 129/186 variables, 57/69 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/186 variables, 14/83 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/186 variables, 126/209 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 9 (OVERLAPS) 1/187 variables, 1/210 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/187 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:00] [INFO ] Deduced a trap composed of 15 places in 68 ms of which 4 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/187 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/187 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 13 (OVERLAPS) 0/187 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 126 unsolved
No progress, stopping.
After SMT solving in domain Int declared 187/187 variables, and 211 constraints, problems are : Problem set: 0 solved, 126 unsolved in 21081 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 57/57 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 30313ms problems are : Problem set: 0 solved, 126 unsolved
Search for dead transitions found 0 dead transitions in 30314ms
Starting structural reductions in SI_LTL mode, iteration 1 : 57/316 places, 138/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30526 ms. Remains : 57/316 places, 138/412 transitions.
Stuttering acceptance computed with spot in 226 ms :[(NOT p0), true, (OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-10
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-10 finished in 30780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((p0 U X(X(p1))) U (p1 U X(p0))))))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 303 transition count 390
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 303 transition count 390
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 298 transition count 380
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 298 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 298 transition count 379
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 294 transition count 375
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 294 transition count 375
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 291 transition count 369
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 291 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 288 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 288 transition count 365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 285 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 285 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 285 transition count 359
Applied a total of 65 rules in 46 ms. Remains 285 /316 variables (removed 31) and now considering 359/412 (removed 53) transitions.
// Phase 1: matrix 359 rows 285 cols
[2025-06-04 03:44:11] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:44:11] [INFO ] Implicit Places using invariants in 166 ms returned []
[2025-06-04 03:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:44:11] [INFO ] Implicit Places using invariants and state equation in 432 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2025-06-04 03:44:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:22] [INFO ] Deduced a trap composed of 30 places in 276 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:22] [INFO ] Deduced a trap composed of 42 places in 263 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:22] [INFO ] Deduced a trap composed of 135 places in 273 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:23] [INFO ] Deduced a trap composed of 109 places in 280 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:23] [INFO ] Deduced a trap composed of 51 places in 282 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:24] [INFO ] Deduced a trap composed of 136 places in 270 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:24] [INFO ] Deduced a trap composed of 42 places in 235 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:24] [INFO ] Deduced a trap composed of 32 places in 267 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:25] [INFO ] Deduced a trap composed of 57 places in 296 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:25] [INFO ] Deduced a trap composed of 113 places in 252 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:25] [INFO ] Deduced a trap composed of 57 places in 261 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:26] [INFO ] Deduced a trap composed of 66 places in 283 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:26] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:27] [INFO ] Deduced a trap composed of 45 places in 286 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:27] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:28] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:28] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:29] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:30] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:30] [INFO ] Deduced a trap composed of 59 places in 250 ms of which 33 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:35] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 52 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/644 variables, and 35 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:46] [INFO ] Deduced a trap composed of 67 places in 185 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:49] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:49] [INFO ] Deduced a trap composed of 52 places in 256 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:44:49] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 359/644 variables, 285/324 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 358/682 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:02] [INFO ] Deduced a trap composed of 53 places in 282 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:02] [INFO ] Deduced a trap composed of 54 places in 243 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:03] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:03] [INFO ] Deduced a trap composed of 55 places in 212 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:04] [INFO ] Deduced a trap composed of 70 places in 150 ms of which 21 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 687 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 285/316 places, 359/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60733 ms. Remains : 285/316 places, 359/412 transitions.
Stuttering acceptance computed with spot in 619 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p1), (AND (NOT p1) (NOT p0)), false, (AND p1 (NOT p0))]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-11
Product exploration explored 100000 steps with 28599 reset in 176 ms.
Product exploration explored 100000 steps with 28559 reset in 192 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 215 ms. Reduced automaton from 12 states, 19 edges and 2 AP (stutter sensitive) to 12 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 513 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (238 resets) in 157 ms. (253 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (68 resets) in 39 ms. (1000 steps per ms) remains 2/5 properties
BEST_FIRST walk for 40004 steps (62 resets) in 30 ms. (1290 steps per ms) remains 2/2 properties
[2025-06-04 03:45:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 184/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 359/644 variables, 285/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:14] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 854 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 184/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/644 variables, 285/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/644 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1466ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 196 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=49 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 472 ms. Reduced automaton from 12 states, 19 edges and 2 AP (stutter sensitive) to 12 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 576 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 574 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 285/285 places, 359/359 transitions.
Applied a total of 0 rules in 6 ms. Remains 285 /285 variables (removed 0) and now considering 359/359 (removed 0) transitions.
[2025-06-04 03:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:45:16] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-04 03:45:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:45:17] [INFO ] Implicit Places using invariants and state equation in 433 ms returned []
Implicit Place search using SMT with State Equation took 623 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2025-06-04 03:45:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:27] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:28] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:28] [INFO ] Deduced a trap composed of 135 places in 277 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:28] [INFO ] Deduced a trap composed of 109 places in 268 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:29] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:29] [INFO ] Deduced a trap composed of 136 places in 246 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:29] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:30] [INFO ] Deduced a trap composed of 32 places in 252 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:30] [INFO ] Deduced a trap composed of 57 places in 290 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:31] [INFO ] Deduced a trap composed of 113 places in 232 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:31] [INFO ] Deduced a trap composed of 57 places in 263 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:31] [INFO ] Deduced a trap composed of 66 places in 294 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:32] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:32] [INFO ] Deduced a trap composed of 45 places in 290 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:32] [INFO ] Deduced a trap composed of 68 places in 145 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:33] [INFO ] Deduced a trap composed of 69 places in 204 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:34] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:34] [INFO ] Deduced a trap composed of 70 places in 153 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:35] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:35] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 25 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:40] [INFO ] Deduced a trap composed of 43 places in 308 ms of which 56 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 1.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 1.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 1.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 1.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/644 variables, and 35 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:52] [INFO ] Deduced a trap composed of 67 places in 209 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:55] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:55] [INFO ] Deduced a trap composed of 52 places in 238 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:45:55] [INFO ] Deduced a trap composed of 46 places in 217 ms of which 30 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 359/644 variables, 285/324 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 358/682 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:06] [INFO ] Deduced a trap composed of 53 places in 194 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:06] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:07] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:07] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:08] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 5/687 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 687 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60091ms
Finished structural reductions in LTL mode , in 1 iterations and 60723 ms. Remains : 285/285 places, 359/359 transitions.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 204 ms. Reduced automaton from 12 states, 19 edges and 2 AP (stutter sensitive) to 12 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 594 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
RANDOM walk for 40000 steps (202 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (61 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (55 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (58 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (72 resets) in 56 ms. (701 steps per ms) remains 2/5 properties
[2025-06-04 03:46:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 184/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 359/644 variables, 285/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:18] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 14 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/644 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/644 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 644/644 variables, and 300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 843 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 99/101 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 184/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 359/644 variables, 285/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/644 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 644/644 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 591 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1443ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 178 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=44 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 11 factoid took 482 ms. Reduced automaton from 12 states, 19 edges and 2 AP (stutter sensitive) to 12 states, 19 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 580 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 578 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 584 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 28512 reset in 180 ms.
Product exploration explored 100000 steps with 28560 reset in 202 ms.
Applying partial POR strategy [false, false, false, false, false, false, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 590 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) p1)]
Support contains 2 out of 285 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 285/285 places, 359/359 transitions.
Graph (trivial) has 313 edges and 285 vertex of which 40 / 285 are part of one of the 17 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 114 rules applied. Total rules applied 115 place count 262 transition count 334
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 7 rules applied. Total rules applied 122 place count 262 transition count 328
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 122 place count 262 transition count 328
Deduced a syphon composed of 121 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 128 place count 262 transition count 328
Discarding 79 places :
Symmetric choice reduction at 2 with 79 rule applications. Total rules 207 place count 183 transition count 247
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 79 rules applied. Total rules applied 286 place count 183 transition count 247
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 288 place count 181 transition count 245
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 290 place count 181 transition count 245
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 181 transition count 244
Performed 52 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 3 with 52 rules applied. Total rules applied 343 place count 181 transition count 271
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 346 place count 181 transition count 268
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 387 place count 140 transition count 215
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 4 with 41 rules applied. Total rules applied 428 place count 140 transition count 215
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 435 place count 133 transition count 196
Deduced a syphon composed of 63 places in 0 ms
Iterating global reduction 4 with 7 rules applied. Total rules applied 442 place count 133 transition count 196
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 443 place count 133 transition count 195
Performed 14 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 5 with 14 rules applied. Total rules applied 457 place count 133 transition count 310
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 458 place count 133 transition count 309
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 476 place count 115 transition count 262
Deduced a syphon composed of 59 places in 0 ms
Iterating global reduction 6 with 18 rules applied. Total rules applied 494 place count 115 transition count 262
Deduced a syphon composed of 59 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 6 with 15 rules applied. Total rules applied 509 place count 115 transition count 247
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 515 place count 109 transition count 229
Deduced a syphon composed of 54 places in 1 ms
Iterating global reduction 6 with 6 rules applied. Total rules applied 521 place count 109 transition count 229
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 522 place count 108 transition count 227
Deduced a syphon composed of 54 places in 0 ms
Iterating global reduction 6 with 1 rules applied. Total rules applied 523 place count 108 transition count 227
Deduced a syphon composed of 54 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 524 place count 108 transition count 226
Deduced a syphon composed of 54 places in 0 ms
Applied a total of 524 rules in 71 ms. Remains 108 /285 variables (removed 177) and now considering 226/359 (removed 133) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:46:23] [INFO ] Redundant transitions in 5 ms returned []
Running 218 sub problems to find dead transitions.
[2025-06-04 03:46:23] [INFO ] Flow matrix only has 214 transitions (discarded 12 similar events)
// Phase 1: matrix 214 rows 108 cols
[2025-06-04 03:46:23] [INFO ] Computed 7 invariants in 2 ms
[2025-06-04 03:46:23] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 8 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 4 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 8 places in 52 ms of which 4 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 4 ms to minimize.
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 3 ms to minimize.
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:26] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 4 ms to minimize.
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:27] [INFO ] Deduced a trap composed of 16 places in 102 ms of which 6 ms to minimize.
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/16 constraints. Problems are: Problem set: 86 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/16 constraints. Problems are: Problem set: 86 solved, 132 unsolved
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
At refinement iteration 4 (OVERLAPS) 213/321 variables, 108/124 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/321 variables, 8/132 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 0/132 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 7 (OVERLAPS) 1/322 variables, 1/133 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/322 variables, 0/133 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 0/322 variables, 0/133 constraints. Problems are: Problem set: 105 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 133 constraints, problems are : Problem set: 105 solved, 113 unsolved in 14912 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 105 solved, 113 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 55/108 variables, 7/7 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 9/16 constraints. Problems are: Problem set: 105 solved, 113 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:46:39] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 1/17 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 0/17 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 213/321 variables, 108/125 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/321 variables, 8/133 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/321 variables, 113/246 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/321 variables, 0/246 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 9 (OVERLAPS) 1/322 variables, 1/247 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/247 constraints. Problems are: Problem set: 105 solved, 113 unsolved
At refinement iteration 11 (OVERLAPS) 0/322 variables, 0/247 constraints. Problems are: Problem set: 105 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 247 constraints, problems are : Problem set: 105 solved, 113 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 113/218 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44986ms problems are : Problem set: 105 solved, 113 unsolved
Search for dead transitions found 105 dead transitions in 44987ms
Found 105 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 105 transitions
Dead transitions reduction (with SMT) removed 105 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/285 places, 121/359 transitions.
Graph (complete) has 201 edges and 108 vertex of which 54 are kept as prefixes of interest. Removing 54 places using SCC suffix rule.1 ms
Discarding 54 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 54 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 54 transition count 135
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 9 rules in 6 ms. Remains 54 /108 variables (removed 54) and now considering 135/121 (removed -14) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/285 places, 135/359 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 45078 ms. Remains : 54/285 places, 135/359 transitions.
Built C files in :
/tmp/ltsmin11924021462535177259
[2025-06-04 03:47:08] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11924021462535177259
Running compilation step : cd /tmp/ltsmin11924021462535177259;'/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 764 ms.
Running link step : cd /tmp/ltsmin11924021462535177259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin11924021462535177259;'/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/stateBased3817820422293224994.hoa' '--buchi-type=spotba'
LTSmin run took 10510 ms.
FORMULA HealthRecord-PT-16-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-16-LTLFireability-11 finished in 188681 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))||X(G(p0))))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 303 transition count 390
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 303 transition count 390
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 298 transition count 380
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 298 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 298 transition count 379
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 294 transition count 375
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 294 transition count 375
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 48 place count 291 transition count 369
Iterating global reduction 1 with 3 rules applied. Total rules applied 51 place count 291 transition count 369
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 54 place count 288 transition count 365
Iterating global reduction 1 with 3 rules applied. Total rules applied 57 place count 288 transition count 365
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 60 place count 285 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 63 place count 285 transition count 361
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 65 place count 285 transition count 359
Applied a total of 65 rules in 26 ms. Remains 285 /316 variables (removed 31) and now considering 359/412 (removed 53) transitions.
// Phase 1: matrix 359 rows 285 cols
[2025-06-04 03:47:19] [INFO ] Computed 14 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:47:19] [INFO ] Implicit Places using invariants in 122 ms returned []
[2025-06-04 03:47:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:47:20] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
Running 358 sub problems to find dead transitions.
[2025-06-04 03:47:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:29] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:29] [INFO ] Deduced a trap composed of 42 places in 265 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:30] [INFO ] Deduced a trap composed of 135 places in 262 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:30] [INFO ] Deduced a trap composed of 109 places in 273 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:30] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:31] [INFO ] Deduced a trap composed of 136 places in 269 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:31] [INFO ] Deduced a trap composed of 42 places in 237 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:32] [INFO ] Deduced a trap composed of 32 places in 285 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:32] [INFO ] Deduced a trap composed of 57 places in 288 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:32] [INFO ] Deduced a trap composed of 113 places in 214 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:33] [INFO ] Deduced a trap composed of 57 places in 279 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:33] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:34] [INFO ] Deduced a trap composed of 64 places in 227 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:34] [INFO ] Deduced a trap composed of 45 places in 274 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:34] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:35] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:36] [INFO ] Deduced a trap composed of 70 places in 184 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:36] [INFO ] Deduced a trap composed of 70 places in 189 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:37] [INFO ] Deduced a trap composed of 46 places in 224 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:38] [INFO ] Deduced a trap composed of 59 places in 247 ms of which 34 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:42] [INFO ] Deduced a trap composed of 43 places in 287 ms of which 52 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 285/644 variables, and 35 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/284 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 1 (OVERLAPS) 1/285 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/285 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:55] [INFO ] Deduced a trap composed of 67 places in 238 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:58] [INFO ] Deduced a trap composed of 42 places in 248 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:58] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:47:58] [INFO ] Deduced a trap composed of 46 places in 245 ms of which 31 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/285 variables, 4/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/285 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 6 (OVERLAPS) 359/644 variables, 285/324 constraints. Problems are: Problem set: 0 solved, 358 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/644 variables, 358/682 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:10] [INFO ] Deduced a trap composed of 53 places in 300 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:10] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:10] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:11] [INFO ] Deduced a trap composed of 55 places in 219 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:11] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/644 variables, 5/687 constraints. Problems are: Problem set: 0 solved, 358 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 644/644 variables, and 687 constraints, problems are : Problem set: 0 solved, 358 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 285/285 constraints, PredecessorRefiner: 358/358 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 0 solved, 358 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 285/316 places, 359/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60595 ms. Remains : 285/316 places, 359/412 transitions.
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), true, p1]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 208 ms.
Computed a total of 88 stabilizing places and 92 stable transitions
Computed a total of 88 stabilizing places and 92 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 23 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-16-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-16-LTLFireability-12 finished in 61211 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 9 out of 316 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Graph (trivial) has 309 edges and 316 vertex of which 46 / 316 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 121 place count 286 transition count 259
Reduce places removed 120 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 135 rules applied. Total rules applied 256 place count 166 transition count 244
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 264 place count 158 transition count 244
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 264 place count 158 transition count 240
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 272 place count 154 transition count 240
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 295 place count 131 transition count 200
Iterating global reduction 3 with 23 rules applied. Total rules applied 318 place count 131 transition count 200
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 3 with 5 rules applied. Total rules applied 323 place count 131 transition count 195
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 328 place count 126 transition count 195
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 339 place count 115 transition count 175
Iterating global reduction 5 with 11 rules applied. Total rules applied 350 place count 115 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 352 place count 115 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 353 place count 114 transition count 173
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 357 place count 110 transition count 168
Iterating global reduction 7 with 4 rules applied. Total rules applied 361 place count 110 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 363 place count 110 transition count 166
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 364 place count 109 transition count 164
Iterating global reduction 8 with 1 rules applied. Total rules applied 365 place count 109 transition count 164
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 366 place count 108 transition count 162
Iterating global reduction 8 with 1 rules applied. Total rules applied 367 place count 108 transition count 162
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 368 place count 107 transition count 160
Iterating global reduction 8 with 1 rules applied. Total rules applied 369 place count 107 transition count 160
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 370 place count 107 transition count 159
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 430 place count 77 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 433 place count 77 transition count 126
Discarding 5 places :
Symmetric choice reduction at 10 with 5 rule applications. Total rules 438 place count 72 transition count 116
Iterating global reduction 10 with 5 rules applied. Total rules applied 443 place count 72 transition count 116
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 446 place count 69 transition count 113
Iterating global reduction 10 with 3 rules applied. Total rules applied 449 place count 69 transition count 113
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 451 place count 67 transition count 107
Iterating global reduction 10 with 2 rules applied. Total rules applied 453 place count 67 transition count 107
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 455 place count 65 transition count 103
Iterating global reduction 10 with 2 rules applied. Total rules applied 457 place count 65 transition count 103
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 458 place count 65 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 462 place count 63 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 11 with 8 rules applied. Total rules applied 470 place count 63 transition count 97
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 471 place count 62 transition count 95
Iterating global reduction 11 with 1 rules applied. Total rules applied 472 place count 62 transition count 95
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 473 place count 61 transition count 92
Iterating global reduction 11 with 1 rules applied. Total rules applied 474 place count 61 transition count 92
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 475 place count 60 transition count 91
Iterating global reduction 11 with 1 rules applied. Total rules applied 476 place count 60 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 480 place count 58 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 481 place count 58 transition count 110
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 483 place count 58 transition count 110
Applied a total of 483 rules in 61 ms. Remains 58 /316 variables (removed 258) and now considering 110/412 (removed 302) transitions.
[2025-06-04 03:48:20] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
// Phase 1: matrix 102 rows 58 cols
[2025-06-04 03:48:20] [INFO ] Computed 7 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:48:20] [INFO ] Implicit Places using invariants in 66 ms returned []
[2025-06-04 03:48:20] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2025-06-04 03:48:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:48:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-06-04 03:48:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 03:48:21] [INFO ] Redundant transitions in 1 ms returned []
Running 94 sub problems to find dead transitions.
[2025-06-04 03:48:21] [INFO ] Flow matrix only has 102 transitions (discarded 8 similar events)
[2025-06-04 03:48:21] [INFO ] Invariant cache hit.
[2025-06-04 03:48:21] [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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:21] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:22] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 4 (OVERLAPS) 101/159 variables, 58/67 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (OVERLAPS) 1/160 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (OVERLAPS) 0/160 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Real declared 160/160 variables, and 71 constraints, problems are : Problem set: 0 solved, 94 unsolved in 6526 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 94 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, 94 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:28] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 94 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:28] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 6 (OVERLAPS) 101/159 variables, 58/69 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 94/166 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 10 (OVERLAPS) 1/160 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 94 unsolved
At refinement iteration 12 (OVERLAPS) 0/160 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 94 unsolved
No progress, stopping.
After SMT solving in domain Int declared 160/160 variables, and 167 constraints, problems are : Problem set: 0 solved, 94 unsolved in 13189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 58/58 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 94/94 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19741ms problems are : Problem set: 0 solved, 94 unsolved
Search for dead transitions found 0 dead transitions in 19742ms
Starting structural reductions in SI_LTL mode, iteration 1 : 58/316 places, 110/412 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20014 ms. Remains : 58/316 places, 110/412 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-14
Stuttering criterion allowed to conclude after 109 steps with 10 reset in 1 ms.
FORMULA HealthRecord-PT-16-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-14 finished in 20084 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(F(p0)) U p1)))'
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 316/316 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 303 transition count 390
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 303 transition count 390
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 298 transition count 381
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 298 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 298 transition count 380
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 295 transition count 377
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 295 transition count 377
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 292 transition count 371
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 292 transition count 371
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 289 transition count 367
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 289 transition count 367
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 58 place count 286 transition count 363
Iterating global reduction 1 with 3 rules applied. Total rules applied 61 place count 286 transition count 363
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 63 place count 286 transition count 361
Applied a total of 63 rules in 30 ms. Remains 286 /316 variables (removed 30) and now considering 361/412 (removed 51) transitions.
// Phase 1: matrix 361 rows 286 cols
[2025-06-04 03:48:40] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:48:41] [INFO ] Implicit Places using invariants in 198 ms returned []
[2025-06-04 03:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 03:48:41] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2025-06-04 03:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/286 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/286 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:52] [INFO ] Deduced a trap composed of 28 places in 274 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:52] [INFO ] Deduced a trap composed of 43 places in 277 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:53] [INFO ] Deduced a trap composed of 138 places in 266 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:53] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:53] [INFO ] Deduced a trap composed of 45 places in 261 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:54] [INFO ] Deduced a trap composed of 112 places in 273 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:54] [INFO ] Deduced a trap composed of 134 places in 280 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:54] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:55] [INFO ] Deduced a trap composed of 134 places in 163 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:55] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:48:58] [INFO ] Deduced a trap composed of 47 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 03:48:58] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 12 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:01] [INFO ] Deduced a trap composed of 107 places in 298 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:04] [INFO ] Deduced a trap composed of 71 places in 237 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:04] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 53 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:05] [INFO ] Deduced a trap composed of 136 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:06] [INFO ] Deduced a trap composed of 114 places in 186 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:07] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:07] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:08] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:08] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:08] [INFO ] Deduced a trap composed of 53 places in 142 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:09] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 16 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 360 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:10] [INFO ] Deduced a trap composed of 52 places in 155 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:11] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 03:49:11] [INFO ] Deduced a trap composed of 52 places in 113 ms of which 14 ms to minimize.
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 30097ms
Starting structural reductions in LTL mode, iteration 1 : 286/316 places, 361/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30837 ms. Remains : 286/316 places, 361/412 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-16-LTLFireability-15
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-16-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-16-LTLFireability-15 finished in 31003 ms.
All properties solved by simple procedures.
Total runtime 770466 ms.

BK_STOP 1749008951977

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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