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-177961074300658.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 CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074300658
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-01
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-02
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-03
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-04
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-05
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-06
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-07
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-08
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-09
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-10
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-11
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-12
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-13
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-14
FORMULA_NAME HealthRecord-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779737724119

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HealthRecord-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-25 19:35:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 19:35:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 19:35:25] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2026-05-25 19:35:25] [INFO ] Transformed 453 places.
[2026-05-25 19:35:25] [INFO ] Transformed 594 transitions.
[2026-05-25 19:35:25] [INFO ] Found NUPN structural information;
[2026-05-25 19:35:25] [INFO ] Parsed PT model containing 453 places and 594 transitions and 1333 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 98 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 594/594 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 389 transition count 524
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 389 transition count 524
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 150 place count 367 transition count 497
Iterating global reduction 0 with 22 rules applied. Total rules applied 172 place count 367 transition count 497
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 173 place count 367 transition count 496
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 184 place count 356 transition count 477
Iterating global reduction 1 with 11 rules applied. Total rules applied 195 place count 356 transition count 477
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 198 place count 353 transition count 473
Iterating global reduction 1 with 3 rules applied. Total rules applied 201 place count 353 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 202 place count 352 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 203 place count 352 transition count 470
Applied a total of 203 rules in 117 ms. Remains 352 /453 variables (removed 101) and now considering 470/594 (removed 124) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12732382199254790486.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14025270581495539724.kers'
[2026-05-25 19:35:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12732382199254790486.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14025270581495539724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 470 rows 352 cols 1083 entries
Finished phase 1 with 336 SingleSign rule and 2 generalized
[2026-05-25 19:35:25] [INFO ] Computed 14 invariants in 2 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14025270581495539724.kers
Total runtime 3 ms.
[2026-05-25 19:35:25] [INFO ] Implicit Places using invariants in 313 ms returned []
[2026-05-25 19:35:25] [INFO ] Invariant cache hit.
[2026-05-25 19:35:26] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
Running 469 sub problems to find dead transitions.
[2026-05-25 19:35:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/351 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/351 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 2 (OVERLAPS) 1/352 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/352 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 469 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 10/44 constraints. Problems are: Problem set: 0 solved, 469 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 469 unsolved
SMT process timed out in 30128ms, After SMT, problems are : Problem set: 0 solved, 469 unsolved
Search for dead transitions found 0 dead transitions in 30141ms
Starting structural reductions in LTL mode, iteration 1 : 352/453 places, 470/594 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30914 ms. Remains : 352/453 places, 470/594 transitions.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Applied a total of 0 rules in 4 ms. Remains 352 /352 variables (removed 0) and now considering 470/470 (removed 0) transitions.
[2026-05-25 19:35:56] [INFO ] Invariant cache hit.
[2026-05-25 19:35:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 19:35:56] [INFO ] Invariant cache hit.
[2026-05-25 19:35:56] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 352/352 places, 470/470 transitions.
Support contains 98 out of 352 places after structural reductions.
[2026-05-25 19:35:56] [INFO ] Flatten gal took : 51 ms
[2026-05-25 19:35:57] [INFO ] Flatten gal took : 22 ms
[2026-05-25 19:35:57] [INFO ] Input system was already deterministic with 470 transitions.
RANDOM walk for 40000 steps (383 resets) in 2025 ms. (19 steps per ms) remains 46/75 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 46/46 properties
[2026-05-25 19:35:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (OVERLAPS) 231/294 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 58/352 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Problem AtomicPropp34 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/352 variables, 13/27 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 5/32 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/33 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 2/35 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/35 constraints. Problems are: Problem set: 1 solved, 45 unsolved
SMT process timed out in 5015ms, After SMT, problems are : Problem set: 1 solved, 45 unsolved
Fused 45 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 59 out of 352 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 352/352 places, 470/470 transitions.
Graph (trivial) has 300 edges and 352 vertex of which 42 / 352 are part of one of the 15 SCC in 6 ms
Free SCC test removed 27 places
Drop transitions (Empty/Sink Transition effects.) removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Graph (complete) has 656 edges and 325 vertex of which 318 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 106 place count 318 transition count 321
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 113 rules applied. Total rules applied 219 place count 214 transition count 312
Reduce places removed 4 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 231 place count 210 transition count 304
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 14 rules applied. Total rules applied 245 place count 202 transition count 298
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 248 place count 199 transition count 298
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 248 place count 199 transition count 290
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 264 place count 191 transition count 290
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 269 place count 186 transition count 280
Iterating global reduction 5 with 5 rules applied. Total rules applied 274 place count 186 transition count 280
Performed 35 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 344 place count 151 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 345 place count 151 transition count 241
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 150 transition count 239
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 150 transition count 239
Performed 10 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 367 place count 140 transition count 300
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 381 place count 140 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 383 place count 139 transition count 298
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 385 place count 139 transition count 296
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 386 place count 138 transition count 295
Iterating global reduction 7 with 1 rules applied. Total rules applied 387 place count 138 transition count 295
Free-agglomeration rule applied 6 times.
Iterating global reduction 7 with 6 rules applied. Total rules applied 393 place count 138 transition count 289
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 399 place count 132 transition count 289
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 400 place count 132 transition count 288
Partial Free-agglomeration rule applied 22 times.
Drop transitions (Partial Free agglomeration) removed 22 transitions
Iterating global reduction 8 with 22 rules applied. Total rules applied 422 place count 132 transition count 288
Applied a total of 422 rules in 98 ms. Remains 132 /352 variables (removed 220) and now considering 288/470 (removed 182) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 132/352 places, 288/470 transitions.
RANDOM walk for 40000 steps (2442 resets) in 746 ms. (53 steps per ms) remains 29/45 properties
BEST_FIRST walk for 4002 steps (37 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (34 resets) in 43 ms. (91 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (34 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (39 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (38 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (36 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (39 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (29 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (35 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (40 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (35 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (35 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (34 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (36 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (36 resets) in 13 ms. (286 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (36 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (37 resets) in 10 ms. (363 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (37 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
[2026-05-25 19:36:03] [INFO ] Flow matrix only has 282 transitions (discarded 6 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3494254043249603980.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11681486292209817727.kers'
[2026-05-25 19:36:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3494254043249603980.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11681486292209817727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 282 rows 132 cols 1010 entries
Finished phase 1 with 125 SingleSign rule and 0 generalized
[2026-05-25 19:36:03] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11681486292209817727.kers
Total runtime 1 ms.
[2026-05-25 19:36:03] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 93/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 282/414 variables, 132/153 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 9/162 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 0/414 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 414/414 variables, and 163 constraints, problems are : Problem set: 0 solved, 29 unsolved in 3001 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 93/132 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (OVERLAPS) 282/414 variables, 132/155 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 9/164 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 29/193 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/414 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/414 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 0/414 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 414/414 variables, and 196 constraints, problems are : Problem set: 0 solved, 29 unsolved in 4946 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 132/132 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7975ms problems are : Problem set: 0 solved, 29 unsolved
Fused 29 Parikh solutions to 28 different solutions.
Parikh walk visited 12 properties in 839 ms.
Support contains 25 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 288/288 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 0 with 7 rules applied. Total rules applied 7 place count 132 transition count 281
Reduce places removed 7 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 10 rules applied. Total rules applied 17 place count 125 transition count 278
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 20 place count 122 transition count 278
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 122 transition count 276
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 120 transition count 276
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 32 place count 112 transition count 259
Iterating global reduction 3 with 8 rules applied. Total rules applied 40 place count 112 transition count 259
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 58 place count 103 transition count 250
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 60 place count 103 transition count 248
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
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 72 place count 97 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 73 place count 97 transition count 258
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 76 place count 94 transition count 243
Iterating global reduction 5 with 3 rules applied. Total rules applied 79 place count 94 transition count 243
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 80 place count 93 transition count 241
Iterating global reduction 5 with 1 rules applied. Total rules applied 81 place count 93 transition count 241
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 83 place count 93 transition count 239
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 84 place count 92 transition count 234
Iterating global reduction 5 with 1 rules applied. Total rules applied 85 place count 92 transition count 234
Free-agglomeration rule applied 8 times.
Iterating global reduction 5 with 8 rules applied. Total rules applied 93 place count 92 transition count 226
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 14 rules applied. Total rules applied 107 place count 84 transition count 220
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 109 place count 84 transition count 220
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 110 place count 84 transition count 220
Applied a total of 110 rules in 51 ms. Remains 84 /132 variables (removed 48) and now considering 220/288 (removed 68) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 84/132 places, 220/288 transitions.
RANDOM walk for 40000 steps (3145 resets) in 281 ms. (141 steps per ms) remains 12/17 properties
BEST_FIRST walk for 40003 steps (419 resets) in 42 ms. (930 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (392 resets) in 60 ms. (655 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (417 resets) in 57 ms. (689 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (447 resets) in 50 ms. (784 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (342 resets) in 51 ms. (769 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (406 resets) in 57 ms. (689 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (420 resets) in 59 ms. (666 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (420 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (425 resets) in 43 ms. (909 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (417 resets) in 45 ms. (869 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (417 resets) in 35 ms. (1111 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (420 resets) in 55 ms. (714 steps per ms) remains 11/11 properties
[2026-05-25 19:36:12] [INFO ] Flow matrix only has 210 transitions (discarded 10 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11579412891665357358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9394949435996064572.kers'
[2026-05-25 19:36:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11579412891665357358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9394949435996064572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 84 cols 844 entries
Finished phase 1 with 77 SingleSign rule and 0 generalized
[2026-05-25 19:36:12] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9394949435996064572.kers
Total runtime 1 ms.
[2026-05-25 19:36:12] [INFO ] State equation strengthened by 10 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 66/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 210/294 variables, 84/94 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 10/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/294 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 104 constraints, problems are : Problem set: 0 solved, 11 unsolved in 529 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 66/84 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 210/294 variables, 84/98 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 10/108 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/294 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 123 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1574 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 84/84 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 2116ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 10 different solutions.
Parikh walk visited 5 properties in 1173 ms.
Support contains 9 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 220/220 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 0 with 8 rules applied. Total rules applied 8 place count 84 transition count 212
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 76 transition count 212
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 76 transition count 209
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 73 transition count 209
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 28 place count 67 transition count 197
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 67 transition count 197
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 36 place count 65 transition count 191
Iterating global reduction 2 with 2 rules applied. Total rules applied 38 place count 65 transition count 191
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 46 place count 61 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 61 transition count 186
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 60 transition count 183
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 60 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 59 transition count 188
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 59 transition count 187
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 55 place count 59 transition count 184
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 58 place count 56 transition count 184
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 59 place count 56 transition count 184
Applied a total of 59 rules in 32 ms. Remains 56 /84 variables (removed 28) and now considering 184/220 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 56/84 places, 184/220 transitions.
RANDOM walk for 40000 steps (4211 resets) in 716 ms. (55 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (493 resets) in 39 ms. (1000 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (578 resets) in 34 ms. (1142 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (548 resets) in 28 ms. (1379 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (543 resets) in 25 ms. (1538 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (547 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (533 resets) in 24 ms. (1600 steps per ms) remains 6/6 properties
Probably explored full state space saw : 280431 states, properties seen :5
Probabilistic random walk after 1554721 steps, saw 280431 distinct states, run finished after 1822 ms. (steps per millisecond=853 ) properties seen :5
Explored full state space saw : 280431 states, properties seen :0
Exhaustive walk after 1554721 steps, saw 280431 distinct states, run finished after 1583 ms. (steps per millisecond=982 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA HealthRecord-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-25 19:36:19] [INFO ] Flatten gal took : 17 ms
[2026-05-25 19:36:19] [INFO ] Flatten gal took : 16 ms
[2026-05-25 19:36:19] [INFO ] Input system was already deterministic with 470 transitions.
Computed a total of 99 stabilizing places and 112 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Graph (trivial) has 404 edges and 352 vertex of which 46 / 352 are part of one of the 17 SCC in 2 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 131 transitions
Trivial Post-agglo rules discarded 131 transitions
Performed 131 trivial Post agglomeration. Transition count delta: 131
Iterating post reduction 0 with 131 rules applied. Total rules applied 132 place count 322 transition count 306
Reduce places removed 131 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 151 rules applied. Total rules applied 283 place count 191 transition count 286
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 296 place count 181 transition count 283
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 299 place count 178 transition count 283
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 299 place count 178 transition count 276
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 313 place count 171 transition count 276
Discarding 38 places :
Symmetric choice reduction at 4 with 38 rule applications. Total rules 351 place count 133 transition count 207
Iterating global reduction 4 with 38 rules applied. Total rules applied 389 place count 133 transition count 207
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 4 with 3 rules applied. Total rules applied 392 place count 133 transition count 204
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 395 place count 130 transition count 204
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 402 place count 123 transition count 190
Iterating global reduction 6 with 7 rules applied. Total rules applied 409 place count 123 transition count 190
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 410 place count 123 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 411 place count 122 transition count 189
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 414 place count 119 transition count 184
Iterating global reduction 8 with 3 rules applied. Total rules applied 417 place count 119 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 418 place count 119 transition count 183
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 420 place count 117 transition count 180
Iterating global reduction 9 with 2 rules applied. Total rules applied 422 place count 117 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 423 place count 117 transition count 179
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 10 with 24 rules applied. Total rules applied 447 place count 105 transition count 167
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 451 place count 105 transition count 163
Discarding 5 places :
Symmetric choice reduction at 11 with 5 rule applications. Total rules 456 place count 100 transition count 153
Iterating global reduction 11 with 5 rules applied. Total rules applied 461 place count 100 transition count 153
Discarding 4 places :
Symmetric choice reduction at 11 with 4 rule applications. Total rules 465 place count 96 transition count 148
Iterating global reduction 11 with 4 rules applied. Total rules applied 469 place count 96 transition count 148
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 471 place count 94 transition count 145
Iterating global reduction 11 with 2 rules applied. Total rules applied 473 place count 94 transition count 145
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 475 place count 92 transition count 141
Iterating global reduction 11 with 2 rules applied. Total rules applied 477 place count 92 transition count 141
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 479 place count 90 transition count 137
Iterating global reduction 11 with 2 rules applied. Total rules applied 481 place count 90 transition count 137
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 482 place count 89 transition count 135
Iterating global reduction 11 with 1 rules applied. Total rules applied 483 place count 89 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 484 place count 89 transition count 134
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 486 place count 89 transition count 132
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 487 place count 89 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 488 place count 88 transition count 131
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 489 place count 87 transition count 129
Iterating global reduction 14 with 1 rules applied. Total rules applied 490 place count 87 transition count 129
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 491 place count 86 transition count 127
Iterating global reduction 14 with 1 rules applied. Total rules applied 492 place count 86 transition count 127
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 493 place count 85 transition count 126
Iterating global reduction 14 with 1 rules applied. Total rules applied 494 place count 85 transition count 126
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 496 place count 84 transition count 125
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 497 place count 83 transition count 124
Iterating global reduction 14 with 1 rules applied. Total rules applied 498 place count 83 transition count 124
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 500 place count 83 transition count 122
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 500 place count 83 transition count 121
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 502 place count 82 transition count 121
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 14 with 1 rules applied. Total rules applied 503 place count 81 transition count 120
Applied a total of 503 rules in 70 ms. Remains 81 /352 variables (removed 271) and now considering 120/470 (removed 350) transitions.
[2026-05-25 19:36:19] [INFO ] Flow matrix only has 112 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-16694165630063572405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10428628140272970555.kers'
[2026-05-25 19:36:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16694165630063572405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10428628140272970555.kers]
Normalized transition count is 111 out of 112 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 111 rows 81 cols 296 entries
Finished phase 1 with 74 SingleSign rule and 0 generalized
[2026-05-25 19:36:19] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10428628140272970555.kers
Total runtime 1 ms.
[2026-05-25 19:36:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-25 19:36:20] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2026-05-25 19:36:20] [INFO ] Invariant cache hit.
[2026-05-25 19:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:36:20] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2026-05-25 19:36:20] [INFO ] Redundant transitions in 2 ms returned []
Running 107 sub problems to find dead transitions.
[2026-05-25 19:36:20] [INFO ] Flow matrix only has 112 transitions (discarded 8 similar events)
[2026-05-25 19:36:20] [INFO ] Invariant cache hit.
[2026-05-25 19:36:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (OVERLAPS) 7/81 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (OVERLAPS) 111/192 variables, 81/92 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (OVERLAPS) 1/193 variables, 1/93 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/193 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 0/193 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Real declared 193/193 variables, and 93 constraints, problems are : Problem set: 0 solved, 107 unsolved in 5498 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 107 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 3 (OVERLAPS) 7/81 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 7 (OVERLAPS) 111/192 variables, 81/93 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 107/200 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 10 (OVERLAPS) 1/193 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/193 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 107 unsolved
At refinement iteration 12 (OVERLAPS) 0/193 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 107 unsolved
No progress, stopping.
After SMT solving in domain Int declared 193/193 variables, and 201 constraints, problems are : Problem set: 0 solved, 107 unsolved in 7080 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 81/81 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 107/107 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12594ms problems are : Problem set: 0 solved, 107 unsolved
Search for dead transitions found 0 dead transitions in 12594ms
Starting structural reductions in SI_CTL mode, iteration 1 : 81/352 places, 120/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12826 ms. Remains : 81/352 places, 120/470 transitions.
[2026-05-25 19:36:32] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:36:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:36:32] [INFO ] Input system was already deterministic with 120 transitions.
[2026-05-25 19:36:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:36:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:36:32] [INFO ] Time to serialize gal into /tmp/CTLFireability15950672350790401838.gal : 3 ms
[2026-05-25 19:36:32] [INFO ] Time to serialize properties into /tmp/CTLFireability14298383473670346106.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/CTLFireability15950672350790401838.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14298383473670346106.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,3.11869e+07,0.045112,5344,2,771,5,6488,6,0,435,5560,0


Converting to forward existential form...Done !
original formula: AF(EG(!(E(((p423==1)||(p351==1)) U A((p161==1) U (p295==1))))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(E(((p423==1)||(p351==1)) U !((E(!((p295==1)) U (!((p161==1)) * !((p295==1)))) + EG(!((p295==1)...173
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t13, t16, t18, t19, t20, t23, t24, t61, t65, t66, t67, t68,...299
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,1.85075,68912,1,0,525,416906,272,286,2817,400866,646
FORMULA HealthRecord-PT-16-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 326 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 326 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 53 place count 326 transition count 432
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 64 place count 315 transition count 413
Iterating global reduction 1 with 11 rules applied. Total rules applied 75 place count 315 transition count 413
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 82 place count 308 transition count 399
Iterating global reduction 1 with 7 rules applied. Total rules applied 89 place count 308 transition count 399
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 92 place count 305 transition count 394
Iterating global reduction 1 with 3 rules applied. Total rules applied 95 place count 305 transition count 394
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 98 place count 302 transition count 390
Iterating global reduction 1 with 3 rules applied. Total rules applied 101 place count 302 transition count 390
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 104 place count 299 transition count 386
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 299 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 108 place count 299 transition count 385
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 297 transition count 382
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 297 transition count 382
Applied a total of 112 rules in 36 ms. Remains 297 /352 variables (removed 55) and now considering 382/470 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-24826347198785806.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15891505427992245209.kers'
[2026-05-25 19:36:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-24826347198785806.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15891505427992245209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 382 rows 297 cols 887 entries
Finished phase 1 with 281 SingleSign rule and 2 generalized
[2026-05-25 19:36:34] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15891505427992245209.kers
Total runtime 2 ms.
[2026-05-25 19:36:34] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-25 19:36:34] [INFO ] Invariant cache hit.
[2026-05-25 19:36:34] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 381 sub problems to find dead transitions.
[2026-05-25 19:36:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/297 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 9/35 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 9 (OVERLAPS) 382/679 variables, 297/346 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 679/679 variables, and 346 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/297 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 35/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 6 (OVERLAPS) 382/679 variables, 297/346 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/679 variables, 381/727 constraints. Problems are: Problem set: 0 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/679 variables, 6/733 constraints. Problems are: Problem set: 0 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 679/679 variables, and 735 constraints, problems are : Problem set: 0 solved, 381 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 297/297 constraints, PredecessorRefiner: 381/381 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 381 unsolved
Search for dead transitions found 0 dead transitions in 60064ms
Starting structural reductions in LTL mode, iteration 1 : 297/352 places, 382/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60338 ms. Remains : 297/352 places, 382/470 transitions.
[2026-05-25 19:37:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:37:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:37:35] [INFO ] Input system was already deterministic with 382 transitions.
[2026-05-25 19:37:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:37:35] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:37:35] [INFO ] Time to serialize gal into /tmp/CTLFireability16344181456027254001.gal : 5 ms
[2026-05-25 19:37:35] [INFO ] Time to serialize properties into /tmp/CTLFireability15918475747510613766.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/CTLFireability16344181456027254001.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15918475747510613766.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.05878e+11,6.61067,171548,2,18484,5,481008,6,0,1572,1.14331e+06,0


Converting to forward existential form...Done !
original formula: (AX(((p86==1) + A(!(E((p213==1) U (p393==1))) U (((((p415==1)&&(p427==1))&&((p303==1)||(p338==1)))||(p163==1))||((p381==1)||(p109==1)))))...317
=> equivalent forward existential formula: (([(FwdU((FwdU((EY(Init) * !((p86==1))),!((((((p415==1)&&(p427==1))&&((p303==1)||(p338==1)))||(p163==1))||((p381...649
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, t42, t43...785
Detected timeout of ITS tools.
[2026-05-25 19:38:05] [INFO ] Flatten gal took : 14 ms
[2026-05-25 19:38:05] [INFO ] Applying decomposition
[2026-05-25 19:38:05] [INFO ] Flatten gal took : 11 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/graph4294712348906291634.txt' '-o' '/tmp/graph4294712348906291634.bin' '-w' '/tmp/graph4294712348906291634.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4294712348906291634.bin' '-l' '-1' '-v' '-w' '/tmp/graph4294712348906291634.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:38:05] [INFO ] Decomposing Gal with order
[2026-05-25 19:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:38:05] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-25 19:38:05] [INFO ] Flatten gal took : 72 ms
[2026-05-25 19:38:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 13 ms.
[2026-05-25 19:38:05] [INFO ] Time to serialize gal into /tmp/CTLFireability655996118389902407.gal : 6 ms
[2026-05-25 19:38:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13287911507171963723.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/CTLFireability655996118389902407.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13287911507171963723.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,2.05878e+11,0.665061,28988,1400,252,41610,5521,749,106567,139,26288,0


Converting to forward existential form...Done !
original formula: (AX(((i3.u11.p86==1) + A(!(E((i12.u55.p213==1) U (i22.i1.u108.p393==1))) U (((((i22.i0.u101.p415==1)&&(i22.i1.u102.p427==1))&&((i18.i0.u8...531
=> equivalent forward existential formula: (([(FwdU((FwdU((EY(Init) * !((i3.u11.p86==1))),!((((((i22.i0.u101.p415==1)&&(i22.i1.u102.p427==1))&&((i18.i0.u80...1026
Reverse transition relation is NOT exact ! Due to transitions t99, t146, t214, t326, t327, t328, t329, t330, t337, t338, t340, t341, t342, t346, i2.i0.u4.t...1520
(forward)formula 0,0,1.93654,66252,1,0,126847,14958,4949,239853,688,45740,355925
FORMULA HealthRecord-PT-16-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Graph (trivial) has 398 edges and 352 vertex of which 46 / 352 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 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 130 place count 322 transition count 308
Reduce places removed 129 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 147 rules applied. Total rules applied 277 place count 193 transition count 290
Reduce places removed 9 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 13 rules applied. Total rules applied 290 place count 184 transition count 286
Reduce places removed 4 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 6 rules applied. Total rules applied 296 place count 180 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 297 place count 179 transition count 284
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 297 place count 179 transition count 277
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 311 place count 172 transition count 277
Discarding 36 places :
Symmetric choice reduction at 5 with 36 rule applications. Total rules 347 place count 136 transition count 213
Iterating global reduction 5 with 36 rules applied. Total rules applied 383 place count 136 transition count 213
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 386 place count 136 transition count 210
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 389 place count 133 transition count 210
Discarding 7 places :
Symmetric choice reduction at 7 with 7 rule applications. Total rules 396 place count 126 transition count 196
Iterating global reduction 7 with 7 rules applied. Total rules applied 403 place count 126 transition count 196
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 404 place count 126 transition count 195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 405 place count 125 transition count 195
Discarding 3 places :
Symmetric choice reduction at 9 with 3 rule applications. Total rules 408 place count 122 transition count 190
Iterating global reduction 9 with 3 rules applied. Total rules applied 411 place count 122 transition count 190
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 412 place count 122 transition count 189
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 415 place count 119 transition count 184
Iterating global reduction 10 with 3 rules applied. Total rules applied 418 place count 119 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 419 place count 119 transition count 183
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 11 with 24 rules applied. Total rules applied 443 place count 107 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 447 place count 107 transition count 167
Discarding 5 places :
Symmetric choice reduction at 12 with 5 rule applications. Total rules 452 place count 102 transition count 157
Iterating global reduction 12 with 5 rules applied. Total rules applied 457 place count 102 transition count 157
Discarding 4 places :
Symmetric choice reduction at 12 with 4 rule applications. Total rules 461 place count 98 transition count 152
Iterating global reduction 12 with 4 rules applied. Total rules applied 465 place count 98 transition count 152
Discarding 3 places :
Symmetric choice reduction at 12 with 3 rule applications. Total rules 468 place count 95 transition count 148
Iterating global reduction 12 with 3 rules applied. Total rules applied 471 place count 95 transition count 148
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 472 place count 95 transition count 147
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 474 place count 93 transition count 143
Iterating global reduction 13 with 2 rules applied. Total rules applied 476 place count 93 transition count 143
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 478 place count 91 transition count 139
Iterating global reduction 13 with 2 rules applied. Total rules applied 480 place count 91 transition count 139
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 481 place count 90 transition count 137
Iterating global reduction 13 with 1 rules applied. Total rules applied 482 place count 90 transition count 137
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 483 place count 90 transition count 136
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 485 place count 90 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 14 with 1 rules applied. Total rules applied 486 place count 90 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 487 place count 89 transition count 133
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 488 place count 88 transition count 131
Iterating global reduction 16 with 1 rules applied. Total rules applied 489 place count 88 transition count 131
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 490 place count 87 transition count 129
Iterating global reduction 16 with 1 rules applied. Total rules applied 491 place count 87 transition count 129
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 492 place count 86 transition count 128
Iterating global reduction 16 with 1 rules applied. Total rules applied 493 place count 86 transition count 128
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 16 with 2 rules applied. Total rules applied 495 place count 85 transition count 127
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 496 place count 84 transition count 126
Iterating global reduction 16 with 1 rules applied. Total rules applied 497 place count 84 transition count 126
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 16 with 2 rules applied. Total rules applied 499 place count 84 transition count 124
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 16 with 1 rules applied. Total rules applied 500 place count 84 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 17 with 1 rules applied. Total rules applied 501 place count 83 transition count 123
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 18 with 1 rules applied. Total rules applied 502 place count 83 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 18 with 1 rules applied. Total rules applied 503 place count 82 transition count 122
Applied a total of 503 rules in 54 ms. Remains 82 /352 variables (removed 270) and now considering 122/470 (removed 348) transitions.
[2026-05-25 19:38:07] [INFO ] Flow matrix only has 114 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-15034987424415611048.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4083457121012982217.kers'
[2026-05-25 19:38:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15034987424415611048.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4083457121012982217.kers]
Normalized transition count is 113 out of 114 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 113 rows 82 cols 298 entries
Finished phase 1 with 75 SingleSign rule and 0 generalized
[2026-05-25 19:38:07] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4083457121012982217.kers
Total runtime 0 ms.
[2026-05-25 19:38:07] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-25 19:38:07] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
[2026-05-25 19:38:07] [INFO ] Invariant cache hit.
[2026-05-25 19:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:38:07] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2026-05-25 19:38:07] [INFO ] Redundant transitions in 3 ms returned []
Running 110 sub problems to find dead transitions.
[2026-05-25 19:38:07] [INFO ] Flow matrix only has 114 transitions (discarded 8 similar events)
[2026-05-25 19:38:07] [INFO ] Invariant cache hit.
[2026-05-25 19:38:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (OVERLAPS) 7/82 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/82 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 113/195 variables, 82/97 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (OVERLAPS) 1/196 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 98 constraints, problems are : Problem set: 0 solved, 110 unsolved in 5600 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 8/8 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/75 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 3 (OVERLAPS) 7/82 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 7/15 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 7 (OVERLAPS) 113/195 variables, 82/98 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 110/208 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 1/196 variables, 1/209 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/196 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 110 unsolved
At refinement iteration 12 (OVERLAPS) 0/196 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 209 constraints, problems are : Problem set: 0 solved, 110 unsolved in 9743 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 82/82 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 110/110 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15353ms problems are : Problem set: 0 solved, 110 unsolved
Search for dead transitions found 0 dead transitions in 15353ms
Starting structural reductions in SI_CTL mode, iteration 1 : 82/352 places, 122/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15631 ms. Remains : 82/352 places, 122/470 transitions.
[2026-05-25 19:38:23] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:38:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:38:23] [INFO ] Input system was already deterministic with 122 transitions.
[2026-05-25 19:38:23] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:38:23] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:38:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12073411085508803562.gal : 1 ms
[2026-05-25 19:38:23] [INFO ] Time to serialize properties into /tmp/CTLFireability10076122024514220282.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/CTLFireability12073411085508803562.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10076122024514220282.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,3.22611e+07,0.123118,9400,2,1386,5,24634,6,0,440,26622,0


Converting to forward existential form...Done !
original formula: EG((AF((p168==0)) * (AG(((p191==1)||(p202==1))) + AF(((p359==1)||(p411==1))))))
=> equivalent forward existential formula: [FwdG(Init,(!(EG(!((p168==0)))) * (!(E(TRUE U !(((p191==1)||(p202==1))))) + !(EG(!(((p359==1)||(p411==1))))))))]...164
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t15, t17, t19, t21, t23, t41, t42, t44, t45, t57, t58, t66,...345
(forward)formula 0,0,3.06026,113912,1,0,485,667404,275,213,2852,700328,559
FORMULA HealthRecord-PT-16-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 323 transition count 428
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 323 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 323 transition count 426
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 73 place count 310 transition count 406
Iterating global reduction 1 with 13 rules applied. Total rules applied 86 place count 310 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 88 place count 310 transition count 404
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 96 place count 302 transition count 387
Iterating global reduction 2 with 8 rules applied. Total rules applied 104 place count 302 transition count 387
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 107 place count 299 transition count 382
Iterating global reduction 2 with 3 rules applied. Total rules applied 110 place count 299 transition count 382
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 296 transition count 378
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 296 transition count 378
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 294 transition count 375
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 294 transition count 375
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 292 transition count 372
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 292 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 125 place count 291 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 126 place count 291 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 127 place count 291 transition count 369
Applied a total of 127 rules in 34 ms. Remains 291 /352 variables (removed 61) and now considering 369/470 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17992305329885663354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1396705477130319910.kers'
[2026-05-25 19:38:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17992305329885663354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1396705477130319910.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 291 cols 855 entries
Finished phase 1 with 275 SingleSign rule and 2 generalized
[2026-05-25 19:38:26] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1396705477130319910.kers
Total runtime 2 ms.
[2026-05-25 19:38:26] [INFO ] Implicit Places using invariants in 86 ms returned []
[2026-05-25 19:38:26] [INFO ] Invariant cache hit.
[2026-05-25 19:38:26] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 19:38:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/291 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 18/32 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 369/660 variables, 291/328 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/660 variables, 1/329 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 660/660 variables, and 329 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/290 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/290 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/291 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/291 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/291 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/291 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/291 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 369/660 variables, 291/338 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/660 variables, 368/706 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/660 variables, 8/714 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 660/660 variables, and 714 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 291/291 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 60060ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 291/352 places, 369/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60349 ms. Remains : 291/352 places, 369/470 transitions.
[2026-05-25 19:39:26] [INFO ] Flatten gal took : 10 ms
[2026-05-25 19:39:26] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:39:26] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 19:39:26] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:39:26] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:39:26] [INFO ] Time to serialize gal into /tmp/CTLFireability7430887956386858083.gal : 1 ms
[2026-05-25 19:39:26] [INFO ] Time to serialize properties into /tmp/CTLFireability9965484391541643025.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/CTLFireability7430887956386858083.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9965484391541643025.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.85818e+11,3.04227,89524,2,11690,5,249752,6,0,1535,572542,0


Converting to forward existential form...Done !
original formula: AF(AG(((p326==1) + ((EX((p415==1)) * (p374==1)) * (p66==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((p326==1) + ((EX((p415==1)) * (p374==1)) * (p66==1))))))))] = 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...710
(forward)formula 0,0,28.0276,633324,1,0,727,2.09368e+06,766,336,9176,3.47846e+06,885
FORMULA HealthRecord-PT-16-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 322 transition count 427
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 322 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 322 transition count 425
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 77 place count 307 transition count 401
Iterating global reduction 1 with 15 rules applied. Total rules applied 92 place count 307 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 307 transition count 399
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 299 transition count 382
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 112 place count 297 transition count 378
Iterating global reduction 2 with 2 rules applied. Total rules applied 114 place count 297 transition count 378
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 295 transition count 376
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 295 transition count 376
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 119 place count 294 transition count 374
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 294 transition count 374
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 121 place count 293 transition count 372
Iterating global reduction 2 with 1 rules applied. Total rules applied 122 place count 293 transition count 372
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 123 place count 292 transition count 370
Iterating global reduction 2 with 1 rules applied. Total rules applied 124 place count 292 transition count 370
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 125 place count 292 transition count 369
Applied a total of 125 rules in 32 ms. Remains 292 /352 variables (removed 60) and now considering 369/470 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16862800332215010321.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5432241429811126332.kers'
[2026-05-25 19:39:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16862800332215010321.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5432241429811126332.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 369 rows 292 cols 855 entries
Finished phase 1 with 276 SingleSign rule and 2 generalized
[2026-05-25 19:39:54] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5432241429811126332.kers
Total runtime 3 ms.
[2026-05-25 19:39:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 19:39:54] [INFO ] Invariant cache hit.
[2026-05-25 19:39:55] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 368 sub problems to find dead transitions.
[2026-05-25 19:39:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/292 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 10/36 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 369/661 variables, 292/328 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/661 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 661/661 variables, and 328 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/291 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/291 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 1/292 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 22/36 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 5/42 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 11 (OVERLAPS) 369/661 variables, 292/344 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/661 variables, 368/712 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 661/661 variables, and 720 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 292/292 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 8/8 constraints]
After SMT, in 60058ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 60059ms
Starting structural reductions in LTL mode, iteration 1 : 292/352 places, 369/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60346 ms. Remains : 292/352 places, 369/470 transitions.
[2026-05-25 19:40:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:40:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:40:55] [INFO ] Input system was already deterministic with 369 transitions.
[2026-05-25 19:40:55] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:40:55] [INFO ] Flatten gal took : 21 ms
[2026-05-25 19:40:55] [INFO ] Time to serialize gal into /tmp/CTLFireability11420830529333596338.gal : 6 ms
[2026-05-25 19:40:55] [INFO ] Time to serialize properties into /tmp/CTLFireability6646088626822645613.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/CTLFireability11420830529333596338.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6646088626822645613.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.93307e+11,2.71338,73244,2,9441,5,211524,6,0,1539,443639,0


Converting to forward existential form...Done !
original formula: AG(AX(EG(((p427==0)&&(((p24==0)||(p31==0))||(p446==0))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(((p427==0)&&(((p24==0)||(p31==0))||(p446==0))))))] = 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...650
Detected timeout of ITS tools.
[2026-05-25 19:41:25] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:41:25] [INFO ] Applying decomposition
[2026-05-25 19:41:25] [INFO ] Flatten gal took : 28 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/graph12840040189659778102.txt' '-o' '/tmp/graph12840040189659778102.bin' '-w' '/tmp/graph12840040189659778102.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12840040189659778102.bin' '-l' '-1' '-v' '-w' '/tmp/graph12840040189659778102.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:41:25] [INFO ] Decomposing Gal with order
[2026-05-25 19:41:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:41:25] [INFO ] Removed a total of 110 redundant transitions.
[2026-05-25 19:41:25] [INFO ] Flatten gal took : 15 ms
[2026-05-25 19:41:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 6 ms.
[2026-05-25 19:41:25] [INFO ] Time to serialize gal into /tmp/CTLFireability211772852896547027.gal : 4 ms
[2026-05-25 19:41:25] [INFO ] Time to serialize properties into /tmp/CTLFireability13230961748212269957.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/CTLFireability211772852896547027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13230961748212269957.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.93307e+11,0.914053,28768,1291,61,41375,1789,773,92747,99,6192,0


Converting to forward existential form...Done !
original formula: AG(AX(EG(((i19.i1.u104.p427==0)&&(((i1.i1.u6.p24==0)||(i1.i3.u9.p31==0))||(i19.i1.u110.p446==0))))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(EG(((i19.i1.u104.p427==0)&&(((i1.i1.u6.p24==0)||(i1.i3.u9.p31==0))||(i19.i1.u110.p446=...172
Reverse transition relation is NOT exact ! Due to transitions t197, t332, i1.i1.t267, i1.i1.t277, i1.i1.t282, i1.i1.t310, i1.i1.t312, i1.i1.u6.t269, i1.i1....1268
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 an SCC at level 1
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 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,3.47144,104796,1,0,174784,1789,5208,360495,494,6192,480936
FORMULA HealthRecord-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Graph (trivial) has 385 edges and 352 vertex of which 44 / 352 are part of one of the 16 SCC in 1 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 124 transitions
Trivial Post-agglo rules discarded 124 transitions
Performed 124 trivial Post agglomeration. Transition count delta: 124
Iterating post reduction 0 with 124 rules applied. Total rules applied 125 place count 323 transition count 314
Reduce places removed 124 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 138 rules applied. Total rules applied 263 place count 199 transition count 300
Reduce places removed 7 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 2 with 15 rules applied. Total rules applied 278 place count 192 transition count 292
Reduce places removed 8 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 13 rules applied. Total rules applied 291 place count 184 transition count 287
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 293 place count 182 transition count 287
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 293 place count 182 transition count 281
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 305 place count 176 transition count 281
Discarding 31 places :
Symmetric choice reduction at 5 with 31 rule applications. Total rules 336 place count 145 transition count 226
Iterating global reduction 5 with 31 rules applied. Total rules applied 367 place count 145 transition count 226
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 5 with 2 rules applied. Total rules applied 369 place count 145 transition count 224
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 371 place count 143 transition count 224
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 377 place count 137 transition count 212
Iterating global reduction 7 with 6 rules applied. Total rules applied 383 place count 137 transition count 212
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 385 place count 135 transition count 209
Iterating global reduction 7 with 2 rules applied. Total rules applied 387 place count 135 transition count 209
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 388 place count 135 transition count 208
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 389 place count 134 transition count 207
Iterating global reduction 8 with 1 rules applied. Total rules applied 390 place count 134 transition count 207
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 391 place count 134 transition count 206
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 417 place count 121 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 421 place count 121 transition count 189
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 428 place count 114 transition count 175
Iterating global reduction 10 with 7 rules applied. Total rules applied 435 place count 114 transition count 175
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 438 place count 111 transition count 170
Iterating global reduction 10 with 3 rules applied. Total rules applied 441 place count 111 transition count 170
Discarding 3 places :
Symmetric choice reduction at 10 with 3 rule applications. Total rules 444 place count 108 transition count 167
Iterating global reduction 10 with 3 rules applied. Total rules applied 447 place count 108 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 448 place count 108 transition count 166
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 449 place count 107 transition count 164
Iterating global reduction 11 with 1 rules applied. Total rules applied 450 place count 107 transition count 164
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 451 place count 106 transition count 162
Iterating global reduction 11 with 1 rules applied. Total rules applied 452 place count 106 transition count 162
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 453 place count 105 transition count 160
Iterating global reduction 11 with 1 rules applied. Total rules applied 454 place count 105 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 455 place count 105 transition count 159
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 11 with 1 rules applied. Total rules applied 456 place count 105 transition count 158
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 457 place count 104 transition count 158
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 458 place count 103 transition count 156
Iterating global reduction 13 with 1 rules applied. Total rules applied 459 place count 103 transition count 156
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 460 place count 102 transition count 154
Iterating global reduction 13 with 1 rules applied. Total rules applied 461 place count 102 transition count 154
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 462 place count 102 transition count 154
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 463 place count 101 transition count 153
Applied a total of 463 rules in 42 ms. Remains 101 /352 variables (removed 251) and now considering 153/470 (removed 317) transitions.
[2026-05-25 19:41:29] [INFO ] Flow matrix only has 145 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-9148669618271195969.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5618184277835225479.kers'
[2026-05-25 19:41:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9148669618271195969.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5618184277835225479.kers]
Normalized transition count is 144 out of 145 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 101 cols 381 entries
Finished phase 1 with 94 SingleSign rule and 0 generalized
[2026-05-25 19:41:29] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5618184277835225479.kers
Total runtime 1 ms.
[2026-05-25 19:41:29] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-25 19:41:29] [INFO ] Flow matrix only has 145 transitions (discarded 8 similar events)
[2026-05-25 19:41:29] [INFO ] Invariant cache hit.
[2026-05-25 19:41:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 19:41:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2026-05-25 19:41:29] [INFO ] Redundant transitions in 4 ms returned []
Running 146 sub problems to find dead transitions.
[2026-05-25 19:41:29] [INFO ] Flow matrix only has 145 transitions (discarded 8 similar events)
[2026-05-25 19:41:29] [INFO ] Invariant cache hit.
[2026-05-25 19:41:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 4/101 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 144/245 variables, 101/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (OVERLAPS) 1/246 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 113 constraints, problems are : Problem set: 0 solved, 146 unsolved in 7152 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 146 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 2 (OVERLAPS) 4/101 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 6 (OVERLAPS) 144/245 variables, 101/113 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/245 variables, 146/259 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/245 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 9 (OVERLAPS) 1/246 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 146 unsolved
At refinement iteration 11 (OVERLAPS) 0/246 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 146 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 260 constraints, problems are : Problem set: 0 solved, 146 unsolved in 17824 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 101/101 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 146/146 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 25006ms problems are : Problem set: 0 solved, 146 unsolved
Search for dead transitions found 0 dead transitions in 25009ms
Starting structural reductions in SI_CTL mode, iteration 1 : 101/352 places, 153/470 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25241 ms. Remains : 101/352 places, 153/470 transitions.
[2026-05-25 19:41:54] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:41:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:41:54] [INFO ] Input system was already deterministic with 153 transitions.
[2026-05-25 19:41:54] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:41:54] [INFO ] Flatten gal took : 2 ms
[2026-05-25 19:41:54] [INFO ] Time to serialize gal into /tmp/CTLFireability11122230330146229724.gal : 1 ms
[2026-05-25 19:41:54] [INFO ] Time to serialize properties into /tmp/CTLFireability16619868936547465653.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/CTLFireability11122230330146229724.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16619868936547465653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.47907e+08,0.314983,15720,2,1449,5,45310,6,0,548,63029,0


Converting to forward existential form...Done !
original formula: AF((EG((((EF((p302==1)) * E((p256==1) U (p227==1))) + (AF((p340==1)) * (((p242==1)||(p224==1))||(p336==0)))) + ((p68==0)||(p297==0)))) * ...202
=> equivalent forward existential formula: [FwdG(Init,!((EG((((E(TRUE U (p302==1)) * E((p256==1) U (p227==1))) + (!(EG(!((p340==1)))) * (((p242==1)||(p224=...271
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t6, t7, t9, t11, t12, t15, t16, t17, t20, t22, t24, t28, t30, t33, t39, t41, t44,...356
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,14.2893,359580,1,0,1113,2.02234e+06,350,672,3719,2.40968e+06,1222
FORMULA HealthRecord-PT-16-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 321 transition count 425
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 321 transition count 425
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 321 transition count 423
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 306 transition count 399
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 306 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 306 transition count 397
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 105 place count 297 transition count 379
Iterating global reduction 2 with 9 rules applied. Total rules applied 114 place count 297 transition count 379
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 293 transition count 372
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 293 transition count 372
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 126 place count 289 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 289 transition count 367
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 286 transition count 363
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 286 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 137 place count 286 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 284 transition count 359
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 284 transition count 359
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 283 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 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 144 place count 283 transition count 356
Applied a total of 144 rules in 56 ms. Remains 283 /352 variables (removed 69) and now considering 356/470 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3292943258991757336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8124237679682314366.kers'
[2026-05-25 19:42:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3292943258991757336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8124237679682314366.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:42:08] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8124237679682314366.kers
Total runtime 1 ms.
[2026-05-25 19:42:08] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 19:42:08] [INFO ] Invariant cache hit.
[2026-05-25 19:42:09] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2026-05-25 19:42:09] [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")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
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 30014 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 60042ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60043ms
Starting structural reductions in LTL mode, iteration 1 : 283/352 places, 356/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60439 ms. Remains : 283/352 places, 356/470 transitions.
[2026-05-25 19:43:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:43:09] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:43:09] [INFO ] Input system was already deterministic with 356 transitions.
[2026-05-25 19:43:09] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:43:09] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:43:09] [INFO ] Time to serialize gal into /tmp/CTLFireability10140188763777796690.gal : 1 ms
[2026-05-25 19:43:09] [INFO ] Time to serialize properties into /tmp/CTLFireability1228022496855702705.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/CTLFireability10140188763777796690.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1228022496855702705.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.44695e+11,2.42762,71808,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: AG(EX(EF((p126==0))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX(E(TRUE U (p126==0)))))] = 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
(forward)formula 0,0,11.1299,265620,1,0,566,800874,733,318,8270,1.03497e+06,724
FORMULA HealthRecord-PT-16-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 325 transition count 430
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 325 transition count 430
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 56 place count 325 transition count 428
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 68 place count 313 transition count 408
Iterating global reduction 1 with 12 rules applied. Total rules applied 80 place count 313 transition count 408
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 88 place count 305 transition count 392
Iterating global reduction 1 with 8 rules applied. Total rules applied 96 place count 305 transition count 392
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 302 transition count 387
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 302 transition count 387
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 299 transition count 383
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 299 transition count 383
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 297 transition count 381
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 297 transition count 381
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 113 place count 297 transition count 380
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 114 place count 296 transition count 379
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 296 transition count 379
Applied a total of 115 rules in 37 ms. Remains 296 /352 variables (removed 56) and now considering 379/470 (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-4122772475211709152.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7089011659311369637.kers'
[2026-05-25 19:43:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4122772475211709152.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7089011659311369637.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 296 cols 881 entries
Finished phase 1 with 280 SingleSign rule and 2 generalized
[2026-05-25 19:43:20] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7089011659311369637.kers
Total runtime 3 ms.
[2026-05-25 19:43:20] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-25 19:43:20] [INFO ] Invariant cache hit.
[2026-05-25 19:43:20] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-25 19:43:20] [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, 20/34 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 379/675 variables, 296/333 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 675/675 variables, and 333 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: 23/23 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, 23/37 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/296 variables, 2/39 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/296 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (OVERLAPS) 379/675 variables, 296/335 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 378/713 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/675 variables, 6/719 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 Int declared 675/675 variables, and 721 constraints, problems are : Problem set: 0 solved, 378 unsolved in 30033 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: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60071ms problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 60072ms
Starting structural reductions in LTL mode, iteration 1 : 296/352 places, 379/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60372 ms. Remains : 296/352 places, 379/470 transitions.
[2026-05-25 19:44:20] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:44:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:44:20] [INFO ] Input system was already deterministic with 379 transitions.
[2026-05-25 19:44:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:44:20] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:44:20] [INFO ] Time to serialize gal into /tmp/CTLFireability2192201064253268205.gal : 2 ms
[2026-05-25 19:44:20] [INFO ] Time to serialize properties into /tmp/CTLFireability15887084076693792078.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/CTLFireability2192201064253268205.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15887084076693792078.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.9739e+11,3.74901,114420,2,14201,5,317060,6,0,1565,728023,0


Converting to forward existential form...Done !
original formula: (AG(AF(AX(AF((p197==1))))) * A((EX(A((p127!=1) U (p198!=1))) * EF(((p212==1)&&(p173==1)))) U ((!(((EX((p423==1)) * ((p92==1)||(p92!=1))) ...208
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(EX(!(!(EG(!((p197==1)))))))))] = FALSE * ((([(EY((((FwdU(Init,!(((!(((EX((p423==1)) *...1066
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t34, t35, t36, t37, t40, t41, t42...708
Detected timeout of ITS tools.
[2026-05-25 19:44:50] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:44:50] [INFO ] Applying decomposition
[2026-05-25 19:44:50] [INFO ] Flatten gal took : 5 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/graph13025651152976497211.txt' '-o' '/tmp/graph13025651152976497211.bin' '-w' '/tmp/graph13025651152976497211.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph13025651152976497211.bin' '-l' '-1' '-v' '-w' '/tmp/graph13025651152976497211.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:44:51] [INFO ] Decomposing Gal with order
[2026-05-25 19:44:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:44:51] [INFO ] Removed a total of 109 redundant transitions.
[2026-05-25 19:44:51] [INFO ] Flatten gal took : 30 ms
[2026-05-25 19:44:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 15 labels/synchronizations in 6 ms.
[2026-05-25 19:44:51] [INFO ] Time to serialize gal into /tmp/CTLFireability3227896412205356091.gal : 4 ms
[2026-05-25 19:44:51] [INFO ] Time to serialize properties into /tmp/CTLFireability904845620244534614.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/CTLFireability3227896412205356091.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability904845620244534614.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,1.9739e+11,0.532316,24212,1297,142,34881,3321,758,80739,137,11546,0


Converting to forward existential form...Done !
original formula: (AG(AF(AX(AF((i10.i2.u49.p197==1))))) * A((EX(A((i3.i1.u25.p127!=1) U (i10.i0.u51.p198!=1))) * EF(((i13.i0.u54.p212==1)&&(i5.u40.p173==1)...324
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(EX(!(!(EG(!((i10.i2.u49.p197==1)))))))))] = FALSE * ((([(EY((((FwdU(Init,!(((!(((EX((...1590
Reverse transition relation is NOT exact ! Due to transitions t95, t177, t213, t245, t339, i1.i0.u4.t283, i1.i0.u4.t285, i1.i0.u4.t286, i1.i0.u4.t287, i1.i...1460
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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 21
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 321 transition count 425
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 321 transition count 425
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 64 place count 321 transition count 423
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 79 place count 306 transition count 399
Iterating global reduction 1 with 15 rules applied. Total rules applied 94 place count 306 transition count 399
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 96 place count 306 transition count 397
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 105 place count 297 transition count 379
Iterating global reduction 2 with 9 rules applied. Total rules applied 114 place count 297 transition count 379
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 118 place count 293 transition count 372
Iterating global reduction 2 with 4 rules applied. Total rules applied 122 place count 293 transition count 372
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 126 place count 289 transition count 367
Iterating global reduction 2 with 4 rules applied. Total rules applied 130 place count 289 transition count 367
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 133 place count 286 transition count 363
Iterating global reduction 2 with 3 rules applied. Total rules applied 136 place count 286 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 137 place count 286 transition count 362
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 139 place count 284 transition count 359
Iterating global reduction 3 with 2 rules applied. Total rules applied 141 place count 284 transition count 359
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 142 place count 283 transition count 357
Iterating global reduction 3 with 1 rules applied. Total rules applied 143 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 144 place count 283 transition count 356
Applied a total of 144 rules in 26 ms. Remains 283 /352 variables (removed 69) and now considering 356/470 (removed 114) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1616243338792215199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14126783959886083725.kers'
[2026-05-25 19:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1616243338792215199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14126783959886083725.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:45:21] [INFO ] Computed 14 invariants in 5 ms
Computed 14 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14126783959886083725.kers
Total runtime 7 ms.
[2026-05-25 19:45:21] [INFO ] Implicit Places using invariants in 88 ms returned []
[2026-05-25 19:45:21] [INFO ] Invariant cache hit.
[2026-05-25 19:45:21] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
Running 355 sub problems to find dead transitions.
[2026-05-25 19:45:21] [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")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
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 30017 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 30022 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 60064ms problems are : Problem set: 0 solved, 355 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 283/352 places, 356/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60349 ms. Remains : 283/352 places, 356/470 transitions.
[2026-05-25 19:46:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:21] [INFO ] Input system was already deterministic with 356 transitions.
[2026-05-25 19:46:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:21] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:46:21] [INFO ] Time to serialize gal into /tmp/CTLFireability9898924267942619085.gal : 1 ms
[2026-05-25 19:46:21] [INFO ] Time to serialize properties into /tmp/CTLFireability10435149207992362917.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/CTLFireability9898924267942619085.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10435149207992362917.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.44695e+11,2.24084,71820,2,9342,5,208164,6,0,1490,440851,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(AF((p99==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(!(EG(!((p99==0)))))))] != 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:46:51] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:46:51] [INFO ] Applying decomposition
[2026-05-25 19:46:51] [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/graph7999066027799128523.txt' '-o' '/tmp/graph7999066027799128523.bin' '-w' '/tmp/graph7999066027799128523.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7999066027799128523.bin' '-l' '-1' '-v' '-w' '/tmp/graph7999066027799128523.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:46:51] [INFO ] Decomposing Gal with order
[2026-05-25 19:46:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:46:51] [INFO ] Removed a total of 113 redundant transitions.
[2026-05-25 19:46:51] [INFO ] Flatten gal took : 11 ms
[2026-05-25 19:46:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 5 ms.
[2026-05-25 19:46:51] [INFO ] Time to serialize gal into /tmp/CTLFireability11965609437519274811.gal : 2 ms
[2026-05-25 19:46:51] [INFO ] Time to serialize properties into /tmp/CTLFireability16722720968460261792.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/CTLFireability11965609437519274811.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16722720968460261792.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 -...264
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,0.710021,25308,1166,36,34670,490,728,74626,79,1199,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(AF((i0.u18.p99==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(!(EG(!((i0.u18.p99==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t197, t229, t321, i1.i0.t267, i1.i0.t269, i1.i0.t281, i1.i0.t283, i1.i0.t285, i1.i0.t294, i1....1208
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 6
Fast SCC detection found a local SCC at level 1
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 324 transition count 429
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 324 transition count 429
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 58 place count 324 transition count 427
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 71 place count 311 transition count 407
Iterating global reduction 1 with 13 rules applied. Total rules applied 84 place count 311 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 86 place count 311 transition count 405
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 303 transition count 389
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 303 transition count 389
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 105 place count 300 transition count 383
Iterating global reduction 2 with 3 rules applied. Total rules applied 108 place count 300 transition count 383
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 110 place count 298 transition count 381
Iterating global reduction 2 with 2 rules applied. Total rules applied 112 place count 298 transition count 381
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 113 place count 297 transition count 380
Iterating global reduction 2 with 1 rules applied. Total rules applied 114 place count 297 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 115 place count 297 transition count 379
Applied a total of 115 rules in 27 ms. Remains 297 /352 variables (removed 55) and now considering 379/470 (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-327372098536198542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12914206336893431742.kers'
[2026-05-25 19:47:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-327372098536198542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12914206336893431742.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 297 cols 883 entries
Finished phase 1 with 281 SingleSign rule and 2 generalized
[2026-05-25 19:47:21] [INFO ] Computed 14 invariants in 4 ms
Computed 14 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12914206336893431742.kers
Total runtime 5 ms.
[2026-05-25 19:47:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-25 19:47:21] [INFO ] Invariant cache hit.
[2026-05-25 19:47:21] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 378 sub problems to find dead transitions.
[2026-05-25 19:47:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/296 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/296 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 2 (OVERLAPS) 1/297 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/297 variables, 9/38 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 4/45 constraints. Problems are: Problem set: 0 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/297 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/297 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 378 unsolved
SMT process timed out in 30029ms, After SMT, problems are : Problem set: 0 solved, 378 unsolved
Search for dead transitions found 0 dead transitions in 30029ms
Starting structural reductions in LTL mode, iteration 1 : 297/352 places, 379/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30283 ms. Remains : 297/352 places, 379/470 transitions.
[2026-05-25 19:47:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:51] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:52] [INFO ] Input system was already deterministic with 379 transitions.
[2026-05-25 19:47:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:47:52] [INFO ] Time to serialize gal into /tmp/CTLFireability12616358402465099598.gal : 2 ms
[2026-05-25 19:47:52] [INFO ] Time to serialize properties into /tmp/CTLFireability17893294961352731212.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/CTLFireability12616358402465099598.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17893294961352731212.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.10978e+11,2.88055,92368,2,11549,5,260024,6,0,1569,589044,0


Converting to forward existential form...Done !
original formula: !(A(AX(((p396==1) + AF(((p351==1)||(p399==1))))) U AF(((!(AF((p108==1))) * (p150==1)) * (p284==1)))))
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((!(!(EG(!((p108==1))))) * (p150==1)) * (p284==1))))))) * !(!(EX(!(((p396==1) + !(EG(...342
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...720
Detected timeout of ITS tools.
[2026-05-25 19:48:22] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:48:22] [INFO ] Applying decomposition
[2026-05-25 19:48:22] [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/graph10618154437001587753.txt' '-o' '/tmp/graph10618154437001587753.bin' '-w' '/tmp/graph10618154437001587753.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10618154437001587753.bin' '-l' '-1' '-v' '-w' '/tmp/graph10618154437001587753.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:48:22] [INFO ] Decomposing Gal with order
[2026-05-25 19:48:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:48:22] [INFO ] Removed a total of 106 redundant transitions.
[2026-05-25 19:48:22] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:48:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2026-05-25 19:48:22] [INFO ] Time to serialize gal into /tmp/CTLFireability14080870419244936793.gal : 3 ms
[2026-05-25 19:48:22] [INFO ] Time to serialize properties into /tmp/CTLFireability5238439902206412469.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/CTLFireability14080870419244936793.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5238439902206412469.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.10978e+11,2.75632,70740,1512,153,96188,14715,749,261245,166,77945,0


Converting to forward existential form...Done !
original formula: !(A(AX(((i20.u109.p396==1) + AF(((i17.i0.u91.p351==1)||(i20.u109.p399==1))))) U AF(((!(AF((u21.p108==1))) * (i8.i0.u37.p150==1)) * (i16.i...173
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!(((!(!(EG(!((u21.p108==1))))) * (i8.i0.u37.p150==1)) * (i16.i1.u84.p284==1))))))) * !(...446
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t25, t33, t57, t61, t94, t322, t323, t324, t325, t326, t338, i0.i1.t280, i0.i1...1343
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 an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 7
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 323 transition count 429
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 323 transition count 429
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 60 place count 323 transition count 427
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 75 place count 308 transition count 403
Iterating global reduction 1 with 15 rules applied. Total rules applied 90 place count 308 transition count 403
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 92 place count 308 transition count 401
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 100 place count 300 transition count 385
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 300 transition count 385
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 111 place count 297 transition count 379
Iterating global reduction 2 with 3 rules applied. Total rules applied 114 place count 297 transition count 379
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 117 place count 294 transition count 376
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 294 transition count 376
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 122 place count 292 transition count 373
Iterating global reduction 2 with 2 rules applied. Total rules applied 124 place count 292 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 125 place count 292 transition count 372
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 291 transition count 370
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 291 transition count 370
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 128 place count 290 transition count 368
Iterating global reduction 3 with 1 rules applied. Total rules applied 129 place count 290 transition count 368
Applied a total of 129 rules in 23 ms. Remains 290 /352 variables (removed 62) and now considering 368/470 (removed 102) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8326335547488034748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7034021270127011194.kers'
[2026-05-25 19:48:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8326335547488034748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7034021270127011194.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 290 cols 855 entries
Finished phase 1 with 274 SingleSign rule and 2 generalized
[2026-05-25 19:48:52] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7034021270127011194.kers
Total runtime 2 ms.
[2026-05-25 19:48:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 19:48:52] [INFO ] Invariant cache hit.
[2026-05-25 19:48:52] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-25 19:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/290 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 12/26 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 3/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (OVERLAPS) 368/658 variables, 290/319 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/658 variables, and 321 constraints, problems are : Problem set: 0 solved, 367 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 290/290 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 367 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/289 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/290 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/290 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 17/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 6 (OVERLAPS) 368/658 variables, 290/321 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 367/688 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/658 variables, 7/695 constraints. Problems are: Problem set: 0 solved, 367 unsolved
SMT process timed out in 60059ms, After SMT, problems are : Problem set: 0 solved, 367 unsolved
Search for dead transitions found 0 dead transitions in 60061ms
Starting structural reductions in LTL mode, iteration 1 : 290/352 places, 368/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60331 ms. Remains : 290/352 places, 368/470 transitions.
[2026-05-25 19:49:52] [INFO ] Flatten gal took : 8 ms
[2026-05-25 19:49:52] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:49:52] [INFO ] Input system was already deterministic with 368 transitions.
[2026-05-25 19:49:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:52] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:49:52] [INFO ] Time to serialize gal into /tmp/CTLFireability1551300996923149987.gal : 1 ms
[2026-05-25 19:49:52] [INFO ] Time to serialize properties into /tmp/CTLFireability16251875129045608373.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/CTLFireability1551300996923149987.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16251875129045608373.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.74737e+11,3.0852,96332,2,11287,5,263898,6,0,1530,600990,0


Converting to forward existential form...Done !
original formula: AX(AF(((p337==1) * (((p338==0) + EX((p407==1))) + (EX((p63==1)) + A((p187!=1) U ((p334==1)&&(p372==1))))))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(((p337==1) * (((p338==0) + EX((p407==1))) + (EX((p63==1)) + !((E(!(((p334==1)&&(p372==1))) U (!...244
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...671
Detected timeout of ITS tools.
[2026-05-25 19:50:22] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:50:22] [INFO ] Applying decomposition
[2026-05-25 19:50:22] [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/graph12448483431024769899.txt' '-o' '/tmp/graph12448483431024769899.bin' '-w' '/tmp/graph12448483431024769899.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12448483431024769899.bin' '-l' '-1' '-v' '-w' '/tmp/graph12448483431024769899.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:50:22] [INFO ] Decomposing Gal with order
[2026-05-25 19:50:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:50:22] [INFO ] Removed a total of 107 redundant transitions.
[2026-05-25 19:50:22] [INFO ] Flatten gal took : 12 ms
[2026-05-25 19:50:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2026-05-25 19:50:22] [INFO ] Time to serialize gal into /tmp/CTLFireability4009061425825154821.gal : 3 ms
[2026-05-25 19:50:22] [INFO ] Time to serialize properties into /tmp/CTLFireability14530292200795840511.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/CTLFireability4009061425825154821.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14530292200795840511.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.74737e+11,1.21941,33976,1306,111,45727,3542,738,124697,121,11120,0


Converting to forward existential form...Done !
original formula: AX(AF(((i16.i1.u84.p337==1) * (((i16.i1.u83.p338==0) + EX((i20.i1.u102.p407==1))) + (EX((i0.i0.u10.p63==1)) + A((i9.i2.u48.p187!=1) U ((i...203
=> equivalent forward existential formula: [FwdG(EY(Init),!(((i16.i1.u84.p337==1) * (((i16.i1.u83.p338==0) + EX((i20.i1.u102.p407==1))) + (EX((i0.i0.u10.p6...367
Reverse transition relation is NOT exact ! Due to transitions t88, t330, i0.i0.u10.t270, i0.i0.u10.t272, i0.i0.u10.t273, i0.i0.u10.t279, i0.i0.u10.t280, i0...1360
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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local 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 : 352/352 places, 470/470 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 326 transition count 431
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 326 transition count 431
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 326 transition count 429
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 315 transition count 410
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 315 transition count 410
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 315 transition count 409
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 83 place count 309 transition count 398
Iterating global reduction 2 with 6 rules applied. Total rules applied 89 place count 309 transition count 398
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 93 place count 305 transition count 391
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 305 transition count 391
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 100 place count 302 transition count 387
Iterating global reduction 2 with 3 rules applied. Total rules applied 103 place count 302 transition count 387
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 105 place count 300 transition count 385
Iterating global reduction 2 with 2 rules applied. Total rules applied 107 place count 300 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 108 place count 300 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 109 place count 299 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 110 place count 299 transition count 383
Applied a total of 110 rules in 21 ms. Remains 299 /352 variables (removed 53) and now considering 383/470 (removed 87) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17309311214735686926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13731603616237143612.kers'
[2026-05-25 19:50:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17309311214735686926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13731603616237143612.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 383 rows 299 cols 887 entries
Finished phase 1 with 283 SingleSign rule and 2 generalized
[2026-05-25 19:50:52] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13731603616237143612.kers
Total runtime 2 ms.
[2026-05-25 19:50:52] [INFO ] Implicit Places using invariants in 77 ms returned []
[2026-05-25 19:50:52] [INFO ] Invariant cache hit.
[2026-05-25 19:50:53] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Running 382 sub problems to find dead transitions.
[2026-05-25 19:50:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/299 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (OVERLAPS) 383/682 variables, 299/337 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/682 variables, and 337 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 382 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/298 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 2 (OVERLAPS) 1/299 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 24/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 6 (OVERLAPS) 383/682 variables, 299/337 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/682 variables, 382/719 constraints. Problems are: Problem set: 0 solved, 382 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/682 variables, 4/723 constraints. Problems are: Problem set: 0 solved, 382 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 682/682 variables, and 724 constraints, problems are : Problem set: 0 solved, 382 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 299/299 constraints, PredecessorRefiner: 382/382 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 382 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 299/352 places, 383/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60392 ms. Remains : 299/352 places, 383/470 transitions.
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:51:53] [INFO ] Input system was already deterministic with 383 transitions.
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:51:53] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:51:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12386475711174698593.gal : 2 ms
[2026-05-25 19:51:53] [INFO ] Time to serialize properties into /tmp/CTLFireability5986542245209834110.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/CTLFireability12386475711174698593.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5986542245209834110.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.07754e+11,4.93623,139572,2,14677,5,380682,6,0,1581,935487,0


Converting to forward existential form...Done !
original formula: (!(A(AX(AF(((p240==1)&&(p53==1)))) U (AG(EX((p195==1))) * E((p421==1) U EF((p307==1)))))) * EF(EG((p140==0))))
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!((!(E(TRUE U !(EX((p195==1))))) * E((p421==1) U E(TRUE U (p307==1))))) U (!(!(EX(!(!(...373
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t33, t34, t35, t37, t38, t39, t40, t43...781
Detected timeout of ITS tools.
[2026-05-25 19:52:23] [INFO ] Flatten gal took : 7 ms
[2026-05-25 19:52:23] [INFO ] Applying decomposition
[2026-05-25 19:52:23] [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/graph8404997403467904619.txt' '-o' '/tmp/graph8404997403467904619.bin' '-w' '/tmp/graph8404997403467904619.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8404997403467904619.bin' '-l' '-1' '-v' '-w' '/tmp/graph8404997403467904619.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:52:23] [INFO ] Decomposing Gal with order
[2026-05-25 19:52:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:52:23] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-25 19:52:23] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:52:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 3 ms.
[2026-05-25 19:52:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12624753081435931519.gal : 3 ms
[2026-05-25 19:52:23] [INFO ] Time to serialize properties into /tmp/CTLFireability199246454120669604.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/CTLFireability12624753081435931519.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability199246454120669604.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,2.07754e+11,0.480555,22436,1038,113,29807,4114,774,78287,112,16004,0


Converting to forward existential form...Done !
original formula: (!(A(AX(AF(((i10.i2.u68.p240==1)&&(i0.i1.u8.p53==1)))) U (AG(EX((i8.i2.u49.p195==1))) * E((i18.i2.u113.p421==1) U EF((i14.u84.p307==1))))...188
=> equivalent forward existential formula: [FwdG(FwdU((Init * !(!((E(!((!(E(TRUE U !(EX((i8.i2.u49.p195==1))))) * E((i18.i2.u113.p421==1) U E(TRUE U (i14.u...493
Reverse transition relation is NOT exact ! Due to transitions t215, t297, t317, t328, t329, t330, t331, t332, t340, t341, t342, t343, t344, t353, t366, i0....1442
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
(forward)formula 0,1,8.7478,250264,1,0,432979,10239,6116,1.17291e+06,563,37682,631214
FORMULA HealthRecord-PT-16-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 322 transition count 427
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 322 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 322 transition count 425
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 77 place count 307 transition count 401
Iterating global reduction 1 with 15 rules applied. Total rules applied 92 place count 307 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 307 transition count 399
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 103 place count 298 transition count 381
Iterating global reduction 2 with 9 rules applied. Total rules applied 112 place count 298 transition count 381
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 116 place count 294 transition count 374
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 294 transition count 374
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 124 place count 290 transition count 369
Iterating global reduction 2 with 4 rules applied. Total rules applied 128 place count 290 transition count 369
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 287 transition count 365
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 287 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 287 transition count 364
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 137 place count 285 transition count 361
Iterating global reduction 3 with 2 rules applied. Total rules applied 139 place count 285 transition count 361
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 140 place count 284 transition count 359
Iterating global reduction 3 with 1 rules applied. Total rules applied 141 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 142 place count 284 transition count 358
Applied a total of 142 rules in 32 ms. Remains 284 /352 variables (removed 68) and now considering 358/470 (removed 112) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12884411228020932398.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9463791604132241985.kers'
[2026-05-25 19:52:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12884411228020932398.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9463791604132241985.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:52:32] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9463791604132241985.kers
Total runtime 2 ms.
[2026-05-25 19:52:32] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-25 19:52:32] [INFO ] Invariant cache hit.
[2026-05-25 19:52:32] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 357 sub problems to find dead transitions.
[2026-05-25 19:52:32] [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, 16/30 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 6/38 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 9 (OVERLAPS) 358/642 variables, 284/323 constraints. Problems are: Problem set: 0 solved, 357 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 642/642 variables, and 323 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30018 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: 25/25 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, 25/39 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 6 (OVERLAPS) 358/642 variables, 284/323 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 357/680 constraints. Problems are: Problem set: 0 solved, 357 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 6/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 694 constraints, problems are : Problem set: 0 solved, 357 unsolved in 30017 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: 8/8 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 357 unsolved
Search for dead transitions found 0 dead transitions in 60066ms
Starting structural reductions in LTL mode, iteration 1 : 284/352 places, 358/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60341 ms. Remains : 284/352 places, 358/470 transitions.
[2026-05-25 19:53:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:53:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:53:32] [INFO ] Input system was already deterministic with 358 transitions.
[2026-05-25 19:53:32] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:53:32] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:53:32] [INFO ] Time to serialize gal into /tmp/CTLFireability9873610678623348544.gal : 1 ms
[2026-05-25 19:53:32] [INFO ] Time to serialize properties into /tmp/CTLFireability1461197987745623026.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/CTLFireability9873610678623348544.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1461197987745623026.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.04685,72056,2,9369,5,209149,6,0,1496,441830,0


Converting to forward existential form...Done !
original formula: A(!(EG(((p115==1) + AF(AX((p338==1)))))) U !(EF((p280==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (p280==1))))))) * !(E(!(!(E(TRUE U (p280==1)))) U (!(!(EG(((p115==1) + !(EG(!(!(EX(!...217
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...643
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-25 19:54:02] [INFO ] Flatten gal took : 5 ms
[2026-05-25 19:54:02] [INFO ] Applying decomposition
[2026-05-25 19:54:02] [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/graph6416877816922033890.txt' '-o' '/tmp/graph6416877816922033890.bin' '-w' '/tmp/graph6416877816922033890.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6416877816922033890.bin' '-l' '-1' '-v' '-w' '/tmp/graph6416877816922033890.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:54:02] [INFO ] Decomposing Gal with order
[2026-05-25 19:54:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:54:02] [INFO ] Removed a total of 104 redundant transitions.
[2026-05-25 19:54:02] [INFO ] Flatten gal took : 9 ms
[2026-05-25 19:54:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2026-05-25 19:54:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7546895233938586059.gal : 2 ms
[2026-05-25 19:54:02] [INFO ] Time to serialize properties into /tmp/CTLFireability10292033420361557640.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/CTLFireability7546895233938586059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10292033420361557640.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,0.362061,18872,1154,70,26979,1776,713,49836,121,4376,0


Converting to forward existential form...Done !
original formula: A(!(EG(((i4.i2.u20.p115==1) + AF(AX((i16.i1.u83.p338==1)))))) U !(EF((i17.i1.u95.p280==1))))
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U (i17.i1.u95.p280==1))))))) * !(E(!(!(E(TRUE U (i17.i1.u95.p280==1)))) U (!(!(EG(((i4...271
Reverse transition relation is NOT exact ! Due to transitions t133, t231, t323, i0.i0.u8.t269, i0.i0.u8.t271, i0.i0.u8.t272, i0.i0.u8.t278, i0.i0.u8.t279, ...1210
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 an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an 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
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 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an 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 1
Fast SCC detection found a local 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 18
Fast SCC detection found an SCC at level 19
Fast SCC detection found an SCC at level 20
(forward)formula 0,0,4.11977,147848,1,0,260372,2728,5055,524503,637,7419,428365
FORMULA HealthRecord-PT-16-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 322 transition count 427
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 322 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 62 place count 322 transition count 425
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 77 place count 307 transition count 401
Iterating global reduction 1 with 15 rules applied. Total rules applied 92 place count 307 transition count 401
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 94 place count 307 transition count 399
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 102 place count 299 transition count 382
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 299 transition count 382
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 296 transition count 377
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 296 transition count 377
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 119 place count 293 transition count 373
Iterating global reduction 2 with 3 rules applied. Total rules applied 122 place count 293 transition count 373
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 124 place count 291 transition count 370
Iterating global reduction 2 with 2 rules applied. Total rules applied 126 place count 291 transition count 370
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 128 place count 289 transition count 367
Iterating global reduction 2 with 2 rules applied. Total rules applied 130 place count 289 transition count 367
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 131 place count 288 transition count 365
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 288 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 133 place count 288 transition count 364
Applied a total of 133 rules in 23 ms. Remains 288 /352 variables (removed 64) and now considering 364/470 (removed 106) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17909357509834144706.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2878851248628294514.kers'
[2026-05-25 19:54:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17909357509834144706.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2878851248628294514.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 364 rows 288 cols 843 entries
Finished phase 1 with 272 SingleSign rule and 2 generalized
[2026-05-25 19:54:06] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2878851248628294514.kers
Total runtime 3 ms.
[2026-05-25 19:54:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-25 19:54:06] [INFO ] Invariant cache hit.
[2026-05-25 19:54:07] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 363 sub problems to find dead transitions.
[2026-05-25 19:54:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 13/27 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 12/39 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/652 variables, 288/327 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 652/652 variables, and 328 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/287 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/287 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 2 (OVERLAPS) 1/288 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/288 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 26/40 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/288 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 7 (OVERLAPS) 364/652 variables, 288/334 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/652 variables, 363/697 constraints. Problems are: Problem set: 0 solved, 363 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/652 variables, 2/699 constraints. Problems are: Problem set: 0 solved, 363 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 652/652 variables, and 700 constraints, problems are : Problem set: 0 solved, 363 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 288/288 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 363 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 288/352 places, 364/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60320 ms. Remains : 288/352 places, 364/470 transitions.
[2026-05-25 19:55:07] [INFO ] Flatten gal took : 6 ms
[2026-05-25 19:55:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:55:07] [INFO ] Input system was already deterministic with 364 transitions.
[2026-05-25 19:55:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:55:07] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:55:07] [INFO ] Time to serialize gal into /tmp/CTLFireability17622629641191379153.gal : 1 ms
[2026-05-25 19:55:07] [INFO ] Time to serialize properties into /tmp/CTLFireability2329728777405355530.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/CTLFireability17622629641191379153.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2329728777405355530.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.70512e+11,2.20691,72968,2,9397,5,211326,6,0,1518,443084,0


Converting to forward existential form...Done !
original formula: AX((AF((p446==1)) * (AX(EF(((p69==0)||(p446==0)))) + (p24==1))))
=> equivalent forward existential formula: ([FwdG(EY(Init),!((p446==1)))] = FALSE * [(EY((EY(Init) * !((p24==1)))) * !(E(TRUE U ((p69==0)||(p446==0)))))] =...162
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...650
Hit Full ! (commute/partial/dont) 339/0/25
(forward)formula 0,0,17.7648,485112,1,0,700,1.6202e+06,760,324,8901,2.50384e+06,867
FORMULA HealthRecord-PT-16-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 352/352 places, 470/470 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 326 transition count 433
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 326 transition count 433
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 54 place count 326 transition count 431
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 315 transition count 414
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 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 78 place count 315 transition count 412
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 310 transition count 401
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 310 transition count 401
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 90 place count 308 transition count 398
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 308 transition count 398
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 94 place count 306 transition count 395
Iterating global reduction 2 with 2 rules applied. Total rules applied 96 place count 306 transition count 395
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 98 place count 304 transition count 392
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 304 transition count 392
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 101 place count 303 transition count 391
Iterating global reduction 2 with 1 rules applied. Total rules applied 102 place count 303 transition count 391
Applied a total of 102 rules in 30 ms. Remains 303 /352 variables (removed 49) and now considering 391/470 (removed 79) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15005305013621842990.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17373612015036671705.kers'
[2026-05-25 19:55:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15005305013621842990.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17373612015036671705.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 391 rows 303 cols 911 entries
Finished phase 1 with 287 SingleSign rule and 2 generalized
[2026-05-25 19:55:25] [INFO ] Computed 14 invariants in 1 ms
Computed 14 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-17373612015036671705.kers
Total runtime 11 ms.
[2026-05-25 19:55:25] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-25 19:55:25] [INFO ] Invariant cache hit.
[2026-05-25 19:55:25] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 390 sub problems to find dead transitions.
[2026-05-25 19:55:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 8/42 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 303/694 variables, and 56 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/303 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/302 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/302 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (OVERLAPS) 1/303 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/303 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/303 variables, 42/56 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/303 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 391/694 variables, 303/363 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/694 variables, 390/753 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/694 variables, 2/755 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 694/694 variables, and 755 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 303/303 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 48/48 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60056ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 303/352 places, 391/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60349 ms. Remains : 303/352 places, 391/470 transitions.
[2026-05-25 19:56:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:56:25] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:56:25] [INFO ] Input system was already deterministic with 391 transitions.
[2026-05-25 19:56:25] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:56:25] [INFO ] Flatten gal took : 3 ms
[2026-05-25 19:56:25] [INFO ] Time to serialize gal into /tmp/CTLFireability15242679396670790103.gal : 2 ms
[2026-05-25 19:56:25] [INFO ] Time to serialize properties into /tmp/CTLFireability8618218892608170171.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/CTLFireability15242679396670790103.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8618218892608170171.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.38393e+11,5.42875,150600,2,19914,5,396508,6,0,1605,1.03325e+06,0


Converting to forward existential form...Done !
original formula: EG((((AG(!(A((p308==1) U (p419==1)))) * AF((p275==0))) * (AX((p411==0)) * (((p100==1) + (EG(((p334==0)||(p428==0))) * EF((p123==0)))) + (...292
=> equivalent forward existential formula: [FwdG(Init,(((!(E(TRUE U !(!(!((E(!((p419==1)) U (!((p308==1)) * !((p419==1)))) + EG(!((p419==1))))))))) * !(EG(...465
Reverse transition relation is NOT exact ! Due to transitions t12, t13, t14, t15, t18, t21, t23, t25, t28, t30, t31, t32, t33, t34, t37, t38, t40, t41, t42...801
Detected timeout of ITS tools.
[2026-05-25 19:56:55] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:56:55] [INFO ] Applying decomposition
[2026-05-25 19:56:55] [INFO ] Flatten gal took : 8 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/graph11712137952879625733.txt' '-o' '/tmp/graph11712137952879625733.bin' '-w' '/tmp/graph11712137952879625733.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11712137952879625733.bin' '-l' '-1' '-v' '-w' '/tmp/graph11712137952879625733.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:56:55] [INFO ] Decomposing Gal with order
[2026-05-25 19:56:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:56:55] [INFO ] Removed a total of 107 redundant transitions.
[2026-05-25 19:56:55] [INFO ] Flatten gal took : 13 ms
[2026-05-25 19:56:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 2 ms.
[2026-05-25 19:56:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15083136625558346147.gal : 3 ms
[2026-05-25 19:56:55] [INFO ] Time to serialize properties into /tmp/CTLFireability12508698000848516222.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/CTLFireability15083136625558346147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12508698000848516222.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 -...264
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.38393e+11,0.532384,23312,1135,415,27284,13691,740,63326,188,48846,0


Converting to forward existential form...Done !
original formula: EG((((AG(!(A((i14.u81.p308==1) U (i19.u105.p419==1)))) * AF((i12.i3.u76.p275==0))) * (AX((i19.u104.p411==0)) * (((i5.i2.u17.p100==1) + (E...450
=> equivalent forward existential formula: [FwdG(Init,(((!(E(TRUE U !(!(!((E(!((i19.u105.p419==1)) U (!((i14.u81.p308==1)) * !((i19.u105.p419==1)))) + EG(!...659
Reverse transition relation is NOT exact ! Due to transitions t13, t332, t333, t334, t335, t336, t348, i1.i1.u10.t287, i1.i1.u10.t289, i1.i1.u10.t290, i1.i...1570
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 an SCC at level 1
Fast SCC detection found an SCC at level 2
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 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,7.51139,220596,1,0,361616,41964,5401,701114,998,126904,635738
FORMULA HealthRecord-PT-16-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-25 19:57:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:57:03] [INFO ] Flatten gal took : 4 ms
[2026-05-25 19:57:03] [INFO ] Applying decomposition
[2026-05-25 19:57:03] [INFO ] Flatten gal took : 5 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/graph17462739954105478098.txt' '-o' '/tmp/graph17462739954105478098.bin' '-w' '/tmp/graph17462739954105478098.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17462739954105478098.bin' '-l' '-1' '-v' '-w' '/tmp/graph17462739954105478098.weights' '-q' '0' '-e' '0.001'
[2026-05-25 19:57:03] [INFO ] Decomposing Gal with order
[2026-05-25 19:57:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 19:57:03] [INFO ] Removed a total of 117 redundant transitions.
[2026-05-25 19:57:03] [INFO ] Flatten gal took : 28 ms
[2026-05-25 19:57:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 2 ms.
[2026-05-25 19:57:03] [INFO ] Time to serialize gal into /tmp/CTLFireability13757551137287226772.gal : 5 ms
[2026-05-25 19:57:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17664634366183410227.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/CTLFireability13757551137287226772.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17664634366183410227.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 -...264
No direction supplied, using forward translation only.
Parsed 4 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,6.51844e+11,12.4497,327472,3415,1668,461941,52837,864,1.44562e+06,283,399098,0


Converting to forward existential form...Done !
original formula: (AG(AF(AX(AF((i10.i2.u60.p197==1))))) * A((EX(A((i5.i2.u33.p127!=1) U (i10.i2.u60.p198!=1))) * EF(((i12.i0.u77.p212==1)&&(i9.i0.u50.p173=...328
=> equivalent forward existential formula: ([FwdG(FwdU(Init,TRUE),!(!(EX(!(!(EG(!((i10.i2.u60.p197==1)))))))))] = FALSE * ((([(EY((((FwdU(Init,!(((!(((EX((...1604
Reverse transition relation is NOT exact ! Due to transitions t13, t136, t404, t405, t406, t407, t408, t418, t419, t420, i1.i0.t361, i1.i0.u14.t340, i1.i0....2048
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 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,1537.45,5678136,1,0,7.35724e+06,189656,1762,1.92775e+07,699,2.26483e+06,1632317
FORMULA HealthRecord-PT-16-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !
Detected timeout of ITS tools.
[2026-05-25 20:24:15] [INFO ] Applying decomposition
[2026-05-25 20:24:15] [INFO ] Flatten gal took : 5 ms
[2026-05-25 20:24:15] [INFO ] Decomposing Gal with order
[2026-05-25 20:24:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 20:24:15] [INFO ] Removed a total of 29 redundant transitions.
[2026-05-25 20:24:15] [INFO ] Flatten gal took : 9 ms
[2026-05-25 20:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 78 labels/synchronizations in 1 ms.
[2026-05-25 20:24:15] [INFO ] Time to serialize gal into /tmp/CTLFireability493585106259961431.gal : 2 ms
[2026-05-25 20:24:15] [INFO ] Time to serialize properties into /tmp/CTLFireability15931829491921058663.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/CTLFireability493585106259961431.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15931829491921058663.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 3 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,6.51844e+11,3.2585,116496,908,6011,94397,112722,392,352170,692,1.00166e+06,0


Converting to forward existential form...Done !
original formula: EG(EF(EX(AF((i0.i1.u20.p99==0)))))
=> equivalent forward existential formula: [FwdG(Init,E(TRUE U EX(!(EG(!((i0.i1.u20.p99==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t406, t414, t417, i0.u2.t340, i0.u2.t341, i0.u2.t343, i0.u2.t344, i0.u2.t345, i0.u2.t346, i0....2280
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HealthRecord-PT-16"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-16, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074300658"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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