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.r066-tall-177946967700402.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 CO4-PT-16, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 6.9K Mar 6 13:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 6 13:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 08:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.9K Mar 6 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 50K Mar 6 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Mar 6 13:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Mar 6 13:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:32 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 260K 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 CO4-PT-16-CTLFireability-2024-00
FORMULA_NAME CO4-PT-16-CTLFireability-2024-01
FORMULA_NAME CO4-PT-16-CTLFireability-2024-02
FORMULA_NAME CO4-PT-16-CTLFireability-2024-03
FORMULA_NAME CO4-PT-16-CTLFireability-2024-04
FORMULA_NAME CO4-PT-16-CTLFireability-2024-05
FORMULA_NAME CO4-PT-16-CTLFireability-2024-06
FORMULA_NAME CO4-PT-16-CTLFireability-2024-07
FORMULA_NAME CO4-PT-16-CTLFireability-2024-08
FORMULA_NAME CO4-PT-16-CTLFireability-2024-09
FORMULA_NAME CO4-PT-16-CTLFireability-2024-10
FORMULA_NAME CO4-PT-16-CTLFireability-2024-11
FORMULA_NAME CO4-PT-16-CTLFireability-2024-12
FORMULA_NAME CO4-PT-16-CTLFireability-2024-13
FORMULA_NAME CO4-PT-16-CTLFireability-2024-14
FORMULA_NAME CO4-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779523840783

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-23 08:10:41] [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-23 08:10:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 08:10:42] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2026-05-23 08:10:42] [INFO ] Transformed 837 places.
[2026-05-23 08:10:42] [INFO ] Transformed 1122 transitions.
[2026-05-23 08:10:42] [INFO ] Found NUPN structural information;
[2026-05-23 08:10:42] [INFO ] Parsed PT model containing 837 places and 1122 transitions and 3052 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Deduced a syphon composed of 116 places in 12 ms
Reduce places removed 116 places and 180 transitions.
FORMULA CO4-PT-16-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 92 out of 721 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 721/721 places, 942/942 transitions.
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 704 transition count 939
Discarding 140 places :
Symmetric choice reduction at 1 with 140 rule applications. Total rules 160 place count 564 transition count 797
Iterating global reduction 1 with 140 rules applied. Total rules applied 300 place count 564 transition count 797
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 304 place count 564 transition count 793
Discarding 66 places :
Symmetric choice reduction at 2 with 66 rule applications. Total rules 370 place count 498 transition count 715
Iterating global reduction 2 with 66 rules applied. Total rules applied 436 place count 498 transition count 715
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 437 place count 498 transition count 714
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 449 place count 486 transition count 697
Iterating global reduction 3 with 12 rules applied. Total rules applied 461 place count 486 transition count 697
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 463 place count 486 transition count 695
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 468 place count 481 transition count 690
Iterating global reduction 4 with 5 rules applied. Total rules applied 473 place count 481 transition count 690
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 476 place count 478 transition count 687
Iterating global reduction 4 with 3 rules applied. Total rules applied 479 place count 478 transition count 687
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 482 place count 478 transition count 684
Applied a total of 482 rules in 154 ms. Remains 478 /721 variables (removed 243) and now considering 684/942 (removed 258) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-749491047288933834.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10305049485025923298.kers'
[2026-05-23 08:10:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-749491047288933834.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10305049485025923298.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 684 rows 478 cols 1850 entries
Finished phase 1 with 471 SingleSign rule and 0 generalized
[2026-05-23 08:10:42] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10305049485025923298.kers
Total runtime 5 ms.
[2026-05-23 08:10:42] [INFO ] Implicit Places using invariants in 325 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 356 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 477/721 places, 684/942 transitions.
Applied a total of 0 rules in 9 ms. Remains 477 /477 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 533 ms. Remains : 477/721 places, 684/942 transitions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 684/684 transitions.
Applied a total of 0 rules in 10 ms. Remains 477 /477 variables (removed 0) and now considering 684/684 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6839431246514632153.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18071987897239684082.kers'
[2026-05-23 08:10:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6839431246514632153.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18071987897239684082.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 684 rows 477 cols 1848 entries
Finished phase 1 with 471 SingleSign rule and 0 generalized
[2026-05-23 08:10:42] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-18071987897239684082.kers
Total runtime 3 ms.
[2026-05-23 08:10:42] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-23 08:10:42] [INFO ] Invariant cache hit.
[2026-05-23 08:10:43] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 472 ms to find 0 implicit places.
Running 683 sub problems to find dead transitions.
[2026-05-23 08:10:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (OVERLAPS) 1/477 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Problem TDEAD595 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD632 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/477 variables, 4/10 constraints. Problems are: Problem set: 3 solved, 680 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 680 unsolved
SMT process timed out in 30255ms, After SMT, problems are : Problem set: 3 solved, 680 unsolved
Search for dead transitions found 3 dead transitions in 30271ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 477/477 places, 681/684 transitions.
Applied a total of 0 rules in 7 ms. Remains 477 /477 variables (removed 0) and now considering 681/681 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30790 ms. Remains : 477/477 places, 681/684 transitions.
Support contains 92 out of 477 places after structural reductions.
[2026-05-23 08:11:13] [INFO ] Flatten gal took : 74 ms
[2026-05-23 08:11:13] [INFO ] Flatten gal took : 37 ms
[2026-05-23 08:11:13] [INFO ] Input system was already deterministic with 681 transitions.
Support contains 83 out of 477 places (down from 92) after GAL structural reductions.
RANDOM walk for 40000 steps (888 resets) in 1708 ms. (23 steps per ms) remains 31/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 33 ms. (117 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (15 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (14 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (10 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (14 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (14 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (14 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (10 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (16 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (13 resets) in 34 ms. (114 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (16 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (16 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (15 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4002 steps (14 resets) in 28 ms. (138 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (13 resets) in 10 ms. (364 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4003 steps (12 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (13 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (15 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (14 resets) in 11 ms. (333 steps per ms) remains 28/29 properties
BEST_FIRST walk for 4004 steps (15 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
BEST_FIRST walk for 4004 steps (16 resets) in 13 ms. (286 steps per ms) remains 28/28 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2276466447270596786.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16186047043609513252.kers'
[2026-05-23 08:11:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2276466447270596786.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16186047043609513252.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 681 rows 477 cols 1830 entries
Finished phase 1 with 471 SingleSign rule and 0 generalized
[2026-05-23 08:11:14] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16186047043609513252.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (OVERLAPS) 30/77 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (OVERLAPS) 3/80 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 270/350 variables, 80/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 442/792 variables, 182/268 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/792 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 299/1091 variables, 167/435 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1091 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp38 is UNSAT
At refinement iteration 11 (OVERLAPS) 57/1148 variables, 42/477 constraints. Problems are: Problem set: 1 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1148 variables, 0/477 constraints. Problems are: Problem set: 1 solved, 27 unsolved
Problem AtomicPropp47 is UNSAT
At refinement iteration 13 (OVERLAPS) 10/1158 variables, 6/483 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1158 variables, 0/483 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 15 (OVERLAPS) 0/1158 variables, 0/483 constraints. Problems are: Problem set: 2 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1158/1158 variables, and 483 constraints, problems are : Problem set: 2 solved, 26 unsolved in 2593 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 30/71 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 3/74 variables, 1/6 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 255/329 variables, 74/80 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 7/87 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/87 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 8 (OVERLAPS) 442/771 variables, 176/263 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/771 variables, 19/282 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/771 variables, 1/283 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/771 variables, 0/283 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 12 (OVERLAPS) 318/1089 variables, 177/460 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1089 variables, 0/460 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 59/1148 variables, 44/504 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1148 variables, 0/504 constraints. Problems are: Problem set: 2 solved, 26 unsolved
At refinement iteration 16 (OVERLAPS) 10/1158 variables, 6/510 constraints. Problems are: Problem set: 2 solved, 26 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 510 constraints, problems are : Problem set: 2 solved, 26 unsolved in 5009 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 26/28 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7655ms problems are : Problem set: 2 solved, 26 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 41 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 681/681 transitions.
Graph (trivial) has 429 edges and 477 vertex of which 2 / 477 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1022 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 150 rules applied. Total rules applied 152 place count 473 transition count 522
Reduce places removed 147 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 153 rules applied. Total rules applied 305 place count 326 transition count 516
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 309 place count 324 transition count 514
Reduce places removed 1 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 3 with 16 rules applied. Total rules applied 325 place count 323 transition count 499
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 4 with 15 rules applied. Total rules applied 340 place count 308 transition count 499
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 33 Pre rules applied. Total rules applied 340 place count 308 transition count 466
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 5 with 66 rules applied. Total rules applied 406 place count 275 transition count 466
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 418 place count 263 transition count 451
Iterating global reduction 5 with 12 rules applied. Total rules applied 430 place count 263 transition count 451
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 433 place count 263 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 433 place count 263 transition count 447
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 435 place count 262 transition count 447
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 437 place count 260 transition count 444
Iterating global reduction 6 with 2 rules applied. Total rules applied 439 place count 260 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 441 place count 260 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 442 place count 259 transition count 442
Performed 61 Post agglomeration using F-continuation condition with reduction of 14 identical transitions.
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 8 with 122 rules applied. Total rules applied 564 place count 198 transition count 367
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 14 rules applied. Total rules applied 578 place count 198 transition count 353
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 580 place count 197 transition count 352
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 582 place count 195 transition count 348
Iterating global reduction 10 with 2 rules applied. Total rules applied 584 place count 195 transition count 348
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 10 with 6 rules applied. Total rules applied 590 place count 192 transition count 345
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 591 place count 191 transition count 343
Iterating global reduction 10 with 1 rules applied. Total rules applied 592 place count 191 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 593 place count 191 transition count 342
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -42
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 11 with 72 rules applied. Total rules applied 665 place count 155 transition count 384
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 11 with 13 rules applied. Total rules applied 678 place count 155 transition count 371
Discarding 17 places :
Symmetric choice reduction at 12 with 17 rule applications. Total rules 695 place count 138 transition count 303
Iterating global reduction 12 with 17 rules applied. Total rules applied 712 place count 138 transition count 303
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 12 with 9 rules applied. Total rules applied 721 place count 138 transition count 294
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 722 place count 137 transition count 288
Iterating global reduction 13 with 1 rules applied. Total rules applied 723 place count 137 transition count 288
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 724 place count 137 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 14 with 10 rules applied. Total rules applied 734 place count 137 transition count 277
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 740 place count 137 transition count 271
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 746 place count 131 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 748 place count 131 transition count 269
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 15 with 9 rules applied. Total rules applied 757 place count 131 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 15 with 1 rules applied. Total rules applied 758 place count 131 transition count 268
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 15 with 5 rules applied. Total rules applied 763 place count 131 transition count 268
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 15 with 1 rules applied. Total rules applied 764 place count 130 transition count 267
Applied a total of 764 rules in 179 ms. Remains 130 /477 variables (removed 347) and now considering 267/681 (removed 414) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 130/477 places, 267/681 transitions.
RANDOM walk for 40000 steps (2008 resets) in 516 ms. (77 steps per ms) remains 6/26 properties
BEST_FIRST walk for 40004 steps (270 resets) in 135 ms. (294 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (283 resets) in 101 ms. (392 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (275 resets) in 64 ms. (615 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (288 resets) in 66 ms. (597 steps per ms) remains 3/3 properties
[2026-05-23 08:11:23] [INFO ] Flow matrix only has 247 transitions (discarded 20 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-814557498737059212.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3392658984469671968.kers'
[2026-05-23 08:11:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-814557498737059212.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3392658984469671968.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 247 rows 130 cols 947 entries
Finished phase 1 with 123 SingleSign rule and 1 generalized
[2026-05-23 08:11:23] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3392658984469671968.kers
Total runtime 2 ms.
[2026-05-23 08:11:23] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/74 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 182/256 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 104/360 variables, 44/126 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 17/377 variables, 12/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/377 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/377 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 377/377 variables, and 140 constraints, problems are : Problem set: 0 solved, 3 unsolved in 325 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 50/54 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 20/74 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 182/256 variables, 74/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 104/360 variables, 44/128 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/360 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 17/377 variables, 12/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/377 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/377 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 377/377 variables, and 143 constraints, problems are : Problem set: 0 solved, 3 unsolved in 421 ms.
Refiners :[Generalized P Invariants (flows): 6/6 constraints, State Equation: 130/130 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 772ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 35 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=35 )
Parikh walk visited 3 properties in 41 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2026-05-23 08:11:23] [INFO ] Flatten gal took : 29 ms
[2026-05-23 08:11:23] [INFO ] Flatten gal took : 37 ms
[2026-05-23 08:11:24] [INFO ] Input system was already deterministic with 681 transitions.
Computed a total of 26 stabilizing places and 41 stable transitions
Graph (complete) has 1024 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.7 ms
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 440 transition count 640
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 440 transition count 640
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 440 transition count 636
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 422 transition count 615
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 422 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 422 transition count 614
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 417 transition count 607
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 417 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 417 transition count 605
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 415 transition count 603
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 415 transition count 603
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 414 transition count 602
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 414 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 414 transition count 601
Applied a total of 134 rules in 37 ms. Remains 414 /477 variables (removed 63) and now considering 601/681 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4667201429198562455.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1224436512110008219.kers'
[2026-05-23 08:11:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4667201429198562455.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1224436512110008219.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 601 rows 414 cols 1637 entries
Finished phase 1 with 408 SingleSign rule and 0 generalized
[2026-05-23 08:11:24] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1224436512110008219.kers
Total runtime 4 ms.
[2026-05-23 08:11:24] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-23 08:11:24] [INFO ] Invariant cache hit.
[2026-05-23 08:11:24] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2026-05-23 08:11:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/414 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1015 variables, 414/422 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1015/1015 variables, and 424 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 414/414 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/413 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 1/414 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (OVERLAPS) 601/1015 variables, 414/424 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1015 variables, 600/1024 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1015/1015 variables, and 1024 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 414/414 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60145ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60148ms
Starting structural reductions in LTL mode, iteration 1 : 414/477 places, 601/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60549 ms. Remains : 414/477 places, 601/681 transitions.
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 21 ms
[2026-05-23 08:12:24] [INFO ] Input system was already deterministic with 601 transitions.
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 19 ms
[2026-05-23 08:12:24] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:12:24] [INFO ] Time to serialize gal into /tmp/CTLFireability5212222966711100213.gal : 12 ms
[2026-05-23 08:12:24] [INFO ] Time to serialize properties into /tmp/CTLFireability13774885263082334985.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability5212222966711100213.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13774885263082334985.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.9168e+11,7.4231,193808,2,21828,5,614413,6,0,2250,861696,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:12:54] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:12:54] [INFO ] Applying decomposition
[2026-05-23 08:12:54] [INFO ] Flatten gal took : 16 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/graph14701733311305045226.txt' '-o' '/tmp/graph14701733311305045226.bin' '-w' '/tmp/graph14701733311305045226.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14701733311305045226.bin' '-l' '-1' '-v' '-w' '/tmp/graph14701733311305045226.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:12:55] [INFO ] Decomposing Gal with order
[2026-05-23 08:12:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:12:55] [INFO ] Removed a total of 397 redundant transitions.
[2026-05-23 08:12:55] [INFO ] Flatten gal took : 84 ms
[2026-05-23 08:12:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 22 ms.
[2026-05-23 08:12:55] [INFO ] Time to serialize gal into /tmp/CTLFireability15811315522703287679.gal : 16 ms
[2026-05-23 08:12:55] [INFO ] Time to serialize properties into /tmp/CTLFireability13539674819053195275.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/CTLFireability15811315522703287679.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13539674819053195275.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.9168e+11,0.549498,24952,1037,177,33898,5274,1068,98519,121,24863,0


Converting to forward existential form...Done !
original formula: AX(EG((i14.i0.i0.u111.p622==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i14.i0.i0.u111.p622==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t80, t138, t148, t217, t245, t257, t269, t313, t475, t567, t571, i0.t4, i0.u144.t10, i0....957
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 2
Fast SCC detection found a local 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 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 440 transition count 640
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 440 transition count 640
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 78 place count 440 transition count 636
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 96 place count 422 transition count 615
Iterating global reduction 1 with 18 rules applied. Total rules applied 114 place count 422 transition count 615
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 115 place count 422 transition count 614
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 120 place count 417 transition count 607
Iterating global reduction 2 with 5 rules applied. Total rules applied 125 place count 417 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 127 place count 417 transition count 605
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 129 place count 415 transition count 603
Iterating global reduction 3 with 2 rules applied. Total rules applied 131 place count 415 transition count 603
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 132 place count 414 transition count 602
Iterating global reduction 3 with 1 rules applied. Total rules applied 133 place count 414 transition count 602
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 414 transition count 601
Applied a total of 134 rules in 37 ms. Remains 414 /477 variables (removed 63) and now considering 601/681 (removed 80) transitions.
[2026-05-23 08:13:25] [INFO ] Invariant cache hit.
[2026-05-23 08:13:25] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-23 08:13:25] [INFO ] Invariant cache hit.
[2026-05-23 08:13:26] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 606 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 414/477 places, 601/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 643 ms. Remains : 414/477 places, 601/681 transitions.
[2026-05-23 08:13:26] [INFO ] Flatten gal took : 15 ms
[2026-05-23 08:13:26] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:13:26] [INFO ] Input system was already deterministic with 601 transitions.
[2026-05-23 08:13:26] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:13:26] [INFO ] Flatten gal took : 13 ms
[2026-05-23 08:13:26] [INFO ] Time to serialize gal into /tmp/CTLFireability14024358486143864059.gal : 3 ms
[2026-05-23 08:13:26] [INFO ] Time to serialize properties into /tmp/CTLFireability6025449266174871057.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/CTLFireability14024358486143864059.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6025449266174871057.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.9168e+11,6.93346,194232,2,21828,5,614413,6,0,2250,861696,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:13:56] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:13:56] [INFO ] Applying decomposition
[2026-05-23 08:13:56] [INFO ] Flatten gal took : 10 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/graph12614914350361574919.txt' '-o' '/tmp/graph12614914350361574919.bin' '-w' '/tmp/graph12614914350361574919.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12614914350361574919.bin' '-l' '-1' '-v' '-w' '/tmp/graph12614914350361574919.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:13:56] [INFO ] Decomposing Gal with order
[2026-05-23 08:13:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:13:56] [INFO ] Removed a total of 397 redundant transitions.
[2026-05-23 08:13:56] [INFO ] Flatten gal took : 28 ms
[2026-05-23 08:13:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 8 ms.
[2026-05-23 08:13:56] [INFO ] Time to serialize gal into /tmp/CTLFireability424099606893878964.gal : 7 ms
[2026-05-23 08:13:56] [INFO ] Time to serialize properties into /tmp/CTLFireability14931141749871733432.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/CTLFireability424099606893878964.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14931141749871733432.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.9168e+11,0.664326,32200,1115,205,48235,6232,1054,138713,123,29177,0


Converting to forward existential form...Done !
original formula: AG((AX((((i8.u146.p825==1)||(i5.i1.i0.u41.p258==1))||(i15.i0.i2.u71.p433==0))) * (EF((i18.u145.p821==1)) + (((i14.u114.p619==1)&&(i18.u12...190
=> equivalent forward existential formula: ([(EY(FwdU(Init,TRUE)) * !((((i8.u146.p825==1)||(i5.i1.i0.u41.p258==1))||(i15.i0.i2.u71.p433==0))))] = FALSE * [...286
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t80, t138, t148, t187, t217, t245, t313, t372, t441, t475, t571, i1.t438, i2.t382, ...987
(forward)formula 0,0,4.71386,178560,1,0,257589,6232,6640,1.26239e+06,597,29177,540726
FORMULA CO4-PT-16-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 442 transition count 643
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 442 transition count 643
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 442 transition count 639
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 425 transition count 619
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 425 transition count 619
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 425 transition count 618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 420 transition count 611
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 420 transition count 611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 420 transition count 609
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 418 transition count 607
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 418 transition count 607
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 417 transition count 606
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 417 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 417 transition count 605
Applied a total of 128 rules in 40 ms. Remains 417 /477 variables (removed 60) and now considering 605/681 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4483441418703376528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13532100717815263308.kers'
[2026-05-23 08:14:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4483441418703376528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13532100717815263308.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 605 rows 417 cols 1649 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-23 08:14:01] [INFO ] Computed 6 invariants in 6 ms
Computed 6 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13532100717815263308.kers
Total runtime 9 ms.
[2026-05-23 08:14:01] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-23 08:14:01] [INFO ] Invariant cache hit.
[2026-05-23 08:14:01] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-23 08:14:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (OVERLAPS) 605/1022 variables, 417/425 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 428 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (OVERLAPS) 605/1022 variables, 417/428 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 604/1032 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1032 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 417/477 places, 605/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60491 ms. Remains : 417/477 places, 605/681 transitions.
[2026-05-23 08:15:01] [INFO ] Flatten gal took : 10 ms
[2026-05-23 08:15:01] [INFO ] Flatten gal took : 11 ms
[2026-05-23 08:15:01] [INFO ] Input system was already deterministic with 605 transitions.
[2026-05-23 08:15:01] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:15:01] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:15:01] [INFO ] Time to serialize gal into /tmp/CTLFireability2857283876902726949.gal : 3 ms
[2026-05-23 08:15:01] [INFO ] Time to serialize properties into /tmp/CTLFireability6066991169775151445.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/CTLFireability2857283876902726949.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6066991169775151445.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.97611e+11,7.74083,205192,2,25146,5,642349,6,0,2266,892980,0


Converting to forward existential form...Done !
original formula: !(E((p7==1) U (EX(((p95==1)&&(p661==1))) + (((p670==1)&&(p817==1))&&(p834==1)))))
=> equivalent forward existential formula: ([(EY(FwdU(Init,(p7==1))) * ((p95==1)&&(p661==1)))] = FALSE * [(FwdU(Init,(p7==1)) * (((p670==1)&&(p817==1))&&(p...174
Hit Full ! (commute/partial/dont) 603/0/2
(forward)formula 0,1,7.83949,205192,1,0,11,642349,16,2,2844,892980,6
FORMULA CO4-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Graph (trivial) has 508 edges and 477 vertex of which 2 / 477 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1023 edges and 476 vertex of which 473 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 185 transitions
Trivial Post-agglo rules discarded 185 transitions
Performed 185 trivial Post agglomeration. Transition count delta: 185
Iterating post reduction 0 with 186 rules applied. Total rules applied 188 place count 472 transition count 490
Reduce places removed 185 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 191 rules applied. Total rules applied 379 place count 287 transition count 484
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 383 place count 285 transition count 482
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 384 place count 284 transition count 482
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 384 place count 284 transition count 447
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 454 place count 249 transition count 447
Discarding 17 places :
Symmetric choice reduction at 4 with 17 rule applications. Total rules 471 place count 232 transition count 424
Iterating global reduction 4 with 17 rules applied. Total rules applied 488 place count 232 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 490 place count 232 transition count 422
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 490 place count 232 transition count 417
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 500 place count 227 transition count 417
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 507 place count 220 transition count 406
Iterating global reduction 5 with 7 rules applied. Total rules applied 514 place count 220 transition count 406
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 517 place count 220 transition count 403
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 518 place count 219 transition count 403
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 7 with 54 rules applied. Total rules applied 572 place count 192 transition count 375
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 7 rules applied. Total rules applied 579 place count 192 transition count 368
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 581 place count 191 transition count 367
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 583 place count 189 transition count 363
Iterating global reduction 9 with 2 rules applied. Total rules applied 585 place count 189 transition count 363
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 9 with 8 rules applied. Total rules applied 593 place count 185 transition count 359
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 6 rules applied. Total rules applied 599 place count 185 transition count 353
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 605 place count 183 transition count 349
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 5 rules applied. Total rules applied 610 place count 181 transition count 346
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 612 place count 180 transition count 345
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 613 place count 179 transition count 343
Iterating global reduction 13 with 1 rules applied. Total rules applied 614 place count 179 transition count 343
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 615 place count 178 transition count 341
Iterating global reduction 13 with 1 rules applied. Total rules applied 616 place count 178 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 617 place count 178 transition count 340
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 621 place count 176 transition count 338
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 14 with 13 rules applied. Total rules applied 634 place count 176 transition count 325
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 14 with 7 rules applied. Total rules applied 641 place count 176 transition count 318
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 15 with 7 rules applied. Total rules applied 648 place count 169 transition count 318
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 650 place count 168 transition count 317
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 651 place count 168 transition count 317
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 653 place count 166 transition count 315
Applied a total of 653 rules in 102 ms. Remains 166 /477 variables (removed 311) and now considering 315/681 (removed 366) transitions.
[2026-05-23 08:15:09] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5480771216318857926.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9547849117578416958.kers'
[2026-05-23 08:15:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5480771216318857926.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9547849117578416958.kers]
Normalized transition count is 288 out of 289 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 288 rows 166 cols 690 entries
Finished phase 1 with 160 SingleSign rule and 0 generalized
[2026-05-23 08:15:09] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9547849117578416958.kers
Total runtime 3 ms.
[2026-05-23 08:15:09] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-23 08:15:09] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-23 08:15:09] [INFO ] Invariant cache hit.
[2026-05-23 08:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:15:09] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2026-05-23 08:15:09] [INFO ] Redundant transitions in 17 ms returned []
Running 292 sub problems to find dead transitions.
[2026-05-23 08:15:09] [INFO ] Flow matrix only has 289 transitions (discarded 26 similar events)
[2026-05-23 08:15:09] [INFO ] Invariant cache hit.
[2026-05-23 08:15:09] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 288/454 variables, 166/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (OVERLAPS) 1/455 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (OVERLAPS) 0/455 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 292 unsolved
No progress, stopping.
After SMT solving in domain Real declared 455/455 variables, and 173 constraints, problems are : Problem set: 0 solved, 292 unsolved in 18526 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 292 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 2 (OVERLAPS) 288/454 variables, 166/172 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 292/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 5 (OVERLAPS) 1/455 variables, 1/465 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 1/466 constraints. Problems are: Problem set: 0 solved, 292 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 292 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/455 variables, and 466 constraints, problems are : Problem set: 0 solved, 292 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 166/166 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 292/292 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48596ms problems are : Problem set: 0 solved, 292 unsolved
Search for dead transitions found 0 dead transitions in 48596ms
Starting structural reductions in SI_CTL mode, iteration 1 : 166/477 places, 315/681 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48904 ms. Remains : 166/477 places, 315/681 transitions.
[2026-05-23 08:15:58] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:15:58] [INFO ] Flatten gal took : 5 ms
[2026-05-23 08:15:58] [INFO ] Input system was already deterministic with 315 transitions.
[2026-05-23 08:15:58] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:15:58] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:15:58] [INFO ] Time to serialize gal into /tmp/CTLFireability9628235142448026496.gal : 1 ms
[2026-05-23 08:15:58] [INFO ] Time to serialize properties into /tmp/CTLFireability11450733556242114791.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/CTLFireability9628235142448026496.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11450733556242114791.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.80547e+08,0.106233,8024,2,1221,5,16117,6,0,968,11407,0


Converting to forward existential form...Done !
original formula: AG(AF((p186==1)))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!((p186==1)))] = FALSE
Hit Full ! (commute/partial/dont) 313/0/2
(forward)formula 0,0,0.619843,27304,1,0,8,138037,20,3,4810,47382,8
FORMULA CO4-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 442 transition count 642
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 442 transition count 642
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 442 transition count 638
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 425 transition count 618
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 425 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 425 transition count 617
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 420 transition count 610
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 420 transition count 610
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 420 transition count 608
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 418 transition count 606
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 418 transition count 606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 417 transition count 605
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 417 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 417 transition count 604
Applied a total of 128 rules in 29 ms. Remains 417 /477 variables (removed 60) and now considering 604/681 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5813454839930691019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1165692197531384825.kers'
[2026-05-23 08:15:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5813454839930691019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1165692197531384825.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 604 rows 417 cols 1643 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-23 08:15:59] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1165692197531384825.kers
Total runtime 2 ms.
[2026-05-23 08:15:59] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-23 08:15:59] [INFO ] Invariant cache hit.
[2026-05-23 08:15:59] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-23 08:15:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 604/1021 variables, 417/425 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 427 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 604/1021 variables, 417/427 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 603/1030 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 1031 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60141ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 417/477 places, 604/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 417/477 places, 604/681 transitions.
[2026-05-23 08:16:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:16:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:16:59] [INFO ] Input system was already deterministic with 604 transitions.
[2026-05-23 08:16:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:16:59] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:16:59] [INFO ] Time to serialize gal into /tmp/CTLFireability14311770020290469744.gal : 2 ms
[2026-05-23 08:16:59] [INFO ] Time to serialize properties into /tmp/CTLFireability3699214683471920857.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/CTLFireability14311770020290469744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3699214683471920857.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.96542e+11,7.25852,198520,2,22380,5,631549,6,0,2265,885001,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:17:29] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:17:29] [INFO ] Applying decomposition
[2026-05-23 08:17:29] [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/graph1740849618024908675.txt' '-o' '/tmp/graph1740849618024908675.bin' '-w' '/tmp/graph1740849618024908675.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1740849618024908675.bin' '-l' '-1' '-v' '-w' '/tmp/graph1740849618024908675.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:17:30] [INFO ] Decomposing Gal with order
[2026-05-23 08:17:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:17:30] [INFO ] Removed a total of 403 redundant transitions.
[2026-05-23 08:17:30] [INFO ] Flatten gal took : 20 ms
[2026-05-23 08:17:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 6 ms.
[2026-05-23 08:17:30] [INFO ] Time to serialize gal into /tmp/CTLFireability2580680643659592767.gal : 4 ms
[2026-05-23 08:17:30] [INFO ] Time to serialize properties into /tmp/CTLFireability16168081530816396215.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/CTLFireability2580680643659592767.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16168081530816396215.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.96542e+11,0.450026,19400,813,200,22631,8901,1050,49487,122,39263,0


Converting to forward existential form...Done !
original formula: !(E(E(((i11.u107.p577==1) + AF((i5.u58.p371==1))) U EG(((i18.u140.p775!=1)&&((i15.u116.p603==1)||(i13.u122.p637==1))))) U EX(E((i13.u115....190
=> equivalent forward existential formula: [(EY(FwdU(EY(FwdU(Init,E(((i11.u107.p577==1) + !(EG(!((i5.u58.p371==1))))) U EG(((i18.u140.p775!=1)&&((i15.u116....239
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t80, t139, t150, t166, t219, t233, t237, t247, t315, t443, t477, t564, t570, t574, ...961
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 442 transition count 643
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 442 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 442 transition count 640
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 90 place count 425 transition count 620
Iterating global reduction 1 with 17 rules applied. Total rules applied 107 place count 425 transition count 620
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 425 transition count 619
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 112 place count 421 transition count 614
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 421 transition count 614
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 118 place count 421 transition count 612
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 119 place count 420 transition count 611
Iterating global reduction 3 with 1 rules applied. Total rules applied 120 place count 420 transition count 611
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 121 place count 419 transition count 610
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 place count 419 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 419 transition count 609
Applied a total of 123 rules in 34 ms. Remains 419 /477 variables (removed 58) and now considering 609/681 (removed 72) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10649959526898606401.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2408442252608619444.kers'
[2026-05-23 08:18:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10649959526898606401.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2408442252608619444.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 609 rows 419 cols 1657 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-23 08:18:00] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2408442252608619444.kers
Total runtime 2 ms.
[2026-05-23 08:18:00] [INFO ] Implicit Places using invariants in 177 ms returned []
[2026-05-23 08:18:00] [INFO ] Invariant cache hit.
[2026-05-23 08:18:00] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Running 608 sub problems to find dead transitions.
[2026-05-23 08:18:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (OVERLAPS) 609/1028 variables, 419/427 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1028/1028 variables, and 429 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 4 (OVERLAPS) 609/1028 variables, 419/429 constraints. Problems are: Problem set: 0 solved, 608 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1028 variables, 608/1037 constraints. Problems are: Problem set: 0 solved, 608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1028/1028 variables, and 1037 constraints, problems are : Problem set: 0 solved, 608 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 608/608 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 608 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 419/477 places, 609/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60610 ms. Remains : 419/477 places, 609/681 transitions.
[2026-05-23 08:19:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:19:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:19:00] [INFO ] Input system was already deterministic with 609 transitions.
[2026-05-23 08:19:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:19:00] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:19:00] [INFO ] Time to serialize gal into /tmp/CTLFireability18102094693340101514.gal : 3 ms
[2026-05-23 08:19:00] [INFO ] Time to serialize properties into /tmp/CTLFireability12714174214634475123.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/CTLFireability18102094693340101514.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12714174214634475123.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.3946e+11,8.18235,198760,2,21706,5,616199,6,0,2278,893288,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:19:30] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:19:30] [INFO ] Applying decomposition
[2026-05-23 08:19:30] [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/graph4611582775652470236.txt' '-o' '/tmp/graph4611582775652470236.bin' '-w' '/tmp/graph4611582775652470236.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4611582775652470236.bin' '-l' '-1' '-v' '-w' '/tmp/graph4611582775652470236.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:19:30] [INFO ] Decomposing Gal with order
[2026-05-23 08:19:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:19:31] [INFO ] Removed a total of 403 redundant transitions.
[2026-05-23 08:19:31] [INFO ] Flatten gal took : 59 ms
[2026-05-23 08:19:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 13 ms.
[2026-05-23 08:19:31] [INFO ] Time to serialize gal into /tmp/CTLFireability4826538355157422189.gal : 13 ms
[2026-05-23 08:19:31] [INFO ] Time to serialize properties into /tmp/CTLFireability5513695324521104772.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/CTLFireability4826538355157422189.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5513695324521104772.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,3.3946e+11,0.543215,24484,833,188,29710,9386,966,84633,131,44732,0


Converting to forward existential form...Done !
original formula: AF(EX(((AG((i16.u131.p710==1)) * (i5.u41.p248==1)) * (i6.u62.p371==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EX(((!(E(TRUE U !((i16.u131.p710==1)))) * (i5.u41.p248==1)) * (i6.u62.p371==1)))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t86, t90, t144, t154, t211, t223, t237, t251, t270, t319, t447, t482, t537, t579, i...950
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found 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 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
(forward)formula 0,0,1.7236,61816,1,0,91694,10115,7839,318131,743,48478,223973
FORMULA CO4-PT-16-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Graph (trivial) has 492 edges and 477 vertex of which 2 / 477 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1023 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 171 transitions
Trivial Post-agglo rules discarded 171 transitions
Performed 171 trivial Post agglomeration. Transition count delta: 171
Iterating post reduction 0 with 171 rules applied. Total rules applied 173 place count 469 transition count 500
Reduce places removed 171 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 177 rules applied. Total rules applied 350 place count 298 transition count 494
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 354 place count 296 transition count 492
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 3 with 5 rules applied. Total rules applied 359 place count 295 transition count 488
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 363 place count 291 transition count 488
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 363 place count 291 transition count 453
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 433 place count 256 transition count 453
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 449 place count 240 transition count 432
Iterating global reduction 5 with 16 rules applied. Total rules applied 465 place count 240 transition count 432
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 3 rules applied. Total rules applied 468 place count 240 transition count 429
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 471 place count 239 transition count 427
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 474 place count 238 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 475 place count 237 transition count 425
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 475 place count 237 transition count 421
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 483 place count 233 transition count 421
Discarding 7 places :
Symmetric choice reduction at 9 with 7 rule applications. Total rules 490 place count 226 transition count 410
Iterating global reduction 9 with 7 rules applied. Total rules applied 497 place count 226 transition count 410
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 4 rules applied. Total rules applied 501 place count 226 transition count 406
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 502 place count 225 transition count 406
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 11 with 52 rules applied. Total rules applied 554 place count 199 transition count 380
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 6 rules applied. Total rules applied 560 place count 199 transition count 374
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 562 place count 198 transition count 373
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 564 place count 196 transition count 369
Iterating global reduction 13 with 2 rules applied. Total rules applied 566 place count 196 transition count 369
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 13 with 8 rules applied. Total rules applied 574 place count 192 transition count 365
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 4 rules applied. Total rules applied 578 place count 192 transition count 361
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 3 rules applied. Total rules applied 581 place count 191 transition count 359
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 583 place count 190 transition count 358
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 584 place count 189 transition count 356
Iterating global reduction 16 with 1 rules applied. Total rules applied 585 place count 189 transition count 356
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 586 place count 188 transition count 354
Iterating global reduction 16 with 1 rules applied. Total rules applied 587 place count 188 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 588 place count 188 transition count 353
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 17 with 2 rules applied. Total rules applied 590 place count 187 transition count 352
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 17 with 14 rules applied. Total rules applied 604 place count 187 transition count 338
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 17 with 7 rules applied. Total rules applied 611 place count 187 transition count 331
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 618 place count 180 transition count 331
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 19 with 2 rules applied. Total rules applied 620 place count 179 transition count 330
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 622 place count 177 transition count 328
Applied a total of 622 rules in 84 ms. Remains 177 /477 variables (removed 300) and now considering 328/681 (removed 353) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17667614041826176354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6872632585015649346.kers'
[2026-05-23 08:19:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17667614041826176354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6872632585015649346.kers]
Normalized transition count is 327 out of 328 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 327 rows 177 cols 823 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-23 08:19:32] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-6872632585015649346.kers
Total runtime 14 ms.
[2026-05-23 08:19:33] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-23 08:19:33] [INFO ] Invariant cache hit.
[2026-05-23 08:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:19:33] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2026-05-23 08:19:33] [INFO ] Redundant transitions in 5 ms returned []
Running 309 sub problems to find dead transitions.
[2026-05-23 08:19:33] [INFO ] Invariant cache hit.
[2026-05-23 08:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 327/503 variables, 176/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (OVERLAPS) 1/504 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/504 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (OVERLAPS) 1/505 variables, 1/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/505 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 8 (OVERLAPS) 0/505 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 309 unsolved
No progress, stopping.
After SMT solving in domain Real declared 505/505 variables, and 184 constraints, problems are : Problem set: 0 solved, 309 unsolved in 26396 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 177/177 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 309 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/176 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/176 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 2 (OVERLAPS) 327/503 variables, 176/182 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 231/413 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 5 (OVERLAPS) 1/504 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 309 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/504 variables, 78/492 constraints. Problems are: Problem set: 0 solved, 309 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 504/505 variables, and 492 constraints, problems are : Problem set: 0 solved, 309 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 177/177 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 309/309 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56455ms problems are : Problem set: 0 solved, 309 unsolved
Search for dead transitions found 0 dead transitions in 56456ms
Starting structural reductions in SI_CTL mode, iteration 1 : 177/477 places, 328/681 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56879 ms. Remains : 177/477 places, 328/681 transitions.
[2026-05-23 08:20:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:20:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:20:29] [INFO ] Input system was already deterministic with 328 transitions.
[2026-05-23 08:20:29] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:20:29] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:20:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10732169119921327056.gal : 2 ms
[2026-05-23 08:20:29] [INFO ] Time to serialize properties into /tmp/CTLFireability10728758031546173398.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/CTLFireability10732169119921327056.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10728758031546173398.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,5.40673e+08,0.280554,15664,2,2072,5,44145,6,0,1026,37290,0


Converting to forward existential form...Done !
original formula: EF(((EG(((p593==1)&&(p694==1))) * (p473==0)) * (AG((p581==0)) + ((p750==0)&&(p692==0)))))
=> equivalent forward existential formula: ([((FwdU(Init,TRUE) * (EG(((p593==1)&&(p694==1))) * (p473==0))) * !(E(TRUE U !((p581==0)))))] != FALSE + [((FwdU...247
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t13, t60, t68, t88, t91, t99, t105, t135, t261, t267, Intersection with reachable a...225
(forward)formula 0,1,15.4008,438920,1,0,612,2.68499e+06,686,305,7199,1.64328e+06,861
FORMULA CO4-PT-16-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 448 transition count 650
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 448 transition count 650
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 62 place count 448 transition count 646
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 75 place count 435 transition count 631
Iterating global reduction 1 with 13 rules applied. Total rules applied 88 place count 435 transition count 631
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 91 place count 432 transition count 626
Iterating global reduction 1 with 3 rules applied. Total rules applied 94 place count 432 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 432 transition count 625
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 97 place count 430 transition count 623
Iterating global reduction 2 with 2 rules applied. Total rules applied 99 place count 430 transition count 623
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 429 transition count 622
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 429 transition count 622
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 102 place count 429 transition count 621
Applied a total of 102 rules in 36 ms. Remains 429 /477 variables (removed 48) and now considering 621/681 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4495944882212795900.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7390256846323934767.kers'
[2026-05-23 08:20:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4495944882212795900.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7390256846323934767.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 621 rows 429 cols 1689 entries
Finished phase 1 with 423 SingleSign rule and 0 generalized
[2026-05-23 08:20:45] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7390256846323934767.kers
Total runtime 4 ms.
[2026-05-23 08:20:45] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 08:20:45] [INFO ] Invariant cache hit.
[2026-05-23 08:20:45] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 620 sub problems to find dead transitions.
[2026-05-23 08:20:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/429 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (OVERLAPS) 621/1050 variables, 429/435 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1050/1050 variables, and 438 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 620 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/428 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 1 (OVERLAPS) 1/429 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/429 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/429 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 4 (OVERLAPS) 621/1050 variables, 429/438 constraints. Problems are: Problem set: 0 solved, 620 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1050 variables, 620/1058 constraints. Problems are: Problem set: 0 solved, 620 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1050/1050 variables, and 1058 constraints, problems are : Problem set: 0 solved, 620 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 429/429 constraints, PredecessorRefiner: 620/620 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 620 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Starting structural reductions in LTL mode, iteration 1 : 429/477 places, 621/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60580 ms. Remains : 429/477 places, 621/681 transitions.
[2026-05-23 08:21:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:45] [INFO ] Input system was already deterministic with 621 transitions.
[2026-05-23 08:21:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:45] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:21:45] [INFO ] Time to serialize gal into /tmp/CTLFireability11094888301791733277.gal : 3 ms
[2026-05-23 08:21:45] [INFO ] Time to serialize properties into /tmp/CTLFireability6299364511944492228.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/CTLFireability11094888301791733277.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6299364511944492228.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,4.28467e+11,8.05549,193636,2,24177,5,629958,6,0,2330,842588,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:22:16] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:22:16] [INFO ] Applying decomposition
[2026-05-23 08:22:16] [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/graph4617376693907935646.txt' '-o' '/tmp/graph4617376693907935646.bin' '-w' '/tmp/graph4617376693907935646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4617376693907935646.bin' '-l' '-1' '-v' '-w' '/tmp/graph4617376693907935646.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:22:16] [INFO ] Decomposing Gal with order
[2026-05-23 08:22:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:22:16] [INFO ] Removed a total of 408 redundant transitions.
[2026-05-23 08:22:16] [INFO ] Flatten gal took : 30 ms
[2026-05-23 08:22:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 9 ms.
[2026-05-23 08:22:16] [INFO ] Time to serialize gal into /tmp/CTLFireability3560311729583644228.gal : 5 ms
[2026-05-23 08:22:16] [INFO ] Time to serialize properties into /tmp/CTLFireability11178602044203809190.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/CTLFireability3560311729583644228.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11178602044203809190.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,4.28467e+11,0.415602,20416,842,188,22617,7618,1123,58499,136,46088,0


Converting to forward existential form...Done !
original formula: A(((AF((!(AX(FALSE)) * E(!((((i12.i1.u102.p557==1)&&(i17.i0.u126.p670==1))&&(i17.i0.u141.p821==1))) U (i17.i0.u138.p782==1)))) + (i4.i1.u...494
=> equivalent forward existential formula: [((Init * !(EG(!((!(EX(!((((i0.i1.u10.p109==1)||(i5.i0.u55.p344==1))||(i11.i0.u90.p511==1))))) * ((EX(E(((i16.i1...1215
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t91, t114, t149, t159, t208, t230, t244, t327, t429, t455, t490, t546, i0.i0.u13.t4...1137
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 an SCC at level 2
Fast SCC detection found a local 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 444 transition count 645
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 444 transition count 645
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 70 place count 444 transition count 641
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 87 place count 427 transition count 621
Iterating global reduction 1 with 17 rules applied. Total rules applied 104 place count 427 transition count 621
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 427 transition count 620
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 110 place count 422 transition count 613
Iterating global reduction 2 with 5 rules applied. Total rules applied 115 place count 422 transition count 613
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 117 place count 422 transition count 611
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 119 place count 420 transition count 609
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 420 transition count 609
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 122 place count 419 transition count 608
Iterating global reduction 3 with 1 rules applied. Total rules applied 123 place count 419 transition count 608
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 419 transition count 607
Applied a total of 124 rules in 30 ms. Remains 419 /477 variables (removed 58) and now considering 607/681 (removed 74) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9121915233422937418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-563130555271143653.kers'
[2026-05-23 08:22:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9121915233422937418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-563130555271143653.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 607 rows 419 cols 1659 entries
Finished phase 1 with 413 SingleSign rule and 0 generalized
[2026-05-23 08:22:46] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-563130555271143653.kers
Total runtime 2 ms.
[2026-05-23 08:22:46] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-23 08:22:46] [INFO ] Invariant cache hit.
[2026-05-23 08:22:46] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2026-05-23 08:22:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (OVERLAPS) 607/1026 variables, 419/425 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1026/1026 variables, and 428 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/418 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (OVERLAPS) 1/419 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/419 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/419 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/419 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 5 (OVERLAPS) 607/1026 variables, 419/430 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1026 variables, 606/1036 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1026/1026 variables, and 1037 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 419/419 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60157ms
Starting structural reductions in LTL mode, iteration 1 : 419/477 places, 607/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 419/477 places, 607/681 transitions.
[2026-05-23 08:23:46] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:23:46] [INFO ] Flatten gal took : 17 ms
[2026-05-23 08:23:46] [INFO ] Input system was already deterministic with 607 transitions.
[2026-05-23 08:23:46] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:23:46] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:23:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3147476548047700972.gal : 2 ms
[2026-05-23 08:23:46] [INFO ] Time to serialize properties into /tmp/CTLFireability2024829959937922970.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/CTLFireability3147476548047700972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2024829959937922970.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,3.16026e+11,12.4794,286108,2,28487,5,833474,6,0,2276,1.366e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:24:16] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:24:16] [INFO ] Applying decomposition
[2026-05-23 08:24:16] [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/graph6036885161881848085.txt' '-o' '/tmp/graph6036885161881848085.bin' '-w' '/tmp/graph6036885161881848085.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6036885161881848085.bin' '-l' '-1' '-v' '-w' '/tmp/graph6036885161881848085.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:24:17] [INFO ] Decomposing Gal with order
[2026-05-23 08:24:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:24:17] [INFO ] Removed a total of 427 redundant transitions.
[2026-05-23 08:24:17] [INFO ] Flatten gal took : 18 ms
[2026-05-23 08:24:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 8 ms.
[2026-05-23 08:24:17] [INFO ] Time to serialize gal into /tmp/CTLFireability5919019049533196674.gal : 3 ms
[2026-05-23 08:24:17] [INFO ] Time to serialize properties into /tmp/CTLFireability9525671697380983759.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/CTLFireability5919019049533196674.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9525671697380983759.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,3.16026e+11,0.438936,22640,1053,149,33323,1227,1065,88023,115,6152,0


Converting to forward existential form...Done !
original formula: !(A((((!(A((i4.u21.p163==1) U (((i12.i1.i4.u67.p394==1)&&(i15.u135.p670==1))&&(i15.u144.p750==1)))) * !((EF((i12.i0.i0.u64.p379==1)) * AX...330
=> equivalent forward existential formula: ([(FwdU((FwdU(Init,!(!(E(TRUE U !((i12.i1.i2.u94.p504==1)))))) * !((((!(!((E(!((((i12.i1.i4.u67.p394==1)&&(i15.u...695
Reverse transition relation is NOT exact ! Due to transitions t13, t80, t138, t148, t217, t245, t257, t269, t315, t444, t479, t571, t572, t574, t575, t577,...1003
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Graph (trivial) has 496 edges and 477 vertex of which 2 / 477 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1023 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 177 transitions
Trivial Post-agglo rules discarded 177 transitions
Performed 177 trivial Post agglomeration. Transition count delta: 177
Iterating post reduction 0 with 177 rules applied. Total rules applied 179 place count 469 transition count 494
Reduce places removed 177 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 183 rules applied. Total rules applied 362 place count 292 transition count 488
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 366 place count 290 transition count 486
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 3 with 6 rules applied. Total rules applied 372 place count 289 transition count 481
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 377 place count 284 transition count 481
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 377 place count 284 transition count 446
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 447 place count 249 transition count 446
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 463 place count 233 transition count 424
Iterating global reduction 5 with 16 rules applied. Total rules applied 479 place count 233 transition count 424
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 481 place count 233 transition count 422
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 481 place count 233 transition count 418
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 489 place count 229 transition count 418
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 496 place count 222 transition count 407
Iterating global reduction 6 with 7 rules applied. Total rules applied 503 place count 222 transition count 407
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 506 place count 222 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 507 place count 221 transition count 404
Performed 26 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 8 with 52 rules applied. Total rules applied 559 place count 195 transition count 377
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 566 place count 195 transition count 370
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 568 place count 194 transition count 369
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 570 place count 192 transition count 365
Iterating global reduction 10 with 2 rules applied. Total rules applied 572 place count 192 transition count 365
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 10 with 8 rules applied. Total rules applied 580 place count 188 transition count 361
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 586 place count 188 transition count 355
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 592 place count 186 transition count 351
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 5 rules applied. Total rules applied 597 place count 184 transition count 348
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 599 place count 183 transition count 347
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 600 place count 182 transition count 345
Iterating global reduction 14 with 1 rules applied. Total rules applied 601 place count 182 transition count 345
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 602 place count 181 transition count 343
Iterating global reduction 14 with 1 rules applied. Total rules applied 603 place count 181 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 604 place count 181 transition count 342
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 608 place count 179 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 621 place count 179 transition count 327
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 15 with 7 rules applied. Total rules applied 628 place count 179 transition count 320
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 635 place count 172 transition count 320
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 17 with 2 rules applied. Total rules applied 637 place count 171 transition count 319
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 639 place count 169 transition count 317
Applied a total of 639 rules in 99 ms. Remains 169 /477 variables (removed 308) and now considering 317/681 (removed 364) transitions.
[2026-05-23 08:24:47] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11199935002574481690.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14354051401205877825.kers'
[2026-05-23 08:24:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11199935002574481690.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14354051401205877825.kers]
Normalized transition count is 290 out of 291 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 290 rows 169 cols 735 entries
Finished phase 1 with 163 SingleSign rule and 0 generalized
[2026-05-23 08:24:47] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14354051401205877825.kers
Total runtime 2 ms.
[2026-05-23 08:24:47] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-23 08:24:47] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2026-05-23 08:24:47] [INFO ] Invariant cache hit.
[2026-05-23 08:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:24:47] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2026-05-23 08:24:47] [INFO ] Redundant transitions in 4 ms returned []
Running 302 sub problems to find dead transitions.
[2026-05-23 08:24:47] [INFO ] Flow matrix only has 291 transitions (discarded 26 similar events)
[2026-05-23 08:24:47] [INFO ] Invariant cache hit.
[2026-05-23 08:24:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 290/457 variables, 167/173 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (OVERLAPS) 2/459 variables, 2/175 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (OVERLAPS) 1/460 variables, 1/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 0/460 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 302 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 176 constraints, problems are : Problem set: 0 solved, 302 unsolved in 23555 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 302 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 2 (OVERLAPS) 290/457 variables, 167/173 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 222/395 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 5 (OVERLAPS) 2/459 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 80/477 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 302 unsolved
At refinement iteration 8 (OVERLAPS) 1/460 variables, 1/478 constraints. Problems are: Problem set: 0 solved, 302 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 478 constraints, problems are : Problem set: 0 solved, 302 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 169/169 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 302/302 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 53609ms problems are : Problem set: 0 solved, 302 unsolved
Search for dead transitions found 0 dead transitions in 53610ms
Starting structural reductions in SI_CTL mode, iteration 1 : 169/477 places, 317/681 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53983 ms. Remains : 169/477 places, 317/681 transitions.
[2026-05-23 08:25:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:25:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:25:41] [INFO ] Input system was already deterministic with 317 transitions.
[2026-05-23 08:25:41] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:25:41] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:25:41] [INFO ] Time to serialize gal into /tmp/CTLFireability16164096100060728685.gal : 1 ms
[2026-05-23 08:25:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13160484055980864561.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/CTLFireability16164096100060728685.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13160484055980864561.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.83891e+08,0.146345,9108,2,1458,5,21307,6,0,982,14904,0


Converting to forward existential form...Done !
original formula: ((AF((p822!=1)) * EF((p188==1))) * EG(((p371!=1)&&(p116!=1))))
=> equivalent forward existential formula: (([FwdG(Init,!((p822!=1)))] = FALSE * [(Init * !(E(TRUE U (p188==1))))] = FALSE) * [(Init * !(EG(((p371!=1)&&(p1...175
Reverse transition relation is NOT exact ! Due to transitions t1, t13, t19, t55, t64, t85, t89, t97, t103, t133, t231, t232, Intersection with reachable a...225
Detected timeout of ITS tools.
[2026-05-23 08:26:11] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:26:11] [INFO ] Applying decomposition
[2026-05-23 08:26:11] [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/graph12320834142977836570.txt' '-o' '/tmp/graph12320834142977836570.bin' '-w' '/tmp/graph12320834142977836570.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12320834142977836570.bin' '-l' '-1' '-v' '-w' '/tmp/graph12320834142977836570.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:26:11] [INFO ] Decomposing Gal with order
[2026-05-23 08:26:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:26:11] [INFO ] Removed a total of 282 redundant transitions.
[2026-05-23 08:26:11] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:26:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 6 ms.
[2026-05-23 08:26:11] [INFO ] Time to serialize gal into /tmp/CTLFireability6736957444588820172.gal : 3 ms
[2026-05-23 08:26:11] [INFO ] Time to serialize properties into /tmp/CTLFireability8167096867608286648.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/CTLFireability6736957444588820172.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8167096867608286648.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,3.83891e+08,0.072652,5876,145,86,2343,720,641,3358,115,1978,0


Converting to forward existential form...Done !
original formula: ((AF((i7.i1.u60.p822!=1)) * EF((i0.u9.p188==1))) * EG(((i1.i2.u24.p371!=1)&&(i2.i1.u3.p116!=1))))
=> equivalent forward existential formula: (([FwdG(Init,!((i7.i1.u60.p822!=1)))] = FALSE * [(Init * !(E(TRUE U (i0.u9.p188==1))))] = FALSE) * [(Init * !(EG...210
Reverse transition relation is NOT exact ! Due to transitions t130, i0.u9.t85, i0.u10.t89, i1.i2.u24.t64, i2.i0.u1.t103, i2.i1.u4.t97, i3.u30.t55, i7.t232,...312
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 2
Fast SCC detection found 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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 441 transition count 641
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 441 transition count 641
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 76 place count 441 transition count 637
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 94 place count 423 transition count 616
Iterating global reduction 1 with 18 rules applied. Total rules applied 112 place count 423 transition count 616
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 423 transition count 615
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 418 transition count 608
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 418 transition count 608
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 125 place count 418 transition count 606
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 127 place count 416 transition count 604
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 416 transition count 604
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 130 place count 415 transition count 603
Iterating global reduction 3 with 1 rules applied. Total rules applied 131 place count 415 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 132 place count 415 transition count 602
Applied a total of 132 rules in 40 ms. Remains 415 /477 variables (removed 62) and now considering 602/681 (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-3751935359330101338.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15596145919474690724.kers'
[2026-05-23 08:26:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3751935359330101338.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15596145919474690724.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 415 cols 1639 entries
Finished phase 1 with 409 SingleSign rule and 0 generalized
[2026-05-23 08:26:41] [INFO ] Computed 6 invariants in 3 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15596145919474690724.kers
Total runtime 4 ms.
[2026-05-23 08:26:41] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-23 08:26:41] [INFO ] Invariant cache hit.
[2026-05-23 08:26:41] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-23 08:26:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (OVERLAPS) 602/1017 variables, 415/421 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1017/1017 variables, and 423 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (OVERLAPS) 1/415 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/415 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/415 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/415 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 5 (OVERLAPS) 602/1017 variables, 415/425 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1017 variables, 601/1026 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1017/1017 variables, and 1026 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60146ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60147ms
Starting structural reductions in LTL mode, iteration 1 : 415/477 places, 602/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60703 ms. Remains : 415/477 places, 602/681 transitions.
[2026-05-23 08:27:42] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:27:42] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:27:42] [INFO ] Input system was already deterministic with 602 transitions.
[2026-05-23 08:27:42] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:27:42] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:27:42] [INFO ] Time to serialize gal into /tmp/CTLFireability16727190616169422791.gal : 2 ms
[2026-05-23 08:27:42] [INFO ] Time to serialize properties into /tmp/CTLFireability7640357270786785206.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/CTLFireability16727190616169422791.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7640357270786785206.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.94028e+11,6.90125,193288,2,22168,5,622627,6,0,2255,862136,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:28:12] [INFO ] Flatten gal took : 6 ms
[2026-05-23 08:28:12] [INFO ] Applying decomposition
[2026-05-23 08:28:12] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10974935346401738703.txt' '-o' '/tmp/graph10974935346401738703.bin' '-w' '/tmp/graph10974935346401738703.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10974935346401738703.bin' '-l' '-1' '-v' '-w' '/tmp/graph10974935346401738703.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:28:12] [INFO ] Decomposing Gal with order
[2026-05-23 08:28:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:28:12] [INFO ] Removed a total of 401 redundant transitions.
[2026-05-23 08:28:12] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:28:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 5 ms.
[2026-05-23 08:28:12] [INFO ] Time to serialize gal into /tmp/CTLFireability5061276817914673817.gal : 3 ms
[2026-05-23 08:28:12] [INFO ] Time to serialize properties into /tmp/CTLFireability14060182415628327689.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/CTLFireability5061276817914673817.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14060182415628327689.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.94028e+11,0.417803,22424,898,217,26285,8666,1030,76606,129,40628,0


Converting to forward existential form...Done !
original formula: AX(AG((AF(AG((i3.i1.i1.u45.p289==1))) * (EF((i0.u7.p93==1)) + E((i2.u33.p224==1) U ((i6.u56.p346==1)&&(i7.u148.p825==1)))))))
=> equivalent forward existential formula: ([FwdG(FwdU(EY(Init),TRUE),!(!(E(TRUE U !((i3.i1.i1.u45.p289==1))))))] = FALSE * [((FwdU(EY(Init),TRUE) * !(E((i...253
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t80, t112, t138, t148, t205, t217, t313, t382, t442, t476, t561, t568, i0.t438, i0....975
(forward)formula 0,0,7.79299,290000,1,0,395715,19707,8117,1.9139e+06,756,109941,684412
FORMULA CO4-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Graph (trivial) has 474 edges and 477 vertex of which 2 / 477 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1023 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 163 transitions
Trivial Post-agglo rules discarded 163 transitions
Performed 163 trivial Post agglomeration. Transition count delta: 163
Iterating post reduction 0 with 163 rules applied. Total rules applied 165 place count 469 transition count 508
Reduce places removed 163 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 169 rules applied. Total rules applied 334 place count 306 transition count 502
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 338 place count 304 transition count 500
Reduce places removed 1 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 3 with 14 rules applied. Total rules applied 352 place count 303 transition count 487
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 365 place count 290 transition count 487
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 35 Pre rules applied. Total rules applied 365 place count 290 transition count 452
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 5 with 70 rules applied. Total rules applied 435 place count 255 transition count 452
Discarding 19 places :
Symmetric choice reduction at 5 with 19 rule applications. Total rules 454 place count 236 transition count 428
Iterating global reduction 5 with 19 rules applied. Total rules applied 473 place count 236 transition count 428
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 6 rules applied. Total rules applied 479 place count 236 transition count 422
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 4 rules applied. Total rules applied 483 place count 234 transition count 420
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 486 place count 233 transition count 418
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 487 place count 232 transition count 418
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 487 place count 232 transition count 414
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 495 place count 228 transition count 414
Discarding 8 places :
Symmetric choice reduction at 9 with 8 rule applications. Total rules 503 place count 220 transition count 401
Iterating global reduction 9 with 8 rules applied. Total rules applied 511 place count 220 transition count 401
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 4 rules applied. Total rules applied 515 place count 220 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 516 place count 219 transition count 397
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 11 with 42 rules applied. Total rules applied 558 place count 198 transition count 376
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 8 rules applied. Total rules applied 566 place count 198 transition count 368
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 570 place count 196 transition count 366
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 572 place count 194 transition count 362
Iterating global reduction 13 with 2 rules applied. Total rules applied 574 place count 194 transition count 362
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 13 with 8 rules applied. Total rules applied 582 place count 190 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 13 with 3 rules applied. Total rules applied 585 place count 190 transition count 355
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 14 with 3 rules applied. Total rules applied 588 place count 189 transition count 353
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 590 place count 188 transition count 352
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 591 place count 187 transition count 350
Iterating global reduction 16 with 1 rules applied. Total rules applied 592 place count 187 transition count 350
Discarding 1 places :
Symmetric choice reduction at 16 with 1 rule applications. Total rules 593 place count 186 transition count 348
Iterating global reduction 16 with 1 rules applied. Total rules applied 594 place count 186 transition count 348
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 595 place count 186 transition count 347
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 17 with 2 rules applied. Total rules applied 597 place count 185 transition count 346
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 17 with 13 rules applied. Total rules applied 610 place count 185 transition count 333
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 17 with 7 rules applied. Total rules applied 617 place count 185 transition count 326
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 18 with 7 rules applied. Total rules applied 624 place count 178 transition count 326
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 19 with 2 rules applied. Total rules applied 626 place count 177 transition count 325
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 19 with 3 rules applied. Total rules applied 629 place count 177 transition count 325
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 631 place count 175 transition count 323
Applied a total of 631 rules in 65 ms. Remains 175 /477 variables (removed 302) and now considering 323/681 (removed 358) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9269496182388873464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12553727319084062380.kers'
[2026-05-23 08:28:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9269496182388873464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12553727319084062380.kers]
Normalized transition count is 322 out of 323 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 322 rows 175 cols 1009 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-23 08:28:20] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12553727319084062380.kers
Total runtime 1 ms.
[2026-05-23 08:28:20] [INFO ] Implicit Places using invariants in 315 ms returned []
[2026-05-23 08:28:20] [INFO ] Invariant cache hit.
[2026-05-23 08:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:28:20] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2026-05-23 08:28:20] [INFO ] Redundant transitions in 2 ms returned []
Running 313 sub problems to find dead transitions.
[2026-05-23 08:28:20] [INFO ] Invariant cache hit.
[2026-05-23 08:28:20] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (OVERLAPS) 322/496 variables, 174/180 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/496 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (OVERLAPS) 1/497 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/497 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 1/498 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 498/498 variables, and 183 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 175/175 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 313 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 2 (OVERLAPS) 1/174 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/174 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 5 (OVERLAPS) 322/496 variables, 174/181 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/496 variables, 232/413 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 9 (OVERLAPS) 1/497 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 313 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 81/496 constraints. Problems are: Problem set: 0 solved, 313 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 497/498 variables, and 496 constraints, problems are : Problem set: 0 solved, 313 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 175/175 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 313/313 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 313 unsolved
Search for dead transitions found 0 dead transitions in 60083ms
Starting structural reductions in SI_CTL mode, iteration 1 : 175/477 places, 323/681 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60645 ms. Remains : 175/477 places, 323/681 transitions.
[2026-05-23 08:29:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:29:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:29:20] [INFO ] Input system was already deterministic with 323 transitions.
[2026-05-23 08:29:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:29:20] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:29:20] [INFO ] Time to serialize gal into /tmp/CTLFireability4254651427110291042.gal : 1 ms
[2026-05-23 08:29:20] [INFO ] Time to serialize properties into /tmp/CTLFireability16756892386942392757.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/CTLFireability4254651427110291042.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16756892386942392757.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,6.78332e+08,0.242217,13944,2,2471,5,44100,6,0,1012,32425,0


Converting to forward existential form...Done !
original formula: (AG((AF((((p556==0)&&(p112==0))&&(((p227==0)||(p371==0))||(p485==0)))) * (((p648==0)||(p670==0))||(p750==0)))) + EG(EF((((p457==1)&&(p670...175
=> equivalent forward existential formula: ([FwdG(FwdU((Init * !(EG(E(TRUE U (((p457==1)&&(p670==1))&&(p821==1)))))),TRUE),!((((p556==0)&&(p112==0))&&(((p2...326
Reverse transition relation is NOT exact ! Due to transitions t1, t7, t9, t34, t51, t60, t79, t82, t89, t96, t125, t165, t169, t182, t183, t196, t218, t219...275
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,10.6261,314612,1,0,492,1.9053e+06,684,250,8111,1.15182e+06,682
FORMULA CO4-PT-16-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 442 transition count 642
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 442 transition count 642
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 73 place count 442 transition count 639
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 90 place count 425 transition count 619
Iterating global reduction 1 with 17 rules applied. Total rules applied 107 place count 425 transition count 619
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 425 transition count 618
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 113 place count 420 transition count 611
Iterating global reduction 2 with 5 rules applied. Total rules applied 118 place count 420 transition count 611
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 120 place count 420 transition count 609
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 122 place count 418 transition count 607
Iterating global reduction 3 with 2 rules applied. Total rules applied 124 place count 418 transition count 607
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 125 place count 417 transition count 606
Iterating global reduction 3 with 1 rules applied. Total rules applied 126 place count 417 transition count 606
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 127 place count 417 transition count 605
Applied a total of 127 rules in 41 ms. Remains 417 /477 variables (removed 60) and now considering 605/681 (removed 76) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2017680362250263615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4745231052151320317.kers'
[2026-05-23 08:29:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2017680362250263615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4745231052151320317.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 605 rows 417 cols 1647 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-23 08:29:31] [INFO ] Computed 6 invariants in 6 ms
Computed 6 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-4745231052151320317.kers
Total runtime 7 ms.
[2026-05-23 08:29:31] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-23 08:29:31] [INFO ] Invariant cache hit.
[2026-05-23 08:29:31] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-23 08:29:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (OVERLAPS) 605/1022 variables, 417/425 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1022/1022 variables, and 428 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 4 (OVERLAPS) 605/1022 variables, 417/428 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1022 variables, 604/1032 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1022/1022 variables, and 1032 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 417/477 places, 605/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 417/477 places, 605/681 transitions.
[2026-05-23 08:30:32] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:30:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:30:32] [INFO ] Input system was already deterministic with 605 transitions.
[2026-05-23 08:30:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:30:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:30:32] [INFO ] Time to serialize gal into /tmp/CTLFireability13835289701504023025.gal : 2 ms
[2026-05-23 08:30:32] [INFO ] Time to serialize properties into /tmp/CTLFireability4548495140158462321.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/CTLFireability13835289701504023025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4548495140158462321.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,3.14033e+11,9.52301,228980,2,25162,5,712193,6,0,2266,1.05651e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:31:02] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:31:02] [INFO ] Applying decomposition
[2026-05-23 08:31:02] [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/graph7044964330166310756.txt' '-o' '/tmp/graph7044964330166310756.bin' '-w' '/tmp/graph7044964330166310756.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7044964330166310756.bin' '-l' '-1' '-v' '-w' '/tmp/graph7044964330166310756.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:31:02] [INFO ] Decomposing Gal with order
[2026-05-23 08:31:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:31:02] [INFO ] Removed a total of 405 redundant transitions.
[2026-05-23 08:31:02] [INFO ] Flatten gal took : 16 ms
[2026-05-23 08:31:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 3 ms.
[2026-05-23 08:31:02] [INFO ] Time to serialize gal into /tmp/CTLFireability17046764479121066503.gal : 3 ms
[2026-05-23 08:31:02] [INFO ] Time to serialize properties into /tmp/CTLFireability14513752684331402345.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/CTLFireability17046764479121066503.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14513752684331402345.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,3.14033e+11,0.732723,30232,1673,218,44394,1690,978,131037,114,10094,0


Converting to forward existential form...Done !
original formula: EF((AX((EX((i2.u11.p130==0)) * EG(((i0.u48.p300==0)||(i5.u57.p366==0))))) + (EX(AX(FALSE)) * AG(AF(((i12.u87.p503==1)||(i16.u135.p764==1)...161
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(EX(!((EX((i2.u11.p130==0)) * EG(((i0.u48.p300==0)||(i5.u57.p366==0))))))))] != FALSE + [(...274
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t82, t95, t140, t150, t166, t197, t219, t233, t277, t281, t315, t443, t477, t478, t...952
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 442 transition count 642
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 442 transition count 642
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 442 transition count 638
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 91 place count 425 transition count 618
Iterating global reduction 1 with 17 rules applied. Total rules applied 108 place count 425 transition count 618
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 109 place count 425 transition count 617
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 114 place count 420 transition count 610
Iterating global reduction 2 with 5 rules applied. Total rules applied 119 place count 420 transition count 610
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 121 place count 420 transition count 608
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 123 place count 418 transition count 606
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 418 transition count 606
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 126 place count 417 transition count 605
Iterating global reduction 3 with 1 rules applied. Total rules applied 127 place count 417 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 417 transition count 604
Applied a total of 128 rules in 57 ms. Remains 417 /477 variables (removed 60) and now considering 604/681 (removed 77) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16944031677423660285.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10078623201557985782.kers'
[2026-05-23 08:31:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16944031677423660285.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10078623201557985782.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 604 rows 417 cols 1643 entries
Finished phase 1 with 411 SingleSign rule and 0 generalized
[2026-05-23 08:31:32] [INFO ] Computed 6 invariants in 2 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10078623201557985782.kers
Total runtime 3 ms.
[2026-05-23 08:31:32] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-23 08:31:32] [INFO ] Invariant cache hit.
[2026-05-23 08:31:32] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 603 sub problems to find dead transitions.
[2026-05-23 08:31:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 604/1021 variables, 417/425 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1021/1021 variables, and 428 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 603 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/416 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 1 (OVERLAPS) 1/417 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/417 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 4 (OVERLAPS) 604/1021 variables, 417/428 constraints. Problems are: Problem set: 0 solved, 603 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1021 variables, 603/1031 constraints. Problems are: Problem set: 0 solved, 603 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1021/1021 variables, and 1031 constraints, problems are : Problem set: 0 solved, 603 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 417/417 constraints, PredecessorRefiner: 603/603 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 603 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 417/477 places, 604/681 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60523 ms. Remains : 417/477 places, 604/681 transitions.
[2026-05-23 08:32:32] [INFO ] Flatten gal took : 14 ms
[2026-05-23 08:32:32] [INFO ] Flatten gal took : 8 ms
[2026-05-23 08:32:32] [INFO ] Input system was already deterministic with 604 transitions.
[2026-05-23 08:32:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:32:32] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:32:32] [INFO ] Time to serialize gal into /tmp/CTLFireability14763483555053906750.gal : 2 ms
[2026-05-23 08:32:32] [INFO ] Time to serialize properties into /tmp/CTLFireability16232754289177034565.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/CTLFireability14763483555053906750.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16232754289177034565.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.04363e+11,8.78446,233600,2,22597,5,688715,6,0,2265,1.1141e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-23 08:33:03] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:33:03] [INFO ] Applying decomposition
[2026-05-23 08:33:03] [INFO ] Flatten gal took : 14 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/graph5955016448390176934.txt' '-o' '/tmp/graph5955016448390176934.bin' '-w' '/tmp/graph5955016448390176934.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5955016448390176934.bin' '-l' '-1' '-v' '-w' '/tmp/graph5955016448390176934.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:33:03] [INFO ] Decomposing Gal with order
[2026-05-23 08:33:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:33:03] [INFO ] Removed a total of 405 redundant transitions.
[2026-05-23 08:33:03] [INFO ] Flatten gal took : 43 ms
[2026-05-23 08:33:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 3 ms.
[2026-05-23 08:33:03] [INFO ] Time to serialize gal into /tmp/CTLFireability16245247221495869531.gal : 3 ms
[2026-05-23 08:33:03] [INFO ] Time to serialize properties into /tmp/CTLFireability14785658628075495499.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/CTLFireability16245247221495869531.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14785658628075495499.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,3.04363e+11,1.25705,44196,1356,284,64075,8606,949,191662,121,68672,0


Converting to forward existential form...Done !
original formula: E(EX(EF((((i16.u131.p668==1)&&(i16.u133.p675==1))&&(i16.u133.p795==1)))) U A((i16.u137.p744==1) U (EX((AX(FALSE) * AF((i6.u101.p536==1)))...214
=> equivalent forward existential formula: [((FwdU(Init,EX(E(TRUE U (((i16.u131.p668==1)&&(i16.u133.p675==1))&&(i16.u133.p795==1))))) * !(EG(!((EX((!(EX(!(...580
Reverse transition relation is NOT exact ! Due to transitions t13, t16, t81, t94, t140, t150, t189, t197, t219, t233, t315, t477, t564, t574, i1.u24.t424, ...976
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found 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 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
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 477/477 places, 681/681 transitions.
Graph (trivial) has 497 edges and 477 vertex of which 2 / 477 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (complete) has 1023 edges and 476 vertex of which 474 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 183 transitions
Trivial Post-agglo rules discarded 183 transitions
Performed 183 trivial Post agglomeration. Transition count delta: 183
Iterating post reduction 0 with 184 rules applied. Total rules applied 186 place count 473 transition count 493
Reduce places removed 183 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 189 rules applied. Total rules applied 375 place count 290 transition count 487
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 379 place count 288 transition count 485
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 382 place count 287 transition count 483
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 384 place count 285 transition count 483
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 34 Pre rules applied. Total rules applied 384 place count 285 transition count 449
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 452 place count 251 transition count 449
Discarding 16 places :
Symmetric choice reduction at 5 with 16 rule applications. Total rules 468 place count 235 transition count 427
Iterating global reduction 5 with 16 rules applied. Total rules applied 484 place count 235 transition count 427
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 486 place count 235 transition count 425
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 4 Pre rules applied. Total rules applied 486 place count 235 transition count 421
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 494 place count 231 transition count 421
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 501 place count 224 transition count 410
Iterating global reduction 6 with 7 rules applied. Total rules applied 508 place count 224 transition count 410
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 511 place count 224 transition count 407
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 512 place count 223 transition count 407
Performed 27 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 566 place count 196 transition count 379
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 7 rules applied. Total rules applied 573 place count 196 transition count 372
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 575 place count 195 transition count 371
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 577 place count 193 transition count 367
Iterating global reduction 10 with 2 rules applied. Total rules applied 579 place count 193 transition count 367
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 10 with 8 rules applied. Total rules applied 587 place count 189 transition count 363
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 593 place count 189 transition count 357
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 11 with 6 rules applied. Total rules applied 599 place count 187 transition count 353
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 12 with 5 rules applied. Total rules applied 604 place count 185 transition count 350
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 606 place count 184 transition count 349
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 607 place count 183 transition count 347
Iterating global reduction 14 with 1 rules applied. Total rules applied 608 place count 183 transition count 347
Discarding 1 places :
Symmetric choice reduction at 14 with 1 rule applications. Total rules 609 place count 182 transition count 345
Iterating global reduction 14 with 1 rules applied. Total rules applied 610 place count 182 transition count 345
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 14 with 1 rules applied. Total rules applied 611 place count 182 transition count 344
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 615 place count 180 transition count 342
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 15 with 13 rules applied. Total rules applied 628 place count 180 transition count 329
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 15 with 7 rules applied. Total rules applied 635 place count 180 transition count 322
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 16 with 7 rules applied. Total rules applied 642 place count 173 transition count 322
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 17 with 2 rules applied. Total rules applied 644 place count 172 transition count 321
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 17 with 4 rules applied. Total rules applied 648 place count 172 transition count 321
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 649 place count 172 transition count 320
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 651 place count 170 transition count 318
Applied a total of 651 rules in 69 ms. Remains 170 /477 variables (removed 307) and now considering 318/681 (removed 363) transitions.
[2026-05-23 08:33:33] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10182609466648449335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18375310378644548341.kers'
[2026-05-23 08:33:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10182609466648449335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18375310378644548341.kers]
Normalized transition count is 291 out of 292 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 291 rows 170 cols 704 entries
Finished phase 1 with 164 SingleSign rule and 0 generalized
[2026-05-23 08:33:33] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18375310378644548341.kers
Total runtime 2 ms.
[2026-05-23 08:33:33] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-23 08:33:33] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-23 08:33:33] [INFO ] Invariant cache hit.
[2026-05-23 08:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 08:33:33] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2026-05-23 08:33:33] [INFO ] Redundant transitions in 1 ms returned []
Running 296 sub problems to find dead transitions.
[2026-05-23 08:33:33] [INFO ] Flow matrix only has 292 transitions (discarded 26 similar events)
[2026-05-23 08:33:33] [INFO ] Invariant cache hit.
[2026-05-23 08:33:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 291/461 variables, 170/176 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (OVERLAPS) 1/462 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/462 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (OVERLAPS) 0/462 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 296 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 177 constraints, problems are : Problem set: 0 solved, 296 unsolved in 19323 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 296 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 2 (OVERLAPS) 1/170 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 4 (OVERLAPS) 291/461 variables, 170/176 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 296/472 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 7 (OVERLAPS) 1/462 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 296 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 296 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 462/462 variables, and 474 constraints, problems are : Problem set: 0 solved, 296 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 170/170 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 296/296 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49378ms problems are : Problem set: 0 solved, 296 unsolved
Search for dead transitions found 0 dead transitions in 49389ms
Starting structural reductions in SI_CTL mode, iteration 1 : 170/477 places, 318/681 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49800 ms. Remains : 170/477 places, 318/681 transitions.
[2026-05-23 08:34:23] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:34:23] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:34:23] [INFO ] Input system was already deterministic with 318 transitions.
[2026-05-23 08:34:23] [INFO ] Flatten gal took : 4 ms
[2026-05-23 08:34:23] [INFO ] Flatten gal took : 3 ms
[2026-05-23 08:34:23] [INFO ] Time to serialize gal into /tmp/CTLFireability12981868278469298206.gal : 1 ms
[2026-05-23 08:34:23] [INFO ] Time to serialize properties into /tmp/CTLFireability5567551133185509365.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/CTLFireability12981868278469298206.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5567551133185509365.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,4.8263e+08,0.159716,8824,2,1287,5,19548,6,0,987,14361,0


Converting to forward existential form...Done !
original formula: EG((((EF((p504==0)) + AF((p173==0))) + ((p139==0)||(p300==1))) + (AG((p298==0)) * (p183==1))))
=> equivalent forward existential formula: [FwdG(Init,(((E(TRUE U (p504==0)) + !(EG(!((p173==0))))) + ((p139==0)||(p300==1))) + (!(E(TRUE U !((p298==0)))) ...179
Reverse transition relation is NOT exact ! Due to transitions t1, t11, t17, t54, t62, t88, t91, t98, t103, t135, t228, t229, t317, Intersection with reach...231
(forward)formula 0,1,24.2008,689592,1,0,660,4.11619e+06,670,324,6903,3.67655e+06,917
FORMULA CO4-PT-16-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 08:34:47] [INFO ] Flatten gal took : 9 ms
[2026-05-23 08:34:47] [INFO ] Flatten gal took : 7 ms
[2026-05-23 08:34:47] [INFO ] Applying decomposition
[2026-05-23 08:34:47] [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/graph10059932038307713070.txt' '-o' '/tmp/graph10059932038307713070.bin' '-w' '/tmp/graph10059932038307713070.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10059932038307713070.bin' '-l' '-1' '-v' '-w' '/tmp/graph10059932038307713070.weights' '-q' '0' '-e' '0.001'
[2026-05-23 08:34:47] [INFO ] Decomposing Gal with order
[2026-05-23 08:34:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 08:34:47] [INFO ] Removed a total of 454 redundant transitions.
[2026-05-23 08:34:47] [INFO ] Flatten gal took : 19 ms
[2026-05-23 08:34:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 43 labels/synchronizations in 4 ms.
[2026-05-23 08:34:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3056711608227489294.gal : 4 ms
[2026-05-23 08:34:47] [INFO ] Time to serialize properties into /tmp/CTLFireability9928776419277590212.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/CTLFireability3056711608227489294.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9928776419277590212.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 7 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.00764e+12,12.9507,440304,3492,227,680780,13918,1229,3.01134e+06,140,148280,0


Converting to forward existential form...Done !
original formula: AX(EG((i14.u134.p622==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i14.u134.p622==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t4, t13, t56, t107, t120, t180, t256, t274, t432, t500, t538, t542, t549, t552, t554, t556, t...1530
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
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 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
Detected timeout of ITS tools.
[2026-05-23 09:02:49] [INFO ] Applying decomposition
[2026-05-23 09:02:49] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:02:49] [INFO ] Decomposing Gal with order
[2026-05-23 09:02:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:02:49] [INFO ] Removed a total of 278 redundant transitions.
[2026-05-23 09:02:49] [INFO ] Flatten gal took : 22 ms
[2026-05-23 09:02:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 4 ms.
[2026-05-23 09:02:49] [INFO ] Time to serialize gal into /tmp/CTLFireability10457786008181054699.gal : 3 ms
[2026-05-23 09:02:49] [INFO ] Time to serialize properties into /tmp/CTLFireability609855274351299152.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/CTLFireability10457786008181054699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability609855274351299152.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 7 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.00764e+12,1.85734,71204,780,3612,49711,85764,342,213173,1383,439079,0


Converting to forward existential form...Done !
original formula: AX(EG((i0.i1.i1.i0.u11.p622==0)))
=> equivalent forward existential formula: [(EY(Init) * !(EG((i0.i1.i1.i0.u11.p622==0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t640, t643, i0.t533, i0.t509, i0.i0.i0.u5.t360, i0.i0.i0.u5.t368, i0.i0.i0.u5.t379, i0.i0.i0....2405

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="CO4-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 CO4-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 r066-tall-177946967700402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-16.tgz
mv CO4-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 ;