About the Execution of ITS-Tools for HealthRecord-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 483.672 | 156850.00 | 197578.00 | 1403.00 | FFTFFFFFFFFFFTFT | 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-177961074300628.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300628
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.2K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 7 13:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 7 13:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 7 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:44 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 71K 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-12-LTLFireability-00
FORMULA_NAME HealthRecord-PT-12-LTLFireability-01
FORMULA_NAME HealthRecord-PT-12-LTLFireability-02
FORMULA_NAME HealthRecord-PT-12-LTLFireability-03
FORMULA_NAME HealthRecord-PT-12-LTLFireability-04
FORMULA_NAME HealthRecord-PT-12-LTLFireability-05
FORMULA_NAME HealthRecord-PT-12-LTLFireability-06
FORMULA_NAME HealthRecord-PT-12-LTLFireability-07
FORMULA_NAME HealthRecord-PT-12-LTLFireability-08
FORMULA_NAME HealthRecord-PT-12-LTLFireability-09
FORMULA_NAME HealthRecord-PT-12-LTLFireability-10
FORMULA_NAME HealthRecord-PT-12-LTLFireability-11
FORMULA_NAME HealthRecord-PT-12-LTLFireability-12
FORMULA_NAME HealthRecord-PT-12-LTLFireability-13
FORMULA_NAME HealthRecord-PT-12-LTLFireability-14
FORMULA_NAME HealthRecord-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779736924045
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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 19:22:05] [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:22:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:22:05] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2026-05-25 19:22:05] [INFO ] Transformed 160 places.
[2026-05-25 19:22:05] [INFO ] Transformed 340 transitions.
[2026-05-25 19:22:05] [INFO ] Found NUPN structural information;
[2026-05-25 19:22:05] [INFO ] Parsed PT model containing 160 places and 340 transitions and 895 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA HealthRecord-PT-12-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 312/312 transitions.
Discarding 75 places :
Symmetric choice reduction at 0 with 75 rule applications. Total rules 75 place count 85 transition count 169
Iterating global reduction 0 with 75 rules applied. Total rules applied 150 place count 85 transition count 169
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 154 place count 81 transition count 161
Iterating global reduction 0 with 4 rules applied. Total rules applied 158 place count 81 transition count 161
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 162 place count 81 transition count 157
Applied a total of 162 rules in 34 ms. Remains 81 /160 variables (removed 79) and now considering 157/312 (removed 155) transitions.
[2026-05-25 19:22:05] [INFO ] Flow matrix only has 152 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-6606754991544716257.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1078952451038866232.kers'
[2026-05-25 19:22:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6606754991544716257.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1078952451038866232.kers]
Normalized transition count is 151 out of 152 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 151 rows 79 cols 477 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 19:22:05] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1078952451038866232.kers
Total runtime 2 ms.
[2026-05-25 19:22:05] [INFO ] Implicit Places using invariants in 175 ms returned []
[2026-05-25 19:22:05] [INFO ] Flow matrix only has 152 transitions (discarded 5 similar events)
[2026-05-25 19:22:05] [INFO ] Invariant cache hit.
[2026-05-25 19:22:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:22:05] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 156 sub problems to find dead transitions.
[2026-05-25 19:22:05] [INFO ] Flow matrix only has 152 transitions (discarded 5 similar events)
[2026-05-25 19:22:05] [INFO ] Invariant cache hit.
[2026-05-25 19:22:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 151/232 variables, 81/99 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/232 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (OVERLAPS) 1/233 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/233 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (OVERLAPS) 0/233 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 105 constraints, problems are : Problem set: 0 solved, 156 unsolved in 10994 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/80 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (OVERLAPS) 1/81 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 12/23 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 5/28 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 7 (OVERLAPS) 151/232 variables, 81/111 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/232 variables, 156/267 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/232 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 1/233 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/233 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/233 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 13 (OVERLAPS) 0/233 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 233/233 variables, and 271 constraints, problems are : Problem set: 0 solved, 156 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41102ms problems are : Problem set: 0 solved, 156 unsolved
Search for dead transitions found 0 dead transitions in 41114ms
Starting structural reductions in LTL mode, iteration 1 : 81/160 places, 157/312 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41497 ms. Remains : 81/160 places, 157/312 transitions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 157/157 (removed 0) transitions.
[2026-05-25 19:22:47] [INFO ] Flow matrix only has 152 transitions (discarded 5 similar events)
[2026-05-25 19:22:47] [INFO ] Invariant cache hit.
[2026-05-25 19:22:47] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:22:47] [INFO ] Flow matrix only has 152 transitions (discarded 5 similar events)
[2026-05-25 19:22:47] [INFO ] Invariant cache hit.
[2026-05-25 19:22:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:22:47] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 81/81 places, 157/157 transitions.
Support contains 41 out of 81 places after structural reductions.
[2026-05-25 19:22:47] [INFO ] Flatten gal took : 34 ms
[2026-05-25 19:22:47] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:22:47] [INFO ] Input system was already deterministic with 157 transitions.
RANDOM walk for 40000 steps (2904 resets) in 2206 ms. (18 steps per ms) remains 15/31 properties
BEST_FIRST walk for 4003 steps (35 resets) in 17 ms. (222 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (36 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (37 resets) in 15 ms. (250 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (35 resets) in 21 ms. (182 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (36 resets) in 17 ms. (222 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4004 steps (30 resets) in 27 ms. (143 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4003 steps (31 resets) in 16 ms. (235 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (34 resets) in 10 ms. (364 steps per ms) remains 12/13 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (35 resets) in 7 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (36 resets) in 12 ms. (308 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (35 resets) in 26 ms. (148 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (32 resets) in 11 ms. (333 steps per ms) remains 12/12 properties
[2026-05-25 19:22:48] [INFO ] Flow matrix only has 152 transitions (discarded 5 similar events)
[2026-05-25 19:22:48] [INFO ] Invariant cache hit.
[2026-05-25 19:22:48] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/61 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 18/79 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 2/81 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 151/232 variables, 81/104 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (OVERLAPS) 1/233 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (OVERLAPS) 0/233 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 233/233 variables, and 107 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 45/61 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 18/79 variables, 5/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 2/81 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 10 (OVERLAPS) 151/232 variables, 81/107 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/232 variables, 12/119 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 1/233 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 17 (OVERLAPS) 0/233 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 233/233 variables, and 122 constraints, problems are : Problem set: 0 solved, 12 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2451ms problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 10 properties in 553 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 157/157 transitions.
Graph (trivial) has 95 edges and 81 vertex of which 6 / 81 are part of one of the 3 SCC in 7 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 338 edges and 78 vertex of which 75 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 75 transition count 143
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 73 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 73 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 72 transition count 141
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 28 place count 53 transition count 103
Iterating global reduction 2 with 19 rules applied. Total rules applied 47 place count 53 transition count 103
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 49 place count 53 transition count 101
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 55 place count 47 transition count 88
Iterating global reduction 3 with 6 rules applied. Total rules applied 61 place count 47 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 64 place count 47 transition count 85
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 44 transition count 77
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 44 transition count 77
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 73 place count 44 transition count 74
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 75 place count 42 transition count 70
Iterating global reduction 5 with 2 rules applied. Total rules applied 77 place count 42 transition count 70
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 83 place count 42 transition count 64
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
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 93 place count 37 transition count 95
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 94 place count 37 transition count 94
Free-agglomeration rule applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 99 place count 37 transition count 89
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 104 place count 32 transition count 89
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 106 place count 32 transition count 87
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 109 place count 32 transition count 153
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 113 place count 29 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 116 place count 29 transition count 149
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 117 place count 28 transition count 113
Iterating global reduction 8 with 1 rules applied. Total rules applied 118 place count 28 transition count 113
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 119 place count 27 transition count 111
Iterating global reduction 8 with 1 rules applied. Total rules applied 120 place count 27 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 130 place count 27 transition count 101
Applied a total of 130 rules in 58 ms. Remains 27 /81 variables (removed 54) and now considering 101/157 (removed 56) transitions.
Running 85 sub problems to find dead transitions.
[2026-05-25 19:22:51] [INFO ] Flow matrix only has 77 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7848887864898355800.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13049295741978126644.kers'
[2026-05-25 19:22:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7848887864898355800.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13049295741978126644.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 77 rows 26 cols 394 entries
Finished phase 1 with 17 SingleSign rule and 2 generalized
[2026-05-25 19:22:51] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13049295741978126644.kers
Total runtime 1 ms.
[2026-05-25 19:22:51] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 85 unsolved
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 4 (OVERLAPS) 77/104 variables, 27/35 constraints. Problems are: Problem set: 2 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 20/55 constraints. Problems are: Problem set: 2 solved, 83 unsolved
Problem TDEAD41 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 1/56 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 8 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 3 solved, 82 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 3 solved, 82 unsolved in 1561 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 85/85 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 82 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 1/8 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 3 solved, 82 unsolved
At refinement iteration 5 (OVERLAPS) 77/104 variables, 27/36 constraints. Problems are: Problem set: 3 solved, 82 unsolved
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 20/56 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 80/136 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/136 constraints. Problems are: Problem set: 5 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/136 constraints. Problems are: Problem set: 5 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 136 constraints, problems are : Problem set: 5 solved, 80 unsolved in 2977 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 80/85 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4585ms problems are : Problem set: 5 solved, 80 unsolved
Search for dead transitions found 5 dead transitions in 4586ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 5 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/81 places, 96/157 transitions.
Graph (complete) has 108 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 26 transition count 88
Applied a total of 9 rules in 6 ms. Remains 26 /27 variables (removed 1) and now considering 88/96 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4654 ms. Remains : 26/81 places, 88/157 transitions.
RANDOM walk for 37658 steps (5958 resets) in 774 ms. (48 steps per ms) remains 0/2 properties
FORMULA HealthRecord-PT-12-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 6 stabilizing places and 9 stable 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 U (p1||G(!p0))) U p2)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 119
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 61 transition count 117
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 55 transition count 104
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 55 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 55 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 52 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 66 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 68 place count 50 transition count 86
Iterating global reduction 3 with 2 rules applied. Total rules applied 70 place count 50 transition count 86
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 75 place count 50 transition count 81
Applied a total of 75 rules in 8 ms. Remains 50 /81 variables (removed 31) and now considering 81/157 (removed 76) transitions.
[2026-05-25 19:22:56] [INFO ] Flow matrix only has 78 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-6810239434498631595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8892912285426747478.kers'
[2026-05-25 19:22:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6810239434498631595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8892912285426747478.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 50 cols 267 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 19:22:56] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8892912285426747478.kers
Total runtime 1 ms.
[2026-05-25 19:22:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:22:56] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2026-05-25 19:22:56] [INFO ] Invariant cache hit.
[2026-05-25 19:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:22:56] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 80 sub problems to find dead transitions.
[2026-05-25 19:22:56] [INFO ] Flow matrix only has 78 transitions (discarded 3 similar events)
[2026-05-25 19:22:56] [INFO ] Invariant cache hit.
[2026-05-25 19:22:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (OVERLAPS) 77/127 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 64 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2490 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 77/127 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 80/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 146 constraints, problems are : Problem set: 0 solved, 80 unsolved in 4219 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6722ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 6724ms
Starting structural reductions in LTL mode, iteration 1 : 50/81 places, 81/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6823 ms. Remains : 50/81 places, 81/157 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 U (G(!p0)||p1)) U p2)))'
Stuttering acceptance computed with spot in 279 ms :[(NOT p2), (NOT p2), true, (AND (NOT p1) p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-00
Stuttering criterion allowed to conclude after 22 steps with 1 reset in 4 ms.
FORMULA HealthRecord-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-00 finished in 7187 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(((p0||X(X(p0)))&&(p1||F(p2))))))'
Support contains 12 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 119
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 61 transition count 117
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 56 transition count 106
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 56 transition count 106
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 53 transition count 98
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 53 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 61 place count 53 transition count 95
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 63 place count 51 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 51 transition count 91
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 71 place count 51 transition count 85
Applied a total of 71 rules in 14 ms. Remains 51 /81 variables (removed 30) and now considering 85/157 (removed 72) transitions.
[2026-05-25 19:23:03] [INFO ] Flow matrix only has 82 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-7434404019032318339.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17972769776294200157.kers'
[2026-05-25 19:23:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7434404019032318339.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17972769776294200157.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 51 cols 281 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:23:03] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17972769776294200157.kers
Total runtime 1 ms.
[2026-05-25 19:23:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:23:03] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:03] [INFO ] Invariant cache hit.
[2026-05-25 19:23:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:23:03] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-25 19:23:03] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:03] [INFO ] Invariant cache hit.
[2026-05-25 19:23:03] [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, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/132 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/133 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 63 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 81/132 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/132 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/132 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (OVERLAPS) 1/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 151 constraints, problems are : Problem set: 0 solved, 84 unsolved in 5528 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7799ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 7800ms
Starting structural reductions in LTL mode, iteration 1 : 51/81 places, 85/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7891 ms. Remains : 51/81 places, 85/157 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(((p0||X(X(p0)))&&(p1||F(p2))))))'
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), true]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-01 finished in 8228 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 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Graph (trivial) has 97 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 22 place count 55 transition count 112
Iterating global reduction 0 with 21 rules applied. Total rules applied 43 place count 55 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 46 place count 55 transition count 109
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 51 place count 50 transition count 98
Iterating global reduction 1 with 5 rules applied. Total rules applied 56 place count 50 transition count 98
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 59 place count 50 transition count 95
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 62 place count 47 transition count 87
Iterating global reduction 2 with 3 rules applied. Total rules applied 65 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 68 place count 47 transition count 84
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 45 transition count 80
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 45 transition count 80
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 78 place count 45 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 80 place count 44 transition count 73
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 84 place count 42 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 85 place count 42 transition count 86
Applied a total of 85 rules in 24 ms. Remains 42 /81 variables (removed 39) and now considering 86/157 (removed 71) transitions.
[2026-05-25 19:23:11] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8469743389572963560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2020666233515486239.kers'
[2026-05-25 19:23:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8469743389572963560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2020666233515486239.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 42 cols 292 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 19:23:11] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2020666233515486239.kers
Total runtime 0 ms.
[2026-05-25 19:23:11] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:23:11] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 19:23:11] [INFO ] Invariant cache hit.
[2026-05-25 19:23:11] [INFO ] State equation strengthened by 14 read => feed constraints.
[2026-05-25 19:23:11] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-25 19:23:12] [INFO ] Redundant transitions in 17 ms returned []
Running 70 sub problems to find dead transitions.
[2026-05-25 19:23:12] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-25 19:23:12] [INFO ] Invariant cache hit.
[2026-05-25 19:23:12] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (OVERLAPS) 77/119 variables, 42/54 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (OVERLAPS) 0/119 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 68 constraints, problems are : Problem set: 0 solved, 70 unsolved in 1396 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 70 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 2 (OVERLAPS) 8/42 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 6 (OVERLAPS) 77/119 variables, 42/55 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 14/69 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 70/139 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 70 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 70 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 139 constraints, problems are : Problem set: 0 solved, 70 unsolved in 2412 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 42/42 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 70/70 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3827ms problems are : Problem set: 0 solved, 70 unsolved
Search for dead transitions found 0 dead transitions in 3828ms
Starting structural reductions in SI_LTL mode, iteration 1 : 42/81 places, 86/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3962 ms. Remains : 42/81 places, 86/157 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 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-03 finished in 4077 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(p0) U (p1||G(p0)))||X(G(p2)))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 119
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 61 transition count 117
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 56 transition count 107
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 56 transition count 107
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 55 place count 56 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 55 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 55 transition count 101
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 54 transition count 99
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 54 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 54 transition count 96
Applied a total of 62 rules in 9 ms. Remains 54 /81 variables (removed 27) and now considering 96/157 (removed 61) transitions.
[2026-05-25 19:23:15] [INFO ] Flow matrix only has 93 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-1988074792546616352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9608884061755081469.kers'
[2026-05-25 19:23:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1988074792546616352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9608884061755081469.kers]
Normalized transition count is 92 out of 93 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 92 rows 54 cols 325 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 19:23:15] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9608884061755081469.kers
Total runtime 0 ms.
[2026-05-25 19:23:16] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 19:23:16] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2026-05-25 19:23:16] [INFO ] Invariant cache hit.
[2026-05-25 19:23:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:23:16] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 95 sub problems to find dead transitions.
[2026-05-25 19:23:16] [INFO ] Flow matrix only has 93 transitions (discarded 3 similar events)
[2026-05-25 19:23:16] [INFO ] Invariant cache hit.
[2026-05-25 19:23:16] [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, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (OVERLAPS) 92/146 variables, 54/65 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (OVERLAPS) 1/147 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (OVERLAPS) 0/147 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 67 constraints, problems are : Problem set: 0 solved, 95 unsolved in 3177 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 95 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 1 (OVERLAPS) 1/54 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 5 (OVERLAPS) 92/146 variables, 54/68 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 95/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 8 (OVERLAPS) 1/147 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
At refinement iteration 10 (OVERLAPS) 0/147 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 95 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 164 constraints, problems are : Problem set: 0 solved, 95 unsolved in 6107 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 54/54 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 95/95 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9296ms problems are : Problem set: 0 solved, 95 unsolved
Search for dead transitions found 0 dead transitions in 9296ms
Starting structural reductions in LTL mode, iteration 1 : 54/81 places, 96/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9404 ms. Remains : 54/81 places, 96/157 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(p0) U (p1||G(p0)))||X(G(p2)))))'
Stuttering acceptance computed with spot in 242 ms :[true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-04 finished in 9693 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(((p0 U G(!p1)) U p2)))'
Support contains 6 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Graph (trivial) has 78 edges and 81 vertex of which 6 / 81 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 55 transition count 111
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 55 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 48 place count 55 transition count 108
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 49 transition count 95
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 49 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 63 place count 49 transition count 92
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 65 place count 47 transition count 87
Iterating global reduction 2 with 2 rules applied. Total rules applied 67 place count 47 transition count 87
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 47 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 71 place count 46 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 72 place count 46 transition count 82
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 75 place count 46 transition count 79
Applied a total of 75 rules in 12 ms. Remains 46 /81 variables (removed 35) and now considering 79/157 (removed 78) transitions.
[2026-05-25 19:23:25] [INFO ] Flow matrix only has 74 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-1633207638799586966.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14615192342447600271.kers'
[2026-05-25 19:23:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1633207638799586966.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14615192342447600271.kers]
Normalized transition count is 73 out of 74 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 46 cols 252 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-25 19:23:25] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14615192342447600271.kers
Total runtime 1 ms.
[2026-05-25 19:23:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:23:25] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2026-05-25 19:23:25] [INFO ] Invariant cache hit.
[2026-05-25 19:23:25] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-25 19:23:25] [INFO ] Redundant transitions in 20 ms returned []
Running 63 sub problems to find dead transitions.
[2026-05-25 19:23:25] [INFO ] Flow matrix only has 74 transitions (discarded 5 similar events)
[2026-05-25 19:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/46 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (OVERLAPS) 73/119 variables, 46/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (OVERLAPS) 0/119 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/120 variables, and 57 constraints, problems are : Problem set: 0 solved, 63 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 63 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 2 (OVERLAPS) 8/46 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/46 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 8 (OVERLAPS) 73/119 variables, 46/60 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 63/123 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 63 unsolved
At refinement iteration 11 (OVERLAPS) 0/119 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 63 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/120 variables, and 123 constraints, problems are : Problem set: 0 solved, 63 unsolved in 2042 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 63/63 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3280ms problems are : Problem set: 0 solved, 63 unsolved
Search for dead transitions found 0 dead transitions in 3281ms
Starting structural reductions in SI_LTL mode, iteration 1 : 46/81 places, 79/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3410 ms. Remains : 46/81 places, 79/157 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(((p0 U G(!p1)) U p2)))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), true, p1, (NOT p2), p1]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-05 finished in 3599 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(F((p0&&X(p1)))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 118
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 61 transition count 117
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 47 place count 55 transition count 104
Iterating global reduction 1 with 6 rules applied. Total rules applied 53 place count 55 transition count 104
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 55 transition count 101
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 52 transition count 93
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 52 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 52 transition count 90
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 67 place count 50 transition count 86
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 50 transition count 86
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 75 place count 50 transition count 80
Applied a total of 75 rules in 5 ms. Remains 50 /81 variables (removed 31) and now considering 80/157 (removed 77) transitions.
[2026-05-25 19:23:29] [INFO ] Flow matrix only has 76 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-1703749360345979612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16103789473434136038.kers'
[2026-05-25 19:23:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1703749360345979612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16103789473434136038.kers]
Normalized transition count is 75 out of 76 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 49 cols 263 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-25 19:23:29] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16103789473434136038.kers
Total runtime 0 ms.
[2026-05-25 19:23:29] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 19:23:29] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
[2026-05-25 19:23:29] [INFO ] Invariant cache hit.
[2026-05-25 19:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:23:29] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-25 19:23:29] [INFO ] Flow matrix only has 76 transitions (discarded 4 similar events)
[2026-05-25 19:23:29] [INFO ] Invariant cache hit.
[2026-05-25 19:23:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 75/125 variables, 50/64 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 66 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 75/125 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 79/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/126 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/126 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 145 constraints, problems are : Problem set: 0 solved, 79 unsolved in 3832 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6388ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 6389ms
Starting structural reductions in LTL mode, iteration 1 : 50/81 places, 80/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6495 ms. Remains : 50/81 places, 80/157 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(F((p0&&X(p1)))))'
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-06 finished in 6658 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((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))||((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0)))))&&X(F((G(F(p2))||(p3&&F(p2))))))))'
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 63 transition count 123
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 63 transition count 123
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 63 transition count 121
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 57 transition count 108
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 57 transition count 108
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 57 transition count 105
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 56 place count 54 transition count 97
Iterating global reduction 2 with 3 rules applied. Total rules applied 59 place count 54 transition count 97
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 62 place count 54 transition count 94
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 64 place count 52 transition count 90
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 52 transition count 90
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 71 place count 52 transition count 85
Applied a total of 71 rules in 9 ms. Remains 52 /81 variables (removed 29) and now considering 85/157 (removed 72) transitions.
[2026-05-25 19:23:35] [INFO ] Flow matrix only has 82 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-12734385486164387983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13989513552615696850.kers'
[2026-05-25 19:23:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12734385486164387983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13989513552615696850.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 52 cols 275 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:23:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13989513552615696850.kers
Total runtime 1 ms.
[2026-05-25 19:23:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-25 19:23:36] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:36] [INFO ] Invariant cache hit.
[2026-05-25 19:23:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:23:36] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 84 sub problems to find dead transitions.
[2026-05-25 19:23:36] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:36] [INFO ] Invariant cache hit.
[2026-05-25 19:23:36] [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, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2256 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 81/133 variables, 52/66 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 84/150 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 152 constraints, problems are : Problem set: 0 solved, 84 unsolved in 6438 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8702ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 8702ms
Starting structural reductions in LTL mode, iteration 1 : 52/81 places, 85/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8822 ms. Remains : 52/81 places, 85/157 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((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0))))))||((X(X(!p0)) U ((p1&&X(X(!p0)))||X(X(G(!p0)))))&&X(F((G(F(p2))||(p3&&F(p2))))))))'
Stuttering acceptance computed with spot in 617 ms :[p0, p0, (AND p0 (NOT p2)), p0, p0, (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), true, (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-07
Product exploration explored 100000 steps with 24954 reset in 255 ms.
Product exploration explored 100000 steps with 24998 reset in 180 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 22 factoid took 184 ms. Reduced automaton from 15 states, 31 edges and 4 AP (stutter sensitive) to 11 states, 23 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (2899 resets) in 364 ms. (109 steps per ms) remains 10/14 properties
BEST_FIRST walk for 40003 steps (362 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (363 resets) in 116 ms. (341 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (363 resets) in 207 ms. (192 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (356 resets) in 165 ms. (240 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (352 resets) in 124 ms. (320 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40004 steps (363 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (363 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (360 resets) in 65 ms. (606 steps per ms) remains 7/7 properties
[2026-05-25 19:23:46] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:46] [INFO ] Invariant cache hit.
[2026-05-25 19:23:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem apf1 is UNSAT
Problem apf3 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/52 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/134 variables, 1/64 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/134 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/134 variables, 0/64 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 64 constraints, problems are : Problem set: 2 solved, 5 unsolved in 242 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 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: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 17/52 variables, 5/11 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 5/68 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 2/70 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/70 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/134 variables, 1/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/71 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 71 constraints, problems are : Problem set: 2 solved, 5 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 585ms problems are : Problem set: 2 solved, 5 unsolved
Parikh walk visited 4 properties in 66 ms.
Support contains 1 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 85/85 transitions.
Graph (trivial) has 49 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 177 edges and 49 vertex of which 48 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 73
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 46 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 46 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 45 transition count 71
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 12 place count 42 transition count 65
Iterating global reduction 2 with 3 rules applied. Total rules applied 15 place count 42 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 42 transition count 64
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 18 place count 41 transition count 63
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 28 place count 36 transition count 94
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 36 transition count 93
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 34 place count 36 transition count 88
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 39 place count 31 transition count 88
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 41 place count 31 transition count 86
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 31 transition count 153
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 46 place count 29 transition count 152
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 49 place count 29 transition count 149
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 50 place count 28 transition count 113
Iterating global reduction 5 with 1 rules applied. Total rules applied 51 place count 28 transition count 113
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 52 place count 27 transition count 111
Iterating global reduction 5 with 1 rules applied. Total rules applied 53 place count 27 transition count 111
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 5 with 10 rules applied. Total rules applied 63 place count 27 transition count 101
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 65 place count 27 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 27 transition count 99
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 6 with 7 rules applied. Total rules applied 74 place count 27 transition count 99
Applied a total of 74 rules in 53 ms. Remains 27 /52 variables (removed 25) and now considering 99/85 (removed -14) transitions.
Running 83 sub problems to find dead transitions.
[2026-05-25 19:23:47] [INFO ] Flow matrix only has 75 transitions (discarded 24 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7546259830157597720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11404444298215017130.kers'
[2026-05-25 19:23:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7546259830157597720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11404444298215017130.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 75 rows 26 cols 437 entries
Finished phase 1 with 17 SingleSign rule and 2 generalized
[2026-05-25 19:23:47] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11404444298215017130.kers
Total runtime 1 ms.
[2026-05-25 19:23:47] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/27 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 4 (OVERLAPS) 75/102 variables, 27/35 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 19/54 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/102 variables, 0/54 constraints. Problems are: Problem set: 8 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 54 constraints, problems are : Problem set: 8 solved, 75 unsolved in 1315 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 2/27 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 1/9 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 75/102 variables, 27/36 constraints. Problems are: Problem set: 8 solved, 75 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 19/55 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 72/127 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/127 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/127 constraints. Problems are: Problem set: 11 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 127 constraints, problems are : Problem set: 11 solved, 72 unsolved in 2968 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 27/27 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 72/83 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4318ms problems are : Problem set: 11 solved, 72 unsolved
Search for dead transitions found 11 dead transitions in 4319ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 27/52 places, 88/85 transitions.
Graph (complete) has 92 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 26 /27 variables (removed 1) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4381 ms. Remains : 26/52 places, 88/85 transitions.
RANDOM walk for 36006 steps (5605 resets) in 88 ms. (404 steps per ms) remains 0/1 properties
Found 2 invariant AP formulas.
Knowledge based reduction with 24 factoid took 309 ms. Reduced automaton from 11 states, 23 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 411 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0), (AND (NOT p3) (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 6436 ms.
Stuttering acceptance computed with spot in 423 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0), (AND (NOT p3) (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 85/85 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 85/85 (removed 0) transitions.
[2026-05-25 19:23:52] [INFO ] Flow matrix only has 82 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-15835118972821364365.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12777802938600147787.kers'
[2026-05-25 19:23:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15835118972821364365.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12777802938600147787.kers]
Normalized transition count is 81 out of 82 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 81 rows 52 cols 275 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:23:52] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12777802938600147787.kers
Total runtime 1 ms.
[2026-05-25 19:23:52] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 19:23:52] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:52] [INFO ] Invariant cache hit.
[2026-05-25 19:23:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:23:52] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 102 ms. Remains : 52/52 places, 85/85 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 10 factoid took 84 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (2879 resets) in 125 ms. (317 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40004 steps (360 resets) in 47 ms. (833 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40004 steps (352 resets) in 22 ms. (1739 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (350 resets) in 52 ms. (754 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (360 resets) in 27 ms. (1428 steps per ms) remains 3/3 properties
[2026-05-25 19:23:53] [INFO ] Flow matrix only has 82 transitions (discarded 3 similar events)
[2026-05-25 19:23:53] [INFO ] Invariant cache hit.
[2026-05-25 19:23:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 17/52 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 81/133 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1/134 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/134 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 65 constraints, problems are : Problem set: 0 solved, 3 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 31/35 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 17/52 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/52 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 81/133 variables, 52/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 3/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1/134 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/134 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 71 constraints, problems are : Problem set: 0 solved, 3 unsolved in 275 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 533ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 4 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 85/85 transitions.
Graph (trivial) has 43 edges and 52 vertex of which 6 / 52 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 177 edges and 49 vertex of which 48 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 48 transition count 73
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 46 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 7 place count 46 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 9 place count 45 transition count 71
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 2 with 2 rules applied. Total rules applied 11 place count 44 transition count 70
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 21 place count 39 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 24 place count 39 transition count 96
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 29 place count 39 transition count 91
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 34 place count 34 transition count 91
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 36 place count 34 transition count 89
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 38 place count 34 transition count 150
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 41 place count 32 transition count 149
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 44 place count 32 transition count 146
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 45 place count 31 transition count 113
Iterating global reduction 4 with 1 rules applied. Total rules applied 46 place count 31 transition count 113
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 47 place count 30 transition count 111
Iterating global reduction 4 with 1 rules applied. Total rules applied 48 place count 30 transition count 111
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 54 place count 30 transition count 105
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 58 place count 30 transition count 101
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 60 place count 30 transition count 101
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 62 place count 30 transition count 99
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 69 place count 30 transition count 99
Applied a total of 69 rules in 22 ms. Remains 30 /52 variables (removed 22) and now considering 99/85 (removed -14) transitions.
Running 83 sub problems to find dead transitions.
[2026-05-25 19:23:53] [INFO ] Flow matrix only has 81 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12631597144376624910.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6063833571136839958.kers'
[2026-05-25 19:23:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12631597144376624910.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6063833571136839958.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 81 rows 29 cols 449 entries
Finished phase 1 with 20 SingleSign rule and 2 generalized
[2026-05-25 19:23:53] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6063833571136839958.kers
Total runtime 1 ms.
[2026-05-25 19:23:53] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 1/30 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 83 unsolved
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
At refinement iteration 4 (OVERLAPS) 81/111 variables, 30/38 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 19/57 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/57 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/111 variables, 0/57 constraints. Problems are: Problem set: 8 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 57 constraints, problems are : Problem set: 8 solved, 75 unsolved in 1219 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 7/7 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 2/30 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 75 unsolved
At refinement iteration 4 (OVERLAPS) 81/111 variables, 30/38 constraints. Problems are: Problem set: 8 solved, 75 unsolved
Problem TDEAD38 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 19/57 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 72/129 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/129 constraints. Problems are: Problem set: 11 solved, 72 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/129 constraints. Problems are: Problem set: 11 solved, 72 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 129 constraints, problems are : Problem set: 11 solved, 72 unsolved in 3047 ms.
Refiners :[Generalized P Invariants (flows): 8/8 constraints, State Equation: 30/30 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 72/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4300ms problems are : Problem set: 11 solved, 72 unsolved
Search for dead transitions found 11 dead transitions in 4300ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 11 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/52 places, 88/85 transitions.
Graph (complete) has 107 edges and 30 vertex of which 29 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 29 /30 variables (removed 1) and now considering 88/88 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 4330 ms. Remains : 29/52 places, 88/85 transitions.
RANDOM walk for 40000 steps (6006 resets) in 130 ms. (305 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40003 steps (873 resets) in 23 ms. (1666 steps per ms) remains 1/1 properties
[2026-05-25 19:23:58] [INFO ] Flow matrix only has 70 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13009378171253845978.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10724651192070296035.kers'
[2026-05-25 19:23:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13009378171253845978.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10724651192070296035.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 70 rows 27 cols 332 entries
Finished phase 1 with 19 SingleSign rule and 1 generalized
[2026-05-25 19:23:58] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10724651192070296035.kers
Total runtime 1 ms.
[2026-05-25 19:23:58] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/93 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/98 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/99 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/99 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/99 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 61 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 29/29 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 21/24 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/26 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/93 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/98 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/99 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/99 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/99 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 58 constraints, problems are : Problem set: 0 solved, 1 unsolved in 79 ms.
Refiners :[Generalized P Invariants (flows): 9/9 constraints, State Equation: 29/29 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 406 steps, including 72 resets, run visited all 1 properties in 1 ms. (steps per millisecond=406 )
Parikh walk visited 1 properties in 4 ms.
Knowledge based reduction with 10 factoid took 212 ms. Reduced automaton from 10 states, 16 edges and 4 AP (stutter sensitive) to 10 states, 16 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 425 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0), (AND (NOT p3) (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Knowledge-based reduction took 6005 ms.
Stuttering acceptance computed with spot in 415 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0), (AND (NOT p3) (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 389 ms :[(AND p0 (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (AND (NOT p2) p0), (AND (NOT p3) (NOT p2) p0), (AND (NOT p2) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 19988 reset in 111 ms.
Product exploration explored 100000 steps with 20004 reset in 156 ms.
Spot run failed in 83 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/ltsmin10434344455264658557
[2026-05-25 19:24:00] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10434344455264658557
Running compilation step : cd /tmp/ltsmin10434344455264658557;'/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 295 ms.
Running link step : cd /tmp/ltsmin10434344455264658557;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10434344455264658557;'/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/stateBased4736411662854585581.hoa' '--buchi-type=spotba'
LTSmin run took 1514 ms.
FORMULA HealthRecord-PT-12-LTLFireability-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-07 finished in 26040 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 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Graph (trivial) has 98 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 23 place count 54 transition count 110
Iterating global reduction 0 with 22 rules applied. Total rules applied 45 place count 54 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 48 place count 54 transition count 107
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 54 place count 48 transition count 94
Iterating global reduction 1 with 6 rules applied. Total rules applied 60 place count 48 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 63 place count 48 transition count 91
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 66 place count 45 transition count 83
Iterating global reduction 2 with 3 rules applied. Total rules applied 69 place count 45 transition count 83
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 45 transition count 80
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 74 place count 43 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 76 place count 43 transition count 76
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 82 place count 43 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 84 place count 42 transition count 69
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 88 place count 40 transition count 83
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 90 place count 40 transition count 81
Applied a total of 90 rules in 23 ms. Remains 40 /81 variables (removed 41) and now considering 81/157 (removed 76) transitions.
[2026-05-25 19:24:01] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16063856041750742228.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6336765529884151801.kers'
[2026-05-25 19:24:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16063856041750742228.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6336765529884151801.kers]
Normalized transition count is 72 out of 73 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 40 cols 278 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-25 19:24:01] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6336765529884151801.kers
Total runtime 2 ms.
[2026-05-25 19:24:02] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-25 19:24:02] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2026-05-25 19:24:02] [INFO ] Invariant cache hit.
[2026-05-25 19:24:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:24:02] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2026-05-25 19:24:02] [INFO ] Redundant transitions in 17 ms returned []
Running 65 sub problems to find dead transitions.
[2026-05-25 19:24:02] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2026-05-25 19:24:02] [INFO ] Invariant cache hit.
[2026-05-25 19:24:02] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 72/112 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/113 variables, and 64 constraints, problems are : Problem set: 0 solved, 65 unsolved in 1205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 65 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/32 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 2 (OVERLAPS) 8/40 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 5 (OVERLAPS) 72/112 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 65/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 9 (OVERLAPS) 0/112 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 65 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/113 variables, and 129 constraints, problems are : Problem set: 0 solved, 65 unsolved in 2049 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 40/40 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3271ms problems are : Problem set: 0 solved, 65 unsolved
Search for dead transitions found 0 dead transitions in 3271ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/81 places, 81/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3407 ms. Remains : 40/81 places, 81/157 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 34 ms :[(NOT p0)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 3271 steps (311 resets) in 48 ms. (66 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Knowledge-based reduction took 201 ms.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 81/81 transitions.
Applied a total of 0 rules in 4 ms. Remains 40 /40 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2026-05-25 19:24:05] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2026-05-25 19:24:05] [INFO ] Invariant cache hit.
[2026-05-25 19:24:05] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:24:05] [INFO ] Flow matrix only has 73 transitions (discarded 8 similar events)
[2026-05-25 19:24:05] [INFO ] Invariant cache hit.
[2026-05-25 19:24:05] [INFO ] State equation strengthened by 13 read => feed constraints.
[2026-05-25 19:24:05] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2026-05-25 19:24:06] [INFO ] Redundant transitions in 19 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 117 ms. Remains : 40/40 places, 81/81 transitions.
Computed a total of 11 stabilizing places and 25 stable transitions
Computed a total of 11 stabilizing places and 25 stable transitions
Knowledge based reduction with 3 factoid took 33 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 5888 steps (555 resets) in 12 ms. (452 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Knowledge-based reduction took 142 ms.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3 reset in 47 ms.
Product exploration explored 100000 steps with 0 reset in 46 ms.
Built C files in :
/tmp/ltsmin14983116537162667337
[2026-05-25 19:24:06] [INFO ] Computing symmetric may disable matrix : 81 transitions.
[2026-05-25 19:24:06] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:24:06] [INFO ] Computing symmetric may enable matrix : 81 transitions.
[2026-05-25 19:24:06] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:24:06] [INFO ] Computing Do-Not-Accords matrix : 81 transitions.
[2026-05-25 19:24:06] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 19:24:06] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14983116537162667337
Running compilation step : cd /tmp/ltsmin14983116537162667337;'/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 179 ms.
Running link step : cd /tmp/ltsmin14983116537162667337;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin14983116537162667337;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12058749234035148156.hoa' '--buchi-type=spotba'
LTSmin run took 32 ms.
FORMULA HealthRecord-PT-12-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-08 finished in 4683 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 U p1))))'
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Graph (trivial) has 95 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 56 transition count 114
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 56 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 43 place count 56 transition count 112
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 49 place count 50 transition count 99
Iterating global reduction 1 with 6 rules applied. Total rules applied 55 place count 50 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 58 place count 50 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 60 place count 48 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 62 place count 48 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 65 place count 48 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 47 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 47 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 70 place count 47 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 72 place count 46 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
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 76 place count 44 transition count 101
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 78 place count 44 transition count 99
Applied a total of 78 rules in 15 ms. Remains 44 /81 variables (removed 37) and now considering 99/157 (removed 58) transitions.
[2026-05-25 19:24:06] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1487311034579012941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5155504390613812274.kers'
[2026-05-25 19:24:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1487311034579012941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5155504390613812274.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 44 cols 338 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:24:06] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5155504390613812274.kers
Total runtime 1 ms.
[2026-05-25 19:24:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:24:06] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2026-05-25 19:24:06] [INFO ] Invariant cache hit.
[2026-05-25 19:24:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 19:24:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-25 19:24:06] [INFO ] Redundant transitions in 25 ms returned []
Running 83 sub problems to find dead transitions.
[2026-05-25 19:24:06] [INFO ] Flow matrix only has 90 transitions (discarded 9 similar events)
[2026-05-25 19:24:06] [INFO ] Invariant cache hit.
[2026-05-25 19:24:06] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 89/133 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/134 variables, and 74 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2084 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 4/4 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/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (OVERLAPS) 8/44 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 89/133 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 17/77 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 83/160 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/134 variables, and 160 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3597 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5702ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 5702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 44/81 places, 99/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5846 ms. Remains : 44/81 places, 99/157 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 U p1))))'
Stuttering acceptance computed with spot in 89 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-10 finished in 5974 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((F((X(X(p0))&&F(p1))) U p2))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Graph (trivial) has 95 edges and 81 vertex of which 8 / 81 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 21 place count 56 transition count 113
Iterating global reduction 0 with 20 rules applied. Total rules applied 41 place count 56 transition count 113
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 44 place count 56 transition count 110
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 49 place count 51 transition count 99
Iterating global reduction 1 with 5 rules applied. Total rules applied 54 place count 51 transition count 99
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 51 transition count 96
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 49 transition count 91
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 49 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 49 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 48 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 48 transition count 86
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 48 transition count 83
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 47 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
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 75 place count 45 transition count 101
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 77 place count 45 transition count 99
Applied a total of 77 rules in 18 ms. Remains 45 /81 variables (removed 36) and now considering 99/157 (removed 58) transitions.
[2026-05-25 19:24:12] [INFO ] Flow matrix only has 89 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-5285526269367537768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4055537596462452442.kers'
[2026-05-25 19:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5285526269367537768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4055537596462452442.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 88 rows 44 cols 336 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:24:12] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4055537596462452442.kers
Total runtime 2 ms.
[2026-05-25 19:24:12] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:24:12] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
[2026-05-25 19:24:12] [INFO ] Invariant cache hit.
[2026-05-25 19:24:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2026-05-25 19:24:12] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-25 19:24:12] [INFO ] Redundant transitions in 23 ms returned []
Running 83 sub problems to find dead transitions.
[2026-05-25 19:24:12] [INFO ] Flow matrix only has 89 transitions (discarded 10 similar events)
[2026-05-25 19:24:12] [INFO ] Invariant cache hit.
[2026-05-25 19:24:12] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 8/45 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 88/133 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (OVERLAPS) 0/133 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/134 variables, and 74 constraints, problems are : Problem set: 0 solved, 83 unsolved in 1795 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 17/17 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/37 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 8/45 variables, 7/10 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 88/133 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 17/74 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 83/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/134 variables, and 157 constraints, problems are : Problem set: 0 solved, 83 unsolved in 2692 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4504ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 4504ms
Starting structural reductions in SI_LTL mode, iteration 1 : 45/81 places, 99/157 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4647 ms. Remains : 45/81 places, 99/157 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((F((X(X(p0))&&F(p1))) U p2))))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-11 finished in 4881 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) U p1)&&(!p1 U p1)&&F(p0)) U G(p2)))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 119
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 61 transition count 117
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 47 place count 56 transition count 106
Iterating global reduction 1 with 5 rules applied. Total rules applied 52 place count 56 transition count 106
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 56 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 56 place count 55 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 57 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 60 place count 55 transition count 98
Applied a total of 60 rules in 3 ms. Remains 55 /81 variables (removed 26) and now considering 98/157 (removed 59) transitions.
[2026-05-25 19:24:17] [INFO ] Flow matrix only has 95 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-6536496588363405767.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4667877431301473683.kers'
[2026-05-25 19:24:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6536496588363405767.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4667877431301473683.kers]
Normalized transition count is 94 out of 95 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 55 cols 329 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 19:24:17] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4667877431301473683.kers
Total runtime 1 ms.
[2026-05-25 19:24:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-25 19:24:17] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2026-05-25 19:24:17] [INFO ] Invariant cache hit.
[2026-05-25 19:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:24:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 19:24:17] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2026-05-25 19:24:17] [INFO ] Invariant cache hit.
[2026-05-25 19:24:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (OVERLAPS) 94/149 variables, 55/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/149 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (OVERLAPS) 1/150 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 0/150 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 150/150 variables, and 67 constraints, problems are : Problem set: 0 solved, 97 unsolved in 2859 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 97 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/55 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/55 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/149 variables, 55/72 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/149 variables, 97/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/149 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 1/150 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (OVERLAPS) 0/150 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 150/150 variables, and 170 constraints, problems are : Problem set: 0 solved, 97 unsolved in 7035 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 55/55 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9911ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 9911ms
Starting structural reductions in LTL mode, iteration 1 : 55/81 places, 98/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10019 ms. Remains : 55/81 places, 98/157 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) U p1)&&(!p1 U p1)&&F(p0)) U G(p2)))'
Stuttering acceptance computed with spot in 235 ms :[(NOT p2), (NOT p0), (OR (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HealthRecord-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HealthRecord-PT-12-LTLFireability-12 finished in 10283 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(p0) U X(X((p1&&X(p1))))))'
Support contains 3 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 157/157 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 61 transition count 119
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 61 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 42 place count 61 transition count 117
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 55 transition count 104
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 55 transition count 104
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 57 place count 55 transition count 101
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 53 transition count 96
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 53 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 64 place count 53 transition count 93
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 52 transition count 91
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 52 transition count 91
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 69 place count 52 transition count 88
Applied a total of 69 rules in 8 ms. Remains 52 /81 variables (removed 29) and now considering 88/157 (removed 69) transitions.
[2026-05-25 19:24:27] [INFO ] Flow matrix only has 85 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-12590337619161257007.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12581023506267111668.kers'
[2026-05-25 19:24:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12590337619161257007.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12581023506267111668.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 52 cols 293 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-25 19:24:27] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12581023506267111668.kers
Total runtime 0 ms.
[2026-05-25 19:24:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-25 19:24:27] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:24:27] [INFO ] Invariant cache hit.
[2026-05-25 19:24:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:24:27] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Running 87 sub problems to find dead transitions.
[2026-05-25 19:24:27] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:24:27] [INFO ] Invariant cache hit.
[2026-05-25 19:24:27] [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, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (OVERLAPS) 84/136 variables, 52/63 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (OVERLAPS) 1/137 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/137 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Real declared 137/137 variables, and 67 constraints, problems are : Problem set: 0 solved, 87 unsolved in 3183 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 87 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 1 (OVERLAPS) 1/52 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/52 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 5 (OVERLAPS) 84/136 variables, 52/68 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 87/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 8 (OVERLAPS) 1/137 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/137 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
At refinement iteration 10 (OVERLAPS) 0/137 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 87 unsolved
No progress, stopping.
After SMT solving in domain Int declared 137/137 variables, and 156 constraints, problems are : Problem set: 0 solved, 87 unsolved in 5876 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 52/52 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 87/87 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9070ms problems are : Problem set: 0 solved, 87 unsolved
Search for dead transitions found 0 dead transitions in 9071ms
Starting structural reductions in LTL mode, iteration 1 : 52/81 places, 88/157 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9194 ms. Remains : 52/81 places, 88/157 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(p0) U X(X((p1&&X(p1))))))'
Stuttering acceptance computed with spot in 395 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : HealthRecord-PT-12-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 138 ms.
Product exploration explored 100000 steps with 25000 reset in 153 ms.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 8 factoid took 73 ms. Reduced automaton from 9 states, 19 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (2894 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (362 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 572011 steps, run visited all 1 properties in 468 ms. (steps per millisecond=1222 )
Probabilistic random walk after 572011 steps, saw 74978 distinct states, run finished after 472 ms. (steps per millisecond=1211 ) properties seen :1
Knowledge based reduction with 8 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 847 ms.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 52 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2026-05-25 19:24:38] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:24:38] [INFO ] Invariant cache hit.
[2026-05-25 19:24:38] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-25 19:24:38] [INFO ] Flow matrix only has 85 transitions (discarded 3 similar events)
[2026-05-25 19:24:38] [INFO ] Invariant cache hit.
[2026-05-25 19:24:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:24:38] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 86 ms. Remains : 52/52 places, 88/88 transitions.
Computed a total of 3 stabilizing places and 3 stable transitions
Computed a total of 3 stabilizing places and 3 stable transitions
Knowledge based reduction with 1 factoid took 67 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
RANDOM walk for 40000 steps (2886 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (365 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 572011 steps, run visited all 1 properties in 481 ms. (steps per millisecond=1189 )
Probabilistic random walk after 572011 steps, saw 74978 distinct states, run finished after 481 ms. (steps per millisecond=1189 ) properties seen :1
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 836 ms.
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 183 ms.
Product exploration explored 100000 steps with 25000 reset in 150 ms.
Spot run failed in 43 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/ltsmin18388880273800471590
[2026-05-25 19:24:40] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18388880273800471590
Running compilation step : cd /tmp/ltsmin18388880273800471590;'/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 170 ms.
Running link step : cd /tmp/ltsmin18388880273800471590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin18388880273800471590;'/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/stateBased3732272004425900395.hoa' '--buchi-type=spotba'
LTSmin run took 15 ms.
FORMULA HealthRecord-PT-12-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HealthRecord-PT-12-LTLFireability-13 finished in 12913 ms.
All properties solved by simple procedures.
Total runtime 155492 ms.
BK_STOP 1779737080895
--------------------
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-12"
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-12, 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-177961074300628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-12.tgz
mv HealthRecord-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
