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.r034-tall-177946842100697.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 CANInsertWithFailure-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842100697
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 9.0K Mar 6 10:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Mar 6 10:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 6 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 6 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 15 07:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:53 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 15 07:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Mar 6 10:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Mar 6 10:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Mar 6 10:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 15 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 202K 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 CANInsertWithFailure-PT-005-CTLCardinality-2024-00
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-01
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-02
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-03
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-04
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-05
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-06
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-07
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-08
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-09
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-10
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-11
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-12
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-13
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-14
FORMULA_NAME CANInsertWithFailure-PT-005-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779662111075

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-005
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-24 22:35:12] [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-24 22:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 22:35:12] [INFO ] Load time of PNML (sax parser for PT used): 75 ms
[2026-05-24 22:35:12] [INFO ] Transformed 114 places.
[2026-05-24 22:35:12] [INFO ] Transformed 180 transitions.
[2026-05-24 22:35:12] [INFO ] Parsed PT model containing 114 places and 180 transitions and 500 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Support contains 85 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 10 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (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-17147124049161324236.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4874765982944583035.kers'
[2026-05-24 22:35:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17147124049161324236.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4874765982944583035.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:35:12] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4874765982944583035.kers
Total runtime 1 ms.
[2026-05-24 22:35:12] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 22:35:12] [INFO ] Invariant cache hit.
[2026-05-24 22:35:12] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:35:12] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:35:13] [INFO ] Invariant cache hit.
[2026-05-24 22:35:13] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 180/293 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 45/189 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 15 (OVERLAPS) 1/294 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/294 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (OVERLAPS) 0/294 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 190 constraints, problems are : Problem set: 0 solved, 175 unsolved in 27004 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 1/113 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 180/293 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 175/367 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 1/294 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (OVERLAPS) 0/294 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 368 constraints, problems are : Problem set: 0 solved, 175 unsolved in 21957 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49030ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 49047ms
Finished structural reductions in LTL mode , in 1 iterations and 49499 ms. Remains : 114/114 places, 180/180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:36:02] [INFO ] Invariant cache hit.
[2026-05-24 22:36:02] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-24 22:36:02] [INFO ] Invariant cache hit.
[2026-05-24 22:36:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:36:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 114/114 places, 180/180 transitions.
Support contains 85 out of 114 places after structural reductions.
[2026-05-24 22:36:02] [INFO ] Flatten gal took : 32 ms
[2026-05-24 22:36:02] [INFO ] Flatten gal took : 13 ms
[2026-05-24 22:36:02] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 83 out of 114 places (down from 85) after GAL structural reductions.
RANDOM walk for 40000 steps (403 resets) in 1469 ms. (27 steps per ms) remains 15/86 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 21 ms. (181 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 10 ms. (363 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (11 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
[2026-05-24 22:36:03] [INFO ] Invariant cache hit.
[2026-05-24 22:36:03] [INFO ] State equation strengthened by 45 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp69 is UNSAT
At refinement iteration 2 (OVERLAPS) 84/112 variables, 5/6 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/6 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem AtomicPropp70 is UNSAT
At refinement iteration 4 (OVERLAPS) 2/114 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/114 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 180/294 variables, 114/122 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 45/167 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/167 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/294 variables, 0/167 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 167 constraints, problems are : Problem set: 6 solved, 9 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 90/109 variables, 4/5 constraints. Problems are: Problem set: 6 solved, 9 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 2/111 variables, 1/8 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 2/113 variables, 2/10 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 10/20 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 2/22 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 5/27 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 1/28 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/29 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/29 constraints. Problems are: Problem set: 8 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 180/293 variables, 113/142 constraints. Problems are: Problem set: 8 solved, 7 unsolved
Problem AtomicPropp81 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 45/187 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/293 variables, 6/193 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/293 variables, 0/193 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/294 variables, 1/194 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/294 variables, 0/194 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/294 variables, 0/194 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 194 constraints, problems are : Problem set: 9 solved, 6 unsolved in 2545 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 6/15 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2885ms problems are : Problem set: 9 solved, 6 unsolved
Parikh walk visited 0 properties in 697 ms.
Support contains 8 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 276 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 113 transition count 148
Reduce places removed 32 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 33 rules applied. Total rules applied 66 place count 81 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 80 transition count 146
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 69 place count 79 transition count 146
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 97 place count 65 transition count 132
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 104 place count 65 transition count 125
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 65 transition count 124
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 64 transition count 124
Partial Free-agglomeration rule applied 30 times.
Drop transitions (Partial Free agglomeration) removed 30 transitions
Iterating global reduction 4 with 30 rules applied. Total rules applied 136 place count 64 transition count 124
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 145 place count 64 transition count 124
Applied a total of 145 rules in 47 ms. Remains 64 /114 variables (removed 50) and now considering 124/180 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 64/114 places, 124/180 transitions.
RANDOM walk for 40000 steps (1165 resets) in 312 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (235 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (236 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (227 resets) in 126 ms. (314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (303 resets) in 81 ms. (487 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (241 resets) in 82 ms. (481 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (246 resets) in 117 ms. (339 steps per ms) remains 6/6 properties
Probably explored full state space saw : 18880 states, properties seen :0
Probabilistic random walk after 105185 steps, saw 18880 distinct states, run finished after 406 ms. (steps per millisecond=259 ) properties seen :0
Explored full state space saw : 18880 states, properties seen :0
Exhaustive walk after 105185 steps, saw 18880 distinct states, run finished after 487 ms. (steps per millisecond=215 ) properties seen :0
Successfully simplified 15 atomic propositions for a total of 16 simplifications.
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-24 22:36:07] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:36:07] [INFO ] Flatten gal took : 9 ms
[2026-05-24 22:36:07] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 68 out of 114 places (down from 69) after GAL structural reductions.
Computed a total of 23 stabilizing places and 35 stable transitions
Graph (complete) has 327 edges and 114 vertex of which 113 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 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 (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 113 transition count 154
Reduce places removed 26 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 33 rules applied. Total rules applied 60 place count 87 transition count 147
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 67 place count 80 transition count 147
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 67 place count 80 transition count 146
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 69 place count 79 transition count 146
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 75 place count 76 transition count 143
Applied a total of 75 rules in 14 ms. Remains 76 /114 variables (removed 38) and now considering 143/180 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4711665431699762415.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14273921964263921928.kers'
[2026-05-24 22:36:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4711665431699762415.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14273921964263921928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 76 cols 323 entries
Finished phase 1 with 64 SingleSign rule and 5 generalized
[2026-05-24 22:36:07] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14273921964263921928.kers
Total runtime 1 ms.
[2026-05-24 22:36:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-24 22:36:08] [INFO ] Invariant cache hit.
[2026-05-24 22:36:08] [INFO ] State equation strengthened by 48 read => feed constraints.
[2026-05-24 22:36:08] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2026-05-24 22:36:08] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-24 22:36:08] [INFO ] Invariant cache hit.
[2026-05-24 22:36:08] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 143/218 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 48/141 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (OVERLAPS) 1/219 variables, 1/142 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/219 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (OVERLAPS) 0/219 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 142 constraints, problems are : Problem set: 0 solved, 138 unsolved in 10272 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 143/218 variables, 75/93 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 48/141 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 138/279 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/219 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 280 constraints, problems are : Problem set: 0 solved, 138 unsolved in 11427 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21716ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 21716ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/114 places, 143/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21892 ms. Remains : 76/114 places, 143/180 transitions.
[2026-05-24 22:36:29] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:36:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:36:29] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-24 22:36:29] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:36:29] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:36:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality5650369386977187816.gal : 4 ms
[2026-05-24 22:36:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality2505892586683139571.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality5650369386977187816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality2505892586683139571.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,43991,0.242174,14444,2,4537,5,37579,6,0,431,37828,0


Converting to forward existential form...Done !
original formula: AF(AG(AF(((Node1ID2>Node0WaitAnswer)||(EmptyCAN>0)))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(!(EG(!(((Node1ID2>Node0WaitAnswer)||(EmptyCAN>0))))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t4, t6, t7, t8, t10, t12, t13, t14, t16, t18, t19, t20, t22, t24, t25, t26, t28, ...657
(forward)formula 0,0,7.6788,259484,1,0,517,1.57101e+06,316,234,2963,1.52037e+06,487
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Applied a total of 0 rules in 7 ms. Remains 114 /114 variables (removed 0) and now considering 180/180 (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-9646850203870501064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10304185282925262395.kers'
[2026-05-24 22:36:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9646850203870501064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10304185282925262395.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:36:37] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10304185282925262395.kers
Total runtime 2 ms.
[2026-05-24 22:36:37] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-24 22:36:37] [INFO ] Invariant cache hit.
[2026-05-24 22:36:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:36:37] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:36:37] [INFO ] Invariant cache hit.
[2026-05-24 22:36:37] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 10/19 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 180/293 variables, 113/144 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/293 variables, 45/189 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/293 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 15 (OVERLAPS) 1/294 variables, 1/190 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/294 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 17 (OVERLAPS) 0/294 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 294/294 variables, and 190 constraints, problems are : Problem set: 0 solved, 175 unsolved in 25362 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 19/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 1/113 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/113 variables, 4/31 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/113 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 180/293 variables, 113/147 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 45/192 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/293 variables, 175/367 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 1/294 variables, 1/368 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/294 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 14 (OVERLAPS) 0/294 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 294/294 variables, and 368 constraints, problems are : Problem set: 0 solved, 175 unsolved in 21637 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 114/114 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 26/26 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47014ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 47015ms
Finished structural reductions in LTL mode , in 1 iterations and 47245 ms. Remains : 114/114 places, 180/180 transitions.
[2026-05-24 22:37:24] [INFO ] Flatten gal took : 17 ms
[2026-05-24 22:37:24] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:37:24] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:37:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:37:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:37:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality8522125228529858245.gal : 3 ms
[2026-05-24 22:37:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality4631273889998261516.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/CTLCardinality8522125228529858245.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4631273889998261516.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,200157,0.386797,17824,2,5283,5,49933,6,0,617,49100,0


Converting to forward existential form...Done !
original formula: A(AX((EF((Node4Request<=0)) * (E(EG((Node1IsInserted<=Node4JoinMsg)) U EG((Node2requestsent0>=1))) + !(EX(TRUE))))) U (!(AF(!((((Node3Res...492
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!(!((((Node3ResZone>=1)&&(Node1requestsent3<=1))||(Node4Bootstrap>=1))))))) + ((EG((Nod...1345
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-24 22:37:55] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:37:55] [INFO ] Applying decomposition
[2026-05-24 22:37:55] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph423061418291130215.txt' '-o' '/tmp/graph423061418291130215.bin' '-w' '/tmp/graph423061418291130215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph423061418291130215.bin' '-l' '-1' '-v' '-w' '/tmp/graph423061418291130215.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:37:55] [INFO ] Decomposing Gal with order
[2026-05-24 22:37:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:37:55] [INFO ] Removed a total of 81 redundant transitions.
[2026-05-24 22:37:55] [INFO ] Flatten gal took : 62 ms
[2026-05-24 22:37:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 11 ms.
[2026-05-24 22:37:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality17058432218970816983.gal : 3 ms
[2026-05-24 22:37:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality16890543019606739451.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/CTLCardinality17058432218970816983.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16890543019606739451.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.57389,24016,2,7033,5,77215,6,0,639,70260,0


Converting to forward existential form...Done !
original formula: A(AX((EF((gi0.gi0.gi3.gu21.Node4Request<=0)) * (E(EG((gu20.Node1IsInserted<=gu20.Node4JoinMsg)) U EG((gi0.gi0.gi3.gu14.Node2requestsent0>...678
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!(!((((gi0.gi0.gi3.gu15.Node3ResZone>=1)&&(gi0.gi0.gi3.gu9.Node1requestsent3<=1))||(gi0...1815
Reverse transition relation is NOT exact ! Due to transitions gi0.gi0.gi3.gu5.t61, gi0.gi0.gi3.gu5.t67, gi0.gi0.gi3.gu5.t73, gi0.gi0.gi3.gu5.t88, gi0.gi0.g...1907
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 5 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (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-6259444678375587653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12795686112086063116.kers'
[2026-05-24 22:38:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6259444678375587653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12795686112086063116.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:38:25] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12795686112086063116.kers
Total runtime 2 ms.
[2026-05-24 22:38:25] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 22:38:25] [INFO ] Invariant cache hit.
[2026-05-24 22:38:25] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:38:25] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:38:25] [INFO ] Invariant cache hit.
[2026-05-24 22:38:25] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16970 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19386 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36374ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 36375ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36688 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:39:02] [INFO ] Flatten gal took : 10 ms
[2026-05-24 22:39:02] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:39:02] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:39:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:39:02] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:39:02] [INFO ] Time to serialize gal into /tmp/CTLCardinality312621096334182200.gal : 1 ms
[2026-05-24 22:39:02] [INFO ] Time to serialize properties into /tmp/CTLCardinality1286735818102394544.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/CTLCardinality312621096334182200.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1286735818102394544.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,200157,0.396257,18480,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: AX((AF((((AG((Node2requestsent1>Node2JoinMsg)) + (Node0OKshare>0)) * (Node2Request<1)) * ((Node0GiveAnswer1>0)&&(Node1GiveAnswer0<1)))) *...184
=> equivalent forward existential formula: ([FwdG(EY(Init),!((((!(E(TRUE U !((Node2requestsent1>Node2JoinMsg)))) + (Node0OKshare>0)) * (Node2Request<1)) * ...270
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,3.82194,111132,1,0,400,481156,391,190,3994,533665,387
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 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 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 113 transition count 146
Reduce places removed 34 places and 0 transitions.
Iterating post reduction 1 with 34 rules applied. Total rules applied 69 place count 79 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 79 place count 74 transition count 141
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 85 place count 74 transition count 141
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 72 transition count 139
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 72 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 92 place count 72 transition count 136
Applied a total of 92 rules in 31 ms. Remains 72 /114 variables (removed 42) and now considering 136/180 (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-6933559498777561734.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-848943934285550482.kers'
[2026-05-24 22:39:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6933559498777561734.kers, --Pflows, --basisKERS=/tmp/petrispot-output-848943934285550482.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 136 rows 72 cols 309 entries
Finished phase 1 with 60 SingleSign rule and 5 generalized
[2026-05-24 22:39:06] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-848943934285550482.kers
Total runtime 1 ms.
[2026-05-24 22:39:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-24 22:39:06] [INFO ] Invariant cache hit.
[2026-05-24 22:39:06] [INFO ] State equation strengthened by 52 read => feed constraints.
[2026-05-24 22:39:06] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2026-05-24 22:39:06] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-24 22:39:06] [INFO ] Invariant cache hit.
[2026-05-24 22:39:06] [INFO ] State equation strengthened by 52 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/71 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/71 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 136/207 variables, 71/96 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/207 variables, 52/148 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 1/208 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 0/208 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 208/208 variables, and 149 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11172 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/71 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/71 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/71 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 136/207 variables, 71/96 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 52/148 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 131/279 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/207 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 1/208 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 0/208 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 208/208 variables, and 280 constraints, problems are : Problem set: 0 solved, 131 unsolved in 11044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 72/72 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 22228ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 22229ms
Starting structural reductions in SI_CTL mode, iteration 1 : 72/114 places, 136/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22421 ms. Remains : 72/114 places, 136/180 transitions.
[2026-05-24 22:39:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:39:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:39:28] [INFO ] Input system was already deterministic with 136 transitions.
[2026-05-24 22:39:28] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:39:28] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:39:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality7830308602295141926.gal : 1 ms
[2026-05-24 22:39:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11244019144206443648.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/CTLCardinality7830308602295141926.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11244019144206443648.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,36960,0.255852,14888,2,4447,5,38610,6,0,408,39680,0


Converting to forward existential form...Done !
original formula: AF(AG(((Node3OKshare<=Node2IsNonInsertedNode)||(Node0requestsent4>=1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((Node3OKshare<=Node2IsNonInsertedNode)||(Node0requestsent4>=1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t5, t7, t8, t9, t10, t12, t14, t15, t16, t18, t20, t21, t22, t24, t26, t2...626
(forward)formula 0,0,2.89654,93572,1,0,419,432718,300,195,2678,466975,349
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 7 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (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-989364068620546654.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8795344352410546551.kers'
[2026-05-24 22:39:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-989364068620546654.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8795344352410546551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:39:31] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8795344352410546551.kers
Total runtime 4 ms.
[2026-05-24 22:39:31] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-24 22:39:31] [INFO ] Invariant cache hit.
[2026-05-24 22:39:31] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:39:31] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:39:31] [INFO ] Invariant cache hit.
[2026-05-24 22:39:31] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16721 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 19065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35800ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35801ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36035 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:40:07] [INFO ] Flatten gal took : 10 ms
[2026-05-24 22:40:07] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:07] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:40:07] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:07] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:07] [INFO ] Time to serialize gal into /tmp/CTLCardinality5655757692645215614.gal : 1 ms
[2026-05-24 22:40:07] [INFO ] Time to serialize properties into /tmp/CTLCardinality12291218037679244043.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/CTLCardinality5655757692645215614.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12291218037679244043.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,200157,0.377271,18468,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (EG(AX((Node2IsNonInsertedNode>=1))) + EF(AG((Node4Bootstrap>Node2JoinMsg))))
=> equivalent forward existential formula: ([FwdG(Init,!(EX(!((Node2IsNonInsertedNode>=1)))))] != FALSE + [(FwdU(Init,TRUE) * !(E(TRUE U !((Node4Bootstrap>...183
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,3.51836,109364,1,0,400,505539,390,184,3807,520505,382
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 7 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:40:11] [INFO ] Invariant cache hit.
[2026-05-24 22:40:11] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-24 22:40:11] [INFO ] Invariant cache hit.
[2026-05-24 22:40:11] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:40:11] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 212 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:40:11] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:40:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:11] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:40:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:11] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:11] [INFO ] Time to serialize gal into /tmp/CTLCardinality5867415209490182025.gal : 1 ms
[2026-05-24 22:40:11] [INFO ] Time to serialize properties into /tmp/CTLCardinality1033105204880006463.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/CTLCardinality5867415209490182025.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1033105204880006463.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,200157,0.379185,18396,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: AX(AG(EF((Node0ID2<=0))))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !(E(TRUE U (Node0ID2<=0))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,1,3.55828,96856,1,0,388,437267,381,179,3671,431617,370
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 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 (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 27 place count 113 transition count 154
Reduce places removed 26 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 56 place count 87 transition count 151
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 59 place count 84 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 59 place count 84 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 83 transition count 150
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 67 place count 80 transition count 147
Partial Post-agglomeration rule applied 12 times.
Drop transitions (Partial Post agglomeration) removed 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 79 place count 80 transition count 147
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 84 place count 75 transition count 142
Iterating global reduction 3 with 5 rules applied. Total rules applied 89 place count 75 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 91 place count 75 transition count 140
Applied a total of 91 rules in 25 ms. Remains 75 /114 variables (removed 39) and now considering 140/180 (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-16008148353166885922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7300094546395366719.kers'
[2026-05-24 22:40:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16008148353166885922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7300094546395366719.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 140 rows 75 cols 317 entries
Finished phase 1 with 63 SingleSign rule and 5 generalized
[2026-05-24 22:40:14] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7300094546395366719.kers
Total runtime 1 ms.
[2026-05-24 22:40:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 22:40:14] [INFO ] Invariant cache hit.
[2026-05-24 22:40:15] [INFO ] State equation strengthened by 58 read => feed constraints.
[2026-05-24 22:40:15] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2026-05-24 22:40:15] [INFO ] Redundant transitions in 3 ms returned []
Running 135 sub problems to find dead transitions.
[2026-05-24 22:40:15] [INFO ] Invariant cache hit.
[2026-05-24 22:40:15] [INFO ] State equation strengthened by 58 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 140/214 variables, 74/97 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 58/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 1/215 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/215 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (OVERLAPS) 0/215 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 215/215 variables, and 156 constraints, problems are : Problem set: 0 solved, 135 unsolved in 10375 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 16/23 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (OVERLAPS) 140/214 variables, 74/98 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/214 variables, 58/156 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/214 variables, 135/291 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/214 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 9 (OVERLAPS) 1/215 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/215 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 11 (OVERLAPS) 0/215 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Int declared 215/215 variables, and 292 constraints, problems are : Problem set: 0 solved, 135 unsolved in 13082 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 75/75 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23468ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 23468ms
Starting structural reductions in SI_CTL mode, iteration 1 : 75/114 places, 140/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23697 ms. Remains : 75/114 places, 140/180 transitions.
[2026-05-24 22:40:38] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:40:38] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:40:38] [INFO ] Input system was already deterministic with 140 transitions.
[2026-05-24 22:40:38] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:40:38] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:40:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality10226989022740407731.gal : 1 ms
[2026-05-24 22:40:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality13185809659803664308.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/CTLCardinality10226989022740407731.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality13185809659803664308.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,45198,0.299954,15892,2,4296,5,42722,6,0,424,43194,0


Converting to forward existential form...Done !
original formula: AG(E(EG(((AF((Node4Bootstrap<=Node0requestsent3)) + (Node2NOshare>=1)) + ((Node2GiveAnswer1<=Node1DHTinfo2)||(Node4IsInserted>0)))) U EG(...216
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(EG(((!(EG(!((Node4Bootstrap<=Node0requestsent3)))) + (Node2NOshare>=1)) + ((Node2GiveAns...282
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t7, t8, t9, t10, t12, t15, t16, t19, t21, t22, t23, t25, t26, t27, t29, t...614
Using saturation style SCC detection
(forward)formula 0,0,7.77263,252648,1,0,513,1.5218e+06,321,261,2908,1.36984e+06,470
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 3 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (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-8714979320861710982.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5745021476088942079.kers'
[2026-05-24 22:40:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8714979320861710982.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5745021476088942079.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:40:46] [INFO ] Computed 7 invariants in 2 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5745021476088942079.kers
Total runtime 3 ms.
[2026-05-24 22:40:46] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 22:40:46] [INFO ] Invariant cache hit.
[2026-05-24 22:40:46] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:40:46] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:40:46] [INFO ] Invariant cache hit.
[2026-05-24 22:40:46] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 16962 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18357 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35335ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 35336ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35532 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:41:21] [INFO ] Flatten gal took : 13 ms
[2026-05-24 22:41:21] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:41:21] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:41:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:21] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:21] [INFO ] Time to serialize gal into /tmp/CTLCardinality10307815877303683098.gal : 1 ms
[2026-05-24 22:41:21] [INFO ] Time to serialize properties into /tmp/CTLCardinality16084670318317779142.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/CTLCardinality10307815877303683098.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16084670318317779142.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.435658,18472,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: A(!(((AG((EX((Node1GiveAnswer0>=1)) + (((Node2GiveAnswer1<=0)||(Node2GiveAnswer4<=Node0GiveAnswer2))&&(Node3Request>0)))) * (Node2IsInser...500
=> equivalent forward existential formula: [((Init * !(EG(!(!(((!((EX((Node4DHTinfo<=0)) * EG((Node2requestsent0>=1)))) * (Node1requestsent0>Node2GiveAnswe...1200
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
(forward)formula 0,0,8.94527,245608,1,0,544,1.44415e+06,415,277,3939,1.11141e+06,580
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 6 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:41:31] [INFO ] Invariant cache hit.
[2026-05-24 22:41:31] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 22:41:31] [INFO ] Invariant cache hit.
[2026-05-24 22:41:31] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:41:31] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:41:31] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:41:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:41:31] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:41:31] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:41:31] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality11096324502275215366.gal : 1 ms
[2026-05-24 22:41:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16000278296368695496.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/CTLCardinality11096324502275215366.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16000278296368695496.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.349509,18476,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: A(AX(((Node3requestsent4<=0) + EX((Node0JoinMsg>=1)))) U !(EG(((!(AF((Node4WaitAnswer>=1))) + (Node3ResZone>=1)) + (Node1GiveAnswer0<=0))...158
=> equivalent forward existential formula: [((Init * !(EG(!(!(EG(((!(!(EG(!((Node4WaitAnswer>=1))))) + (Node3ResZone>=1)) + (Node1GiveAnswer0<=0)))))))) * ...423
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
(forward)formula 0,0,23.7172,643364,1,0,1021,4.08995e+06,393,569,3812,3.61767e+06,988
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:41:55] [INFO ] Invariant cache hit.
[2026-05-24 22:41:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-24 22:41:55] [INFO ] Invariant cache hit.
[2026-05-24 22:41:55] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:41:55] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 209 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:41:55] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:55] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:41:55] [INFO ] Time to serialize gal into /tmp/CTLCardinality502195253113005559.gal : 1 ms
[2026-05-24 22:41:55] [INFO ] Time to serialize properties into /tmp/CTLCardinality18446291731780077526.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/CTLCardinality502195253113005559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality18446291731780077526.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,200157,0.382038,18532,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (EG(EX((Node4GiveAnswer2<=0))) * AG(EX(!(A((Node4WaitAnswer>=1) U (Node4DHTinfo2>=1))))))
=> equivalent forward existential formula: ([(Init * !(EG(EX((Node4GiveAnswer2<=0)))))] = FALSE * [(FwdU(Init,TRUE) * !(EX(!(!((E(!((Node4DHTinfo2>=1)) U (...248
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,14.7485,423828,1,0,696,2.69526e+06,387,335,3702,2.42144e+06,703
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 4 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:42:10] [INFO ] Invariant cache hit.
[2026-05-24 22:42:10] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-24 22:42:10] [INFO ] Invariant cache hit.
[2026-05-24 22:42:10] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:10] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:42:10] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:42:10] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:10] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:42:10] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:10] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:10] [INFO ] Time to serialize gal into /tmp/CTLCardinality824361045063119542.gal : 1 ms
[2026-05-24 22:42:10] [INFO ] Time to serialize properties into /tmp/CTLCardinality16490672012863465060.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/CTLCardinality824361045063119542.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16490672012863465060.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,200157,0.383092,18444,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: !(A((((EG((InsertedCounter<1)) * (Node0ID2>Node1GiveAnswer0)) * (Node4IsInserted>=1)) + AF(AX(E((Node4GiveAnswer1<=Node4Request) U (Node0...323
=> equivalent forward existential formula: ([FwdG((FwdU(Init,!(!(EG(!((!(!((E(!((Node4Bootstrap<=Node0GiveAnswer4)) U (!((Node0ResZone<=Node2ID)) * !((Node...1224
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,26.4026,712800,1,0,1220,4.3059e+06,421,751,3831,4.06017e+06,1145
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 2 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:42:37] [INFO ] Invariant cache hit.
[2026-05-24 22:42:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-24 22:42:37] [INFO ] Invariant cache hit.
[2026-05-24 22:42:37] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:37] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:42:37] [INFO ] Flatten gal took : 7 ms
[2026-05-24 22:42:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:37] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:42:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:37] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:37] [INFO ] Time to serialize gal into /tmp/CTLCardinality1041057039394748162.gal : 0 ms
[2026-05-24 22:42:37] [INFO ] Time to serialize properties into /tmp/CTLCardinality6774796786057421187.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/CTLCardinality1041057039394748162.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality6774796786057421187.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,200157,0.384234,18496,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: (A(EF(((Node3ID<=1)&&(Node1IsNonInsertedNode>0))) U ((EF((Node3ID>=1)) + AG(!(AF((Node1JoinMsg<=0))))) * !((A((Node4ID>=1) U (Node4reques...478
=> equivalent forward existential formula: ((([(FwdU(((FwdU(Init,!(((E(TRUE U (Node3ID>=1)) + !(E(TRUE U !(!(!(EG(!((Node1JoinMsg<=0))))))))) * !((!((E(!((...1559
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,18.3992,488896,1,0,695,3.04577e+06,425,363,4018,2.78901e+06,768
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 1 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
[2026-05-24 22:42:55] [INFO ] Invariant cache hit.
[2026-05-24 22:42:56] [INFO ] Implicit Places using invariants in 154 ms returned []
[2026-05-24 22:42:56] [INFO ] Invariant cache hit.
[2026-05-24 22:42:56] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:42:56] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 305 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:42:56] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:42:56] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:42:56] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:42:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:56] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:42:56] [INFO ] Time to serialize gal into /tmp/CTLCardinality15623073534526478661.gal : 2 ms
[2026-05-24 22:42:56] [INFO ] Time to serialize properties into /tmp/CTLCardinality12287422575303391830.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/CTLCardinality15623073534526478661.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12287422575303391830.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.3654,18468,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: A(AF(AX(((Node3requestsent1<=Node3GiveAnswer0)&&(Node0DHTinfo<=Node2NOshare)))) U EX(EX(!(AF((Node0requestsent2<=Node4ID))))))
=> equivalent forward existential formula: [((Init * !(EG(!(EX(EX(!(!(EG(!((Node0requestsent2<=Node4ID))))))))))) * !(E(!(EX(EX(!(!(EG(!((Node0requestsent2...337
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,0,24.1496,682884,1,0,784,4.37969e+06,394,455,3829,3.78181e+06,750
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Graph (complete) has 327 edges and 114 vertex of which 113 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 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 113 transition count 149
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 82 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 81 transition count 148
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 65 place count 81 transition count 147
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 67 place count 80 transition count 147
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 75 place count 76 transition count 143
Applied a total of 75 rules in 18 ms. Remains 76 /114 variables (removed 38) and now considering 143/180 (removed 37) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12084837831624877625.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14974216072786513401.kers'
[2026-05-24 22:43:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12084837831624877625.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14974216072786513401.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 143 rows 76 cols 322 entries
Finished phase 1 with 64 SingleSign rule and 5 generalized
[2026-05-24 22:43:20] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14974216072786513401.kers
Total runtime 2 ms.
[2026-05-24 22:43:20] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 22:43:20] [INFO ] Invariant cache hit.
[2026-05-24 22:43:20] [INFO ] State equation strengthened by 49 read => feed constraints.
[2026-05-24 22:43:20] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-24 22:43:20] [INFO ] Redundant transitions in 3 ms returned []
Running 138 sub problems to find dead transitions.
[2026-05-24 22:43:20] [INFO ] Invariant cache hit.
[2026-05-24 22:43:20] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/75 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/75 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (OVERLAPS) 143/218 variables, 75/100 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 1/219 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 12 (OVERLAPS) 0/219 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 150 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12077 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 18/25 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/75 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 143/218 variables, 75/100 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 49/149 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 138/287 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (OVERLAPS) 1/219 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/219 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/219 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 288 constraints, problems are : Problem set: 0 solved, 138 unsolved in 12854 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 76/76 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24948ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 24949ms
Starting structural reductions in SI_CTL mode, iteration 1 : 76/114 places, 143/180 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25166 ms. Remains : 76/114 places, 143/180 transitions.
[2026-05-24 22:43:45] [INFO ] Flatten gal took : 5 ms
[2026-05-24 22:43:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:43:45] [INFO ] Input system was already deterministic with 143 transitions.
[2026-05-24 22:43:45] [INFO ] Flatten gal took : 1 ms
[2026-05-24 22:43:45] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:43:45] [INFO ] Time to serialize gal into /tmp/CTLCardinality10300581250212882258.gal : 1 ms
[2026-05-24 22:43:45] [INFO ] Time to serialize properties into /tmp/CTLCardinality8607367583366684991.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/CTLCardinality10300581250212882258.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality8607367583366684991.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,40403,0.268257,14260,2,4337,5,36573,6,0,431,37142,0


Converting to forward existential form...Done !
original formula: AF(AG((Node3DHTinfo<=Node0JoinMsg)))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !((Node3DHTinfo<=Node0JoinMsg))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t3, t5, t6, t7, t8, t10, t11, t12, t14, t16, t17, t18, t20, t22, t23, t24, t26, t28, ...657
(forward)formula 0,1,1.98402,61372,1,0,354,277016,314,151,2807,299049,306
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 13 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (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-7963898214451750800.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2940960411094488338.kers'
[2026-05-24 22:43:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7963898214451750800.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2940960411094488338.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 113 cols 400 entries
Finished phase 1 with 101 SingleSign rule and 5 generalized
[2026-05-24 22:43:47] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2940960411094488338.kers
Total runtime 2 ms.
[2026-05-24 22:43:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-24 22:43:47] [INFO ] Invariant cache hit.
[2026-05-24 22:43:48] [INFO ] State equation strengthened by 45 read => feed constraints.
[2026-05-24 22:43:48] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Running 175 sub problems to find dead transitions.
[2026-05-24 22:43:48] [INFO ] Invariant cache hit.
[2026-05-24 22:43:48] [INFO ] State equation strengthened by 45 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (OVERLAPS) 180/292 variables, 112/120 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/292 variables, 45/165 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/292 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (OVERLAPS) 1/293 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 0/293 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 167 constraints, problems are : Problem set: 0 solved, 175 unsolved in 17113 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 4/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 6 (OVERLAPS) 180/292 variables, 112/132 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/292 variables, 45/177 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/292 variables, 175/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 10 (OVERLAPS) 1/293 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 175 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 353 constraints, problems are : Problem set: 0 solved, 175 unsolved in 18997 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 113/113 constraints, ReadFeed: 45/45 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 36123ms problems are : Problem set: 0 solved, 175 unsolved
Search for dead transitions found 0 dead transitions in 36123ms
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36342 ms. Remains : 113/114 places, 180/180 transitions.
[2026-05-24 22:44:24] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:44:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:44:24] [INFO ] Input system was already deterministic with 180 transitions.
[2026-05-24 22:44:24] [INFO ] Flatten gal took : 2 ms
[2026-05-24 22:44:24] [INFO ] Flatten gal took : 3 ms
[2026-05-24 22:44:24] [INFO ] Time to serialize gal into /tmp/CTLCardinality17860893276207145397.gal : 1 ms
[2026-05-24 22:44:24] [INFO ] Time to serialize properties into /tmp/CTLCardinality1769604581048234987.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/CTLCardinality17860893276207145397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality1769604581048234987.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,200157,0.410543,18480,2,5621,5,52743,6,0,616,51547,0


Converting to forward existential form...Done !
original formula: EF((!(E(EG((Node1ID>=1)) U (Node4ID<=Node1requestsent4))) * AX((EG(AF((Node1ID<=0))) * EX(AG((Node3GiveAnswer1<=0)))))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(E(EG((Node1ID>=1)) U (Node4ID<=Node1requestsent4)))) * !(EX(!((EG(!(EG(!((Node1ID<=0)))))...214
Reverse transition relation is NOT exact ! Due to transitions t1, t4, t9, t13, t16, t21, t25, t28, t33, t37, t40, t45, t49, t52, t57, t61, t63, t64, t65, t...687
(forward)formula 0,0,8.05425,224412,1,0,468,1.28923e+06,400,232,3810,1.08389e+06,500
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

[2026-05-24 22:44:32] [INFO ] Flatten gal took : 6 ms
[2026-05-24 22:44:32] [INFO ] Flatten gal took : 4 ms
[2026-05-24 22:44:32] [INFO ] Applying decomposition
[2026-05-24 22:44:32] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph500800064267742676.txt' '-o' '/tmp/graph500800064267742676.bin' '-w' '/tmp/graph500800064267742676.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph500800064267742676.bin' '-l' '-1' '-v' '-w' '/tmp/graph500800064267742676.weights' '-q' '0' '-e' '0.001'
[2026-05-24 22:44:32] [INFO ] Decomposing Gal with order
[2026-05-24 22:44:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 22:44:32] [INFO ] Removed a total of 80 redundant transitions.
[2026-05-24 22:44:32] [INFO ] Flatten gal took : 11 ms
[2026-05-24 22:44:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 5 ms.
[2026-05-24 22:44:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality15529106225547754365.gal : 2 ms
[2026-05-24 22:44:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality11279122371282803203.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/CTLCardinality15529106225547754365.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11279122371282803203.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,200157,0.493506,21720,2,6179,5,67527,6,0,637,65343,0


Converting to forward existential form...Done !
original formula: A(AX((EF((gi2.gi1.gi2.gu20.Node4Request<=0)) * (E(EG((gu6.Node1IsInserted<=gu6.Node4JoinMsg)) U EG((gi2.gi1.gi2.gu22.Node2requestsent0>=1...676
=> equivalent forward existential formula: [((Init * !(EG(!((!(!(EG(!(!((((gi2.gi1.gi4.gu14.Node3ResZone>=1)&&(gi2.gi1.gi2.gu10.Node1requestsent3<=1))||(gi...1813
Reverse transition relation is NOT exact ! Due to transitions gi2.gi1.gi0.t1, gi2.gi1.gi2.gu4.t61, gi2.gi1.gi2.gu4.t67, gi2.gi1.gi2.gu4.t73, gi2.gi1.gi2.gu...1890
Using saturation style SCC detection
(forward)formula 0,1,41.2938,1041184,1,0,1258,7.05621e+06,388,730,3790,5.6201e+06,1245
FORMULA CANInsertWithFailure-PT-005-CTLCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Total runtime 601743 ms.

BK_STOP 1779662714106

--------------------
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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r034-tall-177946842100697"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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