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.r130-smll-177955809000257.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 FireWire-PT-15, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r130-smll-177955809000257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.9K Mar 7 05:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 7 05:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 7 05:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 05:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 10:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 10:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K Mar 7 05:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 7 05:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 05:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Mar 7 05:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 10:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 10:08 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 90K 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 FireWire-PT-15-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-15-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779830235149

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-26 21:17:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-26 21:17:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:17:18] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2026-05-26 21:17:18] [INFO ] Transformed 248 places.
[2026-05-26 21:17:18] [INFO ] Transformed 383 transitions.
[2026-05-26 21:17:18] [INFO ] Found NUPN structural information;
[2026-05-26 21:17:18] [INFO ] Parsed PT model containing 248 places and 383 transitions and 1144 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 35 ms.
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-15-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-15-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 248 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 248/248 places, 383/383 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 383
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 43 place count 205 transition count 344
Iterating global reduction 1 with 39 rules applied. Total rules applied 82 place count 205 transition count 344
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 88 place count 199 transition count 319
Iterating global reduction 1 with 6 rules applied. Total rules applied 94 place count 199 transition count 319
Applied a total of 94 rules in 92 ms. Remains 199 /248 variables (removed 49) and now considering 319/383 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3610521413145040911.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3081142228941573292.kers'
[2026-05-26 21:17:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3610521413145040911.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3081142228941573292.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 199 cols 968 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 21:17:18] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3081142228941573292.kers
Total runtime 5 ms.
[2026-05-26 21:17:19] [INFO ] Implicit Places using invariants in 663 ms returned []
[2026-05-26 21:17:19] [INFO ] Invariant cache hit.
[2026-05-26 21:17:19] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
Running 318 sub problems to find dead transitions.
[2026-05-26 21:17:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Problem TDEAD153 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD292 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 13/17 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 2/19 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/19 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 5 (OVERLAPS) 319/517 variables, 198/217 constraints. Problems are: Problem set: 18 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 517/518 variables, and 217 constraints, problems are : Problem set: 18 solved, 300 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/199 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 15/19 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 4/23 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 1/24 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/24 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 319/517 variables, 198/222 constraints. Problems are: Problem set: 18 solved, 300 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/517 variables, 291/513 constraints. Problems are: Problem set: 18 solved, 300 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 517/518 variables, and 513 constraints, problems are : Problem set: 18 solved, 300 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/199 constraints, PredecessorRefiner: 291/318 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 18 solved, 300 unsolved
Search for dead transitions found 18 dead transitions in 60374ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/248 places, 301/383 transitions.
Applied a total of 0 rules in 9 ms. Remains 199 /199 variables (removed 0) and now considering 301/301 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61981 ms. Remains : 199/248 places, 301/383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 301/301 transitions.
Applied a total of 0 rules in 8 ms. Remains 199 /199 variables (removed 0) and now considering 301/301 (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-5375969696666171232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9871128291225770162.kers'
[2026-05-26 21:18:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5375969696666171232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9871128291225770162.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 301 rows 199 cols 896 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 21:18:20] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9871128291225770162.kers
Total runtime 4 ms.
[2026-05-26 21:18:20] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-26 21:18:20] [INFO ] Invariant cache hit.
[2026-05-26 21:18:20] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2026-05-26 21:18:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Problem TDEAD154 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 18/22 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 8/30 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 2/32 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 0/32 constraints. Problems are: Problem set: 30 solved, 270 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 301/499 variables, 198/230 constraints. Problems are: Problem set: 30 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 499/500 variables, and 230 constraints, problems are : Problem set: 30 solved, 270 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/199 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 30 solved, 270 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 1 (OVERLAPS) 1/198 variables, 4/4 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/198 variables, 28/32 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/32 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 4 (OVERLAPS) 301/499 variables, 198/230 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/499 variables, 261/491 constraints. Problems are: Problem set: 30 solved, 270 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/499 variables, 1/492 constraints. Problems are: Problem set: 30 solved, 270 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 499/500 variables, and 494 constraints, problems are : Problem set: 30 solved, 270 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 198/199 constraints, PredecessorRefiner: 261/300 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60158ms problems are : Problem set: 30 solved, 270 unsolved
Search for dead transitions found 30 dead transitions in 60163ms
Found 30 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 30 transitions
Dead transitions reduction (with SMT) removed 30 transitions
Starting structural reductions in LTL mode, iteration 1 : 199/199 places, 271/301 transitions.
Applied a total of 0 rules in 9 ms. Remains 199 /199 variables (removed 0) and now considering 271/271 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60845 ms. Remains : 199/199 places, 271/301 transitions.
Support contains 87 out of 199 places after structural reductions.
[2026-05-26 21:19:21] [INFO ] Flatten gal took : 103 ms
[2026-05-26 21:19:21] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-15-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 21:19:21] [INFO ] Flatten gal took : 47 ms
[2026-05-26 21:19:21] [INFO ] Input system was already deterministic with 271 transitions.
Support contains 85 out of 199 places (down from 87) after GAL structural reductions.
RANDOM walk for 40000 steps (14 resets) in 2355 ms. (16 steps per ms) remains 38/54 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 38/38 properties
BEST_FIRST walk for 4004 steps (14 resets) in 110 ms. (36 steps per ms) remains 37/38 properties
BEST_FIRST walk for 4000 steps (12 resets) in 110 ms. (36 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 129 ms. (30 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (13 resets) in 102 ms. (38 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 75 ms. (52 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 71 ms. (55 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 76 ms. (51 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (9 resets) in 54 ms. (72 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 60 ms. (65 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 58 ms. (67 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (12 resets) in 57 ms. (68 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 83 ms. (47 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 60 ms. (65 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (12 resets) in 47 ms. (83 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (12 resets) in 31 ms. (125 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 55 ms. (71 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 37 ms. (105 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 45 ms. (86 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 46 ms. (85 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 56 ms. (70 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (10 resets) in 58 ms. (67 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (10 resets) in 21 ms. (181 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 61 ms. (64 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (11 resets) in 49 ms. (80 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 58 ms. (67 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (13 resets) in 38 ms. (102 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 40 ms. (97 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 50 ms. (78 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (10 resets) in 39 ms. (100 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (9 resets) in 35 ms. (111 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4001 steps (12 resets) in 22 ms. (173 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 37/37 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10565245387432046566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5506786348086209759.kers'
[2026-05-26 21:19:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10565245387432046566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5506786348086209759.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 271 rows 199 cols 776 entries
Finished phase 1 with 195 SingleSign rule and 0 generalized
[2026-05-26 21:19:23] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5506786348086209759.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 131/190 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 266/456 variables, 190/194 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 5 (OVERLAPS) 12/468 variables, 7/201 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 7 (OVERLAPS) 2/470 variables, 2/203 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 37 unsolved
At refinement iteration 9 (OVERLAPS) 0/470 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 470/470 variables, and 203 constraints, problems are : Problem set: 0 solved, 37 unsolved in 2603 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 199/199 constraints, PredecessorRefiner: 37/37 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 37 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/59 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 37 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 1 (OVERLAPS) 131/190 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 36 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/190 variables, 8/12 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 266/456 variables, 190/203 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/456 variables, 32/235 constraints. Problems are: Problem set: 2 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/456 variables, 1/236 constraints. Problems are: Problem set: 2 solved, 35 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 456/470 variables, and 236 constraints, problems are : Problem set: 2 solved, 35 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 190/199 constraints, PredecessorRefiner: 32/37 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7633ms problems are : Problem set: 2 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 48 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 271/271 transitions.
Graph (trivial) has 91 edges and 199 vertex of which 6 / 199 are part of one of the 2 SCC in 9 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 195 transition count 253
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 16 rules applied. Total rules applied 29 place count 183 transition count 249
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 180 transition count 249
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 180 transition count 243
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 174 transition count 243
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 53 place count 165 transition count 234
Iterating global reduction 3 with 9 rules applied. Total rules applied 62 place count 165 transition count 234
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 63 place count 164 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 64 place count 164 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 65 place count 164 transition count 223
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 101 place count 146 transition count 205
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 138 transition count 238
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 119 place count 138 transition count 236
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 125 place count 138 transition count 230
Free-agglomeration rule applied 7 times.
Iterating global reduction 5 with 7 rules applied. Total rules applied 132 place count 138 transition count 223
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 139 place count 131 transition count 223
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 141 place count 131 transition count 221
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 146 place count 131 transition count 221
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 131 transition count 221
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 148 place count 130 transition count 220
Applied a total of 148 rules in 208 ms. Remains 130 /199 variables (removed 69) and now considering 220/271 (removed 51) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 208 ms. Remains : 130/199 places, 220/271 transitions.
RANDOM walk for 40000 steps (3173 resets) in 907 ms. (44 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (96 resets) in 22 ms. (174 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (90 resets) in 35 ms. (111 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (88 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (91 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (94 resets) in 33 ms. (117 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (90 resets) in 19 ms. (200 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (92 resets) in 32 ms. (121 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (96 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (99 resets) in 17 ms. (222 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (92 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (90 resets) in 25 ms. (153 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (94 resets) in 20 ms. (190 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (101 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (97 resets) in 26 ms. (148 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (99 resets) in 24 ms. (160 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (96 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (96 resets) in 22 ms. (173 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (91 resets) in 21 ms. (181 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (88 resets) in 18 ms. (210 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (95 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (101 resets) in 23 ms. (166 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (89 resets) in 44 ms. (88 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4001 steps (94 resets) in 20 ms. (190 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (92 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (97 resets) in 22 ms. (174 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (95 resets) in 19 ms. (200 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (94 resets) in 21 ms. (181 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (98 resets) in 23 ms. (166 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (93 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (91 resets) in 18 ms. (210 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (90 resets) in 25 ms. (153 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (87 resets) in 26 ms. (148 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (98 resets) in 24 ms. (160 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (98 resets) in 16 ms. (235 steps per ms) remains 34/34 properties
Finished probabilistic random walk after 160765 steps, run visited all 34 properties in 1222 ms. (steps per millisecond=131 )
Probabilistic random walk after 160765 steps, saw 43416 distinct states, run finished after 1227 ms. (steps per millisecond=131 ) properties seen :34
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2026-05-26 21:19:33] [INFO ] Flatten gal took : 20 ms
[2026-05-26 21:19:33] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:19:33] [INFO ] Input system was already deterministic with 271 transitions.
Computed a total of 55 stabilizing places and 66 stable transitions
Graph (complete) has 482 edges and 199 vertex of which 198 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Graph (trivial) has 144 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 471 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 188 transition count 234
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 162 transition count 233
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 55 place count 162 transition count 224
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 73 place count 153 transition count 224
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 89 place count 137 transition count 207
Iterating global reduction 2 with 16 rules applied. Total rules applied 105 place count 137 transition count 207
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 105 place count 137 transition count 203
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 113 place count 133 transition count 203
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 118 place count 128 transition count 197
Iterating global reduction 2 with 5 rules applied. Total rules applied 123 place count 128 transition count 197
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 124 place count 127 transition count 196
Iterating global reduction 2 with 1 rules applied. Total rules applied 125 place count 127 transition count 196
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 2 rules applied. Total rules applied 127 place count 127 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 126 transition count 194
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 144 place count 118 transition count 186
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 4 with 2 rules applied. Total rules applied 146 place count 118 transition count 184
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 147 place count 117 transition count 184
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 149 place count 115 transition count 172
Iterating global reduction 6 with 2 rules applied. Total rules applied 151 place count 115 transition count 172
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 152 place count 115 transition count 171
Applied a total of 152 rules in 54 ms. Remains 115 /199 variables (removed 84) and now considering 171/271 (removed 100) transitions.
[2026-05-26 21:19:33] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16540942780189338677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1630433243883996740.kers'
[2026-05-26 21:19:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16540942780189338677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1630433243883996740.kers]
Normalized transition count is 167 out of 168 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 115 cols 523 entries
Finished phase 1 with 111 SingleSign rule and 0 generalized
[2026-05-26 21:19:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1630433243883996740.kers
Total runtime 1 ms.
[2026-05-26 21:19:33] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-26 21:19:33] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
[2026-05-26 21:19:33] [INFO ] Invariant cache hit.
[2026-05-26 21:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:19:33] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
[2026-05-26 21:19:33] [INFO ] Redundant transitions in 10 ms returned []
Running 169 sub problems to find dead transitions.
[2026-05-26 21:19:33] [INFO ] Flow matrix only has 168 transitions (discarded 3 similar events)
[2026-05-26 21:19:33] [INFO ] Invariant cache hit.
[2026-05-26 21:19:33] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 169 unsolved
At refinement iteration 2 (OVERLAPS) 1/115 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 169 unsolved
Problem TDEAD57 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 5 (OVERLAPS) 167/282 variables, 115/125 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 2/128 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 9 (OVERLAPS) 0/282 variables, 0/128 constraints. Problems are: Problem set: 1 solved, 168 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/283 variables, and 128 constraints, problems are : Problem set: 1 solved, 168 unsolved in 16814 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 169/169 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 168 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 3 (OVERLAPS) 1/115 variables, 3/8 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 4/12 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 6 (OVERLAPS) 167/282 variables, 115/127 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 1/128 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/282 variables, 168/296 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 0/296 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 10 (OVERLAPS) 0/282 variables, 1/297 constraints. Problems are: Problem set: 1 solved, 168 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/297 constraints. Problems are: Problem set: 1 solved, 168 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 282/283 variables, and 297 constraints, problems are : Problem set: 1 solved, 168 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 115/115 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 168/169 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46885ms problems are : Problem set: 1 solved, 168 unsolved
Search for dead transitions found 1 dead transitions in 46886ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 115/199 places, 170/271 transitions.
Applied a total of 0 rules in 7 ms. Remains 115 /115 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2026-05-26 21:20:20] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 47358 ms. Remains : 115/199 places, 170/271 transitions.
[2026-05-26 21:20:20] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:20:20] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:20:20] [INFO ] Input system was already deterministic with 170 transitions.
[2026-05-26 21:20:20] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:20:20] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:20:20] [INFO ] Time to serialize gal into /tmp/CTLCardinality3566363776613438623.gal : 6 ms
[2026-05-26 21:20:20] [INFO ] Time to serialize properties into /tmp/CTLCardinality10178788793576919445.ctl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality3566363776613438623.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10178788793576919445.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,83777,0.339551,13236,2,2190,5,30914,6,0,628,36011,0


Converting to forward existential form...Done !
original formula: AG((EF((((((p8==0)||(p236==1))||((p111==0)||(p229==1)))&&(p109!=0))&&(p201!=1))) * EF(((p207==0)||(p81==1)))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U (((((p8==0)||(p236==1))||((p111==0)||(p229==1)))&&(p109!=0))&&(p201!=1)))))] = F...227
Reverse transition relation is NOT exact ! Due to transitions t28, t35, t38, t39, t40, t45, t48, t52, t53, t114, t123, t128, t135, t148, t149, t150, t151, ...291
(forward)formula 0,0,3.43953,89124,1,0,365,515313,359,183,4305,319459,433
FORMULA FireWire-PT-15-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Graph (trivial) has 145 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 471 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 188 transition count 232
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 160 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 159 transition count 230
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 61 place count 159 transition count 222
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 77 place count 151 transition count 222
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 93 place count 135 transition count 205
Iterating global reduction 3 with 16 rules applied. Total rules applied 109 place count 135 transition count 205
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 110 place count 135 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 110 place count 135 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 118 place count 131 transition count 200
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 123 place count 126 transition count 194
Iterating global reduction 4 with 5 rules applied. Total rules applied 128 place count 126 transition count 194
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 130 place count 124 transition count 192
Iterating global reduction 4 with 2 rules applied. Total rules applied 132 place count 124 transition count 192
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 4 with 2 rules applied. Total rules applied 134 place count 124 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 135 place count 123 transition count 190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 122 transition count 189
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 121 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 120 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 120 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 119 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 119 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 118 transition count 185
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 118 transition count 185
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 146 place count 117 transition count 184
Iterating global reduction 6 with 1 rules applied. Total rules applied 147 place count 117 transition count 184
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 148 place count 116 transition count 183
Iterating global reduction 6 with 1 rules applied. Total rules applied 149 place count 116 transition count 183
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 150 place count 115 transition count 182
Iterating global reduction 6 with 1 rules applied. Total rules applied 151 place count 115 transition count 182
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 169 place count 106 transition count 173
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 171 place count 106 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 172 place count 105 transition count 171
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 174 place count 103 transition count 159
Iterating global reduction 8 with 2 rules applied. Total rules applied 176 place count 103 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 177 place count 103 transition count 158
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 179 place count 103 transition count 158
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 180 place count 103 transition count 157
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 181 place count 102 transition count 156
Applied a total of 181 rules in 85 ms. Remains 102 /199 variables (removed 97) and now considering 156/271 (removed 115) transitions.
[2026-05-26 21:20:24] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7377594883300976730.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15870440612046935806.kers'
[2026-05-26 21:20:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7377594883300976730.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15870440612046935806.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 102 cols 472 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:20:24] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15870440612046935806.kers
Total runtime 1 ms.
[2026-05-26 21:20:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-26 21:20:24] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2026-05-26 21:20:24] [INFO ] Invariant cache hit.
[2026-05-26 21:20:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:20:24] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 389 ms to find 0 implicit places.
[2026-05-26 21:20:24] [INFO ] Redundant transitions in 9 ms returned []
Running 151 sub problems to find dead transitions.
[2026-05-26 21:20:24] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2026-05-26 21:20:24] [INFO ] Invariant cache hit.
[2026-05-26 21:20:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Problem TDEAD52 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 3 (OVERLAPS) 152/253 variables, 101/113 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 1/114 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/114 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 6 (OVERLAPS) 1/254 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/254 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 8 (OVERLAPS) 0/254 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Real declared 254/255 variables, and 115 constraints, problems are : Problem set: 1 solved, 150 unsolved in 13389 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 150 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 4 (OVERLAPS) 152/253 variables, 101/114 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/253 variables, 150/265 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/253 variables, 1/266 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/253 variables, 0/266 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 9 (OVERLAPS) 1/254 variables, 1/267 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/254 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 150 unsolved
At refinement iteration 11 (OVERLAPS) 0/254 variables, 0/267 constraints. Problems are: Problem set: 1 solved, 150 unsolved
No progress, stopping.
After SMT solving in domain Int declared 254/255 variables, and 267 constraints, problems are : Problem set: 1 solved, 150 unsolved in 29813 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 150/151 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 43236ms problems are : Problem set: 1 solved, 150 unsolved
Search for dead transitions found 1 dead transitions in 43237ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 102/199 places, 155/271 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 155/155 (removed 0) transitions.
[2026-05-26 21:21:07] [INFO ] Redundant transitions in 2 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 43748 ms. Remains : 102/199 places, 155/271 transitions.
[2026-05-26 21:21:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:21:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:21:07] [INFO ] Input system was already deterministic with 155 transitions.
[2026-05-26 21:21:07] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:21:07] [INFO ] Flatten gal took : 14 ms
[2026-05-26 21:21:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality11174112389984293744.gal : 7 ms
[2026-05-26 21:21:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality7483611400391259787.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/CTLCardinality11174112389984293744.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7483611400391259787.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,82357,0.42367,12656,2,1895,5,31079,6,0,561,35349,0


Converting to forward existential form...Done !
original formula: EF(((p178==1) + (EG(AG((p12==0))) * E(EF((p186==1)) U AF((p238==1))))))
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * (p178==1))] != FALSE + [(FwdU((FwdU(Init,TRUE) * EG(!(E(TRUE U !((p12==0)))))),E(TRUE U (p1...197
(forward)formula 0,1,0.425471,12920,1,0,7,31079,8,1,564,35349,1
FORMULA FireWire-PT-15-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 177 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 177 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 177 transition count 249
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 50 place count 171 transition count 231
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 171 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 171 transition count 230
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 170 transition count 229
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 170 transition count 229
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 60 place count 169 transition count 228
Iterating global reduction 3 with 1 rules applied. Total rules applied 61 place count 169 transition count 228
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 168 transition count 227
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 168 transition count 227
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 64 place count 167 transition count 226
Iterating global reduction 3 with 1 rules applied. Total rules applied 65 place count 167 transition count 226
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 166 transition count 225
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 166 transition count 225
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 68 place count 165 transition count 224
Iterating global reduction 3 with 1 rules applied. Total rules applied 69 place count 165 transition count 224
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 70 place count 164 transition count 223
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 164 transition count 223
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 72 place count 163 transition count 222
Iterating global reduction 3 with 1 rules applied. Total rules applied 73 place count 163 transition count 222
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 74 place count 162 transition count 221
Iterating global reduction 3 with 1 rules applied. Total rules applied 75 place count 162 transition count 221
Applied a total of 75 rules in 43 ms. Remains 162 /199 variables (removed 37) and now considering 221/271 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8381172039189546169.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2816578972906697741.kers'
[2026-05-26 21:21:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8381172039189546169.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2816578972906697741.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 162 cols 625 entries
Finished phase 1 with 158 SingleSign rule and 0 generalized
[2026-05-26 21:21:08] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2816578972906697741.kers
Total runtime 2 ms.
[2026-05-26 21:21:08] [INFO ] Implicit Places using invariants in 187 ms returned []
[2026-05-26 21:21:08] [INFO ] Invariant cache hit.
[2026-05-26 21:21:09] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-26 21:21:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Problem TDEAD131 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 221/383 variables, 162/182 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 7 (OVERLAPS) 0/383 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 383/383 variables, and 182 constraints, problems are : Problem set: 1 solved, 219 unsolved in 25318 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/162 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/162 variables, 16/20 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/162 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/23 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 221/383 variables, 162/185 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 219/404 constraints. Problems are: Problem set: 1 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/383 variables, 0/404 constraints. Problems are: Problem set: 1 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 383/383 variables, and 404 constraints, problems are : Problem set: 1 solved, 219 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 162/162 constraints, PredecessorRefiner: 219/220 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55369ms problems are : Problem set: 1 solved, 219 unsolved
Search for dead transitions found 1 dead transitions in 55370ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 162/199 places, 220/271 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 220/220 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56022 ms. Remains : 162/199 places, 220/271 transitions.
[2026-05-26 21:22:04] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:22:04] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:22:04] [INFO ] Input system was already deterministic with 220 transitions.
[2026-05-26 21:22:04] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:22:04] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:22:04] [INFO ] Time to serialize gal into /tmp/CTLCardinality10391874826409763482.gal : 2 ms
[2026-05-26 21:22:04] [INFO ] Time to serialize properties into /tmp/CTLCardinality9497245530604353310.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/CTLCardinality10391874826409763482.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality9497245530604353310.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,565271,2.08471,55000,2,5811,5,154627,6,0,869,222924,0


Converting to forward existential form...Done !
original formula: AG(EX((AX((p163==0)) + (((p144==0)||(p49==1)) * (AG(((p100==0)||(p49==1))) + (((p53==1)&&((p6==0)||(p80==1)))&&((p15==0)||(p12==1))))))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(EX(!((p163==0)))) + (((p144==0)||(p49==1)) * (!(E(TRUE U !(((p100==0)||(p49==1))))) ...227
Reverse transition relation is NOT exact ! Due to transitions t3, t36, t50, t54, t58, t61, t65, t70, t74, t84, t88, t89, t104, t107, t109, t118, t120, t123...317
(forward)formula 0,0,18.4909,451796,1,0,489,2.97154e+06,466,255,5626,1.58444e+06,590
FORMULA FireWire-PT-15-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 177 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 177 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 177 transition count 249
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 172 transition count 234
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 172 transition count 234
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 172 transition count 233
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 57 place count 170 transition count 231
Iterating global reduction 3 with 2 rules applied. Total rules applied 59 place count 170 transition count 231
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 170 transition count 230
Applied a total of 60 rules in 12 ms. Remains 170 /199 variables (removed 29) and now considering 230/271 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4635195236249877768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18429727462743462047.kers'
[2026-05-26 21:22:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4635195236249877768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18429727462743462047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 230 rows 170 cols 659 entries
Finished phase 1 with 166 SingleSign rule and 0 generalized
[2026-05-26 21:22:23] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18429727462743462047.kers
Total runtime 1 ms.
[2026-05-26 21:22:23] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-26 21:22:23] [INFO ] Invariant cache hit.
[2026-05-26 21:22:23] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Running 229 sub problems to find dead transitions.
[2026-05-26 21:22:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Problem TDEAD132 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 2/18 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/170 variables, 5/23 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/170 variables, 3/26 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/170 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 7 (OVERLAPS) 230/400 variables, 170/196 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 1/197 constraints. Problems are: Problem set: 1 solved, 228 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 197 constraints, problems are : Problem set: 1 solved, 228 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 228 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 1 (OVERLAPS) 1/170 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/170 variables, 23/27 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/170 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 4 (OVERLAPS) 230/400 variables, 170/197 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 228/425 constraints. Problems are: Problem set: 1 solved, 228 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 2/427 constraints. Problems are: Problem set: 1 solved, 228 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 428 constraints, problems are : Problem set: 1 solved, 228 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 170/170 constraints, PredecessorRefiner: 228/229 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60059ms problems are : Problem set: 1 solved, 228 unsolved
Search for dead transitions found 1 dead transitions in 60061ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 170/199 places, 229/271 transitions.
Applied a total of 0 rules in 3 ms. Remains 170 /170 variables (removed 0) and now considering 229/229 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60572 ms. Remains : 170/199 places, 229/271 transitions.
[2026-05-26 21:23:23] [INFO ] Flatten gal took : 20 ms
[2026-05-26 21:23:23] [INFO ] Flatten gal took : 18 ms
[2026-05-26 21:23:23] [INFO ] Input system was already deterministic with 229 transitions.
[2026-05-26 21:23:23] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:23:23] [INFO ] Flatten gal took : 17 ms
[2026-05-26 21:23:23] [INFO ] Time to serialize gal into /tmp/CTLCardinality12958276237427304557.gal : 4 ms
[2026-05-26 21:23:23] [INFO ] Time to serialize properties into /tmp/CTLCardinality7322957230034243250.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/CTLCardinality12958276237427304557.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7322957230034243250.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,683562,1.87012,46944,2,5490,5,134424,6,0,910,192666,0


Converting to forward existential form...Done !
original formula: (AF(E(((((p139!=0)||((p104==0)&&(p149==1)))||(p47!=0))&&(p199==0)) U ((!((EF(((p224==0)||(p221==1))) * ((p32==1)||(p108==0)))) + (EF(((p9...334
=> equivalent forward existential formula: ([FwdG(Init,!(E(((((p139!=0)||((p104==0)&&(p149==1)))||(p47!=0))&&(p199==0)) U ((!((E(TRUE U ((p224==0)||(p221==...629
Reverse transition relation is NOT exact ! Due to transitions t3, t46, t48, t54, t58, t62, t65, t69, t72, t78, t86, t90, t91, t106, t109, t111, t120, t122,...310
(forward)formula 0,0,6.46425,143428,1,0,392,777312,488,209,6021,529555,485
FORMULA FireWire-PT-15-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Graph (trivial) has 145 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 471 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 188 transition count 234
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 162 transition count 233
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 55 place count 162 transition count 225
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 71 place count 154 transition count 225
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 87 place count 138 transition count 208
Iterating global reduction 2 with 16 rules applied. Total rules applied 103 place count 138 transition count 208
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 103 place count 138 transition count 204
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 134 transition count 204
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 116 place count 129 transition count 198
Iterating global reduction 2 with 5 rules applied. Total rules applied 121 place count 129 transition count 198
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 127 transition count 196
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 127 transition count 196
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 2 rules applied. Total rules applied 127 place count 127 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 128 place count 126 transition count 194
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 129 place count 125 transition count 193
Iterating global reduction 4 with 1 rules applied. Total rules applied 130 place count 125 transition count 193
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 131 place count 124 transition count 192
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 124 transition count 192
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 133 place count 123 transition count 191
Iterating global reduction 4 with 1 rules applied. Total rules applied 134 place count 123 transition count 191
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 135 place count 122 transition count 190
Iterating global reduction 4 with 1 rules applied. Total rules applied 136 place count 122 transition count 190
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 137 place count 121 transition count 189
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 121 transition count 189
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 139 place count 120 transition count 188
Iterating global reduction 4 with 1 rules applied. Total rules applied 140 place count 120 transition count 188
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 141 place count 119 transition count 187
Iterating global reduction 4 with 1 rules applied. Total rules applied 142 place count 119 transition count 187
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 118 transition count 186
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 118 transition count 186
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 162 place count 109 transition count 177
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 4 with 2 rules applied. Total rules applied 164 place count 109 transition count 175
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 165 place count 108 transition count 175
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 167 place count 106 transition count 163
Iterating global reduction 6 with 2 rules applied. Total rules applied 169 place count 106 transition count 163
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 170 place count 106 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 171 place count 105 transition count 161
Applied a total of 171 rules in 58 ms. Remains 105 /199 variables (removed 94) and now considering 161/271 (removed 110) transitions.
[2026-05-26 21:23:30] [INFO ] Flow matrix only has 158 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-101218753600962804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7564662421333501483.kers'
[2026-05-26 21:23:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-101218753600962804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7564662421333501483.kers]
Normalized transition count is 157 out of 158 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 105 cols 482 entries
Finished phase 1 with 101 SingleSign rule and 0 generalized
[2026-05-26 21:23:30] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7564662421333501483.kers
Total runtime 2 ms.
[2026-05-26 21:23:30] [INFO ] Implicit Places using invariants in 120 ms returned []
[2026-05-26 21:23:30] [INFO ] Flow matrix only has 158 transitions (discarded 3 similar events)
[2026-05-26 21:23:30] [INFO ] Invariant cache hit.
[2026-05-26 21:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:23:30] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2026-05-26 21:23:30] [INFO ] Redundant transitions in 2 ms returned []
Running 155 sub problems to find dead transitions.
[2026-05-26 21:23:30] [INFO ] Flow matrix only has 158 transitions (discarded 3 similar events)
[2026-05-26 21:23:30] [INFO ] Invariant cache hit.
[2026-05-26 21:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 155 unsolved
Problem TDEAD58 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 157/261 variables, 104/114 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 2/117 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 1/262 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/263 variables, and 119 constraints, problems are : Problem set: 1 solved, 154 unsolved in 18315 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 155/155 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 154 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 3 (OVERLAPS) 157/261 variables, 104/117 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 154/272 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/261 variables, 0/272 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 7 (OVERLAPS) 1/262 variables, 1/273 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 154 unsolved
At refinement iteration 9 (OVERLAPS) 0/262 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 154 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/263 variables, and 273 constraints, problems are : Problem set: 1 solved, 154 unsolved in 22082 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 105/105 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 154/155 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40411ms problems are : Problem set: 1 solved, 154 unsolved
Search for dead transitions found 1 dead transitions in 40411ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 105/199 places, 160/271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 104 transition count 159
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 104 transition count 159
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 103 transition count 158
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 103 transition count 158
Applied a total of 4 rules in 7 ms. Remains 103 /105 variables (removed 2) and now considering 158/160 (removed 2) transitions.
[2026-05-26 21:24:11] [INFO ] Flow matrix only has 155 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17426775758296544808.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18345448967599058620.kers'
[2026-05-26 21:24:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17426775758296544808.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18345448967599058620.kers]
Normalized transition count is 154 out of 155 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 154 rows 103 cols 470 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-26 21:24:11] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18345448967599058620.kers
Total runtime 1 ms.
[2026-05-26 21:24:11] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-26 21:24:11] [INFO ] Flow matrix only has 155 transitions (discarded 3 similar events)
[2026-05-26 21:24:11] [INFO ] Invariant cache hit.
[2026-05-26 21:24:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:24:11] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 103/199 places, 158/271 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 41122 ms. Remains : 103/199 places, 158/271 transitions.
[2026-05-26 21:24:11] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:24:11] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:24:11] [INFO ] Input system was already deterministic with 158 transitions.
[2026-05-26 21:24:11] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:24:11] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:24:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality10545189523839562725.gal : 2 ms
[2026-05-26 21:24:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality16550478508944047.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/CTLCardinality10545189523839562725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16550478508944047.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG(AF(((p174==0)||(p77==1))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),!(((p174==0)||(p77==1))))] = FALSE
Hit Full ! (commute/partial/dont) 154/4/4
(forward)formula 0,0,0.864765,16460,1,0,8,63346,20,2,2961,36750,8
FORMULA FireWire-PT-15-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 22 place count 177 transition count 250
Iterating global reduction 1 with 21 rules applied. Total rules applied 43 place count 177 transition count 250
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 44 place count 177 transition count 249
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 49 place count 172 transition count 242
Iterating global reduction 2 with 5 rules applied. Total rules applied 54 place count 172 transition count 242
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 171 transition count 241
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 171 transition count 241
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 57 place count 171 transition count 240
Applied a total of 57 rules in 8 ms. Remains 171 /199 variables (removed 28) and now considering 240/271 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13634464675508861790.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17457389745092371916.kers'
[2026-05-26 21:24:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13634464675508861790.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17457389745092371916.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 240 rows 171 cols 698 entries
Finished phase 1 with 167 SingleSign rule and 0 generalized
[2026-05-26 21:24:12] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17457389745092371916.kers
Total runtime 1 ms.
[2026-05-26 21:24:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-26 21:24:12] [INFO ] Invariant cache hit.
[2026-05-26 21:24:12] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 239 sub problems to find dead transitions.
[2026-05-26 21:24:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 239 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 239 unsolved
Problem TDEAD133 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 17/21 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 1/22 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 240/411 variables, 171/193 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/193 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 7 (OVERLAPS) 0/411 variables, 1/194 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/411 variables, and 194 constraints, problems are : Problem set: 1 solved, 238 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 239/239 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 238 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 1 (OVERLAPS) 1/171 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 19/23 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 5 (OVERLAPS) 240/411 variables, 171/196 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 238/434 constraints. Problems are: Problem set: 1 solved, 238 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/434 constraints. Problems are: Problem set: 1 solved, 238 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/411 variables, and 434 constraints, problems are : Problem set: 1 solved, 238 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 171/171 constraints, PredecessorRefiner: 238/239 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 1 solved, 238 unsolved
Search for dead transitions found 1 dead transitions in 60062ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 171/199 places, 239/271 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 239/239 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60509 ms. Remains : 171/199 places, 239/271 transitions.
[2026-05-26 21:25:12] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:25:12] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:25:13] [INFO ] Input system was already deterministic with 239 transitions.
[2026-05-26 21:25:13] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:25:13] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:25:13] [INFO ] Time to serialize gal into /tmp/CTLCardinality7084466201684338352.gal : 3 ms
[2026-05-26 21:25:13] [INFO ] Time to serialize properties into /tmp/CTLCardinality11100214578985416167.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/CTLCardinality7084466201684338352.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11100214578985416167.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,593563,1.71555,46404,2,6441,5,131491,6,0,924,193461,0


Converting to forward existential form...Done !
original formula: E(EX(AF((p240==0))) U !(((EX((p151==1)) + EF(!((((p87==0)||(p82==1))&&((p45==0)||(p134==1)))))) * EF(!((A((p33==0) U (p235==1)) * ((p85==...175
=> equivalent forward existential formula: ([((FwdU(Init,EX(!(EG(!((p240==0)))))) * !(E(TRUE U !((((p87==0)||(p82==1))&&((p45==0)||(p134==1))))))) * !(EX((...342
Reverse transition relation is NOT exact ! Due to transitions t3, t9, t43, t44, t51, t55, t59, t62, t66, t71, t74, t77, t84, t88, t89, t98, t107, t110, t11...318
Detected timeout of ITS tools.
[2026-05-26 21:25:43] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:25:43] [INFO ] Applying decomposition
[2026-05-26 21:25:43] [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/graph4626288094902576643.txt' '-o' '/tmp/graph4626288094902576643.bin' '-w' '/tmp/graph4626288094902576643.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4626288094902576643.bin' '-l' '-1' '-v' '-w' '/tmp/graph4626288094902576643.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:25:43] [INFO ] Decomposing Gal with order
[2026-05-26 21:25:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:25:43] [INFO ] Removed a total of 152 redundant transitions.
[2026-05-26 21:25:43] [INFO ] Flatten gal took : 88 ms
[2026-05-26 21:25:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 18 ms.
[2026-05-26 21:25:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality9826796531748898008.gal : 9 ms
[2026-05-26 21:25:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality10023500482696719183.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/CTLCardinality9826796531748898008.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10023500482696719183.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,593563,0.613845,18124,513,296,21968,5885,599,49378,215,31968,0


Converting to forward existential form...Done !
original formula: E(EX(AF((i5.u45.p240==0))) U !(((EX((i7.u30.p151==1)) + EF(!((((i3.i1.u18.p87==0)||(i4.i1.u15.p82==1))&&((i8.i1.u8.p45==0)||(i9.u28.p134=...257
=> equivalent forward existential formula: ([((FwdU(Init,EX(!(EG(!((i5.u45.p240==0)))))) * !(E(TRUE U !((((i3.i1.u18.p87==0)||(i4.i1.u15.p82==1))&&((i8.i1....443
Reverse transition relation is NOT exact ! Due to transitions t59, t66, t98, t112, t123, t200, t223, t224, t225, t229, t231, i1.t107, i2.t110, i2.u4.t121, ...443
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
(forward)formula 0,1,4.2056,125480,1,0,204809,14650,3424,540590,1287,154185,467217
FORMULA FireWire-PT-15-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 180 transition count 253
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 180 transition count 253
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 38 place count 180 transition count 252
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 42 place count 176 transition count 239
Iterating global reduction 2 with 4 rules applied. Total rules applied 46 place count 176 transition count 239
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 176 transition count 238
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 175 transition count 237
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 175 transition count 237
Applied a total of 49 rules in 9 ms. Remains 175 /199 variables (removed 24) and now considering 237/271 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3954677786111964994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3642001681768719308.kers'
[2026-05-26 21:25:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3954677786111964994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3642001681768719308.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 237 rows 175 cols 677 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-26 21:25:47] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3642001681768719308.kers
Total runtime 2 ms.
[2026-05-26 21:25:47] [INFO ] Implicit Places using invariants in 173 ms returned []
[2026-05-26 21:25:47] [INFO ] Invariant cache hit.
[2026-05-26 21:25:48] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 236 sub problems to find dead transitions.
[2026-05-26 21:25:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 236 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 236 unsolved
Problem TDEAD137 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 6 (OVERLAPS) 237/412 variables, 175/197 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 412/412 variables, and 197 constraints, problems are : Problem set: 1 solved, 235 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 235 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 5 (OVERLAPS) 237/412 variables, 175/199 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/412 variables, 235/434 constraints. Problems are: Problem set: 1 solved, 235 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/412 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 235 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 412/412 variables, and 436 constraints, problems are : Problem set: 1 solved, 235 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 235/236 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60052ms problems are : Problem set: 1 solved, 235 unsolved
Search for dead transitions found 1 dead transitions in 60053ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 175/199 places, 236/271 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60542 ms. Remains : 175/199 places, 236/271 transitions.
[2026-05-26 21:26:48] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:26:48] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:26:48] [INFO ] Input system was already deterministic with 236 transitions.
[2026-05-26 21:26:48] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:26:48] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:26:48] [INFO ] Time to serialize gal into /tmp/CTLCardinality17761017263888917179.gal : 3 ms
[2026-05-26 21:26:48] [INFO ] Time to serialize properties into /tmp/CTLCardinality13368615399525868006.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/CTLCardinality17761017263888917179.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13368615399525868006.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,730424,1.91548,48100,2,6350,5,140433,6,0,937,194847,0


Converting to forward existential form...Done !
original formula: AG(((EX((((p196==1)||(p9==0))||(p184==1))) + EF((p184==1))) + (AX((EG(((p224==0)&&(p131==1))) * ((p49==0)||(p8==1)))) * !(E((p87==0) U ((...221
=> equivalent forward existential formula: (([(EY((FwdU(Init,TRUE) * !((EX((((p196==1)||(p9==0))||(p184==1))) + E(TRUE U (p184==1)))))) * !(EG(((p224==0)&&...716
Reverse transition relation is NOT exact ! Due to transitions t3, t31, t50, t52, t58, t62, t66, t69, t73, t78, t81, t84, t90, t94, t111, t114, t116, t125, ...321
Hit Full ! (commute/partial/dont) 234/0/2
(forward)formula 0,0,12.2478,286556,1,0,438,1.83562e+06,502,231,6314,928020,540
FORMULA FireWire-PT-15-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 176 transition count 248
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 176 transition count 248
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 168 transition count 228
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 168 transition count 228
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 63 place count 168 transition count 227
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 66 place count 165 transition count 224
Iterating global reduction 1 with 3 rules applied. Total rules applied 69 place count 165 transition count 224
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 70 place count 165 transition count 223
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 164 transition count 222
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 164 transition count 222
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 73 place count 163 transition count 221
Iterating global reduction 2 with 1 rules applied. Total rules applied 74 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 75 place count 162 transition count 220
Iterating global reduction 2 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 2 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Applied a total of 88 rules in 23 ms. Remains 156 /199 variables (removed 43) and now considering 214/271 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7879904701313855478.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7789145364916732380.kers'
[2026-05-26 21:27:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7879904701313855478.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7789145364916732380.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 214 rows 156 cols 606 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-26 21:27:00] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7789145364916732380.kers
Total runtime 1 ms.
[2026-05-26 21:27:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-26 21:27:00] [INFO ] Invariant cache hit.
[2026-05-26 21:27:00] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2026-05-26 21:27:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 213 unsolved
Problem TDEAD127 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/20 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 1/21 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 2/23 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/155 variables, 2/25 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 8 (OVERLAPS) 214/369 variables, 155/180 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/369 variables, 1/181 constraints. Problems are: Problem set: 1 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/369 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 212 unsolved
SMT process timed out in 30028ms, After SMT, problems are : Problem set: 1 solved, 212 unsolved
Search for dead transitions found 1 dead transitions in 30029ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 156/199 places, 213/271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 155 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 155 transition count 212
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 154 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 154 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 153 transition count 210
Applied a total of 6 rules in 7 ms. Remains 153 /156 variables (removed 3) and now considering 210/213 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11006608747896294839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-429736133930579794.kers'
[2026-05-26 21:27:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11006608747896294839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-429736133930579794.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 210 rows 153 cols 592 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:27:31] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-429736133930579794.kers
Total runtime 2 ms.
[2026-05-26 21:27:31] [INFO ] Implicit Places using invariants in 192 ms returned []
[2026-05-26 21:27:31] [INFO ] Invariant cache hit.
[2026-05-26 21:27:31] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 153/199 places, 210/271 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30923 ms. Remains : 153/199 places, 210/271 transitions.
[2026-05-26 21:27:31] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:27:31] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:27:31] [INFO ] Input system was already deterministic with 210 transitions.
[2026-05-26 21:27:31] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:27:31] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:27:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality10602266719314130997.gal : 2 ms
[2026-05-26 21:27:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality8957241034232574206.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/CTLCardinality10602266719314130997.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8957241034232574206.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,709542,2.26593,54576,2,5403,5,159603,6,0,820,221007,0


Converting to forward existential form...Done !
original formula: EF((EX((((p31==0)&&(p64==1))||(p170==0))) * (p160==1)))
=> equivalent forward existential formula: [(EY((FwdU(Init,TRUE) * (p160==1))) * (((p31==0)&&(p64==1))||(p170==0)))] != FALSE
(forward)formula 0,1,2.29447,54576,1,0,9,159603,9,2,1167,221007,3
FORMULA FireWire-PT-15-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 173 transition count 246
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 173 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 173 transition count 245
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 60 place count 165 transition count 225
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 165 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 165 transition count 224
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 162 transition count 221
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 162 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Applied a total of 78 rules in 8 ms. Remains 161 /199 variables (removed 38) and now considering 219/271 (removed 52) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8471392822858346256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15539523222167998727.kers'
[2026-05-26 21:27:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8471392822858346256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15539523222167998727.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 161 cols 630 entries
Finished phase 1 with 157 SingleSign rule and 0 generalized
[2026-05-26 21:27:33] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15539523222167998727.kers
Total runtime 1 ms.
[2026-05-26 21:27:34] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 21:27:34] [INFO ] Invariant cache hit.
[2026-05-26 21:27:34] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-26 21:27:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 13/17 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 1/18 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/161 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/161 variables, 5/27 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 219/380 variables, 161/188 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/380 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 9 (OVERLAPS) 0/380 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 380/380 variables, and 188 constraints, problems are : Problem set: 1 solved, 217 unsolved in 28528 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 217 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 1 (OVERLAPS) 1/161 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/161 variables, 23/27 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/161 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/380 variables, 161/188 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/380 variables, 217/405 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/380 variables, 0/405 constraints. Problems are: Problem set: 1 solved, 217 unsolved
At refinement iteration 7 (OVERLAPS) 0/380 variables, 2/407 constraints. Problems are: Problem set: 1 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 380/380 variables, and 407 constraints, problems are : Problem set: 1 solved, 217 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 217/218 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58558ms problems are : Problem set: 1 solved, 217 unsolved
Search for dead transitions found 1 dead transitions in 58558ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 161/199 places, 218/271 transitions.
Applied a total of 0 rules in 3 ms. Remains 161 /161 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58919 ms. Remains : 161/199 places, 218/271 transitions.
[2026-05-26 21:28:32] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:28:32] [INFO ] Flatten gal took : 8 ms
[2026-05-26 21:28:32] [INFO ] Input system was already deterministic with 218 transitions.
[2026-05-26 21:28:32] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:28:32] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:28:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality16461642588936847420.gal : 2 ms
[2026-05-26 21:28:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality10245728330228961618.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/CTLCardinality16461642588936847420.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10245728330228961618.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,482214,1.48532,40024,2,5262,5,115598,6,0,863,160635,0


Converting to forward existential form...Done !
original formula: EX(AG(((p21==0) * EF((p230==1)))))
=> equivalent forward existential formula: [(EY(Init) * !(E(TRUE U !(((p21==0) * E(TRUE U (p230==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t48, t52, t56, t59, t63, t71, t79, t83, t84, t99, t102, t104, t113, t115, t180, t192, t20...294
(forward)formula 0,0,11.7299,276176,1,0,435,1.82878e+06,458,231,5495,875883,541
FORMULA FireWire-PT-15-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 173 transition count 246
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 173 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 173 transition count 245
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 59 place count 166 transition count 226
Iterating global reduction 2 with 7 rules applied. Total rules applied 66 place count 166 transition count 226
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 166 transition count 225
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 69 place count 164 transition count 223
Iterating global reduction 3 with 2 rules applied. Total rules applied 71 place count 164 transition count 223
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 72 place count 164 transition count 222
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 73 place count 163 transition count 221
Iterating global reduction 4 with 1 rules applied. Total rules applied 74 place count 163 transition count 221
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 75 place count 162 transition count 220
Iterating global reduction 4 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 155 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 155 transition count 213
Applied a total of 90 rules in 16 ms. Remains 155 /199 variables (removed 44) and now considering 213/271 (removed 58) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13047749220094529636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17904961673018742588.kers'
[2026-05-26 21:28:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13047749220094529636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17904961673018742588.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 213 rows 155 cols 602 entries
Finished phase 1 with 151 SingleSign rule and 0 generalized
[2026-05-26 21:28:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17904961673018742588.kers
Total runtime 1 ms.
[2026-05-26 21:28:44] [INFO ] Implicit Places using invariants in 135 ms returned []
[2026-05-26 21:28:44] [INFO ] Invariant cache hit.
[2026-05-26 21:28:45] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2026-05-26 21:28:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Problem TDEAD127 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 3/16 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 213/368 variables, 155/171 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 1/172 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 2/174 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/368 variables, 0/174 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 368/368 variables, and 174 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 2/21 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 5 (OVERLAPS) 213/368 variables, 155/176 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/368 variables, 211/387 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/368 variables, 3/390 constraints. Problems are: Problem set: 1 solved, 211 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/368 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 211 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 368/368 variables, and 390 constraints, problems are : Problem set: 1 solved, 211 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 211/212 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 1 solved, 211 unsolved
Search for dead transitions found 1 dead transitions in 60052ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 155/199 places, 212/271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 154 transition count 211
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 154 transition count 211
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 153 transition count 210
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 153 transition count 210
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 209
Applied a total of 6 rules in 9 ms. Remains 152 /155 variables (removed 3) and now considering 209/212 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2923877799602416161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9545095550205475695.kers'
[2026-05-26 21:29:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2923877799602416161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9545095550205475695.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 209 rows 152 cols 588 entries
Finished phase 1 with 148 SingleSign rule and 0 generalized
[2026-05-26 21:29:45] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9545095550205475695.kers
Total runtime 2 ms.
[2026-05-26 21:29:45] [INFO ] Implicit Places using invariants in 162 ms returned []
[2026-05-26 21:29:45] [INFO ] Invariant cache hit.
[2026-05-26 21:29:45] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 152/199 places, 209/271 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61001 ms. Remains : 152/199 places, 209/271 transitions.
[2026-05-26 21:29:45] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:29:45] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:29:45] [INFO ] Input system was already deterministic with 209 transitions.
[2026-05-26 21:29:45] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:29:45] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:29:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10706929096741038424.gal : 2 ms
[2026-05-26 21:29:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality16326610484363524637.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/CTLCardinality10706929096741038424.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16326610484363524637.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,484706,1.61047,44448,2,5192,5,124191,6,0,818,174600,0


Converting to forward existential form...Done !
original formula: !(A(EG((EX(TRUE) + !(EG(((p77==0)||(p8==1)))))) U AX(AG((((p173==1)&&(p63==0))||(p207==0))))))
=> equivalent forward existential formula: ([(FwdU(EY((FwdU(Init,!(!(EX(!(!(E(TRUE U !((((p173==1)&&(p63==0))||(p207==0)))))))))) * !(EG((EX(TRUE) + !(EG((...326
Reverse transition relation is NOT exact ! Due to transitions t3, t47, t51, t55, t58, t62, t70, t77, t80, t84, t85, t100, t103, t105, t114, t116, t171, t19...300
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Detected timeout of ITS tools.
[2026-05-26 21:30:15] [INFO ] Flatten gal took : 4 ms
[2026-05-26 21:30:15] [INFO ] Applying decomposition
[2026-05-26 21:30:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10677889640034535046.txt' '-o' '/tmp/graph10677889640034535046.bin' '-w' '/tmp/graph10677889640034535046.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10677889640034535046.bin' '-l' '-1' '-v' '-w' '/tmp/graph10677889640034535046.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:30:15] [INFO ] Decomposing Gal with order
[2026-05-26 21:30:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:30:15] [INFO ] Removed a total of 144 redundant transitions.
[2026-05-26 21:30:15] [INFO ] Flatten gal took : 16 ms
[2026-05-26 21:30:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 4 ms.
[2026-05-26 21:30:15] [INFO ] Time to serialize gal into /tmp/CTLCardinality4680058782658780840.gal : 4 ms
[2026-05-26 21:30:15] [INFO ] Time to serialize properties into /tmp/CTLCardinality8708614998710548998.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/CTLCardinality4680058782658780840.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8708614998710548998.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,484706,0.291349,12052,317,142,13554,2886,567,24792,149,12300,0


Converting to forward existential form...Done !
original formula: !(A(EG((EX(TRUE) + !(EG(((i4.i0.u14.p77==0)||(i9.u0.p8==1)))))) U AX(AG((((i7.i1.u34.p173==1)&&(i4.i0.u11.p63==0))||(i0.u3.p207==0))))))
=> equivalent forward existential formula: ([(FwdU(EY((FwdU(Init,!(!(EX(!(!(E(TRUE U !((((i7.i1.u34.p173==1)&&(i4.i0.u11.p63==0))||(i0.u3.p207==0))))))))))...420
Reverse transition relation is NOT exact ! Due to transitions t47, t55, t62, t100, t103, t105, t116, t171, t193, t194, t195, t198, t199, t201, i3.u17.t70, ...381
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found 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
(forward)formula 0,1,3.75112,117788,1,0,219439,6857,3921,471455,957,28944,455352
FORMULA FireWire-PT-15-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 173 transition count 246
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 173 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 173 transition count 245
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 60 place count 165 transition count 225
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 165 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 165 transition count 224
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 162 transition count 221
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 162 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 155 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 155 transition count 213
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 154 transition count 212
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 153 transition count 211
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 153 transition count 211
Applied a total of 94 rules in 17 ms. Remains 153 /199 variables (removed 46) and now considering 211/271 (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-13998842426262830126.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8153917079825905001.kers'
[2026-05-26 21:30:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13998842426262830126.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8153917079825905001.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 153 cols 598 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:30:19] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8153917079825905001.kers
Total runtime 2 ms.
[2026-05-26 21:30:19] [INFO ] Implicit Places using invariants in 139 ms returned []
[2026-05-26 21:30:19] [INFO ] Invariant cache hit.
[2026-05-26 21:30:20] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 381 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-26 21:30:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 211/364 variables, 153/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 175 constraints, problems are : Problem set: 1 solved, 209 unsolved in 25583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 211/364 variables, 153/181 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 209/390 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 3/393 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 393 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55615ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 55617ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/199 places, 210/271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 150 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 150 transition count 207
Applied a total of 6 rules in 7 ms. Remains 150 /153 variables (removed 3) and now considering 207/210 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17532717504330452243.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17620735691885086089.kers'
[2026-05-26 21:31:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17532717504330452243.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17620735691885086089.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 150 cols 584 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-26 21:31:15] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17620735691885086089.kers
Total runtime 3 ms.
[2026-05-26 21:31:15] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-26 21:31:15] [INFO ] Invariant cache hit.
[2026-05-26 21:31:16] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/199 places, 207/271 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56549 ms. Remains : 150/199 places, 207/271 transitions.
[2026-05-26 21:31:16] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:31:16] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:31:16] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-26 21:31:16] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:31:16] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:31:16] [INFO ] Time to serialize gal into /tmp/CTLCardinality7046715914081669698.gal : 3 ms
[2026-05-26 21:31:16] [INFO ] Time to serialize properties into /tmp/CTLCardinality1140208786925795515.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/CTLCardinality7046715914081669698.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1140208786925795515.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,477446,1.65531,44412,2,5326,5,125329,6,0,808,183168,0


Converting to forward existential form...Done !
original formula: E(EF(EX(TRUE)) U AG(((p204==0) * EX((p55==0)))))
=> equivalent forward existential formula: [(FwdU(Init,E(TRUE U EX(TRUE))) * !(E(TRUE U !(((p204==0) * EX((p55==0)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t47, t51, t55, t58, t62, t70, t78, t82, t83, t98, t101, t103, t112, t114, t169, t191, t19...294
(forward)formula 0,1,27.2885,653416,1,0,1144,3.07439e+06,440,736,5334,3.49092e+06,1265
FORMULA FireWire-PT-15-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 198 transition count 271
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 26 place count 173 transition count 246
Iterating global reduction 1 with 25 rules applied. Total rules applied 51 place count 173 transition count 246
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 173 transition count 245
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 60 place count 165 transition count 225
Iterating global reduction 2 with 8 rules applied. Total rules applied 68 place count 165 transition count 225
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 165 transition count 224
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 72 place count 162 transition count 221
Iterating global reduction 3 with 3 rules applied. Total rules applied 75 place count 162 transition count 221
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 76 place count 162 transition count 220
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 77 place count 161 transition count 219
Iterating global reduction 4 with 1 rules applied. Total rules applied 78 place count 161 transition count 219
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 79 place count 160 transition count 218
Iterating global reduction 4 with 1 rules applied. Total rules applied 80 place count 160 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 81 place count 159 transition count 217
Iterating global reduction 4 with 1 rules applied. Total rules applied 82 place count 159 transition count 217
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 83 place count 158 transition count 216
Iterating global reduction 4 with 1 rules applied. Total rules applied 84 place count 158 transition count 216
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 85 place count 157 transition count 215
Iterating global reduction 4 with 1 rules applied. Total rules applied 86 place count 157 transition count 215
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 87 place count 156 transition count 214
Iterating global reduction 4 with 1 rules applied. Total rules applied 88 place count 156 transition count 214
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 89 place count 155 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 155 transition count 213
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 91 place count 154 transition count 212
Iterating global reduction 4 with 1 rules applied. Total rules applied 92 place count 154 transition count 212
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 93 place count 153 transition count 211
Iterating global reduction 4 with 1 rules applied. Total rules applied 94 place count 153 transition count 211
Applied a total of 94 rules in 21 ms. Remains 153 /199 variables (removed 46) and now considering 211/271 (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-16030000811087183.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12215332074253657881.kers'
[2026-05-26 21:31:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16030000811087183.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12215332074253657881.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 211 rows 153 cols 598 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-26 21:31:43] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12215332074253657881.kers
Total runtime 1 ms.
[2026-05-26 21:31:43] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-26 21:31:43] [INFO ] Invariant cache hit.
[2026-05-26 21:31:44] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 210 sub problems to find dead transitions.
[2026-05-26 21:31:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Problem TDEAD125 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 6/18 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (OVERLAPS) 211/364 variables, 153/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (OVERLAPS) 0/364 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 209 unsolved
No progress, stopping.
After SMT solving in domain Real declared 364/364 variables, and 175 constraints, problems are : Problem set: 1 solved, 209 unsolved in 25574 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 209 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 18/22 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/23 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 4/27 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 1/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/28 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 7 (OVERLAPS) 211/364 variables, 153/181 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/364 variables, 209/390 constraints. Problems are: Problem set: 1 solved, 209 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/364 variables, 3/393 constraints. Problems are: Problem set: 1 solved, 209 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 364/364 variables, and 393 constraints, problems are : Problem set: 1 solved, 209 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 209/210 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55601ms problems are : Problem set: 1 solved, 209 unsolved
Search for dead transitions found 1 dead transitions in 55602ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 153/199 places, 210/271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 152 transition count 209
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 209
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 151 transition count 208
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 151 transition count 208
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 150 transition count 207
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 150 transition count 207
Applied a total of 6 rules in 7 ms. Remains 150 /153 variables (removed 3) and now considering 207/210 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9874825335846922845.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15509681842799308681.kers'
[2026-05-26 21:32:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9874825335846922845.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15509681842799308681.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 207 rows 150 cols 584 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-26 21:32:39] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15509681842799308681.kers
Total runtime 2 ms.
[2026-05-26 21:32:39] [INFO ] Implicit Places using invariants in 182 ms returned []
[2026-05-26 21:32:39] [INFO ] Invariant cache hit.
[2026-05-26 21:32:40] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 150/199 places, 207/271 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56454 ms. Remains : 150/199 places, 207/271 transitions.
[2026-05-26 21:32:40] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:32:40] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:32:40] [INFO ] Input system was already deterministic with 207 transitions.
[2026-05-26 21:32:40] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:32:40] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:32:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality9994465207402890196.gal : 2 ms
[2026-05-26 21:32:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality14765636782368927596.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/CTLCardinality9994465207402890196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14765636782368927596.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,477446,1.61529,44328,2,5326,5,125329,6,0,808,183168,0


Converting to forward existential form...Done !
original formula: AF(EX(TRUE))
=> equivalent forward existential formula: [FwdG(Init,!(EX(TRUE)))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t3, t47, t51, t55, t58, t62, t70, t78, t82, t83, t98, t101, t103, t112, t114, t169, t191, t19...294
(forward)formula 0,1,3.90389,85300,1,0,344,346380,435,183,5149,298628,423
FORMULA FireWire-PT-15-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 199/199 places, 271/271 transitions.
Graph (trivial) has 146 edges and 199 vertex of which 12 / 199 are part of one of the 3 SCC in 1 ms
Free SCC test removed 9 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 471 edges and 190 vertex of which 189 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 30 place count 188 transition count 232
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 160 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 159 transition count 230
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 61 place count 159 transition count 222
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 77 place count 151 transition count 222
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 92 place count 136 transition count 206
Iterating global reduction 3 with 15 rules applied. Total rules applied 107 place count 136 transition count 206
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 108 place count 136 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 108 place count 136 transition count 202
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 114 place count 133 transition count 202
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 118 place count 129 transition count 197
Iterating global reduction 4 with 4 rules applied. Total rules applied 122 place count 129 transition count 197
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 124 place count 127 transition count 195
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 127 transition count 195
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 4 with 2 rules applied. Total rules applied 128 place count 127 transition count 193
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 126 transition count 193
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 130 place count 125 transition count 192
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 125 transition count 192
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 132 place count 124 transition count 191
Iterating global reduction 6 with 1 rules applied. Total rules applied 133 place count 124 transition count 191
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 134 place count 123 transition count 190
Iterating global reduction 6 with 1 rules applied. Total rules applied 135 place count 123 transition count 190
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 136 place count 122 transition count 189
Iterating global reduction 6 with 1 rules applied. Total rules applied 137 place count 122 transition count 189
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 121 transition count 188
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 121 transition count 188
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 140 place count 120 transition count 187
Iterating global reduction 6 with 1 rules applied. Total rules applied 141 place count 120 transition count 187
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 142 place count 119 transition count 186
Iterating global reduction 6 with 1 rules applied. Total rules applied 143 place count 119 transition count 186
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 144 place count 118 transition count 185
Iterating global reduction 6 with 1 rules applied. Total rules applied 145 place count 118 transition count 185
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 165 place count 108 transition count 175
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 167 place count 108 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 168 place count 107 transition count 173
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 170 place count 105 transition count 161
Iterating global reduction 8 with 2 rules applied. Total rules applied 172 place count 105 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 173 place count 105 transition count 160
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 174 place count 104 transition count 159
Applied a total of 174 rules in 43 ms. Remains 104 /199 variables (removed 95) and now considering 159/271 (removed 112) transitions.
[2026-05-26 21:32:44] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17874017744421533971.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13160239638365722628.kers'
[2026-05-26 21:32:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17874017744421533971.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13160239638365722628.kers]
Normalized transition count is 155 out of 156 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 155 rows 104 cols 480 entries
Finished phase 1 with 100 SingleSign rule and 0 generalized
[2026-05-26 21:32:44] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13160239638365722628.kers
Total runtime 1 ms.
[2026-05-26 21:32:44] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-26 21:32:44] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:32:44] [INFO ] Invariant cache hit.
[2026-05-26 21:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:32:44] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2026-05-26 21:32:44] [INFO ] Redundant transitions in 2 ms returned []
Running 154 sub problems to find dead transitions.
[2026-05-26 21:32:44] [INFO ] Flow matrix only has 156 transitions (discarded 3 similar events)
[2026-05-26 21:32:44] [INFO ] Invariant cache hit.
[2026-05-26 21:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 154 unsolved
Problem TDEAD54 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/103 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (OVERLAPS) 155/258 variables, 103/118 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/258 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (OVERLAPS) 1/259 variables, 1/121 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 10 (OVERLAPS) 0/259 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Real declared 259/260 variables, and 121 constraints, problems are : Problem set: 1 solved, 153 unsolved in 17569 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 154/154 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 153 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 3 (OVERLAPS) 155/258 variables, 103/119 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 1/120 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/258 variables, 153/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/273 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/274 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 153 unsolved
At refinement iteration 9 (OVERLAPS) 0/259 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 153 unsolved
No progress, stopping.
After SMT solving in domain Int declared 259/260 variables, and 274 constraints, problems are : Problem set: 1 solved, 153 unsolved in 22458 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 104/104 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 153/154 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40057ms problems are : Problem set: 1 solved, 153 unsolved
Search for dead transitions found 1 dead transitions in 40058ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_CTL mode, iteration 1 : 104/199 places, 158/271 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 103 transition count 157
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 157
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 102 transition count 156
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 102 transition count 156
Applied a total of 4 rules in 6 ms. Remains 102 /104 variables (removed 2) and now considering 156/158 (removed 2) transitions.
[2026-05-26 21:33:24] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10866451337097926480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8826600842374938159.kers'
[2026-05-26 21:33:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10866451337097926480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8826600842374938159.kers]
Normalized transition count is 152 out of 153 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 152 rows 102 cols 468 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:33:24] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8826600842374938159.kers
Total runtime 1 ms.
[2026-05-26 21:33:24] [INFO ] Implicit Places using invariants in 117 ms returned []
[2026-05-26 21:33:24] [INFO ] Flow matrix only has 153 transitions (discarded 3 similar events)
[2026-05-26 21:33:24] [INFO ] Invariant cache hit.
[2026-05-26 21:33:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 21:33:25] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 102/199 places, 156/271 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 40914 ms. Remains : 102/199 places, 156/271 transitions.
[2026-05-26 21:33:25] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:33:25] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:33:25] [INFO ] Input system was already deterministic with 156 transitions.
[2026-05-26 21:33:25] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:33:25] [INFO ] Flatten gal took : 6 ms
[2026-05-26 21:33:25] [INFO ] Time to serialize gal into /tmp/CTLCardinality13249073302996002676.gal : 1 ms
[2026-05-26 21:33:25] [INFO ] Time to serialize properties into /tmp/CTLCardinality3852275516967506825.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/CTLCardinality13249073302996002676.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3852275516967506825.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,108761,0.570791,16156,2,2074,5,40388,6,0,562,49111,0


Converting to forward existential form...Done !
original formula: EG(AF(AG(((p175==0)||(p89==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!(!(E(TRUE U !(((p175==0)||(p89==1)))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t27, t35, t36, t37, t42, t45, t49, t50, t108, t112, t116, t121, t125, t131, t135, t136, t137,...292
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,2.66791,69824,1,0,348,405940,343,179,4114,275821,409
FORMULA FireWire-PT-15-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-26 21:33:27] [INFO ] Flatten gal took : 5 ms
[2026-05-26 21:33:27] [INFO ] Flatten gal took : 5 ms
Total runtime 970319 ms.

BK_STOP 1779831207984

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FireWire-PT-15, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r130-smll-177955809000257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-15.tgz
mv FireWire-PT-15 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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