fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074300588
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for HealthRecord-PT-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
441.783 106175.00 139247.00 299.90 TFFFFFFFFFFFFFFF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074300588.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is HealthRecord-PT-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300588
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 6.1K Mar 7 13:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 7 13:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 7 13:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 7 13:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 45K Mar 7 13:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 7 13:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Mar 7 13:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 67K Mar 3 18:30 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-07-LTLFireability-00
FORMULA_NAME HealthRecord-PT-07-LTLFireability-01
FORMULA_NAME HealthRecord-PT-07-LTLFireability-02
FORMULA_NAME HealthRecord-PT-07-LTLFireability-03
FORMULA_NAME HealthRecord-PT-07-LTLFireability-04
FORMULA_NAME HealthRecord-PT-07-LTLFireability-05
FORMULA_NAME HealthRecord-PT-07-LTLFireability-06
FORMULA_NAME HealthRecord-PT-07-LTLFireability-07
FORMULA_NAME HealthRecord-PT-07-LTLFireability-08
FORMULA_NAME HealthRecord-PT-07-LTLFireability-09
FORMULA_NAME HealthRecord-PT-07-LTLFireability-10
FORMULA_NAME HealthRecord-PT-07-LTLFireability-11
FORMULA_NAME HealthRecord-PT-07-LTLFireability-12
FORMULA_NAME HealthRecord-PT-07-LTLFireability-13
FORMULA_NAME HealthRecord-PT-07-LTLFireability-14
FORMULA_NAME HealthRecord-PT-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779736055048

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-07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 19:07:36] [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]
[2026-05-25 19:07:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:07:36] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2026-05-25 19:07:36] [INFO ] Transformed 155 places.
[2026-05-25 19:07:36] [INFO ] Transformed 320 transitions.
[2026-05-25 19:07:36] [INFO ] Found NUPN structural information;
[2026-05-25 19:07:36] [INFO ] Parsed PT model containing 155 places and 320 transitions and 839 arcs in 158 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 25 transitions
Reduce redundant transitions removed 25 transitions.
FORMULA HealthRecord-PT-07-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 295/295 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 84 transition count 159
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 84 transition count 159
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 148 place count 78 transition count 147
Iterating global reduction 0 with 6 rules applied. Total rules applied 154 place count 78 transition count 147
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 156 place count 78 transition count 145
Applied a total of 156 rules in 42 ms. Remains 78 /155 variables (removed 77) and now considering 145/295 (removed 150) transitions.
[2026-05-25 19:07:36] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9985979985258559305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16562488454853270121.kers'
[2026-05-25 19:07:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9985979985258559305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16562488454853270121.kers]
Normalized transition count is 138 out of 139 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 138 rows 77 cols 439 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-25 19:07:36] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16562488454853270121.kers
Total runtime 1 ms.
[2026-05-25 19:07:36] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-25 19:07:36] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2026-05-25 19:07:36] [INFO ] Invariant cache hit.
[2026-05-25 19:07:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:07:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 144 sub problems to find dead transitions.
[2026-05-25 19:07:37] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2026-05-25 19:07:37] [INFO ] Invariant cache hit.
[2026-05-25 19:07:37] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 7/19 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (OVERLAPS) 138/216 variables, 78/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (OVERLAPS) 1/217 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 0/217 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 14 (OVERLAPS) 0/217 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 102 constraints, problems are : Problem set: 0 solved, 144 unsolved in 8756 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 144 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 2 (OVERLAPS) 1/78 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 6 (OVERLAPS) 138/216 variables, 78/101 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/216 variables, 144/245 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
At refinement iteration 12 (OVERLAPS) 0/217 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 144 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 248 constraints, problems are : Problem set: 0 solved, 144 unsolved in 17035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 144/144 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25892ms problems are : Problem set: 0 solved, 144 unsolved
Search for dead transitions found 0 dead transitions in 25911ms
Starting structural reductions in LTL mode, iteration 1 : 78/155 places, 145/295 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26328 ms. Remains : 78/155 places, 145/295 transitions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Applied a total of 0 rules in 1 ms. Remains 78 /78 variables (removed 0) and now considering 145/145 (removed 0) transitions.
[2026-05-25 19:08:02] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2026-05-25 19:08:02] [INFO ] Invariant cache hit.
[2026-05-25 19:08:02] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 19:08:02] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2026-05-25 19:08:02] [INFO ] Invariant cache hit.
[2026-05-25 19:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:03] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 78/78 places, 145/145 transitions.
Support contains 38 out of 78 places after structural reductions.
[2026-05-25 19:08:03] [INFO ] Flatten gal took : 47 ms
[2026-05-25 19:08:03] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:08:03] [INFO ] Input system was already deterministic with 145 transitions.
Support contains 37 out of 78 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (2128 resets) in 2260 ms. (17 steps per ms) remains 15/27 properties
BEST_FIRST walk for 4004 steps (31 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (29 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (29 resets) in 15 ms. (250 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (25 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (28 resets) in 19 ms. (200 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (29 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (31 resets) in 13 ms. (285 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (31 resets) in 9 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (60 resets) in 11 ms. (333 steps per ms) remains 14/14 properties
[2026-05-25 19:08:03] [INFO ] Flow matrix only has 139 transitions (discarded 6 similar events)
[2026-05-25 19:08:03] [INFO ] Invariant cache hit.
[2026-05-25 19:08:03] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (OVERLAPS) 32/56 variables, 9/10 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 13 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 22/78 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 138/216 variables, 78/93 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/216 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 1/217 variables, 1/94 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 1/95 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 12 (OVERLAPS) 0/217 variables, 0/95 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 217/217 variables, and 95 constraints, problems are : Problem set: 2 solved, 12 unsolved in 655 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 33/54 variables, 9/10 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 4/14 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 24/78 variables, 2/17 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/17 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 8 (OVERLAPS) 138/216 variables, 78/95 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/216 variables, 12/107 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/216 variables, 0/107 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 1/217 variables, 1/108 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 13 (OVERLAPS) 0/217 variables, 0/108 constraints. Problems are: Problem set: 2 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 217/217 variables, and 108 constraints, problems are : Problem set: 2 solved, 12 unsolved in 837 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 78/78 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/14 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1498ms problems are : Problem set: 2 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 8 properties in 783 ms.
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 78/78 places, 145/145 transitions.
Graph (trivial) has 90 edges and 78 vertex of which 14 / 78 are part of one of the 7 SCC in 7 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 305 edges and 71 vertex of which 70 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 70 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 69 transition count 121
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 68 transition count 120
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 8 place count 68 transition count 116
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 19 place count 61 transition count 116
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 35 place count 45 transition count 84
Iterating global reduction 3 with 16 rules applied. Total rules applied 51 place count 45 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 55 place count 45 transition count 80
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 60 place count 40 transition count 67
Iterating global reduction 4 with 5 rules applied. Total rules applied 65 place count 40 transition count 67
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 68 place count 40 transition count 64
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 71 place count 37 transition count 58
Iterating global reduction 5 with 3 rules applied. Total rules applied 74 place count 37 transition count 58
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 83 place count 37 transition count 49
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 6 with 4 rules applied. Total rules applied 87 place count 35 transition count 47
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 97 place count 30 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 100 place count 30 transition count 72
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 102 place count 30 transition count 70
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 104 place count 28 transition count 70
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 107 place count 28 transition count 67
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 115 place count 28 transition count 67
Applied a total of 115 rules in 49 ms. Remains 28 /78 variables (removed 50) and now considering 67/145 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 28/78 places, 67/145 transitions.
RANDOM walk for 40000 steps (12997 resets) in 627 ms. (63 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (2288 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2026-05-25 19:08:06] [INFO ] Flow matrix only has 62 transitions (discarded 5 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9130168321725343563.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13839213431537543663.kers'
[2026-05-25 19:08:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9130168321725343563.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13839213431537543663.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 27 cols 313 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-25 19:08:06] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13839213431537543663.kers
Total runtime 0 ms.
[2026-05-25 19:08:06] [INFO ] State equation strengthened by 24 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/27 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/90 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 62 constraints, problems are : Problem set: 0 solved, 1 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/27 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/28 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 62/90 variables, 28/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 24/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/90 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 63 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 28/28 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 230ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 67/67 transitions.
Graph (complete) has 141 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
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 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 66
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 25 transition count 66
Applied a total of 12 rules in 7 ms. Remains 25 /28 variables (removed 3) and now considering 66/67 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 25/28 places, 66/67 transitions.
RANDOM walk for 40000 steps (13061 resets) in 377 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2296 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1014 steps, run visited all 1 properties in 10 ms. (steps per millisecond=101 )
Probabilistic random walk after 1014 steps, saw 410 distinct states, run finished after 17 ms. (steps per millisecond=59 ) properties seen :1
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 5 stabilizing places and 6 stable transitions
FORMULA HealthRecord-PT-07-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(p1)||(p2 U (G(p2)||(p2&&G(p3))))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 61 transition count 114
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 61 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 61 transition count 113
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 57 transition count 102
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 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 46 place count 57 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 49 place count 54 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 54 transition count 93
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 61 place count 54 transition count 84
Applied a total of 61 rules in 5 ms. Remains 54 /78 variables (removed 24) and now considering 84/145 (removed 61) transitions.
[2026-05-25 19:08:07] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8202748649338737269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17167094149494417300.kers'
[2026-05-25 19:08:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8202748649338737269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17167094149494417300.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 54 cols 265 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 19:08:07] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17167094149494417300.kers
Total runtime 1 ms.
[2026-05-25 19:08:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:08:07] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2026-05-25 19:08:07] [INFO ] Invariant cache hit.
[2026-05-25 19:08:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:07] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2026-05-25 19:08:07] [INFO ] Flow matrix only has 81 transitions (discarded 3 similar events)
[2026-05-25 19:08:07] [INFO ] Invariant cache hit.
[2026-05-25 19:08:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (OVERLAPS) 80/134 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 66 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 80/134 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 83/151 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/134 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 1/135 variables, 1/153 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 12 (OVERLAPS) 0/135 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 153 constraints, problems are : Problem set: 0 solved, 83 unsolved in 6267 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8594ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 8595ms
Starting structural reductions in LTL mode, iteration 1 : 54/78 places, 84/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8704 ms. Remains : 54/78 places, 84/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(X(p1)||(p2 U (G(p2)||(p2&&G(p3))))))))'
Stuttering acceptance computed with spot in 531 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-02
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-02 finished in 9395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||F(p2)))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 59 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 54 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 54 transition count 90
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 52 transition count 86
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 52 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 65 place count 52 transition count 80
Applied a total of 65 rules in 8 ms. Remains 52 /78 variables (removed 26) and now considering 80/145 (removed 65) transitions.
[2026-05-25 19:08:16] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-257421780072977915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13807709566842880944.kers'
[2026-05-25 19:08:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-257421780072977915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13807709566842880944.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 52 cols 255 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:08:16] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13807709566842880944.kers
Total runtime 0 ms.
[2026-05-25 19:08:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:08:16] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2026-05-25 19:08:16] [INFO ] Invariant cache hit.
[2026-05-25 19:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:16] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-25 19:08:16] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2026-05-25 19:08:16] [INFO ] Invariant cache hit.
[2026-05-25 19:08:16] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/128 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/129 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 64 constraints, problems are : Problem set: 0 solved, 79 unsolved in 1841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (OVERLAPS) 76/128 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 79/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 1/129 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 12 (OVERLAPS) 0/129 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 146 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4585 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6436ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 6436ms
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 80/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6525 ms. Remains : 52/78 places, 80/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||F(p2)))))'
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-03 finished in 6707 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Graph (trivial) has 93 edges and 78 vertex of which 14 / 78 are part of one of the 7 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 51 transition count 102
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 43 place count 51 transition count 98
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 46 transition count 85
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 46 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 56 place count 46 transition count 82
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 43 transition count 76
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 43 transition count 76
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 70 place count 43 transition count 68
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 72 place count 42 transition count 67
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 42 transition count 66
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 77 place count 40 transition count 80
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 80 place count 40 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 81 place count 39 transition count 76
Applied a total of 81 rules in 29 ms. Remains 39 /78 variables (removed 39) and now considering 76/145 (removed 69) transitions.
[2026-05-25 19:08:23] [INFO ] Flow matrix only has 65 transitions (discarded 11 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8979232822689018526.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15409490555445817848.kers'
[2026-05-25 19:08:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8979232822689018526.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15409490555445817848.kers]
Normalized transition count is 64 out of 65 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 64 rows 39 cols 248 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-25 19:08:23] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15409490555445817848.kers
Total runtime 1 ms.
[2026-05-25 19:08:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:08:23] [INFO ] Flow matrix only has 65 transitions (discarded 11 similar events)
[2026-05-25 19:08:23] [INFO ] Invariant cache hit.
[2026-05-25 19:08:23] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:08:23] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-25 19:08:23] [INFO ] Redundant transitions in 22 ms returned []
Running 62 sub problems to find dead transitions.
[2026-05-25 19:08:23] [INFO ] Flow matrix only has 65 transitions (discarded 11 similar events)
[2026-05-25 19:08:23] [INFO ] Invariant cache hit.
[2026-05-25 19:08:23] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/103 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/104 variables, and 63 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1165 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/39 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 64/103 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 13/63 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 62/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/104 variables, and 125 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1796 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2980ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2981ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/78 places, 76/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3125 ms. Remains : 39/78 places, 76/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-04 finished in 3246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U p1)||G(p2)||X(X(F(p3)))))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 60 transition count 111
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 60 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 60 transition count 107
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 57 transition count 99
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 57 transition count 99
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 55 transition count 95
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 55 transition count 95
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 56 place count 55 transition count 89
Applied a total of 56 rules in 9 ms. Remains 55 /78 variables (removed 23) and now considering 89/145 (removed 56) transitions.
[2026-05-25 19:08:26] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16127583242711716827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3727111057287950516.kers'
[2026-05-25 19:08:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16127583242711716827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3727111057287950516.kers]
Normalized transition count is 84 out of 85 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 84 rows 54 cols 285 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 19:08:26] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3727111057287950516.kers
Total runtime 0 ms.
[2026-05-25 19:08:26] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:08:26] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2026-05-25 19:08:26] [INFO ] Invariant cache hit.
[2026-05-25 19:08:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:26] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 88 sub problems to find dead transitions.
[2026-05-25 19:08:26] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2026-05-25 19:08:26] [INFO ] Invariant cache hit.
[2026-05-25 19:08:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (OVERLAPS) 84/139 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 71 constraints, problems are : Problem set: 0 solved, 88 unsolved in 2926 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 88 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 2 (OVERLAPS) 1/55 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 6 (OVERLAPS) 84/139 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 88/160 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 9 (OVERLAPS) 1/140 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/140 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 88 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 88 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 162 constraints, problems are : Problem set: 0 solved, 88 unsolved in 6669 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 88/88 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9610ms problems are : Problem set: 0 solved, 88 unsolved
Search for dead transitions found 0 dead transitions in 9612ms
Starting structural reductions in LTL mode, iteration 1 : 55/78 places, 89/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9722 ms. Remains : 55/78 places, 89/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0) U p1)||G(p2)||X(X(F(p3)))))))'
Stuttering acceptance computed with spot in 408 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-05
Product exploration explored 100000 steps with 25015 reset in 228 ms.
Product exploration explored 100000 steps with 25017 reset in 186 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge based reduction with 19 factoid took 109 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (2108 resets) in 629 ms. (63 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40004 steps (303 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (318 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (222 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (316 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (319 resets) in 54 ms. (727 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (323 resets) in 216 ms. (184 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (311 resets) in 91 ms. (434 steps per ms) remains 7/7 properties
[2026-05-25 19:08:37] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2026-05-25 19:08:37] [INFO ] Invariant cache hit.
[2026-05-25 19:08:37] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 19/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 84/139 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 68 constraints, problems are : Problem set: 0 solved, 7 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 19/55 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/55 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/55 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 84/139 variables, 55/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 7/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/139 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 1/140 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/140 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/140 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 78 constraints, problems are : Problem set: 0 solved, 7 unsolved in 512 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 767ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 6 properties in 141 ms.
Support contains 1 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 89/89 transitions.
Graph (trivial) has 55 edges and 55 vertex of which 14 / 55 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Graph (complete) has 186 edges and 48 vertex of which 47 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 2 place count 47 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 11 rules applied. Total rules applied 13 place count 40 transition count 66
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 16 place count 37 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 19 place count 37 transition count 61
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 37 transition count 60
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 35 transition count 55
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 35 transition count 55
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 27 place count 35 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 28 place count 34 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 29 place count 34 transition count 50
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 34 transition count 47
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 36 place count 32 transition count 45
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 27 transition count 73
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 48 place count 27 transition count 71
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 50 place count 27 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 52 place count 25 transition count 69
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 55 place count 25 transition count 66
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 63 place count 25 transition count 66
Applied a total of 63 rules in 15 ms. Remains 25 /55 variables (removed 30) and now considering 66/89 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 25/55 places, 66/89 transitions.
RANDOM walk for 8558 steps (2759 resets) in 26 ms. (316 steps per ms) remains 0/1 properties
Knowledge based reduction with 19 factoid took 378 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Knowledge-based reduction took 2313 ms.
Stuttering acceptance computed with spot in 402 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Support contains 5 out of 55 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 55/55 places, 89/89 transitions.
Applied a total of 0 rules in 2 ms. Remains 55 /55 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2026-05-25 19:08:40] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2026-05-25 19:08:40] [INFO ] Invariant cache hit.
[2026-05-25 19:08:40] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:08:40] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2026-05-25 19:08:40] [INFO ] Invariant cache hit.
[2026-05-25 19:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:40] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 55/55 places, 89/89 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge based reduction with 19 factoid took 100 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (2112 resets) in 216 ms. (184 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40004 steps (315 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (326 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (213 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (319 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (323 resets) in 85 ms. (465 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (316 resets) in 59 ms. (666 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (227 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
[2026-05-25 19:08:40] [INFO ] Flow matrix only has 85 transitions (discarded 4 similar events)
[2026-05-25 19:08:40] [INFO ] Invariant cache hit.
[2026-05-25 19:08:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 19/55 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 84/139 variables, 55/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/140 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/140 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 66 constraints, problems are : Problem set: 0 solved, 7 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/36 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 19/55 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/55 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 84/139 variables, 55/68 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 7/75 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/139 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 1/140 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/140 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/140 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 77 constraints, problems are : Problem set: 0 solved, 7 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 713ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 972 steps, including 27 resets, run visited all 7 properties in 10 ms. (steps per millisecond=97 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 7 properties in 15 ms.
Knowledge based reduction with 19 factoid took 376 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 9 states, 19 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Knowledge-based reduction took 1896 ms.
Stuttering acceptance computed with spot in 433 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 444 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) p1 (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p3) (NOT p2))]
Product exploration explored 100000 steps with 25046 reset in 138 ms.
Product exploration explored 100000 steps with 24991 reset in 162 ms.
Spot run failed in 87 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin13460733172385715948
[2026-05-25 19:08:43] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13460733172385715948
Running compilation step : cd /tmp/ltsmin13460733172385715948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 288 ms.
Running link step : cd /tmp/ltsmin13460733172385715948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin13460733172385715948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6039209409422860438.hoa' '--buchi-type=spotba'
LTSmin run took 218 ms.
FORMULA HealthRecord-PT-07-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-07-LTLFireability-05 finished in 17213 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 110
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 59 transition count 107
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 46 place count 54 transition count 94
Iterating global reduction 1 with 5 rules applied. Total rules applied 51 place count 54 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 54 place count 54 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 51 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 51 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 69 place count 51 transition count 76
Applied a total of 69 rules in 8 ms. Remains 51 /78 variables (removed 27) and now considering 76/145 (removed 69) transitions.
[2026-05-25 19:08:43] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14800123295055720083.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7492559537035943038.kers'
[2026-05-25 19:08:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14800123295055720083.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7492559537035943038.kers]
Normalized transition count is 72 out of 73 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 51 cols 241 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:08:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7492559537035943038.kers
Total runtime 0 ms.
[2026-05-25 19:08:43] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:08:43] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2026-05-25 19:08:43] [INFO ] Invariant cache hit.
[2026-05-25 19:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-25 19:08:43] [INFO ] Flow matrix only has 73 transitions (discarded 3 similar events)
[2026-05-25 19:08:43] [INFO ] Invariant cache hit.
[2026-05-25 19:08:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 72/123 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 63 constraints, problems are : Problem set: 0 solved, 75 unsolved in 2025 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 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
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 72/123 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 75/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 140 constraints, problems are : Problem set: 0 solved, 75 unsolved in 4228 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6261ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 6262ms
Starting structural reductions in LTL mode, iteration 1 : 51/78 places, 76/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6355 ms. Remains : 51/78 places, 76/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(p1))))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-06
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-06 finished in 6486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Graph (trivial) has 92 edges and 78 vertex of which 12 / 78 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 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 51 transition count 101
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 51 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 45 place count 51 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 50 place count 46 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 55 place count 46 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 46 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 43 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 43 transition count 75
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 73 place count 43 transition count 66
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 75 place count 42 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 42 transition count 64
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 80 place count 40 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 82 place count 40 transition count 76
Applied a total of 82 rules in 19 ms. Remains 40 /78 variables (removed 38) and now considering 76/145 (removed 69) transitions.
[2026-05-25 19:08:50] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16413821374666560561.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16523499314202368056.kers'
[2026-05-25 19:08:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16413821374666560561.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16523499314202368056.kers]
Normalized transition count is 65 out of 66 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 40 cols 248 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-25 19:08:50] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16523499314202368056.kers
Total runtime 0 ms.
[2026-05-25 19:08:50] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:08:50] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
[2026-05-25 19:08:50] [INFO ] Invariant cache hit.
[2026-05-25 19:08:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:08:50] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-25 19:08:50] [INFO ] Redundant transitions in 21 ms returned []
Running 62 sub problems to find dead transitions.
[2026-05-25 19:08:50] [INFO ] Flow matrix only has 66 transitions (discarded 10 similar events)
[2026-05-25 19:08:50] [INFO ] Invariant cache hit.
[2026-05-25 19:08:50] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 65/105 variables, 40/54 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/105 variables, 13/67 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 105/106 variables, and 67 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/40 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 65/105 variables, 40/55 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/105 variables, 13/68 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/105 variables, 62/130 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/105 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 0/105 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 105/106 variables, and 130 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1996 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3319ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 3319ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/78 places, 76/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3446 ms. Remains : 40/78 places, 76/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-08
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-08 finished in 3520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(G(!p1) U X(p2))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 109
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 109
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 59 transition count 105
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 46 place count 55 transition count 94
Iterating global reduction 1 with 4 rules applied. Total rules applied 50 place count 55 transition count 94
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 53 place count 55 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 52 transition count 85
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 52 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 68 place count 52 transition count 76
Applied a total of 68 rules in 5 ms. Remains 52 /78 variables (removed 26) and now considering 76/145 (removed 69) transitions.
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9501253175952993892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5398824390624299273.kers'
[2026-05-25 19:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9501253175952993892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5398824390624299273.kers]
Normalized transition count is 71 out of 72 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 52 cols 240 entries
Finished phase 1 with 41 SingleSign rule and 1 generalized
[2026-05-25 19:08:53] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5398824390624299273.kers
Total runtime 1 ms.
[2026-05-25 19:08:53] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-25 19:08:53] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2026-05-25 19:08:53] [INFO ] Invariant cache hit.
[2026-05-25 19:08:53] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:08:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 75 sub problems to find dead transitions.
[2026-05-25 19:08:54] [INFO ] Flow matrix only has 72 transitions (discarded 4 similar events)
[2026-05-25 19:08:54] [INFO ] Invariant cache hit.
[2026-05-25 19:08:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 71/123 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 65 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1857 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 52/52 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
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 1/52 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/52 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 9 (OVERLAPS) 71/123 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 75/144 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 12 (OVERLAPS) 1/124 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 14 (OVERLAPS) 0/124 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 145 constraints, problems are : Problem set: 0 solved, 75 unsolved in 5092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6956ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 6956ms
Starting structural reductions in LTL mode, iteration 1 : 52/78 places, 76/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7066 ms. Remains : 52/78 places, 76/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(G(!p1) U X(p2))))))'
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), true, p1]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-09
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-09 finished in 7414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Graph (trivial) has 94 edges and 78 vertex of which 14 / 78 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 51 transition count 101
Iterating global reduction 0 with 19 rules applied. Total rules applied 39 place count 51 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 43 place count 51 transition count 97
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 48 place count 46 transition count 84
Iterating global reduction 1 with 5 rules applied. Total rules applied 53 place count 46 transition count 84
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 56 place count 46 transition count 81
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 43 transition count 75
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 43 transition count 75
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 43 transition count 66
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 73 place count 42 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 74 place count 42 transition count 64
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 78 place count 40 transition count 78
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 81 place count 40 transition count 75
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 39 transition count 74
Applied a total of 82 rules in 14 ms. Remains 39 /78 variables (removed 39) and now considering 74/145 (removed 71) transitions.
[2026-05-25 19:09:01] [INFO ] Flow matrix only has 62 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17876190109566175321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6806690627824446623.kers'
[2026-05-25 19:09:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17876190109566175321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6806690627824446623.kers]
Normalized transition count is 61 out of 62 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 61 rows 38 cols 240 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-25 19:09:01] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6806690627824446623.kers
Total runtime 0 ms.
[2026-05-25 19:09:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:09:01] [INFO ] Flow matrix only has 62 transitions (discarded 12 similar events)
[2026-05-25 19:09:01] [INFO ] Invariant cache hit.
[2026-05-25 19:09:01] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:09:01] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2026-05-25 19:09:01] [INFO ] Redundant transitions in 20 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-25 19:09:01] [INFO ] Flow matrix only has 62 transitions (discarded 12 similar events)
[2026-05-25 19:09:01] [INFO ] Invariant cache hit.
[2026-05-25 19:09:01] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 61/100 variables, 39/51 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/100 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 100/101 variables, and 64 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1271 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 7/39 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 61/100 variables, 39/52 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 13/65 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/100 variables, 60/125 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/100 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/100 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 100/101 variables, and 125 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1586 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 39/39 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2876ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2876ms
Starting structural reductions in SI_LTL mode, iteration 1 : 39/78 places, 74/145 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3031 ms. Remains : 39/78 places, 74/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-10 finished in 3105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1) U ((X(p1)&&(!p0||G(p2)))||X(G(p1))))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 60 transition count 112
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 60 transition count 112
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 60 transition count 109
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 44 place count 55 transition count 96
Iterating global reduction 1 with 5 rules applied. Total rules applied 49 place count 55 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 52 place count 55 transition count 93
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 54 place count 53 transition count 89
Iterating global reduction 2 with 2 rules applied. Total rules applied 56 place count 53 transition count 89
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 62 place count 53 transition count 83
Applied a total of 62 rules in 7 ms. Remains 53 /78 variables (removed 25) and now considering 83/145 (removed 62) transitions.
[2026-05-25 19:09:04] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6290168694483415539.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1986838317583566342.kers'
[2026-05-25 19:09:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6290168694483415539.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1986838317583566342.kers]
Normalized transition count is 79 out of 80 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 79 rows 53 cols 263 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-25 19:09:04] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1986838317583566342.kers
Total runtime 1 ms.
[2026-05-25 19:09:04] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:09:04] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2026-05-25 19:09:04] [INFO ] Invariant cache hit.
[2026-05-25 19:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:04] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 82 sub problems to find dead transitions.
[2026-05-25 19:09:04] [INFO ] Flow matrix only has 80 transitions (discarded 3 similar events)
[2026-05-25 19:09:04] [INFO ] Invariant cache hit.
[2026-05-25 19:09:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/65 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 2/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 68 constraints, problems are : Problem set: 0 solved, 82 unsolved in 2583 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 1 (OVERLAPS) 1/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 79/132 variables, 53/68 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 82/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 1/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 82 unsolved in 5915 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 53/53 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 82/82 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8508ms problems are : Problem set: 0 solved, 82 unsolved
Search for dead transitions found 0 dead transitions in 8509ms
Starting structural reductions in LTL mode, iteration 1 : 53/78 places, 83/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8606 ms. Remains : 53/78 places, 83/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(X(p1) U ((X(p1)&&(!p0||G(p2)))||X(G(p1))))))'
Stuttering acceptance computed with spot in 340 ms :[(OR (NOT p0) (NOT p1)), (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-11
Entered a terminal (fully accepting) state of product in 9 steps with 4 reset in 1 ms.
FORMULA HealthRecord-PT-07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-11 finished in 8986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(X(G((p1&&X((p1 U (!p2||G(p1)))))))))) U X(p3)))'
Support contains 13 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 145/145 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 59 transition count 110
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 59 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 42 place count 59 transition count 106
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 54 transition count 93
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 54 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 54 transition count 90
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 58 place count 51 transition count 84
Iterating global reduction 2 with 3 rules applied. Total rules applied 61 place count 51 transition count 84
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 51 transition count 75
Applied a total of 70 rules in 5 ms. Remains 51 /78 variables (removed 27) and now considering 75/145 (removed 70) transitions.
[2026-05-25 19:09:13] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7379380781291862625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17252292991299985513.kers'
[2026-05-25 19:09:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7379380781291862625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17252292991299985513.kers]
Normalized transition count is 71 out of 72 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 51 cols 237 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:09:13] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17252292991299985513.kers
Total runtime 1 ms.
[2026-05-25 19:09:13] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:09:13] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2026-05-25 19:09:13] [INFO ] Invariant cache hit.
[2026-05-25 19:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:09:13] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-25 19:09:13] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2026-05-25 19:09:13] [INFO ] Invariant cache hit.
[2026-05-25 19:09:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 71/122 variables, 51/68 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/123 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/123 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 69 constraints, problems are : Problem set: 0 solved, 74 unsolved in 2333 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 8/17 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 71/122 variables, 51/72 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/122 variables, 74/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/122 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/123 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/123 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 147 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4938 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7277ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 7278ms
Starting structural reductions in LTL mode, iteration 1 : 51/78 places, 75/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7359 ms. Remains : 51/78 places, 75/145 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(p0)&&X(X(G((p1&&X((p1 U (!p2||G(p1)))))))))) U X(p3)))'
Stuttering acceptance computed with spot in 376 ms :[(NOT p3), (AND (NOT p0) (NOT p3)), (NOT p3), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : HealthRecord-PT-07-LTLFireability-14
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-07-LTLFireability-14 finished in 7790 ms.
All properties solved by simple procedures.
Total runtime 104963 ms.

BK_STOP 1779736161223

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-07"
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-5973"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-07, 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 r146-tall-177961074300588"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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