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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
757.747 224074.00 265528.00 1940.20 TFFTFTFFTTTTFTFT 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-177961074300618.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-11, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300618
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 8.0K Mar 7 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 7 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 7 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 7 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.4K Mar 7 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 28K Mar 7 13:07 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 70K 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-11-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-12
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-13
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-14
FORMULA_NAME HealthRecord-PT-11-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779736712839

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 19:18:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:18:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:18:34] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2026-05-25 19:18:34] [INFO ] Transformed 159 places.
[2026-05-25 19:18:34] [INFO ] Transformed 334 transitions.
[2026-05-25 19:18:34] [INFO ] Found NUPN structural information;
[2026-05-25 19:18:34] [INFO ] Parsed PT model containing 159 places and 334 transitions and 879 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 27 transitions
Reduce redundant transitions removed 27 transitions.
Support contains 74 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 307/307 transitions.
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 46 place count 113 transition count 221
Iterating global reduction 0 with 46 rules applied. Total rules applied 92 place count 113 transition count 221
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 111 transition count 217
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 111 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 97 place count 111 transition count 216
Applied a total of 97 rules in 25 ms. Remains 111 /159 variables (removed 48) and now considering 216/307 (removed 91) transitions.
[2026-05-25 19:18:34] [INFO ] Flow matrix only has 210 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14562436973442524419.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8617526449425787606.kers'
[2026-05-25 19:18:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14562436973442524419.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8617526449425787606.kers]
Normalized transition count is 209 out of 210 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 209 rows 108 cols 599 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-25 19:18:34] [INFO ] Computed 12 invariants in 0 ms
Computed 12 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8617526449425787606.kers
Total runtime 1 ms.
[2026-05-25 19:18:34] [INFO ] Implicit Places using invariants in 215 ms returned []
[2026-05-25 19:18:34] [INFO ] Flow matrix only has 210 transitions (discarded 6 similar events)
[2026-05-25 19:18:34] [INFO ] Invariant cache hit.
[2026-05-25 19:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:18:34] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2026-05-25 19:18:34] [INFO ] Flow matrix only has 210 transitions (discarded 6 similar events)
[2026-05-25 19:18:34] [INFO ] Invariant cache hit.
[2026-05-25 19:18:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 9/46 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 11/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (OVERLAPS) 209/320 variables, 111/174 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 14 (OVERLAPS) 1/321 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/321 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/321 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 17 (OVERLAPS) 0/321 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 182 constraints, problems are : Problem set: 0 solved, 215 unsolved in 23408 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/111 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/111 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/111 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/111 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 11 (OVERLAPS) 209/320 variables, 111/187 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 215/402 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 320/321 variables, and 407 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53543ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 53554ms
Starting structural reductions in LTL mode, iteration 1 : 111/159 places, 216/307 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53976 ms. Remains : 111/159 places, 216/307 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Applied a total of 0 rules in 1 ms. Remains 111 /111 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2026-05-25 19:19:28] [INFO ] Flow matrix only has 210 transitions (discarded 6 similar events)
[2026-05-25 19:19:28] [INFO ] Invariant cache hit.
[2026-05-25 19:19:28] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:19:28] [INFO ] Flow matrix only has 210 transitions (discarded 6 similar events)
[2026-05-25 19:19:28] [INFO ] Invariant cache hit.
[2026-05-25 19:19:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:19:28] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 111/111 places, 216/216 transitions.
Support contains 74 out of 111 places after structural reductions.
[2026-05-25 19:19:28] [INFO ] Flatten gal took : 37 ms
[2026-05-25 19:19:28] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:19:28] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 73 out of 111 places (down from 74) after GAL structural reductions.
RANDOM walk for 40000 steps (2700 resets) in 1690 ms. (23 steps per ms) remains 31/64 properties
BEST_FIRST walk for 4004 steps (39 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (60 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 32 ms. (121 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (41 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (39 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (33 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 11 ms. (333 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (38 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4001 steps (36 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (39 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (34 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 10 ms. (364 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (38 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (37 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (37 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 8 ms. (444 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (36 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (40 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
[2026-05-25 19:19:29] [INFO ] Flow matrix only has 210 transitions (discarded 6 similar events)
[2026-05-25 19:19:29] [INFO ] Invariant cache hit.
[2026-05-25 19:19:29] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp26 is UNSAT
At refinement iteration 2 (OVERLAPS) 59/110 variables, 9/11 constraints. Problems are: Problem set: 2 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 8/19 constraints. Problems are: Problem set: 2 solved, 29 unsolved
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp36 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 6/25 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/110 variables, 6/31 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/110 variables, 1/32 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 4/36 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 3/39 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/39 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 1/111 variables, 1/40 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 12 (OVERLAPS) 209/320 variables, 111/151 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/320 variables, 3/154 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/320 variables, 1/155 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/320 variables, 0/155 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 16 (OVERLAPS) 1/321 variables, 1/156 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/321 variables, 1/157 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/321 variables, 0/157 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 19 (OVERLAPS) 0/321 variables, 2/159 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/321 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 21 (OVERLAPS) 0/321 variables, 0/159 constraints. Problems are: Problem set: 4 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 321/321 variables, and 159 constraints, problems are : Problem set: 4 solved, 27 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 74/110 variables, 9/11 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/110 variables, 33/44 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/110 variables, 0/44 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 1/111 variables, 1/45 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 2/47 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 2/49 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/49 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 9 (OVERLAPS) 209/320 variables, 111/160 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 27/187 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/320 variables, 1/188 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/320 variables, 0/188 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 1/321 variables, 1/189 constraints. Problems are: Problem set: 4 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/321 variables, 0/189 constraints. Problems are: Problem set: 4 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 321/321 variables, and 189 constraints, problems are : Problem set: 4 solved, 27 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/31 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10029ms problems are : Problem set: 4 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 36 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 72 edges and 111 vertex of which 6 / 111 are part of one of the 3 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (complete) has 450 edges and 108 vertex of which 107 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 (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 107 transition count 201
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 105 transition count 198
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 11 place count 104 transition count 197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 11 place count 104 transition count 196
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 13 place count 103 transition count 196
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 36 place count 80 transition count 150
Iterating global reduction 3 with 23 rules applied. Total rules applied 59 place count 80 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 63 place count 80 transition count 146
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 78 transition count 142
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 78 transition count 142
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 71 place count 76 transition count 140
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 77 place count 73 transition count 157
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 78 place count 73 transition count 156
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 94 place count 73 transition count 156
Applied a total of 94 rules in 51 ms. Remains 73 /111 variables (removed 38) and now considering 156/216 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 73/111 places, 156/216 transitions.
RANDOM walk for 40000 steps (2285 resets) in 433 ms. (92 steps per ms) remains 12/27 properties
BEST_FIRST walk for 40003 steps (468 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (497 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (472 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (467 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (492 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (412 resets) in 63 ms. (625 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (457 resets) in 75 ms. (526 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40003 steps (344 resets) in 43 ms. (909 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (494 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (503 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (527 resets) in 57 ms. (689 steps per ms) remains 9/9 properties
[2026-05-25 19:19:39] [INFO ] Flow matrix only has 150 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18047824396695133500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15617569073756382323.kers'
[2026-05-25 19:19:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18047824396695133500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15617569073756382323.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 150 rows 71 cols 752 entries
Finished phase 1 with 62 SingleSign rule and 0 generalized
[2026-05-25 19:19:39] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15617569073756382323.kers
Total runtime 1 ms.
[2026-05-25 19:19:39] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 53/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 7/71 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 2/73 variables, 2/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 150/223 variables, 73/101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 0/223 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 223/223 variables, and 104 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 53/64 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 17/22 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/64 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 7/71 variables, 4/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 2/73 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 150/223 variables, 73/102 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 9/114 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/223 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/223 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/223 variables, 1/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/223 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/223 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 223/223 variables, and 118 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 73/73 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2298ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 8 properties in 244 ms.
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 156/156 transitions.
Graph (trivial) has 62 edges and 73 vertex of which 4 / 73 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 362 edges and 71 vertex of which 68 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 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 68 transition count 151
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 67 transition count 150
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 21 place count 51 transition count 118
Iterating global reduction 2 with 16 rules applied. Total rules applied 37 place count 51 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 51 transition count 117
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 43 place count 48 transition count 115
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 51 place count 48 transition count 107
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 57 place count 45 transition count 124
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 61 place count 45 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 65 place count 41 transition count 120
Partial Free-agglomeration rule applied 21 times.
Drop transitions (Partial Free agglomeration) removed 21 transitions
Iterating global reduction 5 with 21 rules applied. Total rules applied 86 place count 41 transition count 120
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 91 place count 41 transition count 120
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 93 place count 39 transition count 115
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 39 transition count 115
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 97 place count 37 transition count 107
Iterating global reduction 5 with 2 rules applied. Total rules applied 99 place count 37 transition count 107
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 100 place count 36 transition count 105
Iterating global reduction 5 with 1 rules applied. Total rules applied 101 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 105 place count 36 transition count 101
Applied a total of 105 rules in 30 ms. Remains 36 /73 variables (removed 37) and now considering 101/156 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 36/73 places, 101/156 transitions.
RANDOM walk for 40000 steps (2506 resets) in 531 ms. (75 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (565 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3940 steps, run visited all 1 properties in 15 ms. (steps per millisecond=262 )
Probabilistic random walk after 3940 steps, saw 1423 distinct states, run finished after 18 ms. (steps per millisecond=218 ) properties seen :1
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2026-05-25 19:19:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:19:42] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:19:42] [INFO ] Input system was already deterministic with 216 transitions.
Support contains 56 out of 111 places (down from 60) after GAL structural reductions.
Computed a total of 12 stabilizing places and 20 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 152 edges and 111 vertex of which 10 / 111 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 61 transition count 124
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 61 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 94 place count 61 transition count 119
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 101 place count 54 transition count 104
Iterating global reduction 1 with 7 rules applied. Total rules applied 108 place count 54 transition count 104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 54 transition count 103
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 112 place count 51 transition count 95
Iterating global reduction 2 with 3 rules applied. Total rules applied 115 place count 51 transition count 95
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 118 place count 51 transition count 92
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 120 place count 49 transition count 88
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 49 transition count 88
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 128 place count 49 transition count 82
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 49 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 47 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 45 transition count 74
Applied a total of 138 rules in 21 ms. Remains 45 /111 variables (removed 66) and now considering 74/216 (removed 142) transitions.
[2026-05-25 19:19:42] [INFO ] Flow matrix only has 66 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-11719806334229264360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7866720499270075315.kers'
[2026-05-25 19:19:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11719806334229264360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7866720499270075315.kers]
Normalized transition count is 65 out of 66 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 65 rows 44 cols 226 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:19:42] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7866720499270075315.kers
Total runtime 0 ms.
[2026-05-25 19:19:42] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-25 19:19:42] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
[2026-05-25 19:19:42] [INFO ] Invariant cache hit.
[2026-05-25 19:19:42] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-25 19:19:42] [INFO ] Redundant transitions in 14 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-25 19:19:42] [INFO ] Flow matrix only has 66 transitions (discarded 8 similar events)
[2026-05-25 19:19:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 7/45 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 65/110 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/110 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/110 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 110/111 variables, and 59 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 7/45 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 65/110 variables, 45/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/110 variables, 60/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/110 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/110 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 110/111 variables, and 120 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2960ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2961ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/111 places, 74/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3093 ms. Remains : 45/111 places, 74/216 transitions.
[2026-05-25 19:19:45] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:19:45] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:19:45] [INFO ] Input system was already deterministic with 74 transitions.
[2026-05-25 19:19:45] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:19:45] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:19:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10315883979795480857.gal : 2 ms
[2026-05-25 19:19:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11473884102143337872.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10315883979795480857.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11473884102143337872.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4050 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (561 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties

Finished probabilistic random walk after 1109 steps, run visited all 1 properties in 5 ms. (steps per millisecond=221 )
Probabilistic random walk after 1109 steps, saw 491 distinct states, run finished after 5 ms. (steps per millisecond=221 ) properties seen :1
FORMULA HealthRecord-PT-11-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.ensureOpen(BufferedInputStream.java:206)
at java.base/java.io.BufferedInputStream.implRead(BufferedInputStream.java:411)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:405)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:350)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:393)
at java.base/sun.nio.cs.StreamDecoder.lockedRead(StreamDecoder.java:217)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:171)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:188)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:160)
at java.base/java.io.BufferedReader.implReadLine(BufferedReader.java:370)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:347)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:436)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:1583)
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 62 transition count 121
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 62 transition count 121
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 103 place count 62 transition count 116
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 110 place count 55 transition count 101
Iterating global reduction 1 with 7 rules applied. Total rules applied 117 place count 55 transition count 101
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 120 place count 55 transition count 98
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 123 place count 52 transition count 90
Iterating global reduction 2 with 3 rules applied. Total rules applied 126 place count 52 transition count 90
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 129 place count 52 transition count 87
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 131 place count 50 transition count 83
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 50 transition count 83
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 139 place count 50 transition count 77
Applied a total of 139 rules in 5 ms. Remains 50 /111 variables (removed 61) and now considering 77/216 (removed 139) transitions.
[2026-05-25 19:19:45] [INFO ] Flow matrix only has 74 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-10166418156666987331.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14405106581907762123.kers'
[2026-05-25 19:19:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10166418156666987331.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14405106581907762123.kers]
Normalized transition count is 73 out of 74 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 73 rows 50 cols 253 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 19:19:45] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14405106581907762123.kers
Total runtime 0 ms.
[2026-05-25 19:19:45] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 19:19:45] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2026-05-25 19:19:45] [INFO ] Invariant cache hit.
[2026-05-25 19:19:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:19:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 76 sub problems to find dead transitions.
[2026-05-25 19:19:45] [INFO ] Flow matrix only has 74 transitions (discarded 3 similar events)
[2026-05-25 19:19:45] [INFO ] Invariant cache hit.
[2026-05-25 19:19:45] [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, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (OVERLAPS) 73/123 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/123 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/124 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/124 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 124/124 variables, and 62 constraints, problems are : Problem set: 0 solved, 76 unsolved in 1799 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (OVERLAPS) 1/50 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 73/123 variables, 50/67 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/123 variables, 76/143 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/123 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 1/124 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 10 (OVERLAPS) 0/124 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 124/124 variables, and 144 constraints, problems are : Problem set: 0 solved, 76 unsolved in 4610 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6416ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 6416ms
Starting structural reductions in LTL mode, iteration 1 : 50/111 places, 77/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6503 ms. Remains : 50/111 places, 77/216 transitions.
[2026-05-25 19:19:52] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:19:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:19:52] [INFO ] Input system was already deterministic with 77 transitions.
[2026-05-25 19:19:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:19:52] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:19:52] [INFO ] Time to serialize gal into /tmp/CTLFireability13514370785207974664.gal : 1 ms
[2026-05-25 19:19:52] [INFO ] Time to serialize properties into /tmp/CTLFireability9409218162475450732.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability13514370785207974664.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9409218162475450732.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,646389,0.077606,6996,2,1136,5,14854,6,0,273,10270,0


Converting to forward existential form...Done !
original formula: AX(AG(EX((EF((p85==1)) * ((p1==0)||(p156==0))))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(EX((E(TRUE U (p85==1)) * ((p1==0)||(p156==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,0,0.293307,15888,1,0,138,58243,173,68,2088,48436,172
FORMULA HealthRecord-PT-11-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 63 transition count 123
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 63 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 63 transition count 118
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 108 place count 56 transition count 103
Iterating global reduction 1 with 7 rules applied. Total rules applied 115 place count 56 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 56 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 53 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 53 transition count 89
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 51 transition count 85
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 51 transition count 85
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 136 place count 51 transition count 80
Applied a total of 136 rules in 10 ms. Remains 51 /111 variables (removed 60) and now considering 80/216 (removed 136) transitions.
[2026-05-25 19:19:52] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5973204146532054580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12253493864519723031.kers'
[2026-05-25 19:19:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5973204146532054580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12253493864519723031.kers]
Normalized transition count is 76 out of 77 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 76 rows 51 cols 261 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:19:52] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12253493864519723031.kers
Total runtime 1 ms.
[2026-05-25 19:19:52] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:19:52] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2026-05-25 19:19:52] [INFO ] Invariant cache hit.
[2026-05-25 19:19:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:19:52] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Running 79 sub problems to find dead transitions.
[2026-05-25 19:19:52] [INFO ] Flow matrix only has 77 transitions (discarded 3 similar events)
[2026-05-25 19:19:52] [INFO ] Invariant cache hit.
[2026-05-25 19:19:52] [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, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 76/127 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 63 constraints, problems are : Problem set: 0 solved, 79 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 5 (OVERLAPS) 76/127 variables, 51/67 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 79/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 8 (OVERLAPS) 1/128 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 147 constraints, problems are : Problem set: 0 solved, 79 unsolved in 4483 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 79/79 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6581ms problems are : Problem set: 0 solved, 79 unsolved
Search for dead transitions found 0 dead transitions in 6582ms
Starting structural reductions in LTL mode, iteration 1 : 51/111 places, 80/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6681 ms. Remains : 51/111 places, 80/216 transitions.
[2026-05-25 19:19:59] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:19:59] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:19:59] [INFO ] Input system was already deterministic with 80 transitions.
[2026-05-25 19:19:59] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:19:59] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:19:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17902023866843848265.gal : 1 ms
[2026-05-25 19:19:59] [INFO ] Time to serialize properties into /tmp/CTLFireability17520418803222873136.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17902023866843848265.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17520418803222873136.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,727551,0.053486,6560,2,966,5,11647,6,0,280,10981,0


Converting to forward existential form...Done !
original formula: AG((EF((p32==1)) + (EG(EX(((p17==0)||(p156==0)))) * (p69==0))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !((EG(EX(((p17==0)||(p156==0)))) * (p69==0)))) * !(E(TRUE U (p32==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t27, t28, t36, t37, t51, t...272
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,0.446768,23388,1,0,194,115754,187,99,2102,96075,224
FORMULA HealthRecord-PT-11-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 63 transition count 123
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 63 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 63 transition count 118
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 108 place count 56 transition count 103
Iterating global reduction 1 with 7 rules applied. Total rules applied 115 place count 56 transition count 103
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 118 place count 56 transition count 100
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 121 place count 53 transition count 92
Iterating global reduction 2 with 3 rules applied. Total rules applied 124 place count 53 transition count 92
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 127 place count 53 transition count 89
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 51 transition count 85
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 51 transition count 85
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 137 place count 51 transition count 79
Applied a total of 137 rules in 8 ms. Remains 51 /111 variables (removed 60) and now considering 79/216 (removed 137) transitions.
[2026-05-25 19:20:00] [INFO ] Flow matrix only has 76 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-1516132753855674745.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5419176051455946089.kers'
[2026-05-25 19:20:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1516132753855674745.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5419176051455946089.kers]
Normalized transition count is 75 out of 76 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 51 cols 257 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-25 19:20:00] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5419176051455946089.kers
Total runtime 0 ms.
[2026-05-25 19:20:00] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 19:20:00] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2026-05-25 19:20:00] [INFO ] Invariant cache hit.
[2026-05-25 19:20:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:20:00] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 78 sub problems to find dead transitions.
[2026-05-25 19:20:00] [INFO ] Flow matrix only has 76 transitions (discarded 3 similar events)
[2026-05-25 19:20:00] [INFO ] Invariant cache hit.
[2026-05-25 19:20:00] [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, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (OVERLAPS) 75/126 variables, 51/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 63 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1999 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 1/51 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (OVERLAPS) 75/126 variables, 51/66 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 78/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 1/127 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 10 (OVERLAPS) 0/127 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 145 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4597 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 51/51 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6603ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 6605ms
Starting structural reductions in LTL mode, iteration 1 : 51/111 places, 79/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6701 ms. Remains : 51/111 places, 79/216 transitions.
[2026-05-25 19:20:06] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:20:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:20:06] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-25 19:20:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:20:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:20:06] [INFO ] Time to serialize gal into /tmp/CTLFireability2125905095167093629.gal : 1 ms
[2026-05-25 19:20:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13380183564678730348.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2125905095167093629.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13380183564678730348.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,778581,0.062503,6720,2,1227,5,12302,6,0,279,9894,0


Converting to forward existential form...Done !
original formula: EF(AG(AX(((p84==0) * AF((p78==0))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(!(EX(!(((p84==0) * !(EG(!((p78==0))))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, t21, t22, t47, t48, t55, t...262
(forward)formula 0,1,0.351967,18208,1,0,194,77770,183,91,2035,67056,224
FORMULA HealthRecord-PT-11-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 42 place count 69 transition count 135
Iterating global reduction 0 with 42 rules applied. Total rules applied 84 place count 69 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 88 place count 69 transition count 131
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 92 place count 65 transition count 123
Iterating global reduction 1 with 4 rules applied. Total rules applied 96 place count 65 transition count 123
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 99 place count 65 transition count 120
Applied a total of 99 rules in 3 ms. Remains 65 /111 variables (removed 46) and now considering 120/216 (removed 96) transitions.
[2026-05-25 19:20:07] [INFO ] Flow matrix only has 117 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-2986449447666554322.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4602594231131638430.kers'
[2026-05-25 19:20:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2986449447666554322.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4602594231131638430.kers]
Normalized transition count is 116 out of 117 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 116 rows 65 cols 387 entries
Finished phase 1 with 56 SingleSign rule and 0 generalized
[2026-05-25 19:20:07] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4602594231131638430.kers
Total runtime 1 ms.
[2026-05-25 19:20:07] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:20:07] [INFO ] Flow matrix only has 117 transitions (discarded 3 similar events)
[2026-05-25 19:20:07] [INFO ] Invariant cache hit.
[2026-05-25 19:20:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:20:07] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 119 sub problems to find dead transitions.
[2026-05-25 19:20:07] [INFO ] Flow matrix only has 117 transitions (discarded 3 similar events)
[2026-05-25 19:20:07] [INFO ] Invariant cache hit.
[2026-05-25 19:20:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (OVERLAPS) 116/181 variables, 65/79 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 1/182 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 82 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4953 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 119 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (OVERLAPS) 1/65 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 116/181 variables, 65/82 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 119/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/181 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (OVERLAPS) 1/182 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (OVERLAPS) 0/182 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 202 constraints, problems are : Problem set: 0 solved, 119 unsolved in 10700 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 65/65 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15672ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 15674ms
Starting structural reductions in LTL mode, iteration 1 : 65/111 places, 120/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15782 ms. Remains : 65/111 places, 120/216 transitions.
[2026-05-25 19:20:22] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:20:22] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:20:22] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-25 19:20:22] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:20:22] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:20:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2031722645420218551.gal : 1 ms
[2026-05-25 19:20:22] [INFO ] Time to serialize properties into /tmp/CTLFireability6611086983375344278.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability2031722645420218551.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6611086983375344278.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.05773e+06,0.177377,12052,2,1985,5,33519,6,0,376,36239,0


Converting to forward existential form...Done !
original formula: (EG(EX((p9==1))) + (((EG((p64==0)) * AF(AG((p150==0)))) * (EF(!(E((p29==1) U (p38==1)))) * !(A((p125==1) U EX((p4==1)))))) * (EF(((((p113...254
=> equivalent forward existential formula: ((([((Init * !(EG(EX((p9==1))))) * !(EG((p64==0))))] = FALSE * [FwdG((Init * !(EG(EX((p9==1))))),!(!(E(TRUE U !(...605
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t22, ...395
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,10.2053,330520,1,0,649,1.90603e+06,285,379,2926,2.01725e+06,661
FORMULA HealthRecord-PT-11-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 67 transition count 131
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 67 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 67 transition count 127
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 61 transition count 115
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 61 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 107 place count 61 transition count 112
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 60 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 60 transition count 109
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 59 transition count 107
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 59 transition count 107
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 59 transition count 105
Applied a total of 113 rules in 10 ms. Remains 59 /111 variables (removed 52) and now considering 105/216 (removed 111) transitions.
[2026-05-25 19:20:33] [INFO ] Flow matrix only has 102 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-3284833592077934035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12448397683266696132.kers'
[2026-05-25 19:20:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3284833592077934035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12448397683266696132.kers]
Normalized transition count is 101 out of 102 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 101 rows 59 cols 343 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-25 19:20:33] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12448397683266696132.kers
Total runtime 0 ms.
[2026-05-25 19:20:33] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-25 19:20:33] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2026-05-25 19:20:33] [INFO ] Invariant cache hit.
[2026-05-25 19:20:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:20:33] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2026-05-25 19:20:33] [INFO ] Flow matrix only has 102 transitions (discarded 3 similar events)
[2026-05-25 19:20:33] [INFO ] Invariant cache hit.
[2026-05-25 19:20:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 101/160 variables, 59/70 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (OVERLAPS) 1/161 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 0/161 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 161/161 variables, and 71 constraints, problems are : Problem set: 0 solved, 104 unsolved in 2978 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/59 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/59 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 101/160 variables, 59/74 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 104/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (OVERLAPS) 1/161 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/161 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/161 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 161/161 variables, and 179 constraints, problems are : Problem set: 0 solved, 104 unsolved in 8288 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 59/59 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11277ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 11278ms
Starting structural reductions in LTL mode, iteration 1 : 59/111 places, 105/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11409 ms. Remains : 59/111 places, 105/216 transitions.
[2026-05-25 19:20:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:20:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:20:44] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-25 19:20:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:20:44] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:20:44] [INFO ] Time to serialize gal into /tmp/CTLFireability11748939084867511283.gal : 1 ms
[2026-05-25 19:20:44] [INFO ] Time to serialize properties into /tmp/CTLFireability17851006199889278195.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11748939084867511283.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17851006199889278195.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.5834e+06,0.20681,13800,2,1827,5,42374,6,0,337,43202,0


Converting to forward existential form...Done !
original formula: (EF((p23==1)) * (EG(AX((EX((p11==1)) * AX((p78==1))))) + AX(!(E(AG((p145==1)) U ((((p113==1)&&(p134==1))||(p111==1))||((p29==1)||(p145==1...163
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p23==1))))] = FALSE * [(FwdU(EY((Init * !(EG(!(EX(!((EX((p11==1)) * !(EX(!((p78==1))))))))...260
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...318
Using saturation style SCC detection
(forward)formula 0,1,1.21245,47560,1,0,217,248615,245,104,2589,181304,268
FORMULA HealthRecord-PT-11-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 44 place count 67 transition count 131
Iterating global reduction 0 with 44 rules applied. Total rules applied 88 place count 67 transition count 131
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 92 place count 67 transition count 127
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 62 transition count 117
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 62 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 62 transition count 114
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 107 place count 60 transition count 108
Iterating global reduction 2 with 2 rules applied. Total rules applied 109 place count 60 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 111 place count 58 transition count 104
Iterating global reduction 2 with 2 rules applied. Total rules applied 113 place count 58 transition count 104
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 119 place count 58 transition count 98
Applied a total of 119 rules in 3 ms. Remains 58 /111 variables (removed 53) and now considering 98/216 (removed 118) transitions.
[2026-05-25 19:20:45] [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-8943012522793324646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12331348537197616277.kers'
[2026-05-25 19:20:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8943012522793324646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12331348537197616277.kers]
Normalized transition count is 94 out of 95 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 94 rows 58 cols 313 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-25 19:20:45] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12331348537197616277.kers
Total runtime 1 ms.
[2026-05-25 19:20:45] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-25 19:20:45] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2026-05-25 19:20:45] [INFO ] Invariant cache hit.
[2026-05-25 19:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:20:46] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 97 sub problems to find dead transitions.
[2026-05-25 19:20:46] [INFO ] Flow matrix only has 95 transitions (discarded 3 similar events)
[2026-05-25 19:20:46] [INFO ] Invariant cache hit.
[2026-05-25 19:20:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (OVERLAPS) 94/152 variables, 58/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (OVERLAPS) 1/153 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (OVERLAPS) 0/153 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 0/153 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Real declared 153/153 variables, and 73 constraints, problems are : Problem set: 0 solved, 97 unsolved in 3792 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 5/5 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/57 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 1/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 8 (OVERLAPS) 94/152 variables, 58/80 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/152 variables, 97/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/152 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 11 (OVERLAPS) 1/153 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 13 (OVERLAPS) 0/153 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 97 unsolved
No progress, stopping.
After SMT solving in domain Int declared 153/153 variables, and 178 constraints, problems are : Problem set: 0 solved, 97 unsolved in 8874 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 58/58 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12675ms problems are : Problem set: 0 solved, 97 unsolved
Search for dead transitions found 0 dead transitions in 12675ms
Starting structural reductions in LTL mode, iteration 1 : 58/111 places, 98/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12794 ms. Remains : 58/111 places, 98/216 transitions.
[2026-05-25 19:20:58] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:20:58] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:20:58] [INFO ] Input system was already deterministic with 98 transitions.
[2026-05-25 19:20:58] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:20:58] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:20:58] [INFO ] Time to serialize gal into /tmp/CTLFireability17521563257327753627.gal : 1 ms
[2026-05-25 19:20:58] [INFO ] Time to serialize properties into /tmp/CTLFireability10820449121938806764.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17521563257327753627.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10820449121938806764.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.53188e+06,0.090094,8100,2,1149,5,18269,6,0,326,18968,0


Converting to forward existential form...Done !
original formula: A((AX((p22==1)) + EX(AG(AX((p104==1))))) U E((EF(((p36==1)&&(p156==1))) * ((p84==1)||(p7==1))) U !(EF(((p59==1)&&(p123==1))))))
=> equivalent forward existential formula: [((Init * !(EG(!(E((E(TRUE U ((p36==1)&&(p156==1))) * ((p84==1)||(p7==1))) U !(E(TRUE U ((p59==1)&&(p123==1)))))...448
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t21, t23, t...362
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,1.20974,50504,1,0,285,264502,230,139,2478,257090,314
FORMULA HealthRecord-PT-11-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 151 edges and 111 vertex of which 8 / 111 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 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 47 place count 60 transition count 122
Iterating global reduction 0 with 46 rules applied. Total rules applied 93 place count 60 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 95 place count 60 transition count 120
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 103 place count 52 transition count 103
Iterating global reduction 1 with 8 rules applied. Total rules applied 111 place count 52 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 115 place count 52 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 118 place count 49 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 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 124 place count 49 transition count 88
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 126 place count 47 transition count 84
Iterating global reduction 3 with 2 rules applied. Total rules applied 128 place count 47 transition count 84
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 134 place count 47 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 47 transition count 75
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 141 place count 45 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 44 transition count 72
Applied a total of 142 rules in 18 ms. Remains 44 /111 variables (removed 67) and now considering 72/216 (removed 144) transitions.
[2026-05-25 19:20:59] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6089445313491035008.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14710338269154483963.kers'
[2026-05-25 19:20:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6089445313491035008.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14710338269154483963.kers]
Normalized transition count is 65 out of 66 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 65 rows 44 cols 226 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-25 19:20:59] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14710338269154483963.kers
Total runtime 3 ms.
[2026-05-25 19:21:00] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:21:00] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2026-05-25 19:21:00] [INFO ] Invariant cache hit.
[2026-05-25 19:21:00] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-25 19:21:00] [INFO ] Redundant transitions in 13 ms returned []
Running 58 sub problems to find dead transitions.
[2026-05-25 19:21:00] [INFO ] Flow matrix only has 66 transitions (discarded 6 similar events)
[2026-05-25 19:21:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 65/109 variables, 44/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (OVERLAPS) 0/109 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Real declared 109/110 variables, and 56 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1171 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 58 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 2 (OVERLAPS) 7/44 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 6 (OVERLAPS) 65/109 variables, 44/57 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/109 variables, 58/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/109 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
At refinement iteration 9 (OVERLAPS) 0/109 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 109/110 variables, and 115 constraints, problems are : Problem set: 0 solved, 58 unsolved in 1509 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, PredecessorRefiner: 58/58 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2688ms problems are : Problem set: 0 solved, 58 unsolved
Search for dead transitions found 0 dead transitions in 2688ms
Starting structural reductions in SI_CTL mode, iteration 1 : 44/111 places, 72/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2822 ms. Remains : 44/111 places, 72/216 transitions.
[2026-05-25 19:21:02] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:21:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:02] [INFO ] Input system was already deterministic with 72 transitions.
[2026-05-25 19:21:02] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:02] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:02] [INFO ] Time to serialize gal into /tmp/CTLFireability8001351049192855261.gal : 1 ms
[2026-05-25 19:21:02] [INFO ] Time to serialize properties into /tmp/CTLFireability12199357964138846159.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability8001351049192855261.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12199357964138846159.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,353812,0.053474,6200,2,2446,5,10346,6,0,238,8786,0


Converting to forward existential form...Done !
original formula: EG(AG(EF(((p144==1)||(p65==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(E(TRUE U !(E(TRUE U ((p144==1)||(p65==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t14, t15, t62, Intersection with reac...230
(forward)formula 0,0,0.734288,32752,1,0,137,159309,164,63,1730,128811,163
FORMULA HealthRecord-PT-11-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 153 edges and 111 vertex of which 10 / 111 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 60 transition count 123
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 60 transition count 123
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 96 place count 60 transition count 118
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 103 place count 53 transition count 104
Iterating global reduction 1 with 7 rules applied. Total rules applied 110 place count 53 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 53 transition count 100
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 51 transition count 94
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 51 transition count 94
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 120 place count 49 transition count 90
Iterating global reduction 2 with 2 rules applied. Total rules applied 122 place count 49 transition count 90
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 49 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 132 place count 49 transition count 80
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 136 place count 47 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 45 transition count 76
Applied a total of 138 rules in 12 ms. Remains 45 /111 variables (removed 66) and now considering 76/216 (removed 140) transitions.
[2026-05-25 19:21:03] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5455326808533363721.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16204531169893952806.kers'
[2026-05-25 19:21:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5455326808533363721.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16204531169893952806.kers]
Normalized transition count is 68 out of 69 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 68 rows 45 cols 238 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 19:21:03] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16204531169893952806.kers
Total runtime 0 ms.
[2026-05-25 19:21:03] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:21:03] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2026-05-25 19:21:03] [INFO ] Invariant cache hit.
[2026-05-25 19:21:03] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2026-05-25 19:21:03] [INFO ] Redundant transitions in 12 ms returned []
Running 62 sub problems to find dead transitions.
[2026-05-25 19:21:03] [INFO ] Flow matrix only has 69 transitions (discarded 7 similar events)
[2026-05-25 19:21:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 68/113 variables, 45/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/113 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/114 variables, and 57 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1349 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 7/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 3/12 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (OVERLAPS) 68/113 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 62/120 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/113 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/114 variables, and 120 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1851 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3210ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 3210ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/111 places, 76/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3314 ms. Remains : 45/111 places, 76/216 transitions.
[2026-05-25 19:21:06] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:21:06] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:06] [INFO ] Input system was already deterministic with 76 transitions.
[2026-05-25 19:21:06] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:06] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:06] [INFO ] Time to serialize gal into /tmp/CTLFireability6560401999900675349.gal : 1 ms
[2026-05-25 19:21:06] [INFO ] Time to serialize properties into /tmp/CTLFireability13513189333961580833.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6560401999900675349.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13513189333961580833.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,291280,0.0606,6748,2,924,5,12602,6,0,244,12467,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(EF((p10==0)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(E(TRUE U (p10==0)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t16, t17, t33, t34, t49, t51...255
(forward)formula 0,1,0.269428,14928,1,0,140,53572,174,64,1885,47881,162
FORMULA HealthRecord-PT-11-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 43 place count 68 transition count 133
Iterating global reduction 0 with 43 rules applied. Total rules applied 86 place count 68 transition count 133
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 90 place count 68 transition count 129
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 96 place count 62 transition count 117
Iterating global reduction 1 with 6 rules applied. Total rules applied 102 place count 62 transition count 117
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 105 place count 62 transition count 114
Applied a total of 105 rules in 5 ms. Remains 62 /111 variables (removed 49) and now considering 114/216 (removed 102) transitions.
[2026-05-25 19:21:07] [INFO ] Flow matrix only has 111 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-171200250558428562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9670460303513836965.kers'
[2026-05-25 19:21:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-171200250558428562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9670460303513836965.kers]
Normalized transition count is 110 out of 111 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 110 rows 62 cols 371 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-25 19:21:07] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9670460303513836965.kers
Total runtime 3 ms.
[2026-05-25 19:21:07] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 19:21:07] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2026-05-25 19:21:07] [INFO ] Invariant cache hit.
[2026-05-25 19:21:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:21:07] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Running 113 sub problems to find dead transitions.
[2026-05-25 19:21:07] [INFO ] Flow matrix only has 111 transitions (discarded 3 similar events)
[2026-05-25 19:21:07] [INFO ] Invariant cache hit.
[2026-05-25 19:21:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (OVERLAPS) 110/172 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/172 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (OVERLAPS) 1/173 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 0/173 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Real declared 173/173 variables, and 74 constraints, problems are : Problem set: 0 solved, 113 unsolved in 3623 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 113 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 1 (OVERLAPS) 1/62 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 6/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 5 (OVERLAPS) 110/172 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 113/192 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 8 (OVERLAPS) 1/173 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/173 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 113 unsolved
At refinement iteration 10 (OVERLAPS) 0/173 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 113 unsolved
No progress, stopping.
After SMT solving in domain Int declared 173/173 variables, and 193 constraints, problems are : Problem set: 0 solved, 113 unsolved in 9635 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 62/62 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 113/113 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13275ms problems are : Problem set: 0 solved, 113 unsolved
Search for dead transitions found 0 dead transitions in 13275ms
Starting structural reductions in LTL mode, iteration 1 : 62/111 places, 114/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13388 ms. Remains : 62/111 places, 114/216 transitions.
[2026-05-25 19:21:20] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:21:20] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:21:20] [INFO ] Input system was already deterministic with 114 transitions.
[2026-05-25 19:21:20] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:20] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:20] [INFO ] Time to serialize gal into /tmp/CTLFireability15581920150061525564.gal : 1 ms
[2026-05-25 19:21:20] [INFO ] Time to serialize properties into /tmp/CTLFireability8888307609972595847.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability15581920150061525564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8888307609972595847.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.97341e+06,0.335805,18188,2,2386,5,58070,6,0,358,62058,0


Converting to forward existential form...Done !
original formula: AF(E(E((EX((p53==1)) * ((A((p11==1) U (p51==1)) + (p47==1)) + (p127==1))) U !(E((p11==1) U (p23==1)))) U ((p48==1)||(p110==1))))
=> equivalent forward existential formula: [FwdG(Init,!(E(E((EX((p53==1)) * ((!((E(!((p51==1)) U (!((p11==1)) * !((p51==1)))) + EG(!((p51==1))))) + (p47==1...236
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20, t21, t...368
(forward)formula 0,1,10.1114,327260,1,0,638,1.94018e+06,269,343,2646,2.06775e+06,670
FORMULA HealthRecord-PT-11-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 66 transition count 129
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 66 transition count 129
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 95 place count 66 transition count 124
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 102 place count 59 transition count 109
Iterating global reduction 1 with 7 rules applied. Total rules applied 109 place count 59 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 112 place count 59 transition count 106
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 114 place count 57 transition count 101
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 57 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 119 place count 57 transition count 98
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 120 place count 56 transition count 96
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 56 transition count 96
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 124 place count 56 transition count 93
Applied a total of 124 rules in 3 ms. Remains 56 /111 variables (removed 55) and now considering 93/216 (removed 123) transitions.
[2026-05-25 19:21:30] [INFO ] Flow matrix only has 90 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-11077502980417557821.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9426864289001170010.kers'
[2026-05-25 19:21:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11077502980417557821.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9426864289001170010.kers]
Normalized transition count is 89 out of 90 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 89 rows 56 cols 299 entries
Finished phase 1 with 47 SingleSign rule and 0 generalized
[2026-05-25 19:21:30] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9426864289001170010.kers
Total runtime 0 ms.
[2026-05-25 19:21:30] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-25 19:21:30] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:21:30] [INFO ] Invariant cache hit.
[2026-05-25 19:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:21:30] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Running 92 sub problems to find dead transitions.
[2026-05-25 19:21:30] [INFO ] Flow matrix only has 90 transitions (discarded 3 similar events)
[2026-05-25 19:21:30] [INFO ] Invariant cache hit.
[2026-05-25 19:21:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 89/145 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 1/146 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 0/146 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 68 constraints, problems are : Problem set: 0 solved, 92 unsolved in 2651 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/56 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/56 variables, 4/15 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (OVERLAPS) 89/145 variables, 56/72 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 92/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/146 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 165 constraints, problems are : Problem set: 0 solved, 92 unsolved in 7246 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 56/56 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9906ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 9907ms
Starting structural reductions in LTL mode, iteration 1 : 56/111 places, 93/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9994 ms. Remains : 56/111 places, 93/216 transitions.
[2026-05-25 19:21:40] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:21:40] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:21:40] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-25 19:21:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:40] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:40] [INFO ] Time to serialize gal into /tmp/CTLFireability17597133901204660988.gal : 0 ms
[2026-05-25 19:21:40] [INFO ] Time to serialize properties into /tmp/CTLFireability13766742319822463001.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17597133901204660988.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13766742319822463001.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.29277e+06,0.065392,7020,2,985,5,14035,6,0,313,12737,0


Converting to forward existential form...Done !
original formula: AG(EF((AG((p112==0)) + ((AX((p59==0)) + EG((p77==0))) * (!(A((p44==1) U (p83==1))) + (((p17==1)&&(p36==1))&&((p55==1)&&(p127==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (!(E(TRUE U !((p112==0)))) + ((!(EX(!((p59==0)))) + EG((p77==0))) * (!(!((E(!((p8...276
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t18, t20, t22, t24, t28, t...312
(forward)formula 0,1,2.97651,119780,1,0,465,730120,224,253,2309,691065,588
FORMULA HealthRecord-PT-11-CTLFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 154 edges and 111 vertex of which 10 / 111 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 46 place count 60 transition count 122
Iterating global reduction 0 with 45 rules applied. Total rules applied 91 place count 60 transition count 122
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 96 place count 60 transition count 117
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 104 place count 52 transition count 100
Iterating global reduction 1 with 8 rules applied. Total rules applied 112 place count 52 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 116 place count 52 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 49 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 49 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 125 place count 49 transition count 85
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 47 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 47 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 135 place count 47 transition count 75
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 139 place count 47 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 143 place count 45 transition count 69
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 145 place count 43 transition count 67
Applied a total of 145 rules in 18 ms. Remains 43 /111 variables (removed 68) and now considering 67/216 (removed 149) transitions.
[2026-05-25 19:21:43] [INFO ] Flow matrix only has 59 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-8199440399192788299.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6187062513826618004.kers'
[2026-05-25 19:21:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8199440399192788299.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6187062513826618004.kers]
Normalized transition count is 58 out of 59 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 58 rows 42 cols 204 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-25 19:21:43] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6187062513826618004.kers
Total runtime 0 ms.
[2026-05-25 19:21:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-25 19:21:43] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2026-05-25 19:21:43] [INFO ] Invariant cache hit.
[2026-05-25 19:21:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2026-05-25 19:21:43] [INFO ] Redundant transitions in 12 ms returned []
Running 53 sub problems to find dead transitions.
[2026-05-25 19:21:43] [INFO ] Flow matrix only has 59 transitions (discarded 8 similar events)
[2026-05-25 19:21:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 58/101 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/101 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (OVERLAPS) 0/101 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 101/102 variables, and 57 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 7/43 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 58/101 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 53/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 10 (OVERLAPS) 0/101 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 101/102 variables, and 111 constraints, problems are : Problem set: 0 solved, 53 unsolved in 1402 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2530ms problems are : Problem set: 0 solved, 53 unsolved
Search for dead transitions found 0 dead transitions in 2530ms
Starting structural reductions in SI_CTL mode, iteration 1 : 43/111 places, 67/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2631 ms. Remains : 43/111 places, 67/216 transitions.
[2026-05-25 19:21:46] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:46] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:46] [INFO ] Input system was already deterministic with 67 transitions.
[2026-05-25 19:21:46] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:21:46] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:21:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16345100404658787957.gal : 1 ms
[2026-05-25 19:21:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14345389575525817764.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16345100404658787957.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14345389575525817764.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (4032 resets) in 67 ms. (588 steps per ms) remains 1/1 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40003 steps (551 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1247 steps, run visited all 1 properties in 5 ms. (steps per millisecond=249 )
Probabilistic random walk after 1247 steps, saw 497 distinct states, run finished after 5 ms. (steps per millisecond=249 ) properties seen :1
FORMULA HealthRecord-PT-11-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 117 edges and 111 vertex of which 10 / 111 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 42 place count 64 transition count 130
Iterating global reduction 0 with 41 rules applied. Total rules applied 83 place count 64 transition count 130
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 87 place count 64 transition count 126
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 94 place count 57 transition count 111
Iterating global reduction 1 with 7 rules applied. Total rules applied 101 place count 57 transition count 111
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 105 place count 57 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 106 place count 56 transition count 104
Iterating global reduction 2 with 1 rules applied. Total rules applied 107 place count 56 transition count 104
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 55 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 55 transition count 102
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 112 place count 55 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 55 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 120 place count 53 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 122 place count 51 transition count 91
Applied a total of 122 rules in 10 ms. Remains 51 /111 variables (removed 60) and now considering 91/216 (removed 125) transitions.
[2026-05-25 19:21:46] [INFO ] Flow matrix only has 83 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-17403631158058732053.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9067524713799360408.kers'
[2026-05-25 19:21:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17403631158058732053.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9067524713799360408.kers]
Normalized transition count is 82 out of 83 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 82 rows 50 cols 278 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 19:21:46] [INFO ] Computed 10 invariants in 0 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9067524713799360408.kers
Total runtime 3 ms.
[2026-05-25 19:21:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-25 19:21:46] [INFO ] Flow matrix only has 83 transitions (discarded 8 similar events)
[2026-05-25 19:21:46] [INFO ] Invariant cache hit.
[2026-05-25 19:21:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2026-05-25 19:21:46] [INFO ] Redundant transitions in 12 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-25 19:21:46] [INFO ] Flow matrix only has 83 transitions (discarded 8 similar events)
[2026-05-25 19:21:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 7/51 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 82/133 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/134 variables, and 63 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1504 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/44 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (OVERLAPS) 7/51 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 82/133 variables, 51/64 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 77/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/134 variables, and 141 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2150 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3664ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 3665ms
Starting structural reductions in SI_CTL mode, iteration 1 : 51/111 places, 91/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3774 ms. Remains : 51/111 places, 91/216 transitions.
[2026-05-25 19:21:50] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:21:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:50] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-25 19:21:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:21:50] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:21:50] [INFO ] Time to serialize gal into /tmp/CTLFireability14941879771451310598.gal : 1 ms
[2026-05-25 19:21:50] [INFO ] Time to serialize properties into /tmp/CTLFireability9581212248022457844.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability14941879771451310598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9581212248022457844.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,500908,0.271666,15896,2,4251,5,45857,6,0,280,55859,0


Converting to forward existential form...Done !
original formula: AF(!(E((((p129==1) + A((p28==1) U ((p113==1)&&(p136==1)))) * (AF((p2==1)) + E((p77==1) U (p54==1)))) U EF(((p55==1)&&(p156==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E((((p129==1) + !((E(!(((p113==1)&&(p136==1))) U (!((p28==1)) * !(((p113==1)&&(p136==1))))) + EG(...279
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t20, t21...320
(forward)formula 0,0,9.18944,291100,1,0,601,1.61589e+06,225,355,2140,1.75498e+06,696
FORMULA HealthRecord-PT-11-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 114 edges and 111 vertex of which 10 / 111 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 42 places :
Symmetric choice reduction at 0 with 42 rule applications. Total rules 43 place count 63 transition count 129
Iterating global reduction 0 with 42 rules applied. Total rules applied 85 place count 63 transition count 129
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 89 place count 63 transition count 125
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 96 place count 56 transition count 110
Iterating global reduction 1 with 7 rules applied. Total rules applied 103 place count 56 transition count 110
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 107 place count 56 transition count 106
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 55 transition count 103
Iterating global reduction 2 with 1 rules applied. Total rules applied 109 place count 55 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 110 place count 54 transition count 101
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 54 transition count 101
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 113 place count 54 transition count 99
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 117 place count 54 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 121 place count 52 transition count 93
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 123 place count 50 transition count 91
Applied a total of 123 rules in 15 ms. Remains 50 /111 variables (removed 61) and now considering 91/216 (removed 125) transitions.
[2026-05-25 19:21:59] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11762582754518854943.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12259884521277442133.kers'
[2026-05-25 19:21:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11762582754518854943.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12259884521277442133.kers]
Normalized transition count is 83 out of 84 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 83 rows 50 cols 282 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-25 19:21:59] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12259884521277442133.kers
Total runtime 0 ms.
[2026-05-25 19:21:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2026-05-25 19:21:59] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
[2026-05-25 19:21:59] [INFO ] Invariant cache hit.
[2026-05-25 19:21:59] [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.
[2026-05-25 19:21:59] [INFO ] Redundant transitions in 12 ms returned []
Running 77 sub problems to find dead transitions.
[2026-05-25 19:21:59] [INFO ] Flow matrix only has 84 transitions (discarded 7 similar events)
[2026-05-25 19:21:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 83/133 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/133 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/134 variables, and 63 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1713 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 7/50 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 83/133 variables, 50/65 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/133 variables, 77/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/133 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 10 (OVERLAPS) 0/133 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/134 variables, and 142 constraints, problems are : Problem set: 0 solved, 77 unsolved in 2996 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 50/50 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4718ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 4720ms
Starting structural reductions in SI_CTL mode, iteration 1 : 50/111 places, 91/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4828 ms. Remains : 50/111 places, 91/216 transitions.
[2026-05-25 19:22:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:22:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:22:04] [INFO ] Input system was already deterministic with 91 transitions.
[2026-05-25 19:22:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:22:04] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:22:04] [INFO ] Time to serialize gal into /tmp/CTLFireability9940698176964506415.gal : 1 ms
[2026-05-25 19:22:04] [INFO ] Time to serialize properties into /tmp/CTLFireability12812103055584888589.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9940698176964506415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12812103055584888589.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,589252,0.089624,7832,2,1160,5,15664,6,0,279,16913,0


Converting to forward existential form...Done !
original formula: EF(((EG(AG((((p17==1)&&(p36==1))&&((p55==1)&&(p152==1))))) + E(EF((p16==1)) U (p99==1))) + (E(EG((p100!=1)) U (p11==1)) + ((p113==1)&&(p1...165
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),!(E(TRUE U !((((p17==1)&&(p36==1))&&((p55==1)&&(p152==1)))))))] != FALSE + [(FwdU(FwdU(I...328
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t19, t20...335
(forward)formula 0,1,0.636181,27996,1,0,211,132803,208,85,2078,108324,222
FORMULA HealthRecord-PT-11-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Graph (trivial) has 131 edges and 111 vertex of which 10 / 111 are part of one of the 5 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 44 places :
Symmetric choice reduction at 0 with 44 rule applications. Total rules 45 place count 61 transition count 125
Iterating global reduction 0 with 44 rules applied. Total rules applied 89 place count 61 transition count 125
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 94 place count 61 transition count 120
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 102 place count 53 transition count 103
Iterating global reduction 1 with 8 rules applied. Total rules applied 110 place count 53 transition count 103
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 114 place count 53 transition count 99
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 50 transition count 91
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 50 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 123 place count 50 transition count 88
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 124 place count 49 transition count 86
Iterating global reduction 3 with 1 rules applied. Total rules applied 125 place count 49 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 128 place count 49 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 132 place count 49 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 136 place count 47 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 138 place count 45 transition count 75
Applied a total of 138 rules in 15 ms. Remains 45 /111 variables (removed 66) and now considering 75/216 (removed 141) transitions.
[2026-05-25 19:22:05] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4089035138823677142.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3625073005942392385.kers'
[2026-05-25 19:22:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4089035138823677142.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3625073005942392385.kers]
Normalized transition count is 67 out of 68 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 67 rows 45 cols 230 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-25 19:22:05] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3625073005942392385.kers
Total runtime 0 ms.
[2026-05-25 19:22:05] [INFO ] Implicit Places using invariants in 28 ms returned []
[2026-05-25 19:22:05] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2026-05-25 19:22:05] [INFO ] Invariant cache hit.
[2026-05-25 19:22:05] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2026-05-25 19:22:05] [INFO ] Redundant transitions in 12 ms returned []
Running 61 sub problems to find dead transitions.
[2026-05-25 19:22:05] [INFO ] Flow matrix only has 68 transitions (discarded 7 similar events)
[2026-05-25 19:22:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 7/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 67/112 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (OVERLAPS) 0/112 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Real declared 112/113 variables, and 58 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1333 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 2 (OVERLAPS) 7/45 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/45 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 5 (OVERLAPS) 67/112 variables, 45/58 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 61/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
At refinement iteration 8 (OVERLAPS) 0/112 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 61 unsolved
No progress, stopping.
After SMT solving in domain Int declared 112/113 variables, and 119 constraints, problems are : Problem set: 0 solved, 61 unsolved in 1866 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 45/45 constraints, PredecessorRefiner: 61/61 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3207ms problems are : Problem set: 0 solved, 61 unsolved
Search for dead transitions found 0 dead transitions in 3207ms
Starting structural reductions in SI_CTL mode, iteration 1 : 45/111 places, 75/216 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3319 ms. Remains : 45/111 places, 75/216 transitions.
[2026-05-25 19:22:08] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:22:08] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:22:08] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-25 19:22:08] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:22:08] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:22:08] [INFO ] Time to serialize gal into /tmp/CTLFireability6546742053625995935.gal : 0 ms
[2026-05-25 19:22:08] [INFO ] Time to serialize properties into /tmp/CTLFireability523022163808591435.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability6546742053625995935.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability523022163808591435.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,359752,0.100356,8264,2,1016,5,16619,6,0,243,21228,0


Converting to forward existential form...Done !
original formula: AG(AF(((EG(((p51==0)||(p99==0))) + (p36==0)) + (p156==0))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((EG(((p51==0)||(p99==0))) + (p36==0)) + (p156==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t6, t7, t8, t9, t10, t11, t12, t13, t14, t15, t16, t17, t18, t27, t28...295
(forward)formula 0,0,2.06634,74604,1,0,299,423934,170,136,1732,438379,315
FORMULA HealthRecord-PT-11-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

***************************************

Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 216/216 transitions.
Discarding 50 places :
Symmetric choice reduction at 0 with 50 rule applications. Total rules 50 place count 61 transition count 119
Iterating global reduction 0 with 50 rules applied. Total rules applied 100 place count 61 transition count 119
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 105 place count 61 transition count 114
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 54 transition count 99
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 54 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 122 place count 54 transition count 96
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 125 place count 51 transition count 88
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 51 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 131 place count 51 transition count 85
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 133 place count 49 transition count 81
Iterating global reduction 3 with 2 rules applied. Total rules applied 135 place count 49 transition count 81
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 141 place count 49 transition count 75
Applied a total of 141 rules in 6 ms. Remains 49 /111 variables (removed 62) and now considering 75/216 (removed 141) transitions.
[2026-05-25 19:22:10] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10839704335099995996.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14754051283499728276.kers'
[2026-05-25 19:22:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10839704335099995996.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14754051283499728276.kers]
Normalized transition count is 71 out of 72 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 71 rows 49 cols 249 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-25 19:22:10] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14754051283499728276.kers
Total runtime 1 ms.
[2026-05-25 19:22:10] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-25 19:22:10] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2026-05-25 19:22:10] [INFO ] Invariant cache hit.
[2026-05-25 19:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:22:10] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-25 19:22:10] [INFO ] Flow matrix only has 72 transitions (discarded 3 similar events)
[2026-05-25 19:22:10] [INFO ] Invariant cache hit.
[2026-05-25 19:22:10] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 71/120 variables, 49/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (OVERLAPS) 1/121 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 0/121 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 61 constraints, problems are : Problem set: 0 solved, 74 unsolved in 1876 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (OVERLAPS) 71/120 variables, 49/62 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 74/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (OVERLAPS) 1/121 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/121 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 137 constraints, problems are : Problem set: 0 solved, 74 unsolved in 4184 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6067ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 6067ms
Starting structural reductions in LTL mode, iteration 1 : 49/111 places, 75/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6152 ms. Remains : 49/111 places, 75/216 transitions.
[2026-05-25 19:22:16] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:22:16] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:22:16] [INFO ] Input system was already deterministic with 75 transitions.
[2026-05-25 19:22:16] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:22:16] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:22:16] [INFO ] Time to serialize gal into /tmp/CTLFireability7444104102370326444.gal : 0 ms
[2026-05-25 19:22:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17160703859199253628.ctl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability7444104102370326444.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17160703859199253628.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,484794,0.04182,5472,2,672,5,6755,6,0,267,6022,0


Converting to forward existential form...Done !
original formula: AG(AX(AF(((EF(((p20==0)||(p156==0))) + (p55==0)) + (p156==0)))))
=> equivalent forward existential formula: [FwdG(EY(FwdU(Init,TRUE)),!(((E(TRUE U ((p20==0)||(p156==0))) + (p55==0)) + (p156==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t7, t8, t9, t10, t11, t12, t13, t15, t17, t19, Intersection with reachab...227
(forward)formula 0,1,0.131743,9564,1,0,130,24933,175,63,1937,20306,162
FORMULA HealthRecord-PT-11-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

***************************************

[2026-05-25 19:22:16] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:22:16] [INFO ] Flatten gal took : 5 ms
Total runtime 222933 ms.

BK_STOP 1779736936913

--------------------
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
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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-11"
export BK_EXAMINATION="CTLFireability"
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-11, examination is CTLFireability"
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-177961074300618"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HealthRecord-PT-11.tgz
mv HealthRecord-PT-11 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;