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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 712K
-rw-r--r-- 1 mcc users 7.0K Mar 5 08:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Mar 5 08:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Mar 5 08:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 5 08:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.8K Mar 15 07:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 08:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 08:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 36K Mar 5 08:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 198K Mar 5 08:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 07:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Mar 15 07:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779529934826

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202604301425
[2026-05-23 09:52:15] [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-23 09:52:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:52:16] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2026-05-23 09:52:16] [INFO ] Transformed 28 places.
[2026-05-23 09:52:16] [INFO ] Transformed 52 transitions.
[2026-05-23 09:52:16] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 132 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2026-05-23 09:52:16] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6763805695886825668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17554436205777181372.kers'
[2026-05-23 09:52:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6763805695886825668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17554436205777181372.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 34 rows 28 cols 150 entries
Finished phase 1 with 13 SingleSign rule and 8 generalized
[2026-05-23 09:52:16] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17554436205777181372.kers
Total runtime 1 ms.
[2026-05-23 09:52:16] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/9 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 5 (OVERLAPS) 34/62 variables, 28/37 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 6/43 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/43 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/43 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 43 constraints, problems are : Problem set: 10 solved, 39 unsolved in 844 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/9 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (OVERLAPS) 34/62 variables, 28/37 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 6/43 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 39/82 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/82 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 82 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 28/28 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2440ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 2456ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
[2026-05-23 09:52:18] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8568499774927256866.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13301217775751314173.kers'
[2026-05-23 09:52:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8568499774927256866.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13301217775751314173.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 28 cols 138 entries
Finished phase 1 with 9 SingleSign rule and 10 generalized
[2026-05-23 09:52:18] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13301217775751314173.kers
Total runtime 1 ms.
[2026-05-23 09:52:18] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-23 09:52:18] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:18] [INFO ] Invariant cache hit.
[2026-05-23 09:52:18] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:52:18] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 28/28 places, 42/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2613 ms. Remains : 28/28 places, 42/52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2026-05-23 09:52:18] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:18] [INFO ] Invariant cache hit.
[2026-05-23 09:52:18] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/58 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/58 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 44 constraints, problems are : Problem set: 0 solved, 39 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/28 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/58 variables, 28/40 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/58 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 39/83 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/58 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (OVERLAPS) 0/58 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 84 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1914ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1916ms
[2026-05-23 09:52:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:20] [INFO ] Invariant cache hit.
[2026-05-23 09:52:20] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 09:52:20] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:20] [INFO ] Invariant cache hit.
[2026-05-23 09:52:20] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-23 09:52:20] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 1985 ms. Remains : 28/28 places, 42/42 transitions.
Support contains 26 out of 28 places after structural reductions.
[2026-05-23 09:52:20] [INFO ] Flatten gal took : 21 ms
[2026-05-23 09:52:20] [INFO ] Flatten gal took : 8 ms
[2026-05-23 09:52:21] [INFO ] Input system was already deterministic with 42 transitions.
RANDOM walk for 40000 steps (915 resets) in 2297 ms. (17 steps per ms) remains 23/48 properties
BEST_FIRST walk for 4001 steps (44 resets) in 71 ms. (55 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (28 resets) in 42 ms. (93 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (40 resets) in 44 ms. (88 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (38 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (37 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (36 resets) in 45 ms. (87 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (37 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (40 resets) in 23 ms. (166 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (36 resets) in 21 ms. (181 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (27 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (40 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (36 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4000 steps (39 resets) in 38 ms. (102 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 14 ms. (266 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (38 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (28 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (40 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (40 resets) in 26 ms. (148 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (24 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (44 resets) in 25 ms. (153 steps per ms) remains 23/23 properties
[2026-05-23 09:52:22] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:22] [INFO ] Invariant cache hit.
[2026-05-23 09:52:22] [INFO ] State equation strengthened by 4 read => feed constraints.
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 19 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp47 is UNSAT
At refinement iteration 2 (OVERLAPS) 11/26 variables, 6/7 constraints. Problems are: Problem set: 16 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 16 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 16 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 5 (OVERLAPS) 2/28 variables, 2/10 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/10 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 30/58 variables, 28/38 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 4/42 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/42 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/42 constraints. Problems are: Problem set: 20 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 42 constraints, problems are : Problem set: 20 solved, 3 unsolved in 160 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 20 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 1/1 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 12/15 variables, 2/3 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 4/19 variables, 4/7 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/19 variables, 0/7 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 18/37 variables, 19/26 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/37 variables, 0/26 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 16/53 variables, 4/30 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/53 variables, 4/34 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/53 variables, 3/37 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/53 variables, 0/37 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/55 variables, 1/38 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/55 variables, 2/40 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/55 variables, 0/40 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 3/58 variables, 3/43 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/58 variables, 1/44 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/58 variables, 1/45 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/58 variables, 0/45 constraints. Problems are: Problem set: 20 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/58 variables, 0/45 constraints. Problems are: Problem set: 20 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 45 constraints, problems are : Problem set: 20 solved, 3 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 3/23 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 280ms problems are : Problem set: 20 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 61 ms.
Support contains 3 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 138 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 26 /28 variables (removed 2) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2026-05-23 09:52:22] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2662968367598228685.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-407070760373597605.kers'
[2026-05-23 09:52:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2662968367598228685.kers, --Pflows, --basisKERS=/tmp/petrispot-output-407070760373597605.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 26 cols 136 entries
Finished phase 1 with 18 SingleSign rule and 1 generalized
[2026-05-23 09:52:22] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-407070760373597605.kers
Total runtime 0 ms.
[2026-05-23 09:52:22] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 478 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 845 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1338ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1338ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1349 ms. Remains : 26/28 places, 42/42 transitions.
RANDOM walk for 40000 steps (918 resets) in 132 ms. (300 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (381 resets) in 85 ms. (465 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (391 resets) in 82 ms. (481 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (388 resets) in 101 ms. (392 steps per ms) remains 3/3 properties
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 57 ms. (steps per millisecond=176 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 57 ms. (steps per millisecond=176 ) properties seen :0
Successfully simplified 23 atomic propositions for a total of 15 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:52:23] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 09:52:23] [INFO ] Flatten gal took : 6 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:52:23] [INFO ] Flatten gal took : 5 ms
[2026-05-23 09:52:24] [INFO ] Input system was already deterministic with 42 transitions.
Support contains 21 out of 28 places (down from 26) after GAL structural reductions.
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 19 stabilizing places and 18 stable transitions
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 41
Applied a total of 4 rules in 9 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2026-05-23 09:52:24] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8441919032552273760.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5751461986285804253.kers'
[2026-05-23 09:52:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8441919032552273760.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5751461986285804253.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 125 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-23 09:52:24] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5751461986285804253.kers
Total runtime 2 ms.
[2026-05-23 09:52:24] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 38 constraints, problems are : Problem set: 0 solved, 38 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 38/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 925 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1509ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1509ms
[2026-05-23 09:52:25] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:52:25] [INFO ] Invariant cache hit.
[2026-05-23 09:52:25] [INFO ] Implicit Places using invariants in 47 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/28 places, 41/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1568 ms. Remains : 23/28 places, 41/42 transitions.
[2026-05-23 09:52:25] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2026-05-23 09:52:25] [INFO ] Flatten gal took : 4 ms
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-23 09:52:25] [INFO ] Flatten gal took : 4 ms
[2026-05-23 09:52:25] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 42
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2026-05-23 09:52:25] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6675558514831262549.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10264115286385779792.kers'
[2026-05-23 09:52:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6675558514831262549.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10264115286385779792.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 27 cols 137 entries
Finished phase 1 with 14 SingleSign rule and 5 generalized
[2026-05-23 09:52:25] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10264115286385779792.kers
Total runtime 0 ms.
[2026-05-23 09:52:25] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 41 constraints, problems are : Problem set: 0 solved, 39 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/57 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 81 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1661 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2329ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2330ms
[2026-05-23 09:52:27] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:27] [INFO ] Invariant cache hit.
[2026-05-23 09:52:27] [INFO ] Implicit Places using invariants in 39 ms returned [6, 17]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2371 ms. Remains : 25/28 places, 42/42 transitions.
[2026-05-23 09:52:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:27] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:27] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-23 09:52:28] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:28] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:28] [INFO ] Time to serialize gal into /tmp/CTLCardinality2086094128999003196.gal : 2 ms
[2026-05-23 09:52:28] [INFO ] Time to serialize properties into /tmp/CTLCardinality11500630196389806221.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/CTLCardinality2086094128999003196.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11500630196389806221.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,2874,0.081798,7052,2,1878,5,9992,6,0,141,11846,0


Converting to forward existential form...Done !
original formula: EF(EX((AG((SORTI_A>1)) * ((SUR_PONT_A<1)||((CHOIX_1+CHOIX_2)>29)))))
=> equivalent forward existential formula: [((EY(FwdU(Init,TRUE)) * ((SUR_PONT_A<1)||((CHOIX_1+CHOIX_2)>29))) * !(E(TRUE U !((SORTI_A>1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t9, t10, t11, t12, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t...267
(forward)formula 0,1,0.273389,14968,1,0,117,40650,105,46,1137,43135,93
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Applied a total of 2 rules in 1 ms. Remains 26 /28 variables (removed 2) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2026-05-23 09:52:28] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7182302373643104076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3619434826929354297.kers'
[2026-05-23 09:52:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7182302373643104076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3619434826929354297.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 26 cols 136 entries
Finished phase 1 with 18 SingleSign rule and 1 generalized
[2026-05-23 09:52:28] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3619434826929354297.kers
Total runtime 0 ms.
[2026-05-23 09:52:28] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/56 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 38 constraints, problems are : Problem set: 0 solved, 39 unsolved in 470 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/56 variables, 26/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 39/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/56 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 77 constraints, problems are : Problem set: 0 solved, 39 unsolved in 814 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 26/26 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 1297ms
[2026-05-23 09:52:29] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:29] [INFO ] Invariant cache hit.
[2026-05-23 09:52:29] [INFO ] Implicit Places using invariants in 42 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1344 ms. Remains : 25/28 places, 42/42 transitions.
[2026-05-23 09:52:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:29] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-23 09:52:29] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:29] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:29] [INFO ] Time to serialize gal into /tmp/CTLCardinality16321564682890471532.gal : 1 ms
[2026-05-23 09:52:29] [INFO ] Time to serialize properties into /tmp/CTLCardinality17481163789842703124.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/CTLCardinality16321564682890471532.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality17481163789842703124.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,2874,0.064103,6788,2,1947,5,8533,6,0,144,10333,0


Converting to forward existential form...Done !
original formula: AX((ATTENTE_A>SUR_PONT_A))
=> equivalent forward existential formula: [(EY(Init) * !((ATTENTE_A>SUR_PONT_A)))] = FALSE
(forward)formula 0,0,0.06523,7052,1,0,10,8533,9,2,240,10333,2
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 41
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 4 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2026-05-23 09:52:29] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2313517617918085543.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12315506954813256711.kers'
[2026-05-23 09:52:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2313517617918085543.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12315506954813256711.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 125 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-23 09:52:29] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12315506954813256711.kers
Total runtime 0 ms.
[2026-05-23 09:52:29] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 38 constraints, problems are : Problem set: 0 solved, 38 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 38/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1527ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1527ms
[2026-05-23 09:52:31] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:52:31] [INFO ] Invariant cache hit.
[2026-05-23 09:52:31] [INFO ] Implicit Places using invariants in 34 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/28 places, 41/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1569 ms. Remains : 24/28 places, 41/42 transitions.
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality7706870468874618684.gal : 1 ms
[2026-05-23 09:52:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality16178211367502524677.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/CTLCardinality7706870468874618684.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality16178211367502524677.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,2874,0.053981,6412,2,1530,5,7188,6,0,139,10071,0


Converting to forward existential form...Done !
original formula: AF(((ATTENTE_B>(CONTROLEUR_1+CONTROLEUR_2))||((CAPACITE>=84)&&((ROUTE_B>=1)||(CAPACITE>=75)))))
=> equivalent forward existential formula: [FwdG(Init,!(((ATTENTE_B>(CONTROLEUR_1+CONTROLEUR_2))||((CAPACITE>=84)&&((ROUTE_B>=1)||(CAPACITE>=75))))))] = FA...158
Hit Full ! (commute/partial/dont) 6/3/35
(forward)formula 0,0,0.40855,20480,1,0,67,67454,19,4,890,65689,64
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 41
Applied a total of 4 rules in 1 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 09:52:31] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:52:31] [INFO ] Invariant cache hit.
[2026-05-23 09:52:31] [INFO ] Implicit Places using invariants in 38 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/28 places, 41/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 23/28 places, 41/42 transitions.
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:31] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:52:31] [INFO ] Time to serialize gal into /tmp/CTLCardinality15702986286615569414.gal : 0 ms
[2026-05-23 09:52:31] [INFO ] Time to serialize properties into /tmp/CTLCardinality4460961295295484514.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/CTLCardinality15702986286615569414.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4460961295295484514.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,2874,0.078155,7096,2,1482,5,11201,6,0,135,12065,0


Converting to forward existential form...Done !
original formula: EX(((EG(EF((VIDANGE_1>NB_ATTENTE_B_4))) * (ROUTE_A<=CAPACITE)) * (NB_ATTENTE_A_3<2)))
=> equivalent forward existential formula: [FwdG(((EY(Init) * (NB_ATTENTE_A_3<2)) * (ROUTE_A<=CAPACITE)),E(TRUE U (VIDANGE_1>NB_ATTENTE_B_4)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t9, t10, t11, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t...262
dead was empty
(forward)formula 0,0,0.759406,31264,1,0,191,120832,105,58,1089,128045,180
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 41
Applied a total of 4 rules in 1 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 09:52:32] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:52:32] [INFO ] Invariant cache hit.
[2026-05-23 09:52:32] [INFO ] Implicit Places using invariants in 47 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 41/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 24/28 places, 41/42 transitions.
[2026-05-23 09:52:32] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:32] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:32] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-23 09:52:32] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:32] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:32] [INFO ] Time to serialize gal into /tmp/CTLCardinality14604109516872581176.gal : 1 ms
[2026-05-23 09:52:32] [INFO ] Time to serialize properties into /tmp/CTLCardinality4575245264960747897.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/CTLCardinality14604109516872581176.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4575245264960747897.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,2874,0.067576,6840,2,1962,5,8877,6,0,139,10904,0


Converting to forward existential form...Done !
original formula: EG(((ATTENTE_A<=NB_ATTENTE_A_2) * EG(AG(EX(TRUE)))))
=> equivalent forward existential formula: [FwdG(Init,((ATTENTE_A<=NB_ATTENTE_A_2) * EG(!(E(TRUE U !(EX(TRUE)))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t9, t10, t11, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t...262
dead was empty
(forward)formula 0,0,0.841222,33428,1,0,238,106667,106,81,1143,141560,238
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 42
Applied a total of 1 rules in 1 ms. Remains 27 /28 variables (removed 1) and now considering 42/42 (removed 0) transitions.
Running 39 sub problems to find dead transitions.
[2026-05-23 09:52:33] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2080533768886430642.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7751214101156604386.kers'
[2026-05-23 09:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2080533768886430642.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7751214101156604386.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 30 rows 27 cols 137 entries
Finished phase 1 with 14 SingleSign rule and 5 generalized
[2026-05-23 09:52:33] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7751214101156604386.kers
Total runtime 0 ms.
[2026-05-23 09:52:33] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 57/57 variables, and 41 constraints, problems are : Problem set: 0 solved, 39 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 30/57 variables, 27/37 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 4/41 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 39/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 10 (OVERLAPS) 0/57 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/57 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 57/57 variables, and 81 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1634 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 27/27 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2281ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2283ms
[2026-05-23 09:52:35] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2026-05-23 09:52:35] [INFO ] Invariant cache hit.
[2026-05-23 09:52:35] [INFO ] Implicit Places using invariants in 33 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/28 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2318 ms. Remains : 26/28 places, 42/42 transitions.
[2026-05-23 09:52:35] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:35] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:35] [INFO ] Input system was already deterministic with 42 transitions.
[2026-05-23 09:52:35] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:35] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:35] [INFO ] Time to serialize gal into /tmp/CTLCardinality10185947537320637699.gal : 1 ms
[2026-05-23 09:52:35] [INFO ] Time to serialize properties into /tmp/CTLCardinality14321779892701530709.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/CTLCardinality10185947537320637699.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality14321779892701530709.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,2874,0.072791,6900,2,1800,5,9364,6,0,145,11697,0


Converting to forward existential form...Done !
original formula: (AF(AG((NB_ATTENTE_B_1<=NB_ATTENTE_B_4))) * AF(AX((((EX(TRUE) * AF((NB_ATTENTE_B_1<=VIDANGE_1))) + AG((CONTROLEUR_2<=ATTENTE_A))) + (SORT...166
=> equivalent forward existential formula: ([FwdG(Init,!(!(E(TRUE U !((NB_ATTENTE_B_1<=NB_ATTENTE_B_4))))))] = FALSE * [FwdG(Init,!(!(EX(!((((EX(TRUE) * !(...267
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t9, t10, t11, t12, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t...267
dead was empty
dead was empty
(forward)formula 0,1,1.01757,41408,1,0,301,149633,114,116,1212,195576,310
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Graph (complete) has 195 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 41
Applied a total of 3 rules in 10 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Running 38 sub problems to find dead transitions.
[2026-05-23 09:52:36] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12201505303338323551.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6689385309388557728.kers'
[2026-05-23 09:52:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12201505303338323551.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6689385309388557728.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 121 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-23 09:52:36] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6689385309388557728.kers
Total runtime 0 ms.
[2026-05-23 09:52:36] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 37 constraints, problems are : Problem set: 0 solved, 38 unsolved in 489 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 29/54 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 38/75 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (OVERLAPS) 0/54 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 76 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 25/25 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1532ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 1533ms
[2026-05-23 09:52:38] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:52:38] [INFO ] Invariant cache hit.
[2026-05-23 09:52:38] [INFO ] Implicit Places using invariants in 43 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 23/28 places, 41/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 1591 ms. Remains : 23/28 places, 41/42 transitions.
[2026-05-23 09:52:38] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:38] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:38] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-23 09:52:38] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:38] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:38] [INFO ] Time to serialize gal into /tmp/CTLCardinality6865499270947207559.gal : 0 ms
[2026-05-23 09:52:38] [INFO ] Time to serialize properties into /tmp/CTLCardinality12231707196755712133.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/CTLCardinality6865499270947207559.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality12231707196755712133.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,2246,0.060114,6500,2,1062,5,8522,6,0,135,8670,0


Converting to forward existential form...Done !
original formula: AF(E((SUR_PONT_A<=NB_ATTENTE_B_2) U AG((COMPTEUR_0<=NB_ATTENTE_A_1))))
=> equivalent forward existential formula: [FwdG(Init,!(E((SUR_PONT_A<=NB_ATTENTE_B_2) U !(E(TRUE U !((COMPTEUR_0<=NB_ATTENTE_A_1)))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t5, t6, t7, t15, t16, t17, t18, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t30...280
dead was empty
(forward)formula 0,1,0.789974,34180,1,0,405,147409,108,165,1062,164836,394
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 41
Applied a total of 4 rules in 3 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 09:52:39] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1959175144017417290.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12374304397362822972.kers'
[2026-05-23 09:52:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1959175144017417290.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12374304397362822972.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 125 entries
Finished phase 1 with 17 SingleSign rule and 1 generalized
[2026-05-23 09:52:39] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12374304397362822972.kers
Total runtime 0 ms.
[2026-05-23 09:52:39] [INFO ] Implicit Places using invariants in 41 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 41/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 24 /24 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45 ms. Remains : 24/28 places, 41/42 transitions.
[2026-05-23 09:52:39] [INFO ] Flatten gal took : 3 ms
[2026-05-23 09:52:39] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:39] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-23 09:52:39] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:39] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:39] [INFO ] Time to serialize gal into /tmp/CTLCardinality1211682461542791954.gal : 1 ms
[2026-05-23 09:52:39] [INFO ] Time to serialize properties into /tmp/CTLCardinality11633072257010855725.ctl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLCardinality1211682461542791954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality11633072257010855725.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,2874,0.056334,6388,2,1530,5,7188,6,0,139,10071,0


Converting to forward existential form...Done !
original formula: EF(!(E(AX(((((NB_ATTENTE_A_0<=CONTROLEUR_2)&&(ATTENTE_B<=ROUTE_A))||(VIDANGE_1<=COMPTEUR_2))||(VIDANGE_1<=NB_ATTENTE_A_1))) U AF(!(((CHOI...195
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(!(EX(!(((((NB_ATTENTE_A_0<=CONTROLEUR_2)&&(ATTENTE_B<=ROUTE_A))||(VIDANGE_1<=COMPTEUR_2)...259
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t9, t10, t11, t19, t20, t21, t22, t23, t24, t25, t26, t27, t28, t29, t30, t31, t32, t...262
(forward)formula 0,1,0.934758,38472,1,0,469,157039,106,213,1166,198751,450
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 42/42 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 26 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 25 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 25 transition count 41
Applied a total of 4 rules in 3 ms. Remains 25 /28 variables (removed 3) and now considering 41/42 (removed 1) transitions.
Skipped dead transition search.
[2026-05-23 09:52:40] [INFO ] Flow matrix only has 29 transitions (discarded 12 similar events)
[2026-05-23 09:52:40] [INFO ] Invariant cache hit.
[2026-05-23 09:52:40] [INFO ] Implicit Places using invariants in 38 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/28 places, 41/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 41/41 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 43 ms. Remains : 23/28 places, 41/42 transitions.
[2026-05-23 09:52:40] [INFO ] Flatten gal took : 1 ms
[2026-05-23 09:52:40] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:40] [INFO ] Input system was already deterministic with 41 transitions.
[2026-05-23 09:52:40] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:40] [INFO ] Flatten gal took : 2 ms
[2026-05-23 09:52:40] [INFO ] Time to serialize gal into /tmp/CTLCardinality4917929563523335204.gal : 1 ms
[2026-05-23 09:52:40] [INFO ] Time to serialize properties into /tmp/CTLCardinality4329401543957747948.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/CTLCardinality4917929563523335204.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLCardinality4329401543957747948.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,2874,0.075812,7088,2,1482,5,11201,6,0,135,12065,0


Converting to forward existential form...Done !
original formula: EX(TRUE)
=> equivalent forward existential formula: [(EY(Init) * TRUE)] != FALSE
(forward)formula 0,1,0.076234,7088,1,0,6,11201,7,1,219,12065,1
FORMULA BridgeAndVehicles-PT-V04P05N02-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-23 09:52:40] [INFO ] Flatten gal took : 7 ms
[2026-05-23 09:52:40] [INFO ] Flatten gal took : 3 ms
Total runtime 24486 ms.

BK_STOP 1779529960524

--------------------
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="BridgeAndVehicles-PT-V04P05N02"
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 BridgeAndVehicles-PT-V04P05N02, 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-177946841800161"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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