About the Execution of ITS-Tools for HealthRecord-PT-09
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 209176.00 | 0.00 | 0.00 | FFFFTFFTFFTFFFTF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r100-smll-174867008200604.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-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-174867008200604
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.3K 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 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 68K 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-09-LTLFireability-00
FORMULA_NAME HealthRecord-PT-09-LTLFireability-01
FORMULA_NAME HealthRecord-PT-09-LTLFireability-02
FORMULA_NAME HealthRecord-PT-09-LTLFireability-03
FORMULA_NAME HealthRecord-PT-09-LTLFireability-04
FORMULA_NAME HealthRecord-PT-09-LTLFireability-05
FORMULA_NAME HealthRecord-PT-09-LTLFireability-06
FORMULA_NAME HealthRecord-PT-09-LTLFireability-07
FORMULA_NAME HealthRecord-PT-09-LTLFireability-08
FORMULA_NAME HealthRecord-PT-09-LTLFireability-09
FORMULA_NAME HealthRecord-PT-09-LTLFireability-10
FORMULA_NAME HealthRecord-PT-09-LTLFireability-11
FORMULA_NAME HealthRecord-PT-09-LTLFireability-12
FORMULA_NAME HealthRecord-PT-09-LTLFireability-13
FORMULA_NAME HealthRecord-PT-09-LTLFireability-14
FORMULA_NAME HealthRecord-PT-09-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1749001146039
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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-04 01:39:08] [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 01:39:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 01:39:09] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2025-06-04 01:39:09] [INFO ] Transformed 157 places.
[2025-06-04 01:39:09] [INFO ] Transformed 327 transitions.
[2025-06-04 01:39:09] [INFO ] Found NUPN structural information;
[2025-06-04 01:39:09] [INFO ] Parsed PT model containing 157 places and 327 transitions and 859 arcs in 547 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 26 transitions
Reduce redundant transitions removed 26 transitions.
FORMULA HealthRecord-PT-09-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 301/301 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 86 transition count 166
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 86 transition count 166
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 145 place count 83 transition count 160
Iterating global reduction 0 with 3 rules applied. Total rules applied 148 place count 83 transition count 160
Applied a total of 148 rules in 103 ms. Remains 83 /157 variables (removed 74) and now considering 160/301 (removed 141) transitions.
[2025-06-04 01:39:09] [INFO ] Flow matrix only has 155 transitions (discarded 5 similar events)
// Phase 1: matrix 155 rows 83 cols
[2025-06-04 01:39:09] [INFO ] Computed 11 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:39:10] [INFO ] Implicit Places using invariants in 367 ms returned []
[2025-06-04 01:39:10] [INFO ] Flow matrix only has 155 transitions (discarded 5 similar events)
[2025-06-04 01:39:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:39:10] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 714 ms to find 0 implicit places.
Running 159 sub problems to find dead transitions.
[2025-06-04 01:39:10] [INFO ] Flow matrix only has 155 transitions (discarded 5 similar events)
[2025-06-04 01:39:10] [INFO ] Invariant cache hit.
[2025-06-04 01:39:10] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:13] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:13] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:13] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:13] [INFO ] Deduced a trap composed of 23 places in 98 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:13] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:13] [INFO ] Deduced a trap composed of 25 places in 84 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 14 places in 115 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:14] [INFO ] Deduced a trap composed of 30 places in 75 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:15] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 14/25 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:16] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 154/237 variables, 83/109 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/238 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 10 (OVERLAPS) 0/238 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 110 constraints, problems are : Problem set: 0 solved, 159 unsolved in 15212 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 1 (OVERLAPS) 1/83 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/83 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/83 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:27] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:27] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:27] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:27] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 3/30 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 7 (OVERLAPS) 154/237 variables, 83/113 constraints. Problems are: Problem set: 0 solved, 159 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 159/272 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:30] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:35] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:35] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 2/275 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:40] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/237 variables, 1/276 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:51] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 5 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/237 variables, 1/277 constraints. Problems are: Problem set: 0 solved, 159 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 237/238 variables, and 277 constraints, problems are : Problem set: 0 solved, 159 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 159/159 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45475ms problems are : Problem set: 0 solved, 159 unsolved
Search for dead transitions found 0 dead transitions in 45499ms
Starting structural reductions in LTL mode, iteration 1 : 83/157 places, 160/301 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46364 ms. Remains : 83/157 places, 160/301 transitions.
Support contains 32 out of 83 places after structural reductions.
[2025-06-04 01:39:56] [INFO ] Flatten gal took : 81 ms
[2025-06-04 01:39:56] [INFO ] Flatten gal took : 36 ms
[2025-06-04 01:39:56] [INFO ] Input system was already deterministic with 160 transitions.
RANDOM walk for 40000 steps (2377 resets) in 3949 ms. (10 steps per ms) remains 14/35 properties
BEST_FIRST walk for 40003 steps (352 resets) in 244 ms. (163 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (351 resets) in 144 ms. (275 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (347 resets) in 76 ms. (519 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (356 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (349 resets) in 81 ms. (487 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (355 resets) in 139 ms. (285 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (350 resets) in 94 ms. (421 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (351 resets) in 82 ms. (481 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (345 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (357 resets) in 173 ms. (229 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (356 resets) in 142 ms. (279 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (349 resets) in 107 ms. (370 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40003 steps (349 resets) in 274 ms. (145 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (360 resets) in 243 ms. (163 steps per ms) remains 12/12 properties
[2025-06-04 01:39:58] [INFO ] Flow matrix only has 155 transitions (discarded 5 similar events)
[2025-06-04 01:39:58] [INFO ] Invariant cache hit.
[2025-06-04 01:39:58] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 38/55 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 11 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 3 (OVERLAPS) 28/83 variables, 8/11 constraints. Problems are: Problem set: 2 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:58] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:58] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 5 ms to minimize.
Problem AtomicPropp14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:58] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 3/14 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:58] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:58] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 2/16 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/17 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 154/237 variables, 83/100 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:59] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:59] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 2/102 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/102 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/103 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:39:59] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 1/104 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/238 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/238 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 238/238 variables, and 104 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 44/52 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 4/7 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 31/83 variables, 8/15 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/83 variables, 5/20 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:00] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 1/21 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/83 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 154/237 variables, 83/104 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 9/113 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/237 variables, 0/113 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1/238 variables, 1/114 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/238 variables, 0/114 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 238/238 variables, and 114 constraints, problems are : Problem set: 3 solved, 9 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 83/83 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2881ms problems are : Problem set: 3 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 9 properties in 231 ms.
FORMULA HealthRecord-PT-09-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 11 simplifications.
FORMULA HealthRecord-PT-09-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 10 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(F(((p0 U p1)&&X(F(p2)))) U p3))))'
Support contains 4 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 64 transition count 124
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 64 transition count 124
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 59 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 59 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 59 transition count 107
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 57 transition count 102
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 57 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 57 transition count 99
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 56 transition count 97
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 56 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 56 transition count 94
Applied a total of 66 rules in 21 ms. Remains 56 /83 variables (removed 27) and now considering 94/160 (removed 66) transitions.
[2025-06-04 01:40:02] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
// Phase 1: matrix 91 rows 56 cols
[2025-06-04 01:40:02] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:02] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 01:40:02] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 01:40:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:40:02] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 93 sub problems to find dead transitions.
[2025-06-04 01:40:02] [INFO ] Flow matrix only has 91 transitions (discarded 3 similar events)
[2025-06-04 01:40:02] [INFO ] Invariant cache hit.
[2025-06-04 01:40:02] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:03] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:03] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 90/146 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (OVERLAPS) 1/147 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:06] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:06] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:06] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 71 constraints, problems are : Problem set: 0 solved, 93 unsolved in 7317 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 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, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 93 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:10] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:10] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (OVERLAPS) 90/146 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 93/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 166 constraints, problems are : Problem set: 0 solved, 93 unsolved in 12115 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 19477ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 19490ms
Starting structural reductions in LTL mode, iteration 1 : 56/83 places, 94/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19714 ms. Remains : 56/83 places, 94/160 transitions.
Stuttering acceptance computed with spot in 747 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-01
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 3 ms.
FORMULA HealthRecord-PT-09-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-01 finished in 20604 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 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Graph (trivial) has 100 edges and 83 vertex of which 12 / 83 are part of one of the 6 SCC in 4 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 56 transition count 115
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 56 transition count 115
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 47 place count 50 transition count 102
Iterating global reduction 0 with 6 rules applied. Total rules applied 53 place count 50 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 59 place count 50 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 62 place count 47 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 65 place count 47 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 68 place count 47 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 70 place count 45 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 72 place count 45 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 78 place count 45 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 82 place count 43 transition count 73
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 43 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 41 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 90 place count 41 transition count 85
Applied a total of 90 rules in 74 ms. Remains 41 /83 variables (removed 42) and now considering 85/160 (removed 75) transitions.
[2025-06-04 01:40:22] [INFO ] Flow matrix only has 74 transitions (discarded 11 similar events)
// Phase 1: matrix 74 rows 41 cols
[2025-06-04 01:40:22] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 01:40:22] [INFO ] Flow matrix only has 74 transitions (discarded 11 similar events)
[2025-06-04 01:40:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:22] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 01:40:22] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:40:22] [INFO ] Redundant transitions in 36 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-04 01:40:22] [INFO ] Flow matrix only has 74 transitions (discarded 11 similar events)
[2025-06-04 01:40:22] [INFO ] Invariant cache hit.
[2025-06-04 01:40:22] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:23] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:23] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 73/114 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 66 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3109 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 73/114 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 71/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4367 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7560ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 7562ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/83 places, 85/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7876 ms. Remains : 41/83 places, 85/160 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-02
Product exploration explored 100000 steps with 1 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 135 ms.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 23007 steps (2406 resets) in 150 ms. (152 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 85/85 transitions.
Applied a total of 0 rules in 8 ms. Remains 41 /41 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2025-06-04 01:40:31] [INFO ] Flow matrix only has 74 transitions (discarded 11 similar events)
[2025-06-04 01:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:31] [INFO ] Implicit Places using invariants in 61 ms returned []
[2025-06-04 01:40:31] [INFO ] Flow matrix only has 74 transitions (discarded 11 similar events)
[2025-06-04 01:40:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:31] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-04 01:40:31] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:40:31] [INFO ] Redundant transitions in 38 ms returned []
Running 71 sub problems to find dead transitions.
[2025-06-04 01:40:31] [INFO ] Flow matrix only has 74 transitions (discarded 11 similar events)
[2025-06-04 01:40:31] [INFO ] Invariant cache hit.
[2025-06-04 01:40:31] [INFO ] State equation strengthened by 14 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:32] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:32] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 73/114 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (OVERLAPS) 0/114 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Real declared 114/115 variables, and 66 constraints, problems are : Problem set: 0 solved, 71 unsolved in 3230 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 71 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 5 (OVERLAPS) 73/114 variables, 41/52 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 14/66 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 71/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
At refinement iteration 9 (OVERLAPS) 0/114 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 71 unsolved
No progress, stopping.
After SMT solving in domain Int declared 114/115 variables, and 137 constraints, problems are : Problem set: 0 solved, 71 unsolved in 4434 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 71/71 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7699ms problems are : Problem set: 0 solved, 71 unsolved
Search for dead transitions found 0 dead transitions in 7703ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7956 ms. Remains : 41/41 places, 85/85 transitions.
Computed a total of 16 stabilizing places and 30 stable transitions
Computed a total of 16 stabilizing places and 30 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 33387 steps (3495 resets) in 60 ms. (547 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6 reset in 167 ms.
Product exploration explored 100000 steps with 25 reset in 215 ms.
Built C files in :
/tmp/ltsmin10945735955596541763
[2025-06-04 01:40:40] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2025-06-04 01:40:40] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:40:40] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2025-06-04 01:40:40] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:40:40] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2025-06-04 01:40:40] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:40:40] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10945735955596541763
Running compilation step : cd /tmp/ltsmin10945735955596541763;'/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 649 ms.
Running link step : cd /tmp/ltsmin10945735955596541763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 79 ms.
Running LTSmin : cd /tmp/ltsmin10945735955596541763;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17290323233706683450.hoa' '--buchi-type=spotba'
LTSmin run took 213 ms.
FORMULA HealthRecord-PT-09-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-02 finished in 18858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0&&F(!p0)) U X(X(X(X(X(G(p1))))))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 63 transition count 122
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 63 transition count 122
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 56 transition count 107
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 56 transition count 107
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 56 transition count 98
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 53 transition count 90
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 53 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 53 transition count 88
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 51 transition count 84
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 51 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 81 place count 51 transition count 78
Applied a total of 81 rules in 14 ms. Remains 51 /83 variables (removed 32) and now considering 78/160 (removed 82) transitions.
[2025-06-04 01:40:41] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
// Phase 1: matrix 75 rows 51 cols
[2025-06-04 01:40:41] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:41] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-04 01:40:41] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2025-06-04 01:40:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:40:41] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Running 77 sub problems to find dead transitions.
[2025-06-04 01:40:41] [INFO ] Flow matrix only has 75 transitions (discarded 3 similar events)
[2025-06-04 01:40:41] [INFO ] Invariant cache hit.
[2025-06-04 01:40:41] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:42] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:42] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:43] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:43] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 1/126 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (OVERLAPS) 0/126 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 65 constraints, problems are : Problem set: 0 solved, 77 unsolved in 5024 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:47] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:47] [INFO ] Deduced a trap composed of 12 places in 79 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 74/125 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 77/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 77 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:51] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/126 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 11 (OVERLAPS) 0/126 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 145 constraints, problems are : Problem set: 0 solved, 77 unsolved in 8966 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14006ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 14008ms
Starting structural reductions in LTL mode, iteration 1 : 51/83 places, 78/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14212 ms. Remains : 51/83 places, 78/160 transitions.
Stuttering acceptance computed with spot in 518 ms :[true, (OR (NOT p1) p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-03
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-03 finished in 14767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!((p0 U p1) U (X(p0)&&p2))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 63 transition count 122
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 63 transition count 122
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 58 transition count 111
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 58 transition count 111
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 59 place count 58 transition count 102
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 61 place count 56 transition count 97
Iterating global reduction 1 with 2 rules applied. Total rules applied 63 place count 56 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 66 place count 56 transition count 94
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 67 place count 55 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 68 place count 55 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 71 place count 55 transition count 89
Applied a total of 71 rules in 15 ms. Remains 55 /83 variables (removed 28) and now considering 89/160 (removed 71) transitions.
[2025-06-04 01:40:56] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
// Phase 1: matrix 86 rows 55 cols
[2025-06-04 01:40:56] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:56] [INFO ] Implicit Places using invariants in 75 ms returned []
[2025-06-04 01:40:56] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:40:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:40:56] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2025-06-04 01:40:56] [INFO ] Flow matrix only has 86 transitions (discarded 3 similar events)
[2025-06-04 01:40:56] [INFO ] Invariant cache hit.
[2025-06-04 01:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:57] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:57] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:40:57] [INFO ] Deduced a trap composed of 14 places in 62 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/140 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/141 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/141 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/141 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 141/141 variables, and 68 constraints, problems are : Problem set: 0 solved, 88 unsolved in 5795 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 88 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:02] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 85/140 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/140 variables, 88/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (OVERLAPS) 1/141 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (OVERLAPS) 0/141 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 141/141 variables, and 157 constraints, problems are : Problem set: 0 solved, 88 unsolved in 8865 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14681ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 14682ms
Starting structural reductions in LTL mode, iteration 1 : 55/83 places, 89/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14900 ms. Remains : 55/83 places, 89/160 transitions.
Stuttering acceptance computed with spot in 153 ms :[(AND p0 p2), (AND p0 p2), (AND p1 p2 p0), (AND p1 p2 p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Product exploration explored 100000 steps with 50000 reset in 377 ms.
Computed a total of 6 stabilizing places and 8 stable transitions
Computed a total of 6 stabilizing places and 8 stable transitions
Detected a total of 6/55 stabilizing places and 8/89 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X p2), (X (NOT (AND p1 p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 19 factoid took 224 ms. Reduced automaton from 4 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-09-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-04 finished in 15892 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) U p1) U !X(X((!X(p2)||p3)))))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 62 transition count 120
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 62 transition count 120
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 55 transition count 105
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 55 transition count 105
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 65 place count 55 transition count 96
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 68 place count 52 transition count 88
Iterating global reduction 1 with 3 rules applied. Total rules applied 71 place count 52 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 52 transition count 85
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 50 transition count 81
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 50 transition count 81
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 83 place count 50 transition count 76
Applied a total of 83 rules in 14 ms. Remains 50 /83 variables (removed 33) and now considering 76/160 (removed 84) transitions.
[2025-06-04 01:41:12] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
// Phase 1: matrix 73 rows 50 cols
[2025-06-04 01:41:12] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:12] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-04 01:41:12] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2025-06-04 01:41:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:41:12] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2025-06-04 01:41:12] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2025-06-04 01:41:12] [INFO ] Invariant cache hit.
[2025-06-04 01:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:13] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:13] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/122 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/122 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/123 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 62 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4426 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:17] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:17] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 72/122 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/122 variables, 75/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 139 constraints, problems are : Problem set: 0 solved, 75 unsolved in 6318 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10761ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 10762ms
Starting structural reductions in LTL mode, iteration 1 : 50/83 places, 76/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10967 ms. Remains : 50/83 places, 76/160 transitions.
Stuttering acceptance computed with spot in 763 ms :[(OR (NOT p2) p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (NOT p2) p3), (OR (NOT p2) p3), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (NOT p2) p3), (OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-09-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-08 finished in 11764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0||G(p1)||X(p2)) U X(p3)))'
Support contains 5 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 64 transition count 124
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 64 transition count 124
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 43 place count 59 transition count 113
Iterating global reduction 0 with 5 rules applied. Total rules applied 48 place count 59 transition count 113
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 59 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 56 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 56 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 56 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 54 transition count 92
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 54 transition count 92
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 73 place count 54 transition count 86
Applied a total of 73 rules in 16 ms. Remains 54 /83 variables (removed 29) and now considering 86/160 (removed 74) transitions.
[2025-06-04 01:41:23] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
// Phase 1: matrix 83 rows 54 cols
[2025-06-04 01:41:23] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-04 01:41:24] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2025-06-04 01:41:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:41:24] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 85 sub problems to find dead transitions.
[2025-06-04 01:41:24] [INFO ] Flow matrix only has 83 transitions (discarded 3 similar events)
[2025-06-04 01:41:24] [INFO ] Invariant cache hit.
[2025-06-04 01:41:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:25] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:25] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 82/136 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 1/137 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 0/137 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 66 constraints, problems are : Problem set: 0 solved, 85 unsolved in 5437 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 85 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: 0 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:30] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:30] [INFO ] Deduced a trap composed of 19 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 01:41:30] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 9 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 5 (OVERLAPS) 82/136 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 85/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 154 constraints, problems are : Problem set: 0 solved, 85 unsolved in 9974 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15429ms problems are : Problem set: 0 solved, 85 unsolved
Search for dead transitions found 0 dead transitions in 15430ms
Starting structural reductions in LTL mode, iteration 1 : 54/83 places, 86/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15632 ms. Remains : 54/83 places, 86/160 transitions.
Stuttering acceptance computed with spot in 212 ms :[(NOT p3), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p2) (NOT p3)), true, (NOT p1)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-12
Stuttering criterion allowed to conclude after 348 steps with 108 reset in 1 ms.
FORMULA HealthRecord-PT-09-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-09-LTLFireability-12 finished in 15870 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)||(p1 U (p2||G(p1))))))'
Support contains 3 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Graph (trivial) has 96 edges and 83 vertex of which 12 / 83 are part of one of the 6 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 19 place count 58 transition count 119
Iterating global reduction 0 with 18 rules applied. Total rules applied 37 place count 58 transition count 119
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 42 place count 53 transition count 109
Iterating global reduction 0 with 5 rules applied. Total rules applied 47 place count 53 transition count 109
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 56 place count 53 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 60 place count 51 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 51 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 50 transition count 107
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 65 place count 50 transition count 105
Applied a total of 65 rules in 21 ms. Remains 50 /83 variables (removed 33) and now considering 105/160 (removed 55) transitions.
[2025-06-04 01:41:39] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
// Phase 1: matrix 97 rows 50 cols
[2025-06-04 01:41:39] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:39] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-04 01:41:39] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 01:41:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:39] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-04 01:41:39] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:41:40] [INFO ] Redundant transitions in 20 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-04 01:41:40] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 01:41:40] [INFO ] Invariant cache hit.
[2025-06-04 01:41: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/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:40] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:40] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:40] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 73 constraints, problems are : Problem set: 0 solved, 91 unsolved in 3364 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 91/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 164 constraints, problems are : Problem set: 0 solved, 91 unsolved in 6646 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10037ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 10038ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/83 places, 105/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10217 ms. Remains : 50/83 places, 105/160 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 186 ms.
Product exploration explored 100000 steps with 1 reset in 297 ms.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p1) p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p1) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 157 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (4135 resets) in 311 ms. (128 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (611 resets) in 224 ms. (177 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (609 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (613 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (615 resets) in 158 ms. (251 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (609 resets) in 404 ms. (98 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (609 resets) in 196 ms. (203 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (614 resets) in 102 ms. (388 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (599 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 1435442 steps, run timeout after 3001 ms. (steps per millisecond=478 ) properties seen :6 out of 8
Probabilistic random walk after 1435442 steps, saw 168194 distinct states, run finished after 3009 ms. (steps per millisecond=477 ) properties seen :6
[2025-06-04 01:41:54] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 01:41:54] [INFO ] Invariant cache hit.
[2025-06-04 01:41:54] [INFO ] State equation strengthened by 11 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 96/146 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 70 constraints, problems are : Problem set: 0 solved, 2 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 3/3 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 01:41:54] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 16/50 variables, 6/10 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 01:41:54] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:54] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/75 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 01:41:55] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/146 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/146 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 76 constraints, problems are : Problem set: 0 solved, 2 unsolved in 329 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 428ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 139 ms.
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 105/105 transitions.
Graph (complete) has 191 edges and 50 vertex of which 34 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 34 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 27 place count 34 transition count 65
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 35 place count 29 transition count 65
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 38 place count 29 transition count 62
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 28 transition count 61
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 28 transition count 61
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 27 transition count 59
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 27 transition count 59
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 26 transition count 58
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 26 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 45 place count 26 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 3 with 2 rules applied. Total rules applied 47 place count 25 transition count 56
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 51 place count 23 transition count 54
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 57 place count 23 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 23 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 22 transition count 47
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 66 place count 22 transition count 47
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 22 transition count 46
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 68 place count 22 transition count 45
Applied a total of 68 rules in 33 ms. Remains 22 /50 variables (removed 28) and now considering 45/105 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 22/50 places, 45/105 transitions.
RANDOM walk for 40000 steps (2806 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (795 resets) in 60 ms. (655 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (820 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Probably explored full state space saw : 195 states, properties seen :0
Probabilistic random walk after 567 steps, saw 195 distinct states, run finished after 16 ms. (steps per millisecond=35 ) properties seen :0
Explored full state space saw : 195 states, properties seen :0
Exhaustive walk after 567 steps, saw 195 distinct states, run finished after 5 ms. (steps per millisecond=113 ) properties seen :0
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (AND p0 p1) p2)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR (AND p0 p1) p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X p0)), (X (X p1)), (G (OR p0 p2 (NOT p1))), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (AND p0 p1) p2))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT (OR p2 (NOT p1)))), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 21 factoid took 493 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p0)]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 105/105 transitions.
Applied a total of 0 rules in 9 ms. Remains 50 /50 variables (removed 0) and now considering 105/105 (removed 0) transitions.
[2025-06-04 01:41:56] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 01:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:56] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 01:41:56] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 01:41:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:41:56] [INFO ] State equation strengthened by 11 read => feed constraints.
[2025-06-04 01:41:56] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:41:56] [INFO ] Redundant transitions in 32 ms returned []
Running 91 sub problems to find dead transitions.
[2025-06-04 01:41:56] [INFO ] Flow matrix only has 97 transitions (discarded 8 similar events)
[2025-06-04 01:41:56] [INFO ] Invariant cache hit.
[2025-06-04 01:41:56] [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/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:57] [INFO ] Deduced a trap composed of 5 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 01:41:57] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:41:57] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/147 variables, and 73 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4381 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (OVERLAPS) 96/146 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 11/73 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 91/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/147 variables, and 164 constraints, problems are : Problem set: 0 solved, 91 unsolved in 7011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11423ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 11423ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 11696 ms. Remains : 50/50 places, 105/105 transitions.
Computed a total of 12 stabilizing places and 11 stable transitions
Computed a total of 12 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 208 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (4170 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (610 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (622 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (617 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (614 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (609 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
Probably explored full state space saw : 236740 states, properties seen :4
Probabilistic random walk after 2104428 steps, saw 236740 distinct states, run finished after 2591 ms. (steps per millisecond=812 ) properties seen :4
Explored full state space saw : 236740 states, properties seen :0
Exhaustive walk after 2104428 steps, saw 236740 distinct states, run finished after 2076 ms. (steps per millisecond=1013 ) properties seen :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p0)), (X (X p1)), (G (OR p1 p2 p0))]
False Knowledge obtained : [(F (NOT (OR p1 p2))), (F (NOT p1)), (F (NOT p2)), (F (NOT p0)), (F (NOT (OR p1 p2 (NOT p0))))]
Knowledge based reduction with 14 factoid took 382 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 140 ms.
Product exploration explored 100000 steps with 0 reset in 132 ms.
Built C files in :
/tmp/ltsmin6424710401801441182
[2025-06-04 01:42:14] [INFO ] Computing symmetric may disable matrix : 105 transitions.
[2025-06-04 01:42:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:42:14] [INFO ] Computing symmetric may enable matrix : 105 transitions.
[2025-06-04 01:42:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:42:14] [INFO ] Computing Do-Not-Accords matrix : 105 transitions.
[2025-06-04 01:42:14] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-04 01:42:14] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6424710401801441182
Running compilation step : cd /tmp/ltsmin6424710401801441182;'/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 523 ms.
Running link step : cd /tmp/ltsmin6424710401801441182;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin6424710401801441182;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12900206239170973636.hoa' '--buchi-type=spotba'
LTSmin run took 281 ms.
FORMULA HealthRecord-PT-09-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-09-LTLFireability-13 finished in 35103 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 U (p1||G(p0)))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 63 transition count 121
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 63 transition count 121
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 56 transition count 106
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 56 transition count 106
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 56 transition count 97
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 53 transition count 89
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 53 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 71 place count 53 transition count 87
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 51 transition count 83
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 51 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 81 place count 51 transition count 77
Applied a total of 81 rules in 7 ms. Remains 51 /83 variables (removed 32) and now considering 77/160 (removed 83) transitions.
[2025-06-04 01:42:14] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
// Phase 1: matrix 73 rows 51 cols
[2025-06-04 01:42:14] [INFO ] Computed 10 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:42:15] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-06-04 01:42:15] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2025-06-04 01:42:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-04 01:42:15] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2025-06-04 01:42:15] [INFO ] Flow matrix only has 73 transitions (discarded 4 similar events)
[2025-06-04 01:42:15] [INFO ] Invariant cache hit.
[2025-06-04 01:42:15] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:15] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:16] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 72/123 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 1/124 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 0/124 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 64 constraints, problems are : Problem set: 0 solved, 76 unsolved in 3996 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 76 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:19] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:19] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 8 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 72/123 variables, 51/65 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 76/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (OVERLAPS) 1/124 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 11 (OVERLAPS) 0/124 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 142 constraints, problems are : Problem set: 0 solved, 76 unsolved in 7496 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11507ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 11508ms
Starting structural reductions in LTL mode, iteration 1 : 51/83 places, 77/160 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11723 ms. Remains : 51/83 places, 77/160 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 115 ms.
Product exploration explored 100000 steps with 50000 reset in 138 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 21 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-09-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-14 finished in 12128 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1||G(p0)))&&(G(p2)||G(!p0))))'
Support contains 2 out of 83 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 83/83 places, 160/160 transitions.
Graph (trivial) has 98 edges and 83 vertex of which 12 / 83 are part of one of the 6 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 20 place count 57 transition count 117
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 57 transition count 117
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 46 place count 50 transition count 102
Iterating global reduction 0 with 7 rules applied. Total rules applied 53 place count 50 transition count 102
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 62 place count 50 transition count 93
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 47 transition count 85
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 47 transition count 85
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 71 place count 47 transition count 82
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 73 place count 45 transition count 78
Iterating global reduction 2 with 2 rules applied. Total rules applied 75 place count 45 transition count 78
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 81 place count 45 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 43 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 43 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 90 place count 41 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 93 place count 41 transition count 80
Applied a total of 93 rules in 29 ms. Remains 41 /83 variables (removed 42) and now considering 80/160 (removed 80) transitions.
[2025-06-04 01:42:27] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
// Phase 1: matrix 70 rows 41 cols
[2025-06-04 01:42:27] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:42:27] [INFO ] Implicit Places using invariants in 76 ms returned []
[2025-06-04 01:42:27] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
[2025-06-04 01:42:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 01:42:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2025-06-04 01:42:27] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 01:42:27] [INFO ] Redundant transitions in 39 ms returned []
Running 66 sub problems to find dead transitions.
[2025-06-04 01:42:27] [INFO ] Flow matrix only has 70 transitions (discarded 10 similar events)
[2025-06-04 01:42:27] [INFO ] Invariant cache hit.
[2025-06-04 01:42:27] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:27] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:27] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:27] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:28] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (OVERLAPS) 69/110 variables, 41/54 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 67 constraints, problems are : Problem set: 0 solved, 66 unsolved in 2212 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 7/41 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:30] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 66 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 01:42:30] [INFO ] Deduced a trap composed of 14 places in 76 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 69/110 variables, 41/56 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 66/135 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/110 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/110 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 135 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4699 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 41/41 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6934ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 6935ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/83 places, 80/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7206 ms. Remains : 41/83 places, 80/160 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND p0 (NOT p2))), p0, (AND p0 (NOT p2)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-09-LTLFireability-15
Product exploration explored 100000 steps with 14 reset in 77 ms.
Product exploration explored 100000 steps with 2 reset in 116 ms.
Computed a total of 16 stabilizing places and 28 stable transitions
Computed a total of 16 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 156 ms. Reduced automaton from 6 states, 17 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p2)]
RANDOM walk for 2466 steps (256 resets) in 10 ms. (224 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p2 p0 p1), (X p2), (X (NOT (AND p2 (NOT p0)))), (X (AND p2 p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p2 p0)), (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1))))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p2 p0))), (X (X (NOT (OR (NOT p2) (AND (NOT p0) (NOT p1)))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 21 factoid took 195 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HealthRecord-PT-09-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HealthRecord-PT-09-LTLFireability-15 finished in 8101 ms.
All properties solved by simple procedures.
Total runtime 206462 ms.
BK_STOP 1749001355215
--------------------
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-09"
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-09, 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-174867008200604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-09.tgz
mv HealthRecord-PT-09 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 '
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 ;