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-177961074300657.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-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300657
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 6.3K Mar 7 13:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Mar 7 13:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 7 13:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Mar 7 13:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 10:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 13:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 7 13:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 7 13:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 7 13:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:45 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 125K 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-16-CTLCardinality-2024-00
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-01
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-02
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-03
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-04
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-05
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-06
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-07
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-08
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-09
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-10
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-11
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-12
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-13
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-14
FORMULA_NAME HealthRecord-PT-16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779737658062

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-25 19:34:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:34:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:34:19] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2026-05-25 19:34:19] [INFO ] Transformed 453 places.
[2026-05-25 19:34:19] [INFO ] Transformed 594 transitions.
[2026-05-25 19:34:19] [INFO ] Found NUPN structural information;
[2026-05-25 19:34:19] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 168 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
FORMULA HealthRecord-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HealthRecord-PT-16-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 85 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 63 places :
Symmetric choice reduction at 0 with 63 rule applications. Total rules 63 place count 390 transition count 522
Iterating global reduction 0 with 63 rules applied. Total rules applied 126 place count 390 transition count 522
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 143 place count 373 transition count 497
Iterating global reduction 0 with 17 rules applied. Total rules applied 160 place count 373 transition count 497
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 162 place count 373 transition count 495
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 165 place count 370 transition count 489
Iterating global reduction 1 with 3 rules applied. Total rules applied 168 place count 370 transition count 489
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 169 place count 369 transition count 487
Iterating global reduction 1 with 1 rules applied. Total rules applied 170 place count 369 transition count 487
Applied a total of 170 rules in 101 ms. Remains 369 /453 variables (removed 84) and now considering 487/594 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1189406149528180850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-928140801283438862.kers'
[2026-05-25 19:34:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1189406149528180850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-928140801283438862.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 487 rows 369 cols 1117 entries
Finished phase 1 with 353 SingleSign rule and 2 generalized
[2026-05-25 19:34:19] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-928140801283438862.kers
Total runtime 3 ms.
[2026-05-25 19:34:19] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-25 19:34:19] [INFO ] Invariant cache hit.
[2026-05-25 19:34:20] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 486 sub problems to find dead transitions.
[2026-05-25 19:34:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 16/50 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 369/856 variables, and 57 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/369 constraints, PredecessorRefiner: 486/486 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 486 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/368 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/368 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 2 (OVERLAPS) 1/369 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/369 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 43/57 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 4/61 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 486 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 486 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 369/856 variables, and 73 constraints, problems are : Problem set: 0 solved, 486 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/369 constraints, PredecessorRefiner: 0/486 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60162ms problems are : Problem set: 0 solved, 486 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Starting structural reductions in LTL mode, iteration 1 : 369/453 places, 487/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60905 ms. Remains : 369/453 places, 487/594 transitions.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Applied a total of 0 rules in 6 ms. Remains 369 /369 variables (removed 0) and now considering 487/487 (removed 0) transitions.
[2026-05-25 19:35:20] [INFO ] Invariant cache hit.
[2026-05-25 19:35:20] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 19:35:20] [INFO ] Invariant cache hit.
[2026-05-25 19:35:20] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 369/369 places, 487/487 transitions.
Support contains 85 out of 369 places after structural reductions.
[2026-05-25 19:35:20] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-25 19:35:20] [INFO ] Flatten gal took : 48 ms
FORMULA HealthRecord-PT-16-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 19:35:20] [INFO ] Flatten gal took : 21 ms
[2026-05-25 19:35:20] [INFO ] Input system was already deterministic with 487 transitions.
Support contains 81 out of 369 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (236 resets) in 1360 ms. (29 steps per ms) remains 23/47 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 23/23 properties
[2026-05-25 19:35:21] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 265/302 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 22 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 3 (OVERLAPS) 67/369 variables, 7/14 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/369 variables, 2/16 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/369 variables, 3/19 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 3/22 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 487/856 variables, 369/391 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/856 variables, 3/394 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/856 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 0/856 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 856/856 variables, and 394 constraints, problems are : Problem set: 2 solved, 21 unsolved in 3379 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 369/369 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 1 (OVERLAPS) 240/271 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 30/301 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 68/369 variables, 7/14 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/369 variables, 11/25 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/369 variables, 11/36 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/369 variables, 1/37 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/38 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 3/41 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/369 variables, 1/42 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 3/45 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 1/46 constraints. Problems are: Problem set: 2 solved, 21 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/369 variables, 4/50 constraints. Problems are: Problem set: 2 solved, 21 unsolved
SMT process timed out in 8432ms, After SMT, problems are : Problem set: 2 solved, 21 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 31 out of 369 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 369/369 places, 487/487 transitions.
Graph (trivial) has 371 edges and 369 vertex of which 46 / 369 are part of one of the 17 SCC in 9 ms
Free SCC test removed 29 places
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 670 edges and 340 vertex of which 332 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 129 transitions
Trivial Post-agglo rules discarded 129 transitions
Performed 129 trivial Post agglomeration. Transition count delta: 129
Iterating post reduction 0 with 129 rules applied. Total rules applied 131 place count 332 transition count 309
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 1 with 143 rules applied. Total rules applied 274 place count 203 transition count 295
Reduce places removed 7 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 2 with 16 rules applied. Total rules applied 290 place count 196 transition count 286
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 14 rules applied. Total rules applied 304 place count 187 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 306 place count 185 transition count 281
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 306 place count 185 transition count 276
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 316 place count 180 transition count 276
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 328 place count 168 transition count 253
Iterating global reduction 5 with 12 rules applied. Total rules applied 340 place count 168 transition count 253
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 3 rules applied. Total rules applied 343 place count 168 transition count 250
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 346 place count 165 transition count 250
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 350 place count 161 transition count 242
Iterating global reduction 7 with 4 rules applied. Total rules applied 354 place count 161 transition count 242
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 434 place count 121 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 437 place count 121 transition count 199
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 438 place count 120 transition count 197
Iterating global reduction 8 with 1 rules applied. Total rules applied 439 place count 120 transition count 197
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 440 place count 119 transition count 195
Iterating global reduction 8 with 1 rules applied. Total rules applied 441 place count 119 transition count 195
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 463 place count 108 transition count 254
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 8 with 12 rules applied. Total rules applied 475 place count 108 transition count 242
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 477 place count 107 transition count 259
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 481 place count 107 transition count 255
Free-agglomeration rule applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 489 place count 107 transition count 247
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 497 place count 99 transition count 247
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 499 place count 99 transition count 245
Partial Free-agglomeration rule applied 20 times.
Drop transitions (Partial Free agglomeration) removed 20 transitions
Iterating global reduction 10 with 20 rules applied. Total rules applied 519 place count 99 transition count 245
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 10 with 16 rules applied. Total rules applied 535 place count 99 transition count 245
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 540 place count 99 transition count 245
Applied a total of 540 rules in 106 ms. Remains 99 /369 variables (removed 270) and now considering 245/487 (removed 242) transitions.
Running 237 sub problems to find dead transitions.
[2026-05-25 19:35:30] [INFO ] Flow matrix only has 236 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6124519872010651812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-518142891530227817.kers'
[2026-05-25 19:35:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6124519872010651812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-518142891530227817.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 236 rows 99 cols 926 entries
Finished phase 1 with 91 SingleSign rule and 2 generalized
[2026-05-25 19:35:30] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-518142891530227817.kers
Total runtime 1 ms.
[2026-05-25 19:35:30] [INFO ] State equation strengthened by 12 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 2 (OVERLAPS) 1/99 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 237 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 237 unsolved
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
At refinement iteration 4 (OVERLAPS) 236/335 variables, 99/105 constraints. Problems are: Problem set: 17 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/335 variables, 12/117 constraints. Problems are: Problem set: 17 solved, 220 unsolved
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 6/123 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 2/125 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 0/125 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/335 variables, 0/125 constraints. Problems are: Problem set: 20 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 335/335 variables, and 125 constraints, problems are : Problem set: 20 solved, 217 unsolved in 17605 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 237/237 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 5/5 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/96 variables, 0/5 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 3/99 variables, 1/6 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 8/14 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 5 (OVERLAPS) 236/335 variables, 99/113 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/335 variables, 12/125 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 217/342 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 3/345 constraints. Problems are: Problem set: 20 solved, 217 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 3/348 constraints. Problems are: Problem set: 20 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 335/335 variables, and 348 constraints, problems are : Problem set: 20 solved, 217 unsolved in 20016 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 99/99 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 217/237 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 37721ms problems are : Problem set: 20 solved, 217 unsolved
Search for dead transitions found 20 dead transitions in 37722ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 99/369 places, 225/487 transitions.
Graph (complete) has 318 edges and 99 vertex of which 97 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 97 transition count 224
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 96 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 96 transition count 222
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 13 place count 96 transition count 222
Applied a total of 13 rules in 19 ms. Remains 96 /99 variables (removed 3) and now considering 222/225 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 37848 ms. Remains : 96/369 places, 222/487 transitions.
RANDOM walk for 40000 steps (4408 resets) in 548 ms. (72 steps per ms) remains 7/21 properties
BEST_FIRST walk for 40004 steps (573 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (575 resets) in 48 ms. (816 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (564 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (586 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (608 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (588 resets) in 63 ms. (625 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (305 resets) in 46 ms. (851 steps per ms) remains 7/7 properties
[2026-05-25 19:36:08] [INFO ] Flow matrix only has 213 transitions (discarded 9 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10707932233065452058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17076817082325439572.kers'
[2026-05-25 19:36:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10707932233065452058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17076817082325439572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 96 cols 681 entries
Finished phase 1 with 90 SingleSign rule and 1 generalized
[2026-05-25 19:36:08] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17076817082325439572.kers
Total runtime 1 ms.
[2026-05-25 19:36:08] [INFO ] State equation strengthened by 22 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, 7 unsolved
At refinement iteration 1 (OVERLAPS) 43/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 148/202 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 85/287 variables, 29/88 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 22/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 22/309 variables, 13/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/309 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/309 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 123 constraints, problems are : Problem set: 0 solved, 7 unsolved in 221 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 43/54 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 148/202 variables, 54/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 85/287 variables, 29/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 22/114 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 3/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 22/309 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/309 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 0/309 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 130 constraints, problems are : Problem set: 0 solved, 7 unsolved in 529 ms.
Refiners :[Generalized P Invariants (flows): 5/5 constraints, State Equation: 96/96 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 757ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 5 properties in 265 ms.
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 222/222 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 96 transition count 201
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 34 place count 83 transition count 201
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 34 place count 83 transition count 197
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 42 place count 79 transition count 197
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 55 place count 66 transition count 176
Iterating global reduction 2 with 13 rules applied. Total rules applied 68 place count 66 transition count 176
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 62 transition count 170
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 62 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 61 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 61 transition count 167
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 61 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 92 place count 55 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 95 place count 55 transition count 156
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 96 place count 54 transition count 155
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 54 transition count 155
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 101 place count 52 transition count 159
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 52 transition count 159
Applied a total of 102 rules in 20 ms. Remains 52 /96 variables (removed 44) and now considering 159/222 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 52/96 places, 159/222 transitions.
RANDOM walk for 40000 steps (6152 resets) in 566 ms. (70 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (580 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (569 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 8786 steps, run visited all 2 properties in 46 ms. (steps per millisecond=191 )
Probabilistic random walk after 8786 steps, saw 3196 distinct states, run finished after 49 ms. (steps per millisecond=179 ) properties seen :2
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2026-05-25 19:36:09] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:36:09] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:36:09] [INFO ] Input system was already deterministic with 487 transitions.
Computed a total of 99 stabilizing places and 109 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 337 transition count 447
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 337 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 337 transition count 446
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 85 place count 317 transition count 416
Iterating global reduction 1 with 20 rules applied. Total rules applied 105 place count 317 transition count 416
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 107 place count 317 transition count 414
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 119 place count 305 transition count 393
Iterating global reduction 2 with 12 rules applied. Total rules applied 131 place count 305 transition count 393
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 138 place count 298 transition count 381
Iterating global reduction 2 with 7 rules applied. Total rules applied 145 place count 298 transition count 381
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 149 place count 294 transition count 373
Iterating global reduction 2 with 4 rules applied. Total rules applied 153 place count 294 transition count 373
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 290 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 290 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 162 place count 290 transition count 366
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 164 place count 288 transition count 364
Iterating global reduction 3 with 2 rules applied. Total rules applied 166 place count 288 transition count 364
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 167 place count 287 transition count 363
Iterating global reduction 3 with 1 rules applied. Total rules applied 168 place count 287 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 287 transition count 362
Applied a total of 169 rules in 68 ms. Remains 287 /369 variables (removed 82) and now considering 362/487 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7764951808492011921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5374987264554255804.kers'
[2026-05-25 19:36:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7764951808492011921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5374987264554255804.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 362 rows 287 cols 839 entries
Finished phase 1 with 271 SingleSign rule and 2 generalized
[2026-05-25 19:36:09] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5374987264554255804.kers
Total runtime 1 ms.
[2026-05-25 19:36:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-25 19:36:09] [INFO ] Invariant cache hit.
[2026-05-25 19:36:09] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 361 sub problems to find dead transitions.
[2026-05-25 19:36:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (OVERLAPS) 362/649 variables, 287/315 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/649 variables, 3/318 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/649 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 649/649 variables, and 318 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 361 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/286 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/286 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 2 (OVERLAPS) 1/287 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/287 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/287 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/287 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 9 (OVERLAPS) 362/649 variables, 287/326 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/649 variables, 361/687 constraints. Problems are: Problem set: 0 solved, 361 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/649 variables, 5/692 constraints. Problems are: Problem set: 0 solved, 361 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 649/649 variables, and 692 constraints, problems are : Problem set: 0 solved, 361 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 287/287 constraints, PredecessorRefiner: 361/361 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 361 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 287/369 places, 362/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60334 ms. Remains : 287/369 places, 362/487 transitions.
[2026-05-25 19:37:09] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:37:09] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:37:09] [INFO ] Input system was already deterministic with 362 transitions.
[2026-05-25 19:37:09] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:37:09] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:37:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality9592903064058142353.gal : 7 ms
[2026-05-25 19:37:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality15542862667078525744.ctl : 2 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/CTLCardinality9592903064058142353.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15542862667078525744.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.57944e+11,2.17065,75984,2,10647,5,229279,6,0,1512,457554,0


Converting to forward existential form...Done !
original formula: EX((AF(AX(((p87==0)&&(p443==1)))) * ((p356==0)||(p214==1))))
=> equivalent forward existential formula: [((EY(Init) * ((p356==0)||(p214==1))) * !(EG(!(!(EX(!(((p87==0)&&(p443==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t17, t18, t19, t22, t25, t27, t29, t32, t34, t35, t37, t38, t39, t40, t43...659
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-25 19:37:39] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:37:39] [INFO ] Applying decomposition
[2026-05-25 19:37:39] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9835478900639475148.txt' '-o' '/tmp/graph9835478900639475148.bin' '-w' '/tmp/graph9835478900639475148.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9835478900639475148.bin' '-l' '-1' '-v' '-w' '/tmp/graph9835478900639475148.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:37:40] [INFO ] Decomposing Gal with order
[2026-05-25 19:37:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:37:40] [INFO ] Removed a total of 112 redundant transitions.
[2026-05-25 19:37:40] [INFO ] Flatten gal took : 64 ms
[2026-05-25 19:37:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2026-05-25 19:37:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4126171869965951485.gal : 6 ms
[2026-05-25 19:37:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality5439750271987859035.ctl : 3 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/CTLCardinality4126171869965951485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5439750271987859035.ctl'

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 -...262
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.57944e+11,0.427769,21292,1208,62,30754,998,718,68895,91,2888,0


Converting to forward existential form...Done !
original formula: EX((AF(AX(((i2.u12.p87==0)&&(i21.i2.u110.p443==1)))) * ((i18.i1.u91.p356==0)||(u58.p214==1))))
=> equivalent forward existential formula: [((EY(Init) * ((i18.i1.u91.p356==0)||(u58.p214==1))) * !(EG(!(!(EX(!(((i2.u12.p87==0)&&(i21.i2.u110.p443==1)))))...169
Reverse transition relation is NOT exact ! Due to transitions t90, t202, t234, t326, u58.t161, i1.i0.t272, i1.i0.t274, i1.i0.t286, i1.i0.t288, i1.i0.t290, ...1286
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
(forward)formula 0,0,1.57513,57016,1,0,99983,998,4592,202424,446,2888,270802
FORMULA HealthRecord-PT-16-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 339 transition count 451
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 339 transition count 451
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 339 transition count 450
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 81 place count 319 transition count 420
Iterating global reduction 1 with 20 rules applied. Total rules applied 101 place count 319 transition count 420
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 103 place count 319 transition count 418
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 115 place count 307 transition count 397
Iterating global reduction 2 with 12 rules applied. Total rules applied 127 place count 307 transition count 397
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 133 place count 301 transition count 386
Iterating global reduction 2 with 6 rules applied. Total rules applied 139 place count 301 transition count 386
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 141 place count 299 transition count 381
Iterating global reduction 2 with 2 rules applied. Total rules applied 143 place count 299 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 144 place count 298 transition count 379
Iterating global reduction 2 with 1 rules applied. Total rules applied 145 place count 298 transition count 379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 146 place count 298 transition count 378
Applied a total of 146 rules in 41 ms. Remains 298 /369 variables (removed 71) and now considering 378/487 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7513912032650402587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17735157204946204505.kers'
[2026-05-25 19:37:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7513912032650402587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17735157204946204505.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 298 cols 877 entries
Finished phase 1 with 282 SingleSign rule and 2 generalized
[2026-05-25 19:37:41] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17735157204946204505.kers
Total runtime 2 ms.
[2026-05-25 19:37:41] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-25 19:37:41] [INFO ] Invariant cache hit.
[2026-05-25 19:37:42] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2026-05-25 19:37:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/298 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/676 variables, and 47 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/298 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/298 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 33/47 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (OVERLAPS) 378/676 variables, 298/346 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 377/723 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 1/724 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 724 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 298/369 places, 378/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60348 ms. Remains : 298/369 places, 378/487 transitions.
[2026-05-25 19:38:42] [INFO ] Flatten gal took : 20 ms
[2026-05-25 19:38:42] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:38:42] [INFO ] Input system was already deterministic with 378 transitions.
[2026-05-25 19:38:42] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:38:42] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:38:42] [INFO ] Time to serialize gal into /tmp/CTLCardinality6087941869466854346.gal : 2 ms
[2026-05-25 19:38:42] [INFO ] Time to serialize properties into /tmp/CTLCardinality6845683400157071104.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/CTLCardinality6087941869466854346.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6845683400157071104.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.18998e+11,1.83636,69132,2,10214,5,209108,6,0,1572,411835,0


Converting to forward existential form...Done !
original formula: EG(((EX(EG((((p411==1)||(p435==0))||(p118==1)))) * AX(AX((p30==0)))) * ((AG(((p31==0) * AF(((p24==0)&&(p233==1))))) + ((p166==1)&&(p427==...200
=> equivalent forward existential formula: [FwdG(Init,((EX(EG((((p411==1)||(p435==0))||(p118==1)))) * !(EX(!(!(EX(!((p30==0)))))))) * ((!(E(TRUE U !(((p31=...273
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t22, t24, t26, t29, t31, t32, t35, t36, t38, t39, t40, t41, t44, t45...678
Detected timeout of ITS tools.
[2026-05-25 19:39:12] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:39:12] [INFO ] Applying decomposition
[2026-05-25 19:39:12] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph308305079245071283.txt' '-o' '/tmp/graph308305079245071283.bin' '-w' '/tmp/graph308305079245071283.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph308305079245071283.bin' '-l' '-1' '-v' '-w' '/tmp/graph308305079245071283.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:39:12] [INFO ] Decomposing Gal with order
[2026-05-25 19:39:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:39:12] [INFO ] Removed a total of 106 redundant transitions.
[2026-05-25 19:39:12] [INFO ] Flatten gal took : 19 ms
[2026-05-25 19:39:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-05-25 19:39:12] [INFO ] Time to serialize gal into /tmp/CTLCardinality11118414713105586505.gal : 4 ms
[2026-05-25 19:39:12] [INFO ] Time to serialize properties into /tmp/CTLCardinality9039521726684652600.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/CTLCardinality11118414713105586505.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9039521726684652600.ctl'

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 -...263
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.18998e+11,0.495651,24216,1206,103,33735,3711,752,89308,126,13269,0


Converting to forward existential form...Done !
original formula: EG(((EX(EG((((i20.i1.u103.p411==1)||(i20.i0.u113.p435==0))||(i5.i2.u26.p118==1)))) * AX(AX((i2.i0.u13.p30==0)))) * ((AG(((i2.i2.u9.p31==0...329
=> equivalent forward existential formula: [FwdG(Init,((EX(EG((((i20.i1.u103.p411==1)||(i20.i0.u113.p435==0))||(i5.i2.u26.p118==1)))) * !(EX(!(!(EX(!((i2.i...402
Reverse transition relation is NOT exact ! Due to transitions t91, t136, t339, i2.i0.u13.t272, i2.i0.u13.t274, i2.i0.u13.t275, i2.i0.u13.t281, i2.i0.u13.t2...1395
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,5.65487,207588,1,0,374997,8016,5555,820259,653,24204,603728
FORMULA HealthRecord-PT-16-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Graph (trivial) has 422 edges and 369 vertex of which 46 / 369 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 149 rules applied. Total rules applied 150 place count 339 transition count 305
Reduce places removed 149 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 167 rules applied. Total rules applied 317 place count 190 transition count 287
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 327 place count 182 transition count 285
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 331 place count 180 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 332 place count 179 transition count 283
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 332 place count 179 transition count 279
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 340 place count 175 transition count 279
Discarding 37 places :
Symmetric choice reduction at 5 with 37 rule applications. Total rules 377 place count 138 transition count 211
Iterating global reduction 5 with 37 rules applied. Total rules applied 414 place count 138 transition count 211
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 5 with 6 rules applied. Total rules applied 420 place count 138 transition count 205
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 6 with 6 rules applied. Total rules applied 426 place count 132 transition count 205
Discarding 12 places :
Symmetric choice reduction at 7 with 12 rule applications. Total rules 438 place count 120 transition count 182
Iterating global reduction 7 with 12 rules applied. Total rules applied 450 place count 120 transition count 182
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 7 with 1 rules applied. Total rules applied 451 place count 120 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 452 place count 119 transition count 181
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 457 place count 114 transition count 173
Iterating global reduction 9 with 5 rules applied. Total rules applied 462 place count 114 transition count 173
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 464 place count 114 transition count 171
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 465 place count 113 transition count 169
Iterating global reduction 10 with 1 rules applied. Total rules applied 466 place count 113 transition count 169
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 468 place count 111 transition count 167
Iterating global reduction 10 with 2 rules applied. Total rules applied 470 place count 111 transition count 167
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 471 place count 111 transition count 166
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 472 place count 110 transition count 164
Iterating global reduction 11 with 1 rules applied. Total rules applied 473 place count 110 transition count 164
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 474 place count 109 transition count 162
Iterating global reduction 11 with 1 rules applied. Total rules applied 475 place count 109 transition count 162
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 476 place count 108 transition count 160
Iterating global reduction 11 with 1 rules applied. Total rules applied 477 place count 108 transition count 160
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 11 with 20 rules applied. Total rules applied 497 place count 98 transition count 150
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 498 place count 98 transition count 149
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 501 place count 95 transition count 143
Iterating global reduction 12 with 3 rules applied. Total rules applied 504 place count 95 transition count 143
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 507 place count 92 transition count 139
Iterating global reduction 12 with 3 rules applied. Total rules applied 510 place count 92 transition count 139
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 511 place count 91 transition count 138
Iterating global reduction 12 with 1 rules applied. Total rules applied 512 place count 91 transition count 138
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 513 place count 90 transition count 136
Iterating global reduction 12 with 1 rules applied. Total rules applied 514 place count 90 transition count 136
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 515 place count 89 transition count 134
Iterating global reduction 12 with 1 rules applied. Total rules applied 516 place count 89 transition count 134
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 517 place count 88 transition count 132
Iterating global reduction 12 with 1 rules applied. Total rules applied 518 place count 88 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 519 place count 88 transition count 131
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 13 with 3 rules applied. Total rules applied 522 place count 88 transition count 128
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 13 with 2 rules applied. Total rules applied 524 place count 88 transition count 126
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 526 place count 86 transition count 126
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 527 place count 85 transition count 124
Iterating global reduction 15 with 1 rules applied. Total rules applied 528 place count 85 transition count 124
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 529 place count 84 transition count 122
Iterating global reduction 15 with 1 rules applied. Total rules applied 530 place count 84 transition count 122
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 531 place count 83 transition count 121
Iterating global reduction 15 with 1 rules applied. Total rules applied 532 place count 83 transition count 121
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 534 place count 82 transition count 120
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 535 place count 82 transition count 119
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 537 place count 82 transition count 119
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 538 place count 81 transition count 118
Applied a total of 538 rules in 67 ms. Remains 81 /369 variables (removed 288) and now considering 118/487 (removed 369) transitions.
[2026-05-25 19:39:18] [INFO ] Flow matrix only has 110 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-187604989885759327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1222138138674090376.kers'
[2026-05-25 19:39:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-187604989885759327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1222138138674090376.kers]
Normalized transition count is 109 out of 110 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 109 rows 81 cols 292 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 19:39:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1222138138674090376.kers
Total runtime 1 ms.
[2026-05-25 19:39:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-25 19:39:18] [INFO ] Flow matrix only has 110 transitions (discarded 8 similar events)
[2026-05-25 19:39:18] [INFO ] Invariant cache hit.
[2026-05-25 19:39:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 19:39:18] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2026-05-25 19:39:18] [INFO ] Redundant transitions in 2 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 19:39:18] [INFO ] Flow matrix only has 110 transitions (discarded 8 similar events)
[2026-05-25 19:39:18] [INFO ] Invariant cache hit.
[2026-05-25 19:39:18] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 5/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (OVERLAPS) 109/190 variables, 81/91 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/190 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 1/191 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 0/191 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 93 constraints, problems are : Problem set: 0 solved, 110 unsolved in 4735 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (OVERLAPS) 5/81 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (OVERLAPS) 109/190 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 110/204 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/190 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/191 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/191 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 205 constraints, problems are : Problem set: 0 solved, 110 unsolved in 7295 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12039ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 12040ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/369 places, 118/487 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12210 ms. Remains : 81/369 places, 118/487 transitions.
[2026-05-25 19:39:30] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:39:30] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:39:30] [INFO ] Input system was already deterministic with 118 transitions.
[2026-05-25 19:39:30] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:39:30] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:39:30] [INFO ] Time to serialize gal into /tmp/CTLCardinality13694261822414143262.gal : 1 ms
[2026-05-25 19:39:30] [INFO ] Time to serialize properties into /tmp/CTLCardinality15579348736587892409.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/CTLCardinality13694261822414143262.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality15579348736587892409.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,2.93493e+07,0.112628,9312,2,1529,5,25141,6,0,434,23939,0


Converting to forward existential form...Done !
original formula: EF(EG((AG((p101==0)) * !(E(((p92==0)||(p52==1)) U ((p244==0)||(p214==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((p101==0)))) * !(E(((p92==0)||(p52==1)) U ((p244==0)||(p214==1))))))] != FAL...157
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t8, t10, t12, t13, t17, t19, t38, t67, t107, t109, t111, t114, Intersect...245
(forward)formula 0,1,0.616773,28264,1,0,203,135767,260,103,2822,103783,258
FORMULA HealthRecord-PT-16-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Graph (trivial) has 412 edges and 369 vertex of which 44 / 369 are part of one of the 16 SCC in 2 ms
Free SCC test removed 28 places
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 340 transition count 311
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 162 rules applied. Total rules applied 307 place count 196 transition count 293
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 316 place count 188 transition count 292
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 187 transition count 292
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 317 place count 187 transition count 287
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 327 place count 182 transition count 287
Discarding 33 places :
Symmetric choice reduction at 4 with 33 rule applications. Total rules 360 place count 149 transition count 227
Iterating global reduction 4 with 33 rules applied. Total rules applied 393 place count 149 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 5 rules applied. Total rules applied 398 place count 149 transition count 222
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 402 place count 145 transition count 222
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 402 place count 145 transition count 221
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 404 place count 144 transition count 221
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 413 place count 135 transition count 205
Iterating global reduction 6 with 9 rules applied. Total rules applied 422 place count 135 transition count 205
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 424 place count 133 transition count 202
Iterating global reduction 6 with 2 rules applied. Total rules applied 426 place count 133 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 427 place count 133 transition count 201
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 428 place count 132 transition count 199
Iterating global reduction 7 with 1 rules applied. Total rules applied 429 place count 132 transition count 199
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 461 place count 116 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 462 place count 116 transition count 182
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 468 place count 110 transition count 170
Iterating global reduction 8 with 6 rules applied. Total rules applied 474 place count 110 transition count 170
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 479 place count 105 transition count 161
Iterating global reduction 8 with 5 rules applied. Total rules applied 484 place count 105 transition count 161
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 487 place count 102 transition count 158
Iterating global reduction 8 with 3 rules applied. Total rules applied 490 place count 102 transition count 158
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 491 place count 102 transition count 157
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 493 place count 100 transition count 153
Iterating global reduction 9 with 2 rules applied. Total rules applied 495 place count 100 transition count 153
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 497 place count 98 transition count 149
Iterating global reduction 9 with 2 rules applied. Total rules applied 499 place count 98 transition count 149
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 501 place count 96 transition count 145
Iterating global reduction 9 with 2 rules applied. Total rules applied 503 place count 96 transition count 145
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 504 place count 96 transition count 144
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 506 place count 96 transition count 142
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 1 Pre rules applied. Total rules applied 506 place count 96 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 508 place count 95 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 510 place count 94 transition count 140
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 511 place count 94 transition count 140
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 512 place count 93 transition count 139
Applied a total of 512 rules in 47 ms. Remains 93 /369 variables (removed 276) and now considering 139/487 (removed 348) transitions.
[2026-05-25 19:39:30] [INFO ] Flow matrix only has 131 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-6478847206978243250.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-858987420570983149.kers'
[2026-05-25 19:39:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6478847206978243250.kers, --Pflows, --basisKERS=/tmp/petrispot-output-858987420570983149.kers]
Normalized transition count is 130 out of 131 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 130 rows 93 cols 342 entries
Finished phase 1 with 83 SingleSign rule and 2 generalized
[2026-05-25 19:39:30] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-858987420570983149.kers
Total runtime 0 ms.
[2026-05-25 19:39:31] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 19:39:31] [INFO ] Flow matrix only has 131 transitions (discarded 8 similar events)
[2026-05-25 19:39:31] [INFO ] Invariant cache hit.
[2026-05-25 19:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:39:31] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2026-05-25 19:39:31] [INFO ] Redundant transitions in 4 ms returned []
Running 127 sub problems to find dead transitions.
[2026-05-25 19:39:31] [INFO ] Flow matrix only has 131 transitions (discarded 8 similar events)
[2026-05-25 19:39:31] [INFO ] Invariant cache hit.
[2026-05-25 19:39:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 7/93 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 130/223 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/223 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (OVERLAPS) 1/224 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (OVERLAPS) 0/224 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 224/224 variables, and 108 constraints, problems are : Problem set: 0 solved, 127 unsolved in 5900 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (OVERLAPS) 7/93 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/93 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/93 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/93 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/93 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 8 (OVERLAPS) 130/223 variables, 93/109 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/223 variables, 127/236 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/223 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/223 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 12 (OVERLAPS) 1/224 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/224 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 14 (OVERLAPS) 0/224 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Int declared 224/224 variables, and 238 constraints, problems are : Problem set: 0 solved, 127 unsolved in 12203 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 18112ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 18112ms
Starting structural reductions in SI_CTL mode, iteration 1 : 93/369 places, 139/487 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18289 ms. Remains : 93/369 places, 139/487 transitions.
[2026-05-25 19:39:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:39:49] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:39:49] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-25 19:39:49] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:39:49] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:39:49] [INFO ] Time to serialize gal into /tmp/CTLCardinality11254932618337628691.gal : 0 ms
[2026-05-25 19:39:49] [INFO ] Time to serialize properties into /tmp/CTLCardinality2513055773530917162.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/CTLCardinality11254932618337628691.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2513055773530917162.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,7.87661e+07,0.055802,6308,2,964,5,9927,6,0,501,10027,0


Converting to forward existential form...Done !
original formula: AF(!(A(AF(((((p208==0)||(p334==1))||(p284==1))&&(((p189==0)||(p16==1))||((p310==0)||(p294==1))))) U ((p180==1) + EF(((p448==1)&&(p189==0)...161
=> equivalent forward existential formula: [FwdG(Init,!(!(!((E(!(((p180==1) + E(TRUE U ((p448==1)&&(p189==0))))) U (!(!(EG(!(((((p208==0)||(p334==1))||(p28...339
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t5, t7, t9, t10, t12, t14, t15, t16, t20, t21, t22, t23, t24, t26, t29, t30, ...318
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,4.9682,182556,1,0,793,1.09263e+06,309,488,3411,1.21345e+06,837
FORMULA HealthRecord-PT-16-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Graph (trivial) has 427 edges and 369 vertex of which 46 / 369 are part of one of the 17 SCC in 1 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 151 transitions
Trivial Post-agglo rules discarded 151 transitions
Performed 151 trivial Post agglomeration. Transition count delta: 151
Iterating post reduction 0 with 151 rules applied. Total rules applied 152 place count 339 transition count 303
Reduce places removed 151 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 172 rules applied. Total rules applied 324 place count 188 transition count 282
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 334 place count 178 transition count 282
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 334 place count 178 transition count 277
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 344 place count 173 transition count 277
Discarding 37 places :
Symmetric choice reduction at 3 with 37 rule applications. Total rules 381 place count 136 transition count 209
Iterating global reduction 3 with 37 rules applied. Total rules applied 418 place count 136 transition count 209
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 3 with 6 rules applied. Total rules applied 424 place count 136 transition count 203
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 430 place count 130 transition count 203
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 443 place count 117 transition count 179
Iterating global reduction 5 with 13 rules applied. Total rules applied 456 place count 117 transition count 179
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 457 place count 117 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 458 place count 116 transition count 178
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 464 place count 110 transition count 168
Iterating global reduction 7 with 6 rules applied. Total rules applied 470 place count 110 transition count 168
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 472 place count 110 transition count 166
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 474 place count 108 transition count 162
Iterating global reduction 8 with 2 rules applied. Total rules applied 476 place count 108 transition count 162
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 478 place count 106 transition count 159
Iterating global reduction 8 with 2 rules applied. Total rules applied 480 place count 106 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 482 place count 106 transition count 157
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 9 with 26 rules applied. Total rules applied 508 place count 93 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 509 place count 93 transition count 143
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 512 place count 90 transition count 137
Iterating global reduction 10 with 3 rules applied. Total rules applied 515 place count 90 transition count 137
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 518 place count 87 transition count 133
Iterating global reduction 10 with 3 rules applied. Total rules applied 521 place count 87 transition count 133
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 522 place count 86 transition count 132
Iterating global reduction 10 with 1 rules applied. Total rules applied 523 place count 86 transition count 132
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 524 place count 85 transition count 130
Iterating global reduction 10 with 1 rules applied. Total rules applied 525 place count 85 transition count 130
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 526 place count 84 transition count 128
Iterating global reduction 10 with 1 rules applied. Total rules applied 527 place count 84 transition count 128
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 528 place count 83 transition count 126
Iterating global reduction 10 with 1 rules applied. Total rules applied 529 place count 83 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 530 place count 83 transition count 125
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 533 place count 83 transition count 122
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 11 with 2 rules applied. Total rules applied 535 place count 83 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 537 place count 81 transition count 120
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 538 place count 80 transition count 118
Iterating global reduction 13 with 1 rules applied. Total rules applied 539 place count 80 transition count 118
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 540 place count 79 transition count 116
Iterating global reduction 13 with 1 rules applied. Total rules applied 541 place count 79 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 543 place count 78 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 544 place count 77 transition count 114
Applied a total of 544 rules in 33 ms. Remains 77 /369 variables (removed 292) and now considering 114/487 (removed 373) transitions.
[2026-05-25 19:39:54] [INFO ] Flow matrix only has 106 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-14448501354018010780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18398739480390709420.kers'
[2026-05-25 19:39:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14448501354018010780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18398739480390709420.kers]
Normalized transition count is 105 out of 106 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 77 cols 278 entries
Finished phase 1 with 70 SingleSign rule and 0 generalized
[2026-05-25 19:39:54] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18398739480390709420.kers
Total runtime 0 ms.
[2026-05-25 19:39:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-25 19:39:54] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
[2026-05-25 19:39:54] [INFO ] Invariant cache hit.
[2026-05-25 19:39:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:39:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2026-05-25 19:39:54] [INFO ] Redundant transitions in 1 ms returned []
Running 100 sub problems to find dead transitions.
[2026-05-25 19:39:54] [INFO ] Flow matrix only has 106 transitions (discarded 8 similar events)
[2026-05-25 19:39:54] [INFO ] Invariant cache hit.
[2026-05-25 19:39:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 7/77 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/182 variables, 77/87 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (OVERLAPS) 1/183 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/183 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (OVERLAPS) 0/183 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Real declared 183/183 variables, and 88 constraints, problems are : Problem set: 0 solved, 100 unsolved in 4056 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (OVERLAPS) 7/77 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/77 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/77 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 6 (OVERLAPS) 105/182 variables, 77/89 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 100/189 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/182 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 9 (OVERLAPS) 1/183 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 11 (OVERLAPS) 0/183 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 100 unsolved
No progress, stopping.
After SMT solving in domain Int declared 183/183 variables, and 190 constraints, problems are : Problem set: 0 solved, 100 unsolved in 5543 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 77/77 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9607ms problems are : Problem set: 0 solved, 100 unsolved
Search for dead transitions found 0 dead transitions in 9607ms
Starting structural reductions in SI_CTL mode, iteration 1 : 77/369 places, 114/487 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9743 ms. Remains : 77/369 places, 114/487 transitions.
[2026-05-25 19:40:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:40:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:40:04] [INFO ] Input system was already deterministic with 114 transitions.
RANDOM walk for 540 steps (30 resets) in 8 ms. (60 steps per ms) remains 0/1 properties
FORMULA HealthRecord-PT-16-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-25 19:40:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:40:04] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:40:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality558014749516004569.gal : 1 ms
[2026-05-25 19:40:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15888119750450168745.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality558014749516004569.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15888119750450168745.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 338 transition count 449
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 338 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 338 transition count 448
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 81 place count 320 transition count 422
Iterating global reduction 1 with 18 rules applied. Total rules applied 99 place count 320 transition count 422
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 101 place count 320 transition count 420
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 110 place count 311 transition count 403
Iterating global reduction 2 with 9 rules applied. Total rules applied 119 place count 311 transition count 403
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 123 place count 307 transition count 396
Iterating global reduction 2 with 4 rules applied. Total rules applied 127 place count 307 transition count 396
Applied a total of 127 rules in 17 ms. Remains 307 /369 variables (removed 62) and now considering 396/487 (removed 91) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16801659033820547352.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12959031495536926333.kers'
[2026-05-25 19:40:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16801659033820547352.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12959031495536926333.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 396 rows 307 cols 921 entries
Finished phase 1 with 291 SingleSign rule and 2 generalized
[2026-05-25 19:40:04] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12959031495536926333.kers
Total runtime 2 ms.
[2026-05-25 19:40:04] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-25 19:40:04] [INFO ] Invariant cache hit.
[2026-05-25 19:40:04] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2026-05-25 19:40:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/307 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/307 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 13/54 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/307 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 307/703 variables, and 55 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/307 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/307 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/307 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 4/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 396/703 variables, 307/366 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/703 variables, 395/761 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/703 variables, 1/762 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 762 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 307/307 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60061ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 60062ms
Starting structural reductions in LTL mode, iteration 1 : 307/369 places, 396/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60294 ms. Remains : 307/369 places, 396/487 transitions.
[2026-05-25 19:41:04] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:41:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:41:04] [INFO ] Input system was already deterministic with 396 transitions.
[2026-05-25 19:41:04] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:41:04] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:41:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality120005406803760083.gal : 2 ms
[2026-05-25 19:41:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality8677584994883720434.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/CTLCardinality120005406803760083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8677584994883720434.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,2.68976e+11,4.58329,144128,2,12192,5,398998,6,0,1626,978661,0


Converting to forward existential form...Done !
original formula: (EG((p330==1)) + !(E(EG(((p54==0)||(p38==1))) U !((EF(((p362==0)||(p290==1))) + AX((p287==0)))))))
=> equivalent forward existential formula: [(EY((FwdU((Init * !(EG((p330==1)))),EG(((p54==0)||(p38==1)))) * !(E(TRUE U ((p362==0)||(p290==1)))))) * !((p287...170
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t45...774
(forward)formula 0,1,15.4557,364652,1,0,646,1.10928e+06,815,351,8879,1.48768e+06,803
FORMULA HealthRecord-PT-16-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Graph (trivial) has 420 edges and 369 vertex of which 46 / 369 are part of one of the 17 SCC in 0 ms
Free SCC test removed 29 places
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 145 place count 339 transition count 310
Reduce places removed 144 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 162 rules applied. Total rules applied 307 place count 195 transition count 292
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 316 place count 187 transition count 291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 186 transition count 291
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 317 place count 186 transition count 285
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 329 place count 180 transition count 285
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 365 place count 144 transition count 219
Iterating global reduction 4 with 36 rules applied. Total rules applied 401 place count 144 transition count 219
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 6 rules applied. Total rules applied 407 place count 144 transition count 213
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 413 place count 138 transition count 213
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 424 place count 127 transition count 193
Iterating global reduction 6 with 11 rules applied. Total rules applied 435 place count 127 transition count 193
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 6 with 1 rules applied. Total rules applied 436 place count 127 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 437 place count 126 transition count 192
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 442 place count 121 transition count 183
Iterating global reduction 8 with 5 rules applied. Total rules applied 447 place count 121 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 448 place count 121 transition count 182
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 450 place count 119 transition count 178
Iterating global reduction 9 with 2 rules applied. Total rules applied 452 place count 119 transition count 178
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 454 place count 117 transition count 175
Iterating global reduction 9 with 2 rules applied. Total rules applied 456 place count 117 transition count 175
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 457 place count 117 transition count 174
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 458 place count 116 transition count 172
Iterating global reduction 10 with 1 rules applied. Total rules applied 459 place count 116 transition count 172
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 460 place count 115 transition count 170
Iterating global reduction 10 with 1 rules applied. Total rules applied 461 place count 115 transition count 170
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 462 place count 114 transition count 168
Iterating global reduction 10 with 1 rules applied. Total rules applied 463 place count 114 transition count 168
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 487 place count 102 transition count 156
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 488 place count 102 transition count 155
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 491 place count 99 transition count 149
Iterating global reduction 11 with 3 rules applied. Total rules applied 494 place count 99 transition count 149
Discarding 3 places :
Symmetric choice reduction at 11 with 3 rule applications. Total rules 497 place count 96 transition count 145
Iterating global reduction 11 with 3 rules applied. Total rules applied 500 place count 96 transition count 145
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 501 place count 95 transition count 144
Iterating global reduction 11 with 1 rules applied. Total rules applied 502 place count 95 transition count 144
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 503 place count 94 transition count 142
Iterating global reduction 11 with 1 rules applied. Total rules applied 504 place count 94 transition count 142
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 505 place count 93 transition count 140
Iterating global reduction 11 with 1 rules applied. Total rules applied 506 place count 93 transition count 140
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 507 place count 92 transition count 138
Iterating global reduction 11 with 1 rules applied. Total rules applied 508 place count 92 transition count 138
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 509 place count 92 transition count 137
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 12 with 3 rules applied. Total rules applied 512 place count 92 transition count 134
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 12 with 1 rules applied. Total rules applied 513 place count 92 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 514 place count 91 transition count 133
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 514 place count 91 transition count 132
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 516 place count 90 transition count 132
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 517 place count 89 transition count 130
Iterating global reduction 14 with 1 rules applied. Total rules applied 518 place count 89 transition count 130
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 519 place count 88 transition count 128
Iterating global reduction 14 with 1 rules applied. Total rules applied 520 place count 88 transition count 128
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 521 place count 87 transition count 127
Iterating global reduction 14 with 1 rules applied. Total rules applied 522 place count 87 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 524 place count 86 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 525 place count 86 transition count 125
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 14 with 1 rules applied. Total rules applied 526 place count 86 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 527 place count 85 transition count 124
Applied a total of 527 rules in 41 ms. Remains 85 /369 variables (removed 284) and now considering 124/487 (removed 363) transitions.
[2026-05-25 19:41:20] [INFO ] Flow matrix only has 116 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-13494719863734527262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1471358670502044853.kers'
[2026-05-25 19:41:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13494719863734527262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1471358670502044853.kers]
Normalized transition count is 115 out of 116 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 115 rows 85 cols 308 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-25 19:41:20] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1471358670502044853.kers
Total runtime 0 ms.
[2026-05-25 19:41:20] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-25 19:41:20] [INFO ] Flow matrix only has 116 transitions (discarded 8 similar events)
[2026-05-25 19:41:20] [INFO ] Invariant cache hit.
[2026-05-25 19:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:41:20] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2026-05-25 19:41:20] [INFO ] Redundant transitions in 2 ms returned []
Running 119 sub problems to find dead transitions.
[2026-05-25 19:41:20] [INFO ] Flow matrix only has 116 transitions (discarded 8 similar events)
[2026-05-25 19:41:20] [INFO ] Invariant cache hit.
[2026-05-25 19:41:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 3/85 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (OVERLAPS) 115/200 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (OVERLAPS) 1/201 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 0/201 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 97 constraints, problems are : Problem set: 0 solved, 119 unsolved in 4934 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 4/4 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/82 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 2 (OVERLAPS) 3/85 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 6 (OVERLAPS) 115/200 variables, 85/97 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 119/216 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 9 (OVERLAPS) 1/201 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 119 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 217 constraints, problems are : Problem set: 0 solved, 119 unsolved in 8831 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 85/85 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 119/119 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13774ms problems are : Problem set: 0 solved, 119 unsolved
Search for dead transitions found 0 dead transitions in 13774ms
Starting structural reductions in SI_CTL mode, iteration 1 : 85/369 places, 124/487 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13917 ms. Remains : 85/369 places, 124/487 transitions.
[2026-05-25 19:41:33] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:41:33] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:41:33] [INFO ] Input system was already deterministic with 124 transitions.
[2026-05-25 19:41:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:41:33] [INFO ] Flatten gal took : 1 ms
[2026-05-25 19:41:33] [INFO ] Time to serialize gal into /tmp/CTLCardinality3019047428185485900.gal : 1 ms
[2026-05-25 19:41:33] [INFO ] Time to serialize properties into /tmp/CTLCardinality6582097771592775235.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/CTLCardinality3019047428185485900.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6582097771592775235.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,5.71659e+07,0.044023,5808,2,764,5,7698,6,0,455,6442,0


Converting to forward existential form...Done !
original formula: EG(EF(AG((((p105!=1)||(p289!=0))||(((p319!=1)&&(p97!=0))&&(p176!=1))))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U !(E(TRUE U !((((p105!=1)||(p289!=0))||(((p319!=1)&&(p97!=0))&&(p176!=1))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t7, t8, t10, t12, t14, t15, t16, t17, t20, t21, t24, t89, t112, t114, t119, t...260
(forward)formula 0,1,0.408026,21100,1,0,207,94777,265,108,3062,70876,273
FORMULA HealthRecord-PT-16-CTLCardinality-2024-08 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 : 369/369 places, 487/487 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 335 transition count 445
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 335 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 69 place count 335 transition count 444
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 90 place count 314 transition count 412
Iterating global reduction 1 with 21 rules applied. Total rules applied 111 place count 314 transition count 412
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 113 place count 314 transition count 410
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 126 place count 301 transition count 387
Iterating global reduction 2 with 13 rules applied. Total rules applied 139 place count 301 transition count 387
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 146 place count 294 transition count 375
Iterating global reduction 2 with 7 rules applied. Total rules applied 153 place count 294 transition count 375
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 157 place count 290 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 161 place count 290 transition count 367
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 165 place count 286 transition count 361
Iterating global reduction 2 with 4 rules applied. Total rules applied 169 place count 286 transition count 361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 170 place count 286 transition count 360
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 172 place count 284 transition count 358
Iterating global reduction 3 with 2 rules applied. Total rules applied 174 place count 284 transition count 358
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 175 place count 283 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 176 place count 283 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 283 transition count 356
Applied a total of 177 rules in 26 ms. Remains 283 /369 variables (removed 86) and now considering 356/487 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10991496247096659780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11457283088305447158.kers'
[2026-05-25 19:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10991496247096659780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11457283088305447158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 356 rows 283 cols 825 entries
Finished phase 1 with 267 SingleSign rule and 2 generalized
[2026-05-25 19:41:34] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11457283088305447158.kers
Total runtime 2 ms.
[2026-05-25 19:41:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-25 19:41:34] [INFO ] Invariant cache hit.
[2026-05-25 19:41:34] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2026-05-25 19:41:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/283 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/283 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (OVERLAPS) 356/639 variables, 283/316 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 639/639 variables, and 316 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 355 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/282 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/282 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 2 (OVERLAPS) 1/283 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 19/33 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/283 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 7 (OVERLAPS) 356/639 variables, 283/317 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 355/672 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 7/679 constraints. Problems are: Problem set: 0 solved, 355 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 1/680 constraints. Problems are: Problem set: 0 solved, 355 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 639/639 variables, and 680 constraints, problems are : Problem set: 0 solved, 355 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 283/283 constraints, PredecessorRefiner: 355/355 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 283/369 places, 356/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60285 ms. Remains : 283/369 places, 356/487 transitions.
[2026-05-25 19:42:34] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:42:34] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:42:34] [INFO ] Input system was already deterministic with 356 transitions.
[2026-05-25 19:42:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:42:34] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:42:34] [INFO ] Time to serialize gal into /tmp/CTLCardinality6861089605953771575.gal : 1 ms
[2026-05-25 19:42:34] [INFO ] Time to serialize properties into /tmp/CTLCardinality1275012344690915376.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/CTLCardinality6861089605953771575.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1275012344690915376.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,1.44695e+11,2.12104,71820,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...638
Detected timeout of ITS tools.
[2026-05-25 19:43:04] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:43:04] [INFO ] Applying decomposition
[2026-05-25 19:43:04] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14276349320547580217.txt' '-o' '/tmp/graph14276349320547580217.bin' '-w' '/tmp/graph14276349320547580217.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14276349320547580217.bin' '-l' '-1' '-v' '-w' '/tmp/graph14276349320547580217.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:43:04] [INFO ] Decomposing Gal with order
[2026-05-25 19:43:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:43:04] [INFO ] Removed a total of 99 redundant transitions.
[2026-05-25 19:43:04] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:43:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 5 ms.
[2026-05-25 19:43:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality3000947605562562912.gal : 3 ms
[2026-05-25 19:43:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality17813905387094996736.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/CTLCardinality3000947605562562912.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17813905387094996736.ctl'

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 -...263
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.44695e+11,1.17283,38076,1502,93,56471,2357,711,123874,118,10471,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t321, i1.i0.u4.t267, i1.i0.u4.t269, i1.i0.u4.t270, i1.i0.u4.t276, i1.i0.u4.t277, i1.i0.u4.t27...1274
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 337 transition count 447
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 337 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 337 transition count 446
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 84 place count 318 transition count 418
Iterating global reduction 1 with 19 rules applied. Total rules applied 103 place count 318 transition count 418
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 105 place count 318 transition count 416
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 117 place count 306 transition count 395
Iterating global reduction 2 with 12 rules applied. Total rules applied 129 place count 306 transition count 395
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 135 place count 300 transition count 384
Iterating global reduction 2 with 6 rules applied. Total rules applied 141 place count 300 transition count 384
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 297 transition count 378
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 297 transition count 378
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 150 place count 294 transition count 373
Iterating global reduction 2 with 3 rules applied. Total rules applied 153 place count 294 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 154 place count 294 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 155 place count 293 transition count 371
Iterating global reduction 3 with 1 rules applied. Total rules applied 156 place count 293 transition count 371
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 157 place count 292 transition count 370
Iterating global reduction 3 with 1 rules applied. Total rules applied 158 place count 292 transition count 370
Applied a total of 158 rules in 28 ms. Remains 292 /369 variables (removed 77) and now considering 370/487 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7647156812723465438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9196469956754380869.kers'
[2026-05-25 19:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7647156812723465438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9196469956754380869.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 292 cols 857 entries
Finished phase 1 with 276 SingleSign rule and 2 generalized
[2026-05-25 19:43:34] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9196469956754380869.kers
Total runtime 5 ms.
[2026-05-25 19:43:34] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 19:43:34] [INFO ] Invariant cache hit.
[2026-05-25 19:43:35] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2026-05-25 19:43:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/292 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 370/662 variables, 292/334 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 662/662 variables, and 334 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 369 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/292 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 4/46 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 8 (OVERLAPS) 370/662 variables, 292/346 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/662 variables, 369/715 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/662 variables, 1/716 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 662/662 variables, and 716 constraints, problems are : Problem set: 0 solved, 369 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 369 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 292/369 places, 370/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60314 ms. Remains : 292/369 places, 370/487 transitions.
[2026-05-25 19:44:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:44:35] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:44:35] [INFO ] Input system was already deterministic with 370 transitions.
[2026-05-25 19:44:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:44:35] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:44:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality14929404881261143197.gal : 2 ms
[2026-05-25 19:44:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality2953782129343151683.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/CTLCardinality14929404881261143197.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2953782129343151683.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.8337e+11,3.3789,114160,2,13191,5,306714,6,0,1540,738610,0


Converting to forward existential form...Done !
original formula: ((AG(A(!(AG(((p72==0)||(p288==1)))) U AX(AG((p139==1))))) * EG((p115==0))) * AX((p214==0)))
=> equivalent forward existential formula: ((([(FwdU(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(!(E(TRUE U !((p139==1))))))))) * !(!(!(E(TRUE U !(((p72==0)||(p288==...348
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t36, t39, t40, t41, t44...718
Detected timeout of ITS tools.
[2026-05-25 19:45:05] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:45:05] [INFO ] Applying decomposition
[2026-05-25 19:45:05] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5200006638673428573.txt' '-o' '/tmp/graph5200006638673428573.bin' '-w' '/tmp/graph5200006638673428573.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5200006638673428573.bin' '-l' '-1' '-v' '-w' '/tmp/graph5200006638673428573.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:45:05] [INFO ] Decomposing Gal with order
[2026-05-25 19:45:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:45:05] [INFO ] Removed a total of 92 redundant transitions.
[2026-05-25 19:45:05] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:45:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 6 ms.
[2026-05-25 19:45:05] [INFO ] Time to serialize gal into /tmp/CTLCardinality16862145060255124312.gal : 3 ms
[2026-05-25 19:45:05] [INFO ] Time to serialize properties into /tmp/CTLCardinality4594348678342520655.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/CTLCardinality16862145060255124312.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4594348678342520655.ctl'

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 -...263
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.8337e+11,1.37503,44716,1692,230,66224,5530,737,145040,168,18999,0


Converting to forward existential form...Done !
original formula: ((AG(A(!(AG(((i2.i0.u11.p72==0)||(i17.u84.p288==1)))) U AX(AG((i10.i0.u34.p139==1))))) * EG((i6.i1.u27.p115==0))) * AX((u60.p214==0)))
=> equivalent forward existential formula: ((([(FwdU(EY((FwdU(FwdU(Init,TRUE),!(!(EX(!(!(E(TRUE U !((i10.i0.u34.p139==1))))))))) * !(!(!(E(TRUE U !(((i2.i0...413
Reverse transition relation is NOT exact ! Due to transitions t168, t317, t318, t319, t320, t321, t333, t350, u60.t160, i2.i0.t275, i2.i0.t277, i2.i0.t306,...1440
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,9.05835,249124,1,0,506207,12403,5297,605878,893,41977,985883
FORMULA HealthRecord-PT-16-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 338 transition count 448
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 338 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 338 transition count 447
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 80 place count 321 transition count 421
Iterating global reduction 1 with 17 rules applied. Total rules applied 97 place count 321 transition count 421
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 321 transition count 419
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 108 place count 312 transition count 403
Iterating global reduction 2 with 9 rules applied. Total rules applied 117 place count 312 transition count 403
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 122 place count 307 transition count 395
Iterating global reduction 2 with 5 rules applied. Total rules applied 127 place count 307 transition count 395
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 130 place count 304 transition count 390
Iterating global reduction 2 with 3 rules applied. Total rules applied 133 place count 304 transition count 390
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 136 place count 301 transition count 385
Iterating global reduction 2 with 3 rules applied. Total rules applied 139 place count 301 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 140 place count 301 transition count 384
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 142 place count 299 transition count 382
Iterating global reduction 3 with 2 rules applied. Total rules applied 144 place count 299 transition count 382
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 145 place count 298 transition count 381
Iterating global reduction 3 with 1 rules applied. Total rules applied 146 place count 298 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 147 place count 298 transition count 380
Applied a total of 147 rules in 25 ms. Remains 298 /369 variables (removed 71) and now considering 380/487 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7437526901195608654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12980531797391657156.kers'
[2026-05-25 19:45:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7437526901195608654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12980531797391657156.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 380 rows 298 cols 881 entries
Finished phase 1 with 282 SingleSign rule and 2 generalized
[2026-05-25 19:45:14] [INFO ] Computed 14 invariants in 3 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12980531797391657156.kers
Total runtime 5 ms.
[2026-05-25 19:45:14] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 19:45:14] [INFO ] Invariant cache hit.
[2026-05-25 19:45:14] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 379 sub problems to find dead transitions.
[2026-05-25 19:45:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/298 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 3/45 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (OVERLAPS) 380/678 variables, 298/343 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/678 variables, and 343 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 379 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 2 (OVERLAPS) 1/298 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 7 (OVERLAPS) 380/678 variables, 298/344 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/678 variables, 379/723 constraints. Problems are: Problem set: 0 solved, 379 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/678 variables, 5/728 constraints. Problems are: Problem set: 0 solved, 379 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 678/678 variables, and 730 constraints, problems are : Problem set: 0 solved, 379 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 379/379 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 379 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 298/369 places, 380/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60318 ms. Remains : 298/369 places, 380/487 transitions.
[2026-05-25 19:46:14] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:46:14] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:46:14] [INFO ] Input system was already deterministic with 380 transitions.
[2026-05-25 19:46:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:14] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:14] [INFO ] Time to serialize gal into /tmp/CTLCardinality6190989380615387470.gal : 1 ms
[2026-05-25 19:46:14] [INFO ] Time to serialize properties into /tmp/CTLCardinality1763767974518881414.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/CTLCardinality6190989380615387470.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1763767974518881414.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,1.98462e+11,6.8656,206256,2,20574,5,577981,6,0,1574,1.40239e+06,0


Converting to forward existential form...Done !
original formula: AF(((((p317==0)||(p324==1)) * (!(E(EF((p301==1)) U A((p306==1) U (p202==1)))) + EG(EX(TRUE)))) * (EG(((p202==0)&&(p1==1))) + (p36==0))))
=> equivalent forward existential formula: [FwdG(Init,!(((((p317==0)||(p324==1)) * (!(E(E(TRUE U (p301==1)) U !((E(!((p202==1)) U (!((p306==1)) * !((p202==...252
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t35, t36, t37, t38, t41, t42, t43...773
Detected timeout of ITS tools.
[2026-05-25 19:46:44] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:46:44] [INFO ] Applying decomposition
[2026-05-25 19:46:44] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3655832198517443614.txt' '-o' '/tmp/graph3655832198517443614.bin' '-w' '/tmp/graph3655832198517443614.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3655832198517443614.bin' '-l' '-1' '-v' '-w' '/tmp/graph3655832198517443614.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:46:44] [INFO ] Decomposing Gal with order
[2026-05-25 19:46:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:46:44] [INFO ] Removed a total of 114 redundant transitions.
[2026-05-25 19:46:44] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:46:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2026-05-25 19:46:44] [INFO ] Time to serialize gal into /tmp/CTLCardinality8359213354118557663.gal : 3 ms
[2026-05-25 19:46:44] [INFO ] Time to serialize properties into /tmp/CTLCardinality12064189229208157321.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/CTLCardinality8359213354118557663.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12064189229208157321.ctl'

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 -...263
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.98462e+11,1.20769,47220,1639,116,76753,1106,824,178766,103,5031,0


Converting to forward existential form...Done !
original formula: AF(((((i15.i1.u87.p317==0)||(i15.i1.u85.p324==1)) * (!(E(EF((i15.i0.u86.p301==1)) U A((i15.i1.u85.p306==1) U (i9.i1.u56.p202==1)))) + EG(...237
=> equivalent forward existential formula: [FwdG(Init,!(((((i15.i1.u87.p317==0)||(i15.i1.u85.p324==1)) * (!(E(E(TRUE U (i15.i0.u86.p301==1)) U !((E(!((i9.i...355
Reverse transition relation is NOT exact ! Due to transitions t145, t178, t325, t326, t327, t328, t329, t341, i1.i1.t281, i1.i1.t290, i1.i1.t294, i1.i1.t29...1561
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,1,8.97701,287760,1,0,547945,2808,5489,1.00817e+06,477,7811,747544
FORMULA HealthRecord-PT-16-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 339 transition count 450
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 339 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 339 transition count 449
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 79 place count 321 transition count 423
Iterating global reduction 1 with 18 rules applied. Total rules applied 97 place count 321 transition count 423
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 99 place count 321 transition count 421
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 110 place count 310 transition count 401
Iterating global reduction 2 with 11 rules applied. Total rules applied 121 place count 310 transition count 401
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 126 place count 305 transition count 393
Iterating global reduction 2 with 5 rules applied. Total rules applied 131 place count 305 transition count 393
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 134 place count 302 transition count 387
Iterating global reduction 2 with 3 rules applied. Total rules applied 137 place count 302 transition count 387
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 140 place count 299 transition count 383
Iterating global reduction 2 with 3 rules applied. Total rules applied 143 place count 299 transition count 383
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 145 place count 297 transition count 381
Iterating global reduction 2 with 2 rules applied. Total rules applied 147 place count 297 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 148 place count 296 transition count 380
Iterating global reduction 2 with 1 rules applied. Total rules applied 149 place count 296 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 150 place count 296 transition count 379
Applied a total of 150 rules in 30 ms. Remains 296 /369 variables (removed 73) and now considering 379/487 (removed 108) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-813501460350144661.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5721416622914383217.kers'
[2026-05-25 19:46:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-813501460350144661.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5721416622914383217.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 296 cols 879 entries
Finished phase 1 with 280 SingleSign rule and 2 generalized
[2026-05-25 19:46:53] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5721416622914383217.kers
Total runtime 6 ms.
[2026-05-25 19:46:54] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 19:46:54] [INFO ] Invariant cache hit.
[2026-05-25 19:46:54] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-25 19:46:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/296 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 4/32 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (OVERLAPS) 379/675 variables, 296/338 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/675 variables, and 338 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 378 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/295 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/295 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/296 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/296 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 28/42 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/296 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/296 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (OVERLAPS) 379/675 variables, 296/343 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/675 variables, 378/721 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/675 variables, 2/723 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/675 variables, and 723 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 296/296 constraints, PredecessorRefiner: 378/378 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60053ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60054ms
Starting structural reductions in LTL mode, iteration 1 : 296/369 places, 379/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60315 ms. Remains : 296/369 places, 379/487 transitions.
[2026-05-25 19:47:54] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:47:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:54] [INFO ] Input system was already deterministic with 379 transitions.
[2026-05-25 19:47:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality7840863759619521125.gal : 2 ms
[2026-05-25 19:47:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13976366892993619293.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/CTLCardinality7840863759619521125.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13976366892993619293.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.86064e+11,4.07698,125656,2,14580,5,340991,6,0,1565,844013,0


Converting to forward existential form...Done !
original formula: EG(((!(A(!(((p163==1)||(p335==1))) U E(((p50==0)||(p277==1)) U ((p76==0)&&(p196==0))))) + AF(AX(((p313==0)&&(p433==1))))) + (!(E((p161==1...193
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(E(((p50==0)||(p277==1)) U ((p76==0)&&(p196==0)))) U (!(!(((p163==1)||(p335==1)))) * !(E(((...391
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t27, t30, t32, t33, t34, t36, t37, t38, t39, t42, t43...775
Detected timeout of ITS tools.
[2026-05-25 19:48:24] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:48:24] [INFO ] Applying decomposition
[2026-05-25 19:48:24] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph6826388384719083933.txt' '-o' '/tmp/graph6826388384719083933.bin' '-w' '/tmp/graph6826388384719083933.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6826388384719083933.bin' '-l' '-1' '-v' '-w' '/tmp/graph6826388384719083933.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:48:24] [INFO ] Decomposing Gal with order
[2026-05-25 19:48:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:48:24] [INFO ] Removed a total of 115 redundant transitions.
[2026-05-25 19:48:24] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:48:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 30 labels/synchronizations in 4 ms.
[2026-05-25 19:48:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality12881746892933518449.gal : 3 ms
[2026-05-25 19:48:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality2303668853291201317.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/CTLCardinality12881746892933518449.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2303668853291201317.ctl'

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 -...263
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.86064e+11,2.36956,74700,2356,161,112952,1572,775,302231,112,8040,0


Converting to forward existential form...Done !
original formula: EG(((!(A(!(((i6.i0.u40.p163==1)||(i15.u88.p335==1))) U E(((i2.i0.u8.p50==0)||(i13.i2.u80.p277==1)) U ((i3.i1.u112.p76==0)&&(i7.i1.u53.p19...300
=> equivalent forward existential formula: [FwdG(Init,((!(!((E(!(E(((i2.i0.u8.p50==0)||(i13.i2.u80.p277==1)) U ((i3.i1.u112.p76==0)&&(i7.i1.u53.p196==0))))...580
Reverse transition relation is NOT exact ! Due to transitions t12, t146, t179, t313, t324, t325, t326, t327, t328, t340, t341, t345, t360, t362, i2.i0.t282...1415
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found a local SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
(forward)formula 0,0,26.0847,674052,1,0,1.11091e+06,6997,5424,2.49541e+06,526,25952,1518017
FORMULA HealthRecord-PT-16-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 369/369 places, 487/487 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 336 transition count 447
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 336 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 336 transition count 446
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 88 place count 315 transition count 414
Iterating global reduction 1 with 21 rules applied. Total rules applied 109 place count 315 transition count 414
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 315 transition count 412
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 124 place count 302 transition count 389
Iterating global reduction 2 with 13 rules applied. Total rules applied 137 place count 302 transition count 389
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 144 place count 295 transition count 377
Iterating global reduction 2 with 7 rules applied. Total rules applied 151 place count 295 transition count 377
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 155 place count 291 transition count 369
Iterating global reduction 2 with 4 rules applied. Total rules applied 159 place count 291 transition count 369
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 163 place count 287 transition count 363
Iterating global reduction 2 with 4 rules applied. Total rules applied 167 place count 287 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 168 place count 287 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 170 place count 285 transition count 360
Iterating global reduction 3 with 2 rules applied. Total rules applied 172 place count 285 transition count 360
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 173 place count 284 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 174 place count 284 transition count 359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 284 transition count 358
Applied a total of 175 rules in 27 ms. Remains 284 /369 variables (removed 85) and now considering 358/487 (removed 129) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4042574588742327393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16331189962746749176.kers'
[2026-05-25 19:48:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4042574588742327393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16331189962746749176.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 358 rows 284 cols 829 entries
Finished phase 1 with 268 SingleSign rule and 2 generalized
[2026-05-25 19:48:50] [INFO ] Computed 14 invariants in 5 ms
Computed 14 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16331189962746749176.kers
Total runtime 6 ms.
[2026-05-25 19:48:50] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 19:48:50] [INFO ] Invariant cache hit.
[2026-05-25 19:48:50] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2026-05-25 19:48:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 8/22 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 358/642 variables, 284/311 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 311 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 357 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/283 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/283 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 2 (OVERLAPS) 1/284 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/284 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 11 (OVERLAPS) 358/642 variables, 284/321 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 357/678 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/642 variables, 8/686 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 642/642 variables, and 686 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 284/284 constraints, PredecessorRefiner: 357/357 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 284/369 places, 358/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60328 ms. Remains : 284/369 places, 358/487 transitions.
[2026-05-25 19:49:50] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:49:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:50] [INFO ] Input system was already deterministic with 358 transitions.
[2026-05-25 19:49:50] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:50] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:49:50] [INFO ] Time to serialize gal into /tmp/CTLCardinality15865088199351133416.gal : 1 ms
[2026-05-25 19:49:50] [INFO ] Time to serialize properties into /tmp/CTLCardinality2440217811502751239.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/CTLCardinality15865088199351133416.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2440217811502751239.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.49056e+11,2.31693,76276,2,9683,5,215931,6,0,1496,475878,0


Converting to forward existential form...Done !
original formula: EF(((p217==0) * EX((p266==1))))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p217==0))) * (p266==1))] != FALSE
(forward)formula 0,1,2.48715,76276,1,0,10,215931,9,2,2373,475878,3
FORMULA HealthRecord-PT-16-CTLCardinality-2024-13 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 : 369/369 places, 487/487 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 339 transition count 450
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 339 transition count 450
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 339 transition count 449
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 80 place count 320 transition count 419
Iterating global reduction 1 with 19 rules applied. Total rules applied 99 place count 320 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 100 place count 320 transition count 418
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 112 place count 308 transition count 396
Iterating global reduction 2 with 12 rules applied. Total rules applied 124 place count 308 transition count 396
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 129 place count 303 transition count 387
Iterating global reduction 2 with 5 rules applied. Total rules applied 134 place count 303 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 136 place count 301 transition count 383
Iterating global reduction 2 with 2 rules applied. Total rules applied 138 place count 301 transition count 383
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 140 place count 299 transition count 380
Iterating global reduction 2 with 2 rules applied. Total rules applied 142 place count 299 transition count 380
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 143 place count 299 transition count 379
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 144 place count 298 transition count 378
Iterating global reduction 3 with 1 rules applied. Total rules applied 145 place count 298 transition count 378
Applied a total of 145 rules in 27 ms. Remains 298 /369 variables (removed 71) and now considering 378/487 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13187446529387358836.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14435524565990743158.kers'
[2026-05-25 19:49:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13187446529387358836.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14435524565990743158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 378 rows 298 cols 875 entries
Finished phase 1 with 282 SingleSign rule and 2 generalized
[2026-05-25 19:49:53] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14435524565990743158.kers
Total runtime 3 ms.
[2026-05-25 19:49:53] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 19:49:53] [INFO ] Invariant cache hit.
[2026-05-25 19:49:53] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
Running 377 sub problems to find dead transitions.
[2026-05-25 19:49:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/298 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (OVERLAPS) 378/676 variables, 298/333 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/676 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 333 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 377 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 2 (OVERLAPS) 1/298 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/298 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/298 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/298 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 10 (OVERLAPS) 378/676 variables, 298/343 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/676 variables, 377/720 constraints. Problems are: Problem set: 0 solved, 377 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 3/723 constraints. Problems are: Problem set: 0 solved, 377 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/676 variables, and 723 constraints, problems are : Problem set: 0 solved, 377 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 298/298 constraints, PredecessorRefiner: 377/377 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 377 unsolved
Search for dead transitions found 0 dead transitions in 60050ms
Starting structural reductions in LTL mode, iteration 1 : 298/369 places, 378/487 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60296 ms. Remains : 298/369 places, 378/487 transitions.
[2026-05-25 19:50:53] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:50:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:50:53] [INFO ] Input system was already deterministic with 378 transitions.
[2026-05-25 19:50:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:50:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:50:53] [INFO ] Time to serialize gal into /tmp/CTLCardinality11224613154535293970.gal : 1 ms
[2026-05-25 19:50:53] [INFO ] Time to serialize properties into /tmp/CTLCardinality7963964456764898304.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/CTLCardinality11224613154535293970.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7963964456764898304.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,2.06854e+11,2.97093,96644,2,11590,5,267542,6,0,1572,608032,0


Converting to forward existential form...Done !
original formula: AF((AX(EG((p97==1))) + ((AX(FALSE) * (p276==1)) * (((AF(((p378!=0)&&(p191!=1))) + (p56!=1)) + ((p175==1) + (!(E((p439==1) U (p68==1))) * ...199
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG((p97==1))))) + ((!(EX(!(FALSE))) * (p276==1)) * (((!(EG(!(((p378!=0)&&(p191!=1))))) + (p...262
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t34, t35, t36, t39, t40, t41, t44, t49...685
Detected timeout of ITS tools.
[2026-05-25 19:51:23] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:51:23] [INFO ] Applying decomposition
[2026-05-25 19:51:23] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15098595497685984710.txt' '-o' '/tmp/graph15098595497685984710.bin' '-w' '/tmp/graph15098595497685984710.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15098595497685984710.bin' '-l' '-1' '-v' '-w' '/tmp/graph15098595497685984710.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:51:23] [INFO ] Decomposing Gal with order
[2026-05-25 19:51:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:51:23] [INFO ] Removed a total of 106 redundant transitions.
[2026-05-25 19:51:23] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:51:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2026-05-25 19:51:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality320286346469962285.gal : 2 ms
[2026-05-25 19:51:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality1024544598563003266.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/CTLCardinality320286346469962285.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1024544598563003266.ctl'

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 -...261
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.06854e+11,2.34397,61032,1680,123,83738,6016,763,232278,132,29172,0


Converting to forward existential form...Done !
original formula: AF((AX(EG((i10.i0.u17.p97==1))) + ((AX(FALSE) * (i15.i0.u81.p276==1)) * (((AF(((i20.i1.u112.p378!=0)&&(i11.i0.u50.p191!=1))) + (i2.i2.u8....308
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG((i10.i0.u17.p97==1))))) + ((!(EX(!(FALSE))) * (i15.i0.u81.p276==1)) * (((!(EG(!(((i20.i1...371
Reverse transition relation is NOT exact ! Due to transitions t86, t166, t340, u60.t158, i2.t289, i2.i0.u11.t272, i2.i0.u11.t274, i2.i0.u11.t275, i2.i0.u11...1397
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
Fast SCC detection found an SCC at level 21
Detected timeout of ITS tools.
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:51:53] [INFO ] Applying decomposition
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph68500027078955179.txt' '-o' '/tmp/graph68500027078955179.bin' '-w' '/tmp/graph68500027078955179.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph68500027078955179.bin' '-l' '-1' '-v' '-w' '/tmp/graph68500027078955179.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:51:54] [INFO ] Decomposing Gal with order
[2026-05-25 19:51:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:51:54] [INFO ] Removed a total of 132 redundant transitions.
[2026-05-25 19:51:54] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:51:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 3 ms.
[2026-05-25 19:51:54] [INFO ] Time to serialize gal into /tmp/CTLCardinality1296992595490988893.gal : 3 ms
[2026-05-25 19:51:54] [INFO ] Time to serialize properties into /tmp/CTLCardinality13480426147641192242.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/CTLCardinality1296992595490988893.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13480426147641192242.ctl'

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 -...263
No direction supplied, using forward translation only.
Parsed 2 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,7.42163e+11,7.7864,254920,2988,875,370618,33187,994,1.21143e+06,259,250173,0


Converting to forward existential form...Done !
original formula: AF(AX(FALSE))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(FALSE)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t275, t433, t434, t435, t436, u66.t227, i0.i4.t347, i0.i4.t367, i0.i4.t368, i0.i4.t370, i0.i4...2140
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Fast SCC detection found an SCC at level 18
Fast SCC detection found an SCC at level 19
(forward)formula 0,0,657.948,3613012,1,0,4.90122e+06,65998,2034,1.0686e+07,639,428617,770922
FORMULA HealthRecord-PT-16-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

original formula: AF((AX(EG((i2.i1.u23.p97==1))) + ((AX(FALSE) * (i13.i2.u77.p276==1)) * (((AF(((i18.i1.u123.p378!=0)&&(i8.i1.u55.p191!=1))) + (i0.i4.u14.p...308
=> equivalent forward existential formula: [FwdG(Init,!((!(EX(!(EG((i2.i1.u23.p97==1))))) + ((!(EX(!(FALSE))) * (i13.i2.u77.p276==1)) * (((!(EG(!(((i18.i1....371
(forward)formula 1,0,665.672,3613176,1,0,4.90122e+06,86475,3213,1.0686e+07,782,429894,1260958
FORMULA HealthRecord-PT-16-CTLCardinality-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1721622 ms.

BK_STOP 1779739380827

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="CTLCardinality"
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-16, examination is CTLCardinality"
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-177961074300657"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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