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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 8.6K Mar 7 05:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 7 05:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 7 05:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 7 05:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 10:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 19K Mar 15 10:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 7 05:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Mar 7 05:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Mar 7 05:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Mar 7 05:19 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 84K 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-16-CTLCardinality-2024-00
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-01
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-02
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-03
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-04
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-05
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-06
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-07
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-08
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-09
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-10
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-11
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-12
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-13
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-14
FORMULA_NAME FireWire-PT-16-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779832180761

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-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-26 21:49:43] [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:49:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-26 21:49:43] [INFO ] Load time of PNML (sax parser for PT used): 201 ms
[2026-05-26 21:49:43] [INFO ] Transformed 254 places.
[2026-05-26 21:49:43] [INFO ] Transformed 368 transitions.
[2026-05-26 21:49:43] [INFO ] Found NUPN structural information;
[2026-05-26 21:49:43] [INFO ] Parsed PT model containing 254 places and 368 transitions and 1032 arcs in 437 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 43 ms.
FORMULA FireWire-PT-16-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 118 out of 254 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 254/254 places, 368/368 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 253 transition count 368
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 229 transition count 344
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 229 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 54 place count 224 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 59 place count 224 transition count 330
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 60 place count 224 transition count 329
Applied a total of 60 rules in 132 ms. Remains 224 /254 variables (removed 30) and now considering 329/368 (removed 39) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3144080007038992783.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10931753448335549882.kers'
[2026-05-26 21:49:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3144080007038992783.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10931753448335549882.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 329 rows 224 cols 933 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-26 21:49:44] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10931753448335549882.kers
Total runtime 4 ms.
[2026-05-26 21:49:44] [INFO ] Implicit Places using invariants in 670 ms returned []
[2026-05-26 21:49:44] [INFO ] Invariant cache hit.
[2026-05-26 21:49:45] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1435 ms to find 0 implicit places.
Running 328 sub problems to find dead transitions.
[2026-05-26 21:49:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 328 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 328 unsolved
Problem TDEAD192 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD307 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 20/24 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 1/25 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 2/27 constraints. Problems are: Problem set: 11 solved, 317 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 222/553 variables, and 27 constraints, problems are : Problem set: 11 solved, 317 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/224 constraints, PredecessorRefiner: 328/328 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 317 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 4/4 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 23/27 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 2/29 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 2/31 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 2/33 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/222 variables, 0/33 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 7 (OVERLAPS) 329/551 variables, 222/255 constraints. Problems are: Problem set: 11 solved, 317 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 310/565 constraints. Problems are: Problem set: 11 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/553 variables, and 566 constraints, problems are : Problem set: 11 solved, 317 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 222/224 constraints, PredecessorRefiner: 310/328 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60330ms problems are : Problem set: 11 solved, 317 unsolved
Search for dead transitions found 11 dead transitions in 60369ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 224/254 places, 318/368 transitions.
Applied a total of 0 rules in 10 ms. Remains 224 /224 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62035 ms. Remains : 224/254 places, 318/368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 318/318 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 318/318 (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-93698863351406052.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3975673809523600759.kers'
[2026-05-26 21:50:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-93698863351406052.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3975673809523600759.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 318 rows 224 cols 889 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-26 21:50:45] [INFO ] Computed 4 invariants in 3 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3975673809523600759.kers
Total runtime 4 ms.
[2026-05-26 21:50:46] [INFO ] Implicit Places using invariants in 204 ms returned []
[2026-05-26 21:50:46] [INFO ] Invariant cache hit.
[2026-05-26 21:50:46] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 317 sub problems to find dead transitions.
[2026-05-26 21:50:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 317 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 317 unsolved
Problem TDEAD190 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD295 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 13/17 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 3/20 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 3/23 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 3/26 constraints. Problems are: Problem set: 19 solved, 298 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 222/542 variables, and 26 constraints, problems are : Problem set: 19 solved, 298 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/224 constraints, PredecessorRefiner: 317/317 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 298 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 4/4 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 22/26 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 4/30 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 2/32 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/222 variables, 0/32 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 6 (OVERLAPS) 318/540 variables, 222/254 constraints. Problems are: Problem set: 19 solved, 298 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 291/545 constraints. Problems are: Problem set: 19 solved, 298 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/542 variables, and 551 constraints, problems are : Problem set: 19 solved, 298 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 222/224 constraints, PredecessorRefiner: 291/317 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 19 solved, 298 unsolved
Search for dead transitions found 19 dead transitions in 60138ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in LTL mode, iteration 1 : 224/224 places, 299/318 transitions.
Applied a total of 0 rules in 9 ms. Remains 224 /224 variables (removed 0) and now considering 299/299 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60780 ms. Remains : 224/224 places, 299/318 transitions.
Support contains 118 out of 224 places after structural reductions.
[2026-05-26 21:51:47] [INFO ] Flatten gal took : 107 ms
[2026-05-26 21:51:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FireWire-PT-16-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-26 21:51:47] [INFO ] Flatten gal took : 49 ms
[2026-05-26 21:51:47] [INFO ] Input system was already deterministic with 299 transitions.
Support contains 114 out of 224 places (down from 118) after GAL structural reductions.
RANDOM walk for 40000 steps (10 resets) in 3070 ms. (13 steps per ms) remains 43/73 properties
BEST_FIRST walk for 4003 steps (12 resets) in 119 ms. (33 steps per ms) remains 39/43 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 37/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4000 steps (8 resets) in 77 ms. (51 steps per ms) remains 37/37 properties
BEST_FIRST walk for 4002 steps (13 resets) in 44 ms. (88 steps per ms) remains 36/37 properties
BEST_FIRST walk for 4000 steps (9 resets) in 41 ms. (95 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (10 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 22 ms. (173 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 28 ms. (137 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (10 resets) in 46 ms. (85 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (10 resets) in 25 ms. (153 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (11 resets) in 62 ms. (63 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (11 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 49 ms. (80 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (11 resets) in 61 ms. (64 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 28 ms. (137 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 38 ms. (102 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 39 ms. (100 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 33 ms. (117 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (9 resets) in 32 ms. (121 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (10 resets) in 45 ms. (86 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4001 steps (9 resets) in 83 ms. (47 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 36/36 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17381632647603470582.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14582318199883345274.kers'
[2026-05-26 21:51:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17381632647603470582.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14582318199883345274.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 299 rows 224 cols 813 entries
Finished phase 1 with 220 SingleSign rule and 0 generalized
[2026-05-26 21:51:48] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14582318199883345274.kers
Total runtime 2 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/72 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 1 (OVERLAPS) 133/205 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/205 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 3 (OVERLAPS) 285/490 variables, 205/209 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/490 variables, 0/209 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 19/509 variables, 10/219 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 0/219 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 9/518 variables, 6/225 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/225 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 9 (OVERLAPS) 4/522 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/522 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 11 (OVERLAPS) 1/523 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/523 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 523/523 variables, and 228 constraints, problems are : Problem set: 1 solved, 35 unsolved in 5017 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 35 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 1 (OVERLAPS) 134/204 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/204 variables, 13/17 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 284/488 variables, 204/221 constraints. Problems are: Problem set: 3 solved, 33 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/488 variables, 26/247 constraints. Problems are: Problem set: 3 solved, 33 unsolved
SMT process timed out in 10116ms, After SMT, problems are : Problem set: 3 solved, 33 unsolved
Fused 33 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 61 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 299/299 transitions.
Graph (complete) has 479 edges and 224 vertex of which 223 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 223 transition count 269
Reduce places removed 30 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 34 rules applied. Total rules applied 65 place count 193 transition count 265
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 69 place count 189 transition count 265
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 69 place count 189 transition count 256
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 87 place count 180 transition count 256
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 95 place count 172 transition count 248
Iterating global reduction 3 with 8 rules applied. Total rules applied 103 place count 172 transition count 248
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 103 place count 172 transition count 247
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 105 place count 171 transition count 247
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 106 place count 170 transition count 246
Iterating global reduction 3 with 1 rules applied. Total rules applied 107 place count 170 transition count 246
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 139 place count 154 transition count 230
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -18
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 151 place count 148 transition count 248
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 148 transition count 247
Free-agglomeration rule applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 161 place count 148 transition count 238
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 170 place count 139 transition count 238
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 174 place count 139 transition count 234
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 180 place count 139 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 181 place count 139 transition count 233
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 182 place count 139 transition count 233
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 183 place count 138 transition count 232
Applied a total of 183 rules in 206 ms. Remains 138 /224 variables (removed 86) and now considering 232/299 (removed 67) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 138/224 places, 232/299 transitions.
RANDOM walk for 40000 steps (11 resets) in 928 ms. (43 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 59 ms. (66 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (12 resets) in 72 ms. (54 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (11 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (11 resets) in 61 ms. (64 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 51 ms. (76 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 51 ms. (76 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 60 ms. (65 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 62 ms. (63 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 45 ms. (86 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 48 ms. (81 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (10 resets) in 87 ms. (45 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (9 resets) in 38 ms. (102 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 62 ms. (63 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 35 ms. (111 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (15 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 46 ms. (85 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 58 ms. (67 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (11 resets) in 32 ms. (121 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (10 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (9 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (12 resets) in 27 ms. (142 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (9 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (11 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (10 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
Probabilistic random walk after 1000001 steps, saw 214118 distinct states, run finished after 2962 ms. (steps per millisecond=337 ) properties seen :32
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16873217227249538122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1653820002209921607.kers'
[2026-05-26 21:52:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16873217227249538122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1653820002209921607.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 232 rows 138 cols 722 entries
Finished phase 1 with 134 SingleSign rule and 0 generalized
[2026-05-26 21:52:03] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1653820002209921607.kers
Total runtime 2 ms.
[2026-05-26 21:52:03] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 191/288 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 57/345 variables, 25/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/345 variables, 4/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 10/355 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/355 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 14/369 variables, 13/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/369 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/370 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/370 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 370/370 variables, and 149 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 138/138 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 75/76 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/76 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 21/97 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 191/288 variables, 97/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 57/345 variables, 25/128 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/345 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 10/355 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/355 variables, 2/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/355 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/355 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/355 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 14/369 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/369 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/370 variables, 1/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/370 variables, 0/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 370/370 variables, and 151 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 138/138 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1312ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 232/232 transitions.
Graph (trivial) has 95 edges and 138 vertex of which 8 / 138 are part of one of the 3 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 368 edges and 133 vertex of which 132 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 20 place count 132 transition count 206
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 38 place count 115 transition count 205
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 114 transition count 205
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 39 place count 114 transition count 202
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 45 place count 111 transition count 202
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 49 place count 107 transition count 184
Iterating global reduction 3 with 4 rules applied. Total rules applied 53 place count 107 transition count 184
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 107 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 107 transition count 180
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 105 transition count 180
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 91 place count 89 transition count 164
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 94 place count 86 transition count 161
Iterating global reduction 4 with 3 rules applied. Total rules applied 97 place count 86 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 98 place count 86 transition count 160
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 124 place count 73 transition count 190
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 128 place count 73 transition count 186
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 6 with 34 rules applied. Total rules applied 162 place count 73 transition count 152
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 169 place count 73 transition count 145
Reduce places removed 7 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 179 place count 66 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 7 with 7 rules applied. Total rules applied 186 place count 66 transition count 135
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 66 transition count 135
Applied a total of 187 rules in 107 ms. Remains 66 /138 variables (removed 72) and now considering 135/232 (removed 97) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 66/138 places, 135/232 transitions.
RANDOM walk for 40000 steps (4478 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1486 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6146 steps, run visited all 1 properties in 33 ms. (steps per millisecond=186 )
Probabilistic random walk after 6146 steps, saw 2186 distinct states, run finished after 40 ms. (steps per millisecond=153 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
[2026-05-26 21:52:04] [INFO ] Flatten gal took : 36 ms
[2026-05-26 21:52:04] [INFO ] Flatten gal took : 37 ms
[2026-05-26 21:52:04] [INFO ] Input system was already deterministic with 299 transitions.
Support contains 104 out of 224 places (down from 107) after GAL structural reductions.
Computed a total of 34 stabilizing places and 35 stable transitions
Graph (complete) has 479 edges and 224 vertex of which 222 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Graph (trivial) has 187 edges and 224 vertex of which 19 / 224 are part of one of the 3 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 462 edges and 208 vertex of which 206 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 59 place count 205 transition count 224
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 116 place count 148 transition count 224
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 116 place count 148 transition count 216
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 132 place count 140 transition count 216
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 147 place count 125 transition count 201
Iterating global reduction 2 with 15 rules applied. Total rules applied 162 place count 125 transition count 201
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 125 transition count 200
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 163 place count 125 transition count 196
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 171 place count 121 transition count 196
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 175 place count 117 transition count 192
Iterating global reduction 3 with 4 rules applied. Total rules applied 179 place count 117 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 3 with 2 rules applied. Total rules applied 181 place count 117 transition count 190
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 182 place count 116 transition count 190
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 208 place count 103 transition count 177
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 210 place count 101 transition count 165
Iterating global reduction 5 with 2 rules applied. Total rules applied 212 place count 101 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 101 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 100 transition count 163
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 216 place count 99 transition count 162
Applied a total of 216 rules in 66 ms. Remains 99 /224 variables (removed 125) and now considering 162/299 (removed 137) transitions.
[2026-05-26 21:52:04] [INFO ] Flow matrix only has 159 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-372497991621511084.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3194109621025287448.kers'
[2026-05-26 21:52:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-372497991621511084.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3194109621025287448.kers]
Normalized transition count is 158 out of 159 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 158 rows 99 cols 474 entries
Finished phase 1 with 95 SingleSign rule and 0 generalized
[2026-05-26 21:52:04] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3194109621025287448.kers
Total runtime 2 ms.
[2026-05-26 21:52:05] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-26 21:52:05] [INFO ] Flow matrix only has 159 transitions (discarded 3 similar events)
[2026-05-26 21:52:05] [INFO ] Invariant cache hit.
[2026-05-26 21:52:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-26 21:52:05] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2026-05-26 21:52:05] [INFO ] Redundant transitions in 6 ms returned []
Running 157 sub problems to find dead transitions.
[2026-05-26 21:52:05] [INFO ] Flow matrix only has 159 transitions (discarded 3 similar events)
[2026-05-26 21:52:05] [INFO ] Invariant cache hit.
[2026-05-26 21:52:05] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 157 unsolved
Problem TDEAD79 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 3 (OVERLAPS) 158/256 variables, 98/107 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 11/118 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 6 (OVERLAPS) 1/257 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 0/257 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/258 variables, and 119 constraints, problems are : Problem set: 1 solved, 156 unsolved in 15121 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 157/157 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 156 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 4 (OVERLAPS) 158/256 variables, 98/108 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 11/119 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 156/275 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/275 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 8 (OVERLAPS) 1/257 variables, 1/276 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 156 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/276 constraints. Problems are: Problem set: 1 solved, 156 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/258 variables, and 276 constraints, problems are : Problem set: 1 solved, 156 unsolved in 19834 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 99/99 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 156/157 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35010ms problems are : Problem set: 1 solved, 156 unsolved
Search for dead transitions found 1 dead transitions in 35010ms
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 : 99/224 places, 161/299 transitions.
Applied a total of 0 rules in 9 ms. Remains 99 /99 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2026-05-26 21:52:40] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 35394 ms. Remains : 99/224 places, 161/299 transitions.
[2026-05-26 21:52:40] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:52:40] [INFO ] Flatten gal took : 10 ms
[2026-05-26 21:52:40] [INFO ] Input system was already deterministic with 161 transitions.
[2026-05-26 21:52:40] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:52:40] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:52:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality2964897643893014951.gal : 6 ms
[2026-05-26 21:52:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality103150759787246702.ctl : 6 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/CTLCardinality2964897643893014951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality103150759787246702.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,74575,0.120497,6984,2,861,5,8297,6,0,555,11089,0


Converting to forward existential form...Done !
original formula: AG(EF((p127==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (p127==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t17, t37, t38, t42, t48, t87, t95, t97, t101, t106, t110, t142, t143, t146, t148, t14...264
(forward)formula 0,0,2.34336,65516,1,0,311,391721,340,159,3871,259107,368
FORMULA FireWire-PT-16-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 198 transition count 275
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 198 transition count 275
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 63 place count 185 transition count 261
Iterating global reduction 1 with 13 rules applied. Total rules applied 76 place count 185 transition count 261
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 77 place count 185 transition count 260
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 79 place count 183 transition count 258
Iterating global reduction 2 with 2 rules applied. Total rules applied 81 place count 183 transition count 258
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 182 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 182 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 181 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 181 transition count 256
Applied a total of 85 rules in 23 ms. Remains 181 /224 variables (removed 43) and now considering 256/299 (removed 43) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7711817659135753060.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9347967323961902963.kers'
[2026-05-26 21:52:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7711817659135753060.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9347967323961902963.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 256 rows 181 cols 718 entries
Finished phase 1 with 177 SingleSign rule and 0 generalized
[2026-05-26 21:52:42] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9347967323961902963.kers
Total runtime 1 ms.
[2026-05-26 21:52:42] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-26 21:52:43] [INFO ] Invariant cache hit.
[2026-05-26 21:52:43] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
Running 255 sub problems to find dead transitions.
[2026-05-26 21:52:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 255 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 255 unsolved
Problem TDEAD237 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (OVERLAPS) 256/437 variables, 181/192 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 4/196 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/196 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 437/437 variables, and 196 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 255/255 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/18 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/19 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 6 (OVERLAPS) 256/437 variables, 181/200 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 254/454 constraints. Problems are: Problem set: 1 solved, 254 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/437 variables, 1/455 constraints. Problems are: Problem set: 1 solved, 254 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 437/437 variables, and 455 constraints, problems are : Problem set: 1 solved, 254 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 254/255 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60075ms problems are : Problem set: 1 solved, 254 unsolved
Search for dead transitions found 1 dead transitions in 60076ms
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 : 181/224 places, 255/299 transitions.
Applied a total of 0 rules in 5 ms. Remains 181 /181 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60642 ms. Remains : 181/224 places, 255/299 transitions.
[2026-05-26 21:53:43] [INFO ] Flatten gal took : 33 ms
[2026-05-26 21:53:43] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:53:43] [INFO ] Input system was already deterministic with 255 transitions.
[2026-05-26 21:53:43] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:53:43] [INFO ] Flatten gal took : 21 ms
[2026-05-26 21:53:43] [INFO ] Time to serialize gal into /tmp/CTLCardinality14128588617070617160.gal : 16 ms
[2026-05-26 21:53:43] [INFO ] Time to serialize properties into /tmp/CTLCardinality1438814853052204582.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality14128588617070617160.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1438814853052204582.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (EF((AF(((p197==0)&&(p183==1))) * AF((p123==0)))) * (AG(AX((((p169==1)&&(p141==1))||(((p147==0)&&((p18==0)||(p89==1)))&&(p213==0))))) + (...262
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (!(EG(!(((p197==0)&&(p183==1))))) * !(EG(!((p123==0))))))))] = FALSE * ([((Init * !(!(E(TRU...502
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t31, t33, t38, t43, t44, t47, t54, t68, t71, t85, t96, t99, t102, t117, t...314
(forward)formula 0,0,7.70275,197860,1,0,536,1.15407e+06,552,291,6459,885374,668
FORMULA FireWire-PT-16-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 31 places :
Symmetric choice reduction at 1 with 31 rule applications. Total rules 33 place count 191 transition count 268
Iterating global reduction 1 with 31 rules applied. Total rules applied 64 place count 191 transition count 268
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 178 transition count 254
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 178 transition count 254
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 91 place count 178 transition count 253
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 93 place count 176 transition count 251
Iterating global reduction 2 with 2 rules applied. Total rules applied 95 place count 176 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 175 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 175 transition count 250
Applied a total of 97 rules in 10 ms. Remains 175 /224 variables (removed 49) and now considering 250/299 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9154271559243276046.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13075888848466658133.kers'
[2026-05-26 21:53:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9154271559243276046.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13075888848466658133.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 175 cols 706 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-26 21:53:51] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13075888848466658133.kers
Total runtime 2 ms.
[2026-05-26 21:53:51] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-26 21:53:51] [INFO ] Invariant cache hit.
[2026-05-26 21:53:51] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-26 21:53:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 3/7 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 250/425 variables, 175/182 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 2/184 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 2/186 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/425 variables, and 186 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 250/425 variables, 175/186 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 248/434 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 0/435 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 435 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 248/249 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60083ms problems are : Problem set: 1 solved, 248 unsolved
Search for dead transitions found 1 dead transitions in 60084ms
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/224 places, 249/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60642 ms. Remains : 175/224 places, 249/299 transitions.
[2026-05-26 21:54:52] [INFO ] Flatten gal took : 21 ms
[2026-05-26 21:54:52] [INFO ] Flatten gal took : 21 ms
[2026-05-26 21:54:52] [INFO ] Input system was already deterministic with 249 transitions.
[2026-05-26 21:54:52] [INFO ] Flatten gal took : 21 ms
[2026-05-26 21:54:52] [INFO ] Flatten gal took : 23 ms
[2026-05-26 21:54:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality10330590933405422616.gal : 9 ms
[2026-05-26 21:54:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality7005852179603055998.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/CTLCardinality10330590933405422616.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality7005852179603055998.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: ((EX(AG((p232==0))) + AG((((p7==0)||(p173==1))||((p223==0)||(p140==1))))) + EX((AG((p249==1)) * AX((p100==1)))))
=> equivalent forward existential formula: [(FwdU(((Init * !(EX((!(E(TRUE U !((p249==1)))) * !(EX(!((p100==1)))))))) * !(EX(!(E(TRUE U !((p232==0))))))),TR...220
Reverse transition relation is NOT exact ! Due to transitions t17, t21, t25, t27, t33, t38, t43, t51, t64, t67, t80, t89, t93, t95, t111, t120, t125, t126,...292
(forward)formula 0,0,7.10219,176928,1,0,484,1.06629e+06,527,271,6454,734549,611
FORMULA FireWire-PT-16-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 196 transition count 273
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 196 transition count 273
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 63 place count 187 transition count 263
Iterating global reduction 1 with 9 rules applied. Total rules applied 72 place count 187 transition count 263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 73 place count 187 transition count 262
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 74 place count 186 transition count 261
Iterating global reduction 2 with 1 rules applied. Total rules applied 75 place count 186 transition count 261
Applied a total of 75 rules in 8 ms. Remains 186 /224 variables (removed 38) and now considering 261/299 (removed 38) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9085731022903341612.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-369589910960387954.kers'
[2026-05-26 21:54:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9085731022903341612.kers, --Pflows, --basisKERS=/tmp/petrispot-output-369589910960387954.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 186 cols 731 entries
Finished phase 1 with 182 SingleSign rule and 0 generalized
[2026-05-26 21:54:59] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-369589910960387954.kers
Total runtime 2 ms.
[2026-05-26 21:54:59] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-26 21:54:59] [INFO ] Invariant cache hit.
[2026-05-26 21:54:59] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-26 21:54:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Problem TDEAD240 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 4/15 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 261/447 variables, 186/201 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 2/203 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 2/205 constraints. Problems are: Problem set: 1 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 205 constraints, problems are : Problem set: 1 solved, 259 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/185 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/186 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/186 variables, 15/19 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/186 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/186 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 261/447 variables, 186/206 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 259/465 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/447 variables, 1/466 constraints. Problems are: Problem set: 1 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/447 variables, 1/467 constraints. Problems are: Problem set: 1 solved, 259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 467 constraints, problems are : Problem set: 1 solved, 259 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 186/186 constraints, PredecessorRefiner: 259/260 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 1 solved, 259 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 : 186/224 places, 260/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 186 /186 variables (removed 0) and now considering 260/260 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60483 ms. Remains : 186/224 places, 260/299 transitions.
[2026-05-26 21:55:59] [INFO ] Flatten gal took : 22 ms
[2026-05-26 21:55:59] [INFO ] Flatten gal took : 16 ms
[2026-05-26 21:55:59] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-26 21:55:59] [INFO ] Flatten gal took : 15 ms
[2026-05-26 21:55:59] [INFO ] Flatten gal took : 16 ms
[2026-05-26 21:55:59] [INFO ] Time to serialize gal into /tmp/CTLCardinality5081238030047696297.gal : 5 ms
[2026-05-26 21:55:59] [INFO ] Time to serialize properties into /tmp/CTLCardinality3535440797139278653.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/CTLCardinality5081238030047696297.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3535440797139278653.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (E(EX(((AG(AX((p92==1))) + (p250==0)) + (p245==1))) U (AX(EF((p91!=1))) + (p145!=1))) * (AG((EX((p212==1)) + EX((p80==0)))) + (AF(((p124!...270
=> equivalent forward existential formula: ([(Init * !(E(EX(((!(E(TRUE U !(!(EX(!((p92==1))))))) + (p250==0)) + (p245==1))) U (!(EX(!(E(TRUE U (p91!=1)))))...476
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t28, t30, t36, t41, t46, t54, t68, t71, t84, t94, t98, t100, t103, t105, t118, t126...317
Hit Full ! (commute/partial/dont) 251/0/9
(forward)formula 0,0,22.0765,543912,1,0,719,3.55847e+06,565,369,6921,2.92158e+06,888
FORMULA FireWire-PT-16-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 : 224/224 places, 299/299 transitions.
Graph (trivial) has 185 edges and 224 vertex of which 19 / 224 are part of one of the 3 SCC in 0 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 462 edges and 208 vertex of which 206 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 57 place count 205 transition count 226
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 1 with 55 rules applied. Total rules applied 112 place count 150 transition count 226
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 112 place count 150 transition count 218
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 128 place count 142 transition count 218
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 142 place count 128 transition count 204
Iterating global reduction 2 with 14 rules applied. Total rules applied 156 place count 128 transition count 204
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 156 place count 128 transition count 200
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 164 place count 124 transition count 200
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 168 place count 120 transition count 196
Iterating global reduction 2 with 4 rules applied. Total rules applied 172 place count 120 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 174 place count 120 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 119 transition count 194
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 201 place count 106 transition count 181
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 203 place count 104 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 205 place count 104 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 104 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 208 place count 103 transition count 167
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 209 place count 103 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 210 place count 102 transition count 166
Applied a total of 210 rules in 35 ms. Remains 102 /224 variables (removed 122) and now considering 166/299 (removed 133) transitions.
[2026-05-26 21:56:22] [INFO ] Flow matrix only has 163 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-5539243973019551580.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6554936949763955906.kers'
[2026-05-26 21:56:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5539243973019551580.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6554936949763955906.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 102 cols 483 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 21:56:22] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6554936949763955906.kers
Total runtime 1 ms.
[2026-05-26 21:56:22] [INFO ] Implicit Places using invariants in 102 ms returned []
[2026-05-26 21:56:22] [INFO ] Flow matrix only has 163 transitions (discarded 3 similar events)
[2026-05-26 21:56:22] [INFO ] Invariant cache hit.
[2026-05-26 21:56:22] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-26 21:56:22] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2026-05-26 21:56:22] [INFO ] Redundant transitions in 7 ms returned []
Running 160 sub problems to find dead transitions.
[2026-05-26 21:56:22] [INFO ] Flow matrix only has 163 transitions (discarded 3 similar events)
[2026-05-26 21:56:22] [INFO ] Invariant cache hit.
[2026-05-26 21:56:22] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 160 unsolved
Problem TDEAD80 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 3 (OVERLAPS) 162/263 variables, 101/110 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 11/121 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 6 (OVERLAPS) 1/264 variables, 1/122 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 122 constraints, problems are : Problem set: 1 solved, 159 unsolved in 15635 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 159 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 4 (OVERLAPS) 162/263 variables, 101/112 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 11/123 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 159/282 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 8 (OVERLAPS) 1/264 variables, 1/283 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 159 unsolved
At refinement iteration 11 (OVERLAPS) 0/264 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 159 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 284 constraints, problems are : Problem set: 1 solved, 159 unsolved in 22583 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 159/160 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 38235ms problems are : Problem set: 1 solved, 159 unsolved
Search for dead transitions found 1 dead transitions in 38236ms
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/224 places, 165/299 transitions.
Applied a total of 0 rules in 7 ms. Remains 102 /102 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2026-05-26 21:57:00] [INFO ] Redundant transitions in 3 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 38594 ms. Remains : 102/224 places, 165/299 transitions.
[2026-05-26 21:57:00] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:57:00] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:57:00] [INFO ] Input system was already deterministic with 165 transitions.
[2026-05-26 21:57:00] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:57:00] [INFO ] Flatten gal took : 9 ms
[2026-05-26 21:57:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality10803331984508813305.gal : 2 ms
[2026-05-26 21:57:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality3502516033050958817.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/CTLCardinality10803331984508813305.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality3502516033050958817.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,76725,0.171713,7084,2,900,5,8594,6,0,571,11170,0


Converting to forward existential form...Done !
original formula: AG(EF(((p149==0)||((p239==0)&&(p165==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U ((p149==0)||((p239==0)&&(p165==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t2, t9, t19, t38, t39, t43, t49, t88, t96, t99, t104, t108, t109, t113, t145, t146, t149, t15...270
(forward)formula 0,1,0.753876,20244,1,0,285,78889,348,145,3944,60911,340
FORMULA FireWire-PT-16-CTLCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 192 transition count 269
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 192 transition count 269
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 75 place count 179 transition count 255
Iterating global reduction 1 with 13 rules applied. Total rules applied 88 place count 179 transition count 255
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 179 transition count 254
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 91 place count 177 transition count 252
Iterating global reduction 2 with 2 rules applied. Total rules applied 93 place count 177 transition count 252
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 94 place count 176 transition count 251
Iterating global reduction 2 with 1 rules applied. Total rules applied 95 place count 176 transition count 251
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 96 place count 175 transition count 250
Iterating global reduction 2 with 1 rules applied. Total rules applied 97 place count 175 transition count 250
Applied a total of 97 rules in 11 ms. Remains 175 /224 variables (removed 49) and now considering 250/299 (removed 49) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3607400052790601567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12752731961447580951.kers'
[2026-05-26 21:57:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3607400052790601567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12752731961447580951.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 250 rows 175 cols 706 entries
Finished phase 1 with 171 SingleSign rule and 0 generalized
[2026-05-26 21:57:01] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12752731961447580951.kers
Total runtime 1 ms.
[2026-05-26 21:57:01] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-26 21:57:01] [INFO ] Invariant cache hit.
[2026-05-26 21:57:01] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 249 sub problems to find dead transitions.
[2026-05-26 21:57:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 249 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 249 unsolved
Problem TDEAD231 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (OVERLAPS) 250/425 variables, 175/186 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 2/188 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 248 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 188 constraints, problems are : Problem set: 1 solved, 248 unsolved in 28174 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 249/249 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 248 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/174 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 1 (OVERLAPS) 1/175 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/175 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/175 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 5 (OVERLAPS) 250/425 variables, 175/190 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 248/438 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/425 variables, 1/439 constraints. Problems are: Problem set: 1 solved, 248 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 1/440 constraints. Problems are: Problem set: 1 solved, 248 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 425/425 variables, and 440 constraints, problems are : Problem set: 1 solved, 248 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 175/175 constraints, PredecessorRefiner: 248/249 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 58213ms problems are : Problem set: 1 solved, 248 unsolved
Search for dead transitions found 1 dead transitions in 58214ms
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/224 places, 249/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 175 /175 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58578 ms. Remains : 175/224 places, 249/299 transitions.
[2026-05-26 21:58:00] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:58:00] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:58:00] [INFO ] Input system was already deterministic with 249 transitions.
[2026-05-26 21:58:00] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:58:00] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:58:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality12875849074844360315.gal : 3 ms
[2026-05-26 21:58:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality1914342756538533758.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/CTLCardinality12875849074844360315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1914342756538533758.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (A(!(AX(!(((AX((p191==1)) + (p179==1)) + (p182==1))))) U EG((p140!=0))) + E((EX(((p211==0)||(p57==1))) * (p44==1)) U AG(((p11==0)||(p23==...161
=> equivalent forward existential formula: ([((Init * !(EG(!(EG((p140!=0)))))) * !(E(!(EG((p140!=0))) U (!(!(!(EX(!(!(((!(EX(!((p191==1)))) + (p179==1)) + ...309
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t33, t38, t42, t43, t51, t64, t67, t80, t89, t93, t95, t111, t120, t125, ...297
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,28.562,739836,1,0,1217,4.86495e+06,543,721,6587,4.66164e+06,1326
FORMULA FireWire-PT-16-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 299
Discarding 27 places :
Symmetric choice reduction at 1 with 27 rule applications. Total rules 28 place count 196 transition count 272
Iterating global reduction 1 with 27 rules applied. Total rules applied 55 place count 196 transition count 272
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 188 transition count 263
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 188 transition count 263
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 73 place count 186 transition count 261
Iterating global reduction 1 with 2 rules applied. Total rules applied 75 place count 186 transition count 261
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 76 place count 185 transition count 260
Iterating global reduction 1 with 1 rules applied. Total rules applied 77 place count 185 transition count 260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 78 place count 184 transition count 259
Iterating global reduction 1 with 1 rules applied. Total rules applied 79 place count 184 transition count 259
Applied a total of 79 rules in 9 ms. Remains 184 /224 variables (removed 40) and now considering 259/299 (removed 40) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18289494124391018075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11683559139309819052.kers'
[2026-05-26 21:58:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18289494124391018075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11683559139309819052.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 259 rows 184 cols 729 entries
Finished phase 1 with 180 SingleSign rule and 0 generalized
[2026-05-26 21:58:29] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11683559139309819052.kers
Total runtime 2 ms.
[2026-05-26 21:58:29] [INFO ] Implicit Places using invariants in 140 ms returned []
[2026-05-26 21:58:29] [INFO ] Invariant cache hit.
[2026-05-26 21:58:29] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Running 258 sub problems to find dead transitions.
[2026-05-26 21:58:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 258 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 258 unsolved
Problem TDEAD237 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 6/10 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 2/12 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 1/13 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/183 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (OVERLAPS) 259/442 variables, 183/196 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 2/198 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 1/199 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 442/443 variables, and 199 constraints, problems are : Problem set: 1 solved, 257 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 183/184 constraints, PredecessorRefiner: 258/258 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 257 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/182 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 1 (OVERLAPS) 1/183 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/183 variables, 12/16 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/183 variables, 1/17 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/183 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 5 (OVERLAPS) 259/442 variables, 183/200 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/442 variables, 255/455 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/442 variables, 1/456 constraints. Problems are: Problem set: 1 solved, 257 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/442 variables, 2/458 constraints. Problems are: Problem set: 1 solved, 257 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 442/443 variables, and 459 constraints, problems are : Problem set: 1 solved, 257 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 183/184 constraints, PredecessorRefiner: 255/258 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60047ms problems are : Problem set: 1 solved, 257 unsolved
Search for dead transitions found 1 dead transitions in 60048ms
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 : 184/224 places, 258/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 258/258 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60455 ms. Remains : 184/224 places, 258/299 transitions.
[2026-05-26 21:59:29] [INFO ] Flatten gal took : 13 ms
[2026-05-26 21:59:29] [INFO ] Flatten gal took : 12 ms
[2026-05-26 21:59:29] [INFO ] Input system was already deterministic with 258 transitions.
[2026-05-26 21:59:29] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:59:29] [INFO ] Flatten gal took : 11 ms
[2026-05-26 21:59:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality15065881222511513032.gal : 4 ms
[2026-05-26 21:59:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality5398863364374071327.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/CTLCardinality15065881222511513032.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality5398863364374071327.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: E(A((E(AX(((p231==0)||(p6==1))) U ((!((p2==0)||(p79==1)))||(p154!=1))) + !(((AG(((p11==0)||(p24==1))) * ((p87==0)||(p228==1))) * ((p180==...284
=> equivalent forward existential formula: [FwdG((FwdU(Init,!((E(!((!(!(EX(!(!(EX(!((p147==0)))))))) * ((p21==0)||(p19==1)))) U (!((E(!(EX(!(((p231==0)||(p...513
Reverse transition relation is NOT exact ! Due to transitions t17, t19, t25, t27, t32, t33, t38, t39, t44, t52, t65, t68, t81, t92, t96, t98, t114, t122, t...326
Detected timeout of ITS tools.
[2026-05-26 21:59:59] [INFO ] Flatten gal took : 7 ms
[2026-05-26 21:59:59] [INFO ] Applying decomposition
[2026-05-26 21:59:59] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15756088453336982735.txt' '-o' '/tmp/graph15756088453336982735.bin' '-w' '/tmp/graph15756088453336982735.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15756088453336982735.bin' '-l' '-1' '-v' '-w' '/tmp/graph15756088453336982735.weights' '-q' '0' '-e' '0.001'
[2026-05-26 21:59:59] [INFO ] Decomposing Gal with order
[2026-05-26 21:59:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 21:59:59] [INFO ] Removed a total of 167 redundant transitions.
[2026-05-26 22:00:00] [INFO ] Flatten gal took : 111 ms
[2026-05-26 22:00:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 13 ms.
[2026-05-26 22:00:00] [INFO ] Time to serialize gal into /tmp/CTLCardinality3721702249295908770.gal : 10 ms
[2026-05-26 22:00:00] [INFO ] Time to serialize properties into /tmp/CTLCardinality13526667327084886289.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/CTLCardinality3721702249295908770.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13526667327084886289.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.10667e+06,0.523573,15484,649,191,16181,9800,569,28234,143,39865,0


Converting to forward existential form...Done !
original formula: E(A((E(AX(((i11.i0.i0.u58.p231==0)||(i4.u2.p6==1))) U ((!((i4.u21.p2==0)||(i4.u21.p79==1)))||(i8.u37.p154!=1))) + !(((AG(((i2.u4.p11==0)|...427
=> equivalent forward existential formula: [FwdG((FwdU(Init,!((E(!((!(!(EX(!(!(EX(!((i9.u38.p147==0)))))))) * ((i2.u8.p21==0)||(i2.u7.p19==1)))) U (!((E(!(...694
Reverse transition relation is NOT exact ! Due to transitions t52, t127, t130, t146, t155, t245, t246, t247, t250, t254, i0.u3.t144, i1.t122, i1.u34.t96, i...447
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found a local SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,0,8.59775,238040,1,0,394593,14666,3451,1.01998e+06,838,50671,733636
FORMULA FireWire-PT-16-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 32 place count 192 transition count 269
Iterating global reduction 1 with 30 rules applied. Total rules applied 62 place count 192 transition count 269
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 71 place count 183 transition count 260
Iterating global reduction 1 with 9 rules applied. Total rules applied 80 place count 183 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 183 transition count 259
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 83 place count 181 transition count 257
Iterating global reduction 2 with 2 rules applied. Total rules applied 85 place count 181 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 180 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 180 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 179 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 179 transition count 255
Applied a total of 89 rules in 17 ms. Remains 179 /224 variables (removed 45) and now considering 255/299 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11968179056415015732.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16117523118545081995.kers'
[2026-05-26 22:00:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11968179056415015732.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16117523118545081995.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 255 rows 179 cols 716 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-26 22:00:08] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16117523118545081995.kers
Total runtime 2 ms.
[2026-05-26 22:00:08] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-26 22:00:08] [INFO ] Invariant cache hit.
[2026-05-26 22:00:09] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
Running 254 sub problems to find dead transitions.
[2026-05-26 22:00:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 254 unsolved
Problem TDEAD235 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 6 (OVERLAPS) 255/434 variables, 179/192 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 4/196 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/197 constraints. Problems are: Problem set: 1 solved, 253 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 434/434 variables, and 197 constraints, problems are : Problem set: 1 solved, 253 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 253 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 14/18 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 4/22 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 5 (OVERLAPS) 255/434 variables, 179/201 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 253/454 constraints. Problems are: Problem set: 1 solved, 253 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 253 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 434/434 variables, and 455 constraints, problems are : Problem set: 1 solved, 253 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 253/254 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60057ms problems are : Problem set: 1 solved, 253 unsolved
Search for dead transitions found 1 dead transitions in 60058ms
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 : 179/224 places, 254/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 179 /179 variables (removed 0) and now considering 254/254 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60621 ms. Remains : 179/224 places, 254/299 transitions.
[2026-05-26 22:01:09] [INFO ] Flatten gal took : 12 ms
[2026-05-26 22:01:09] [INFO ] Flatten gal took : 13 ms
[2026-05-26 22:01:09] [INFO ] Input system was already deterministic with 254 transitions.
[2026-05-26 22:01:09] [INFO ] Flatten gal took : 11 ms
[2026-05-26 22:01:09] [INFO ] Flatten gal took : 12 ms
[2026-05-26 22:01:09] [INFO ] Time to serialize gal into /tmp/CTLCardinality545964450503227284.gal : 2 ms
[2026-05-26 22:01:09] [INFO ] Time to serialize properties into /tmp/CTLCardinality10938219257264926893.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/CTLCardinality545964450503227284.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality10938219257264926893.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EX(AF((EG(E((p90==1) U ((p51==0)||(p151==1)))) * (AX(((p159==0)&&(p220==1))) + (EF((p130==1)) * E(((p27==0)||(p125==1)) U (p16==1)))))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG(E((p90==1) U ((p51==0)||(p151==1)))) * (!(EX(!(((p159==0)&&(p220==1))))) + (E(TRUE U (p1...217
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t36, t37, t42, t46, t50, t51, t52, t65, t68, t81, t90, t94, t96, t11...324
Detected timeout of ITS tools.
[2026-05-26 22:01:39] [INFO ] Flatten gal took : 6 ms
[2026-05-26 22:01:39] [INFO ] Applying decomposition
[2026-05-26 22:01:39] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4029476771179704157.txt' '-o' '/tmp/graph4029476771179704157.bin' '-w' '/tmp/graph4029476771179704157.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4029476771179704157.bin' '-l' '-1' '-v' '-w' '/tmp/graph4029476771179704157.weights' '-q' '0' '-e' '0.001'
[2026-05-26 22:01:39] [INFO ] Decomposing Gal with order
[2026-05-26 22:01:39] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-26 22:01:39] [INFO ] Removed a total of 164 redundant transitions.
[2026-05-26 22:01:39] [INFO ] Flatten gal took : 19 ms
[2026-05-26 22:01:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 7 ms.
[2026-05-26 22:01:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality10262820507873780904.gal : 5 ms
[2026-05-26 22:01:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality8394434932876383461.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/CTLCardinality10262820507873780904.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8394434932876383461.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.65532e+06,0.26828,11740,471,202,8750,9409,620,14731,153,35966,0


Converting to forward existential form...Done !
original formula: EX(AF((EG(E((i10.i1.u24.p90==1) U ((i3.u14.p51==0)||(i8.i0.u39.p151==1)))) * (AX(((i7.u40.p159==0)&&(i10.i1.u52.p220==1))) + (EF((i6.u33....232
=> equivalent forward existential formula: [(EY(Init) * !(EG(!((EG(E((i10.i1.u24.p90==1) U ((i3.u14.p51==0)||(i8.i0.u39.p151==1)))) * (!(EX(!(((i7.u40.p159...295
Reverse transition relation is NOT exact ! Due to transitions t42, t114, t121, t145, t153, t243, t247, t250, i0.i0.t140, i0.i1.u6.t128, i0.i2.u1.t143, i1.t...480
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
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 a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found an SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
Fast SCC detection found an SCC at level 8
Fast SCC detection found an SCC at level 9
Fast SCC detection found an SCC at level 10
Fast SCC detection found an SCC at level 11
(forward)formula 0,1,6.15921,167760,1,0,288878,13177,3706,582506,946,35966,538826
FORMULA FireWire-PT-16-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 29 places :
Symmetric choice reduction at 1 with 29 rule applications. Total rules 31 place count 193 transition count 270
Iterating global reduction 1 with 29 rules applied. Total rules applied 60 place count 193 transition count 270
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 71 place count 182 transition count 258
Iterating global reduction 1 with 11 rules applied. Total rules applied 82 place count 182 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 182 transition count 257
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 181 transition count 256
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 181 transition count 256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 86 place count 180 transition count 255
Iterating global reduction 2 with 1 rules applied. Total rules applied 87 place count 180 transition count 255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 179 transition count 254
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 179 transition count 254
Applied a total of 89 rules in 9 ms. Remains 179 /224 variables (removed 45) and now considering 254/299 (removed 45) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7845941594884057343.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12009540133651875395.kers'
[2026-05-26 22:01:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7845941594884057343.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12009540133651875395.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 254 rows 179 cols 714 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-26 22:01:45] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12009540133651875395.kers
Total runtime 2 ms.
[2026-05-26 22:01:45] [INFO ] Implicit Places using invariants in 129 ms returned []
[2026-05-26 22:01:45] [INFO ] Invariant cache hit.
[2026-05-26 22:01:46] [INFO ] Implicit Places using invariants and state equation in 359 ms returned []
Implicit Place search using SMT with State Equation took 491 ms to find 0 implicit places.
Running 253 sub problems to find dead transitions.
[2026-05-26 22:01:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 253 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 253 unsolved
Problem TDEAD235 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 254/433 variables, 179/191 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 252 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (OVERLAPS) 0/433 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 433/433 variables, and 191 constraints, problems are : Problem set: 1 solved, 252 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 253/253 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 4 (OVERLAPS) 254/433 variables, 179/191 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/433 variables, 252/443 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/433 variables, 2/445 constraints. Problems are: Problem set: 1 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/433 variables, 2/447 constraints. Problems are: Problem set: 1 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/433 variables, and 448 constraints, problems are : Problem set: 1 solved, 252 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 252/253 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60063ms problems are : Problem set: 1 solved, 252 unsolved
Search for dead transitions found 1 dead transitions in 60066ms
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 : 179/224 places, 253/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 179 /179 variables (removed 0) and now considering 253/253 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60570 ms. Remains : 179/224 places, 253/299 transitions.
[2026-05-26 22:02:46] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:02:46] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:02:46] [INFO ] Input system was already deterministic with 253 transitions.
[2026-05-26 22:02:46] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:02:46] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:02:46] [INFO ] Time to serialize gal into /tmp/CTLCardinality6431511033744367104.gal : 2 ms
[2026-05-26 22:02:46] [INFO ] Time to serialize properties into /tmp/CTLCardinality6477963655821144871.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/CTLCardinality6431511033744367104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6477963655821144871.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: (AX(AG((((p70==0) + EF((p236==0))) + A((p202==1) U (p222==0))))) + ((EX((p100==1)) * EG(((p89==0)&&(p72==1)))) * (E(!(((p215==0)||(p118==...244
=> equivalent forward existential formula: [(((FwdU(EY((Init * !(((EX((p100==1)) * EG(((p89==0)&&(p72==1)))) * (E(!(((p215==0)||(p118==1))) U ((p60==1)&&(p...360
Reverse transition relation is NOT exact ! Due to transitions t18, t21, t22, t26, t28, t34, t39, t44, t47, t53, t62, t66, t69, t82, t92, t95, t97, t101, t1...319
(forward)formula 0,1,2.46202,63704,1,0,415,262333,527,229,6116,226188,516
FORMULA FireWire-PT-16-CTLCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Graph (trivial) has 178 edges and 224 vertex of which 9 / 224 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 472 edges and 217 vertex of which 215 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 214 transition count 233
Reduce places removed 58 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 156 transition count 231
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 154 transition count 231
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 122 place count 154 transition count 223
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 138 place count 146 transition count 223
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 153 place count 131 transition count 208
Iterating global reduction 3 with 15 rules applied. Total rules applied 168 place count 131 transition count 208
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 169 place count 131 transition count 207
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 169 place count 131 transition count 202
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 179 place count 126 transition count 202
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 183 place count 122 transition count 198
Iterating global reduction 4 with 4 rules applied. Total rules applied 187 place count 122 transition count 198
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 189 place count 122 transition count 196
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 190 place count 121 transition count 196
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 216 place count 108 transition count 183
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 107 transition count 182
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 219 place count 107 transition count 182
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 220 place count 106 transition count 181
Applied a total of 220 rules in 46 ms. Remains 106 /224 variables (removed 118) and now considering 181/299 (removed 118) transitions.
[2026-05-26 22:02:49] [INFO ] Flow matrix only has 180 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12121783680044073261.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13386473195006305070.kers'
[2026-05-26 22:02:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12121783680044073261.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13386473195006305070.kers]
Normalized transition count is 179 out of 180 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 179 rows 106 cols 558 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 22:02:49] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13386473195006305070.kers
Total runtime 1 ms.
[2026-05-26 22:02:49] [INFO ] Implicit Places using invariants in 110 ms returned []
[2026-05-26 22:02:49] [INFO ] Flow matrix only has 180 transitions (discarded 1 similar events)
[2026-05-26 22:02:49] [INFO ] Invariant cache hit.
[2026-05-26 22:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 22:02:49] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2026-05-26 22:02:49] [INFO ] Redundant transitions in 1 ms returned []
Running 176 sub problems to find dead transitions.
[2026-05-26 22:02:49] [INFO ] Flow matrix only has 180 transitions (discarded 1 similar events)
[2026-05-26 22:02:49] [INFO ] Invariant cache hit.
[2026-05-26 22:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 176 unsolved
Problem TDEAD85 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 2/11 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 179/284 variables, 105/116 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 285/286 variables, and 118 constraints, problems are : Problem set: 1 solved, 175 unsolved in 19133 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 176/176 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 3 (OVERLAPS) 179/284 variables, 105/116 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/284 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/284 variables, 175/292 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/284 variables, 0/292 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 7 (OVERLAPS) 1/285 variables, 1/293 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 0/285 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 285/286 variables, and 293 constraints, problems are : Problem set: 1 solved, 175 unsolved in 20174 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 175/176 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 39323ms problems are : Problem set: 1 solved, 175 unsolved
Search for dead transitions found 1 dead transitions in 39324ms
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 : 106/224 places, 180/299 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-26 22:03:28] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 39686 ms. Remains : 106/224 places, 180/299 transitions.
[2026-05-26 22:03:28] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:03:28] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:03:28] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-26 22:03:28] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:03:28] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:03:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2406119437523794743.gal : 1 ms
[2026-05-26 22:03:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality12043494276488776825.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/CTLCardinality2406119437523794743.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12043494276488776825.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,107815,0.120096,7160,2,928,5,9468,6,0,603,11402,0


Converting to forward existential form...Done !
original formula: EF((!(E(((p54==0)||(p99==1)) U AG((((p118==0)||(p57==1))||(p231==1))))) * AF(((p159!=0)&&(p65!=1)))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(((p54==0)||(p99==1)) U !(E(TRUE U !((((p118==0)||(p57==1))||(p231==1)))))))) * !(EG(!((...189
Reverse transition relation is NOT exact ! Due to transitions t1, t8, t17, t37, t38, t53, t54, t92, t94, t102, t104, t105, t107, t115, t160, t161, t162, t1...277
(forward)formula 0,1,9.1305,239248,1,0,593,1.48551e+06,392,305,4320,1.216e+06,703
FORMULA FireWire-PT-16-CTLCardinality-2024-10 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 : 224/224 places, 299/299 transitions.
Graph (trivial) has 185 edges and 224 vertex of which 9 / 224 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 472 edges and 217 vertex of which 215 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 214 transition count 233
Reduce places removed 58 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 119 place count 156 transition count 232
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 155 transition count 232
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 120 place count 155 transition count 224
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 136 place count 147 transition count 224
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 150 place count 133 transition count 210
Iterating global reduction 3 with 14 rules applied. Total rules applied 164 place count 133 transition count 210
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 165 place count 133 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 165 place count 133 transition count 205
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 173 place count 129 transition count 205
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 176 place count 126 transition count 202
Iterating global reduction 4 with 3 rules applied. Total rules applied 179 place count 126 transition count 202
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 181 place count 126 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 182 place count 125 transition count 200
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 212 place count 110 transition count 185
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 214 place count 108 transition count 173
Iterating global reduction 6 with 2 rules applied. Total rules applied 216 place count 108 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 217 place count 108 transition count 172
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 219 place count 107 transition count 171
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 220 place count 106 transition count 170
Applied a total of 220 rules in 35 ms. Remains 106 /224 variables (removed 118) and now considering 170/299 (removed 129) transitions.
[2026-05-26 22:03:37] [INFO ] Flow matrix only has 169 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12210823283489749315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-295778793775885740.kers'
[2026-05-26 22:03:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12210823283489749315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-295778793775885740.kers]
Normalized transition count is 168 out of 169 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 106 cols 516 entries
Finished phase 1 with 102 SingleSign rule and 0 generalized
[2026-05-26 22:03:37] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-295778793775885740.kers
Total runtime 1 ms.
[2026-05-26 22:03:38] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 22:03:38] [INFO ] Flow matrix only has 169 transitions (discarded 1 similar events)
[2026-05-26 22:03:38] [INFO ] Invariant cache hit.
[2026-05-26 22:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-26 22:03:38] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
[2026-05-26 22:03:38] [INFO ] Redundant transitions in 1 ms returned []
Running 165 sub problems to find dead transitions.
[2026-05-26 22:03:38] [INFO ] Flow matrix only has 169 transitions (discarded 1 similar events)
[2026-05-26 22:03:38] [INFO ] Invariant cache hit.
[2026-05-26 22:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Problem TDEAD87 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 168/273 variables, 105/116 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/117 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 1/274 variables, 1/118 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/275 variables, and 118 constraints, problems are : Problem set: 1 solved, 164 unsolved in 16704 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 164 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 7/11 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 3 (OVERLAPS) 168/273 variables, 105/116 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/273 variables, 1/117 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 164/281 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/273 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 1/274 variables, 1/282 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 164 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/275 variables, and 282 constraints, problems are : Problem set: 1 solved, 164 unsolved in 19626 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 106/106 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 164/165 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36350ms problems are : Problem set: 1 solved, 164 unsolved
Search for dead transitions found 1 dead transitions in 36351ms
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 : 106/224 places, 169/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 169/169 (removed 0) transitions.
[2026-05-26 22:04:14] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 36808 ms. Remains : 106/224 places, 169/299 transitions.
[2026-05-26 22:04:14] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:04:14] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:04:14] [INFO ] Input system was already deterministic with 169 transitions.
RANDOM walk for 550 steps (39 resets) in 11 ms. (45 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-16-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-26 22:04:14] [INFO ] Flatten gal took : 5 ms
[2026-05-26 22:04:14] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:04:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4731367099596017030.gal : 1 ms
[2026-05-26 22:04:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4457600842597904912.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4731367099596017030.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4457600842597904912.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Graph (trivial) has 184 edges and 224 vertex of which 19 / 224 are part of one of the 3 SCC in 1 ms
Free SCC test removed 16 places
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Graph (complete) has 462 edges and 208 vertex of which 206 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 205 transition count 227
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 151 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 150 transition count 226
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 112 place count 150 transition count 218
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 128 place count 142 transition count 218
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 143 place count 127 transition count 203
Iterating global reduction 3 with 15 rules applied. Total rules applied 158 place count 127 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 159 place count 127 transition count 202
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 159 place count 127 transition count 198
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 167 place count 123 transition count 198
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 171 place count 119 transition count 194
Iterating global reduction 4 with 4 rules applied. Total rules applied 175 place count 119 transition count 194
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 177 place count 119 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 178 place count 118 transition count 192
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 6 with 26 rules applied. Total rules applied 204 place count 105 transition count 179
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 205 place count 104 transition count 169
Iterating global reduction 6 with 1 rules applied. Total rules applied 206 place count 104 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 207 place count 104 transition count 168
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 209 place count 103 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 210 place count 102 transition count 166
Applied a total of 210 rules in 25 ms. Remains 102 /224 variables (removed 122) and now considering 166/299 (removed 133) transitions.
[2026-05-26 22:04:14] [INFO ] Flow matrix only has 163 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-14288295928990016281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2491800353316655389.kers'
[2026-05-26 22:04:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14288295928990016281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2491800353316655389.kers]
Normalized transition count is 162 out of 163 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 162 rows 102 cols 482 entries
Finished phase 1 with 98 SingleSign rule and 0 generalized
[2026-05-26 22:04:14] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2491800353316655389.kers
Total runtime 1 ms.
[2026-05-26 22:04:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-26 22:04:14] [INFO ] Flow matrix only has 163 transitions (discarded 3 similar events)
[2026-05-26 22:04:14] [INFO ] Invariant cache hit.
[2026-05-26 22:04:14] [INFO ] State equation strengthened by 11 read => feed constraints.
[2026-05-26 22:04:15] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2026-05-26 22:04:15] [INFO ] Redundant transitions in 1 ms returned []
Running 161 sub problems to find dead transitions.
[2026-05-26 22:04:15] [INFO ] Flow matrix only has 163 transitions (discarded 3 similar events)
[2026-05-26 22:04:15] [INFO ] Invariant cache hit.
[2026-05-26 22:04:15] [INFO ] State equation strengthened by 11 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 161 unsolved
Problem TDEAD82 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 162/263 variables, 101/110 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 11/121 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/263 variables, 0/121 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 1/264 variables, 1/122 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 8 (OVERLAPS) 0/264 variables, 0/122 constraints. Problems are: Problem set: 1 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/265 variables, and 122 constraints, problems are : Problem set: 1 solved, 160 unsolved in 16133 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 1/11 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/101 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 162/263 variables, 101/112 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 11/123 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 160/283 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/263 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 9 (OVERLAPS) 1/264 variables, 1/284 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 160 unsolved
At refinement iteration 11 (OVERLAPS) 0/264 variables, 0/284 constraints. Problems are: Problem set: 1 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/265 variables, and 284 constraints, problems are : Problem set: 1 solved, 160 unsolved in 20333 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 102/102 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 160/161 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36492ms problems are : Problem set: 1 solved, 160 unsolved
Search for dead transitions found 1 dead transitions in 36493ms
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/224 places, 165/299 transitions.
Applied a total of 0 rules in 3 ms. Remains 102 /102 variables (removed 0) and now considering 165/165 (removed 0) transitions.
[2026-05-26 22:04:51] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_CTL mode , in 2 iterations and 36868 ms. Remains : 102/224 places, 165/299 transitions.
[2026-05-26 22:04:51] [INFO ] Flatten gal took : 3 ms
[2026-05-26 22:04:51] [INFO ] Flatten gal took : 4 ms
[2026-05-26 22:04:51] [INFO ] Input system was already deterministic with 165 transitions.
[2026-05-26 22:04:51] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:04:51] [INFO ] Flatten gal took : 7 ms
[2026-05-26 22:04:51] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12616909499464605104.gal : 5 ms
[2026-05-26 22:04:51] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1748119813972199381.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12616909499464605104.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1748119813972199381.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1748119813972199381.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 12
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :12 after 21
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :21 after 30
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :30 after 41
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :41 after 92
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :741 after 1496
RANDOM walk for 40000 steps (3863 resets) in 286 ms. (139 steps per ms) remains 1/1 properties
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1496 after 2577
BEST_FIRST walk for 40004 steps (1263 resets) in 109 ms. (363 steps per ms) remains 1/1 properties
Invariant property FireWire-PT-16-CTLCardinality-2024-12 does not hold.
FORMULA FireWire-PT-16-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,7145,0.103962,6920,2,915,15,7811,6,0,572,8809,0
Total reachable state count : 7145

Verifying 1 reachability properties.
Invariant property FireWire-PT-16-CTLCardinality-2024-12 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-16-CTLCardinality-2024-12,13,0.105095,6952,2,165,15,7811,7,0,578,8809,0
ITS tools runner thread asked to quit. Dying gracefully.
Finished probabilistic random walk after 17204 steps, run visited all 1 properties in 59 ms. (steps per millisecond=291 )
Probabilistic random walk after 17204 steps, saw 4602 distinct states, run finished after 59 ms. (steps per millisecond=291 ) properties seen :1
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 223 transition count 299
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 25 place count 199 transition count 275
Iterating global reduction 1 with 24 rules applied. Total rules applied 49 place count 199 transition count 275
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 58 place count 190 transition count 266
Iterating global reduction 1 with 9 rules applied. Total rules applied 67 place count 190 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 68 place count 190 transition count 265
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 189 transition count 264
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 189 transition count 264
Applied a total of 70 rules in 7 ms. Remains 189 /224 variables (removed 35) and now considering 264/299 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-782840667186213804.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11653244695936671586.kers'
[2026-05-26 22:04:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-782840667186213804.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11653244695936671586.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 264 rows 189 cols 736 entries
Finished phase 1 with 185 SingleSign rule and 0 generalized
[2026-05-26 22:04:51] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11653244695936671586.kers
Total runtime 2 ms.
[2026-05-26 22:04:51] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-26 22:04:51] [INFO ] Invariant cache hit.
[2026-05-26 22:04:52] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 504 ms to find 0 implicit places.
Running 263 sub problems to find dead transitions.
[2026-05-26 22:04:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 263 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 263 unsolved
Problem TDEAD244 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 264/452 variables, 188/197 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 6/203 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 0/203 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 1/453 variables, 1/204 constraints. Problems are: Problem set: 1 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 453/453 variables, and 204 constraints, problems are : Problem set: 1 solved, 262 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 189/189 constraints, PredecessorRefiner: 263/263 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/187 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/188 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/188 variables, 11/15 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/20 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 264/452 variables, 188/208 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 257/465 constraints. Problems are: Problem set: 1 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/452 variables, 2/467 constraints. Problems are: Problem set: 1 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 452/453 variables, and 468 constraints, problems are : Problem set: 1 solved, 262 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 188/189 constraints, PredecessorRefiner: 257/263 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60058ms problems are : Problem set: 1 solved, 262 unsolved
Search for dead transitions found 1 dead transitions in 60060ms
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 : 189/224 places, 263/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 189 /189 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60577 ms. Remains : 189/224 places, 263/299 transitions.
[2026-05-26 22:05:52] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:05:52] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:05:52] [INFO ] Input system was already deterministic with 263 transitions.
[2026-05-26 22:05:52] [INFO ] Flatten gal took : 9 ms
[2026-05-26 22:05:52] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:05:52] [INFO ] Time to serialize gal into /tmp/CTLCardinality548895011937778107.gal : 2 ms
[2026-05-26 22:05:52] [INFO ] Time to serialize properties into /tmp/CTLCardinality16981996285584239123.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/CTLCardinality548895011937778107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16981996285584239123.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AG((EF((A((((p36==0)||(p251==1))&&((p232==0)||(p161==1))) U ((p246==0)||(p165==1))) + (EF(((p165==0)||(p250==1))) * (p174==0)))) + (((p10...333
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * !(E(TRUE U (!((E(!(((p246==0)||(p165==1))) U (!((((p36==0)||(p251==1))&&((p232==0)||(p161...981
Reverse transition relation is NOT exact ! Due to transitions t20, t24, t28, t30, t36, t40, t41, t47, t56, t58, t59, t70, t73, t76, t89, t90, t99, t103, t1...343
(forward)formula 0,1,4.49204,105708,1,0,620,503007,570,330,6744,467624,743
FORMULA FireWire-PT-16-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 299/299 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 299
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 34 place count 190 transition count 267
Iterating global reduction 1 with 32 rules applied. Total rules applied 66 place count 190 transition count 267
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 79 place count 177 transition count 253
Iterating global reduction 1 with 13 rules applied. Total rules applied 92 place count 177 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 93 place count 177 transition count 252
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 95 place count 175 transition count 250
Iterating global reduction 2 with 2 rules applied. Total rules applied 97 place count 175 transition count 250
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 174 transition count 249
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 174 transition count 249
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 100 place count 173 transition count 248
Iterating global reduction 2 with 1 rules applied. Total rules applied 101 place count 173 transition count 248
Applied a total of 101 rules in 8 ms. Remains 173 /224 variables (removed 51) and now considering 248/299 (removed 51) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13401640620934570061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13297549630170096895.kers'
[2026-05-26 22:05:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13401640620934570061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13297549630170096895.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 248 rows 173 cols 702 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-26 22:05:57] [INFO ] Computed 4 invariants in 1 ms
Computed 4 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13297549630170096895.kers
Total runtime 1 ms.
[2026-05-26 22:05:57] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-26 22:05:57] [INFO ] Invariant cache hit.
[2026-05-26 22:05:57] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
Running 247 sub problems to find dead transitions.
[2026-05-26 22:05:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 247 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 247 unsolved
Problem TDEAD229 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 4/8 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (OVERLAPS) 248/421 variables, 173/183 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/421 variables, and 185 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 247/247 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 246 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 1 (OVERLAPS) 1/173 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/173 variables, 8/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/173 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 4 (OVERLAPS) 248/421 variables, 173/185 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 246/431 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/421 variables, 3/434 constraints. Problems are: Problem set: 1 solved, 246 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/421 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 246 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 421/421 variables, and 435 constraints, problems are : Problem set: 1 solved, 246 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 173/173 constraints, PredecessorRefiner: 246/247 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60043ms problems are : Problem set: 1 solved, 246 unsolved
Search for dead transitions found 1 dead transitions in 60043ms
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 : 173/224 places, 247/299 transitions.
Applied a total of 0 rules in 2 ms. Remains 173 /173 variables (removed 0) and now considering 247/247 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60405 ms. Remains : 173/224 places, 247/299 transitions.
[2026-05-26 22:06:57] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:06:57] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:06:57] [INFO ] Input system was already deterministic with 247 transitions.
[2026-05-26 22:06:57] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:06:57] [INFO ] Flatten gal took : 8 ms
[2026-05-26 22:06:57] [INFO ] Time to serialize gal into /tmp/CTLCardinality930453916055554564.gal : 2 ms
[2026-05-26 22:06:57] [INFO ] Time to serialize properties into /tmp/CTLCardinality11552199571801995406.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/CTLCardinality930453916055554564.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11552199571801995406.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EF(AG(EX(((p185==0)||(p231==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !(EX(((p185==0)||(p231==1)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t16, t20, t24, t26, t32, t37, t42, t50, t63, t66, t79, t88, t92, t94, t110, t118, t123, t124,...292
(forward)formula 0,1,5.11094,126288,1,0,417,728159,515,235,6124,532381,526
FORMULA FireWire-PT-16-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-26 22:07:02] [INFO ] Flatten gal took : 6 ms
[2026-05-26 22:07:02] [INFO ] Flatten gal took : 6 ms
Total runtime 1039473 ms.

BK_STOP 1779833222747

--------------------
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-16"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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