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.r018-smll-177946788000090.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 AutonomousCar-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.3K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 228K 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 AutonomousCar-PT-06b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-06b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779482852188

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 20:47:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 20:47:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 20:47:35] [INFO ] Load time of PNML (sax parser for PT used): 282 ms
[2026-05-22 20:47:35] [INFO ] Transformed 289 places.
[2026-05-22 20:47:35] [INFO ] Transformed 644 transitions.
[2026-05-22 20:47:35] [INFO ] Found NUPN structural information;
[2026-05-22 20:47:35] [INFO ] Parsed PT model containing 289 places and 644 transitions and 3812 arcs in 555 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Support contains 105 out of 289 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 289/289 places, 644/644 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 259 transition count 614
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 259 transition count 614
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 63 place count 256 transition count 611
Iterating global reduction 0 with 3 rules applied. Total rules applied 66 place count 256 transition count 611
Applied a total of 66 rules in 162 ms. Remains 256 /289 variables (removed 33) and now considering 611/644 (removed 33) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18385294291917315161.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17874376015295990093.kers'
[2026-05-22 20:47:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18385294291917315161.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17874376015295990093.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 611 rows 256 cols 3746 entries
Finished phase 1 with 245 SingleSign rule and 0 generalized
[2026-05-22 20:47:35] [INFO ] Computed 11 invariants in 5 ms
Computed 11 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-17874376015295990093.kers
Total runtime 8 ms.
[2026-05-22 20:47:36] [INFO ] Implicit Places using invariants in 572 ms returned []
[2026-05-22 20:47:36] [INFO ] Invariant cache hit.
[2026-05-22 20:47:36] [INFO ] Implicit Places using invariants and state equation in 605 ms returned []
Implicit Place search using SMT with State Equation took 1252 ms to find 0 implicit places.
Running 610 sub problems to find dead transitions.
[2026-05-22 20:47:37] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 1 (OVERLAPS) 1/256 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 610 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 610 unsolved
SMT process timed out in 31644ms, After SMT, problems are : Problem set: 0 solved, 610 unsolved
Search for dead transitions found 0 dead transitions in 31693ms
Starting structural reductions in LTL mode, iteration 1 : 256/289 places, 611/644 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33197 ms. Remains : 256/289 places, 611/644 transitions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 611/611 (removed 0) transitions.
[2026-05-22 20:48:08] [INFO ] Invariant cache hit.
[2026-05-22 20:48:08] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 20:48:08] [INFO ] Invariant cache hit.
[2026-05-22 20:48:09] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 431 ms. Remains : 256/256 places, 611/611 transitions.
Support contains 105 out of 256 places after structural reductions.
[2026-05-22 20:48:09] [INFO ] Flatten gal took : 192 ms
[2026-05-22 20:48:09] [INFO ] Flatten gal took : 87 ms
[2026-05-22 20:48:10] [INFO ] Input system was already deterministic with 611 transitions.
RANDOM walk for 40000 steps (162 resets) in 3277 ms. (12 steps per ms) remains 43/108 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (9 resets) in 23 ms. (166 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 43/43 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 42/43 properties
[2026-05-22 20:48:11] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp68 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp99 is UNSAT
At refinement iteration 1 (OVERLAPS) 202/256 variables, 11/11 constraints. Problems are: Problem set: 5 solved, 37 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 3/14 constraints. Problems are: Problem set: 6 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/14 constraints. Problems are: Problem set: 6 solved, 36 unsolved
Problem AtomicPropp75 is UNSAT
At refinement iteration 4 (OVERLAPS) 611/867 variables, 256/270 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/867 variables, 1/271 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/867 variables, 0/271 constraints. Problems are: Problem set: 7 solved, 35 unsolved
At refinement iteration 7 (OVERLAPS) 0/867 variables, 0/271 constraints. Problems are: Problem set: 7 solved, 35 unsolved
No progress, stopping.
After SMT solving in domain Real declared 867/867 variables, and 271 constraints, problems are : Problem set: 7 solved, 35 unsolved in 3545 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 256/256 constraints, PredecessorRefiner: 42/8 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 35 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 35 unsolved
Problem AtomicPropp0 is UNSAT
At refinement iteration 1 (OVERLAPS) 210/256 variables, 11/11 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 4/15 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 1/16 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 1/17 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/17 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 611/867 variables, 256/273 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 5/278 constraints. Problems are: Problem set: 8 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/867 variables, 2/280 constraints. Problems are: Problem set: 8 solved, 34 unsolved
SMT process timed out in 8788ms, After SMT, problems are : Problem set: 8 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 611/611 transitions.
Graph (trivial) has 172 edges and 256 vertex of which 2 / 256 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 925 edges and 255 vertex of which 254 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.7 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 77 transitions
Trivial Post-agglo rules discarded 77 transitions
Performed 77 trivial Post agglomeration. Transition count delta: 77
Iterating post reduction 0 with 78 rules applied. Total rules applied 80 place count 254 transition count 531
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 102 rules applied. Total rules applied 182 place count 177 transition count 506
Reduce places removed 14 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 19 rules applied. Total rules applied 201 place count 163 transition count 501
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 3 with 11 rules applied. Total rules applied 212 place count 158 transition count 495
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 215 place count 155 transition count 495
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 12 Pre rules applied. Total rules applied 215 place count 155 transition count 483
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 5 with 24 rules applied. Total rules applied 239 place count 143 transition count 483
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 248 place count 134 transition count 474
Iterating global reduction 5 with 9 rules applied. Total rules applied 257 place count 134 transition count 474
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 5 with 144 rules applied. Total rules applied 401 place count 134 transition count 330
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 6 with 60 rules applied. Total rules applied 461 place count 104 transition count 300
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 463 place count 102 transition count 292
Iterating global reduction 6 with 2 rules applied. Total rules applied 465 place count 102 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 468 place count 102 transition count 289
Free-agglomeration rule applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 481 place count 102 transition count 276
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 494 place count 89 transition count 276
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 7 with 2 rules applied. Total rules applied 496 place count 89 transition count 276
Applied a total of 496 rules in 187 ms. Remains 89 /256 variables (removed 167) and now considering 276/611 (removed 335) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 89/256 places, 276/611 transitions.
RANDOM walk for 40000 steps (609 resets) in 617 ms. (64 steps per ms) remains 22/34 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (21 resets) in 13 ms. (286 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4003 steps (19 resets) in 19 ms. (200 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4004 steps (16 resets) in 14 ms. (266 steps per ms) remains 18/20 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (19 resets) in 19 ms. (200 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (19 resets) in 14 ms. (266 steps per ms) remains 16/18 properties
BEST_FIRST walk for 4003 steps (18 resets) in 13 ms. (285 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (21 resets) in 17 ms. (222 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (18 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (21 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (16 resets) in 12 ms. (308 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4002 steps (17 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 15/15 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11637772239504626185.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10832862052211181887.kers'
[2026-05-22 20:48:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11637772239504626185.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10832862052211181887.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 276 rows 89 cols 2176 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-22 20:48:20] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10832862052211181887.kers
Total runtime 4 ms.
[2026-05-22 20:48:20] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 67/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 276/365 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/365 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 365/365 variables, and 101 constraints, problems are : Problem set: 0 solved, 15 unsolved in 598 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 67/89 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 276/365 variables, 89/100 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/365 variables, 14/115 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/365 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/365 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/365 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 365/365 variables, and 118 constraints, problems are : Problem set: 0 solved, 15 unsolved in 3975 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 15/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 4614ms problems are : Problem set: 0 solved, 15 unsolved
Parikh walk visited 1 properties in 6002 ms.
Support contains 21 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 276/276 transitions.
Graph (trivial) has 42 edges and 89 vertex of which 2 / 89 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 602 edges and 88 vertex of which 85 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 9 place count 85 transition count 265
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 79 transition count 265
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 15 place count 79 transition count 263
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 19 place count 77 transition count 263
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 20 place count 76 transition count 257
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 76 transition count 257
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 76 transition count 256
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 40 place count 67 transition count 247
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 41 place count 66 transition count 240
Iterating global reduction 3 with 1 rules applied. Total rules applied 42 place count 66 transition count 240
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 45 place count 66 transition count 237
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 48 place count 63 transition count 237
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 49 place count 63 transition count 237
Applied a total of 49 rules in 56 ms. Remains 63 /89 variables (removed 26) and now considering 237/276 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 63/89 places, 237/276 transitions.
RANDOM walk for 40000 steps (1521 resets) in 521 ms. (76 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (232 resets) in 75 ms. (526 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40003 steps (207 resets) in 61 ms. (645 steps per ms) remains 6/9 properties
BEST_FIRST walk for 40003 steps (322 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (205 resets) in 71 ms. (555 steps per ms) remains 3/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6174968958194510578.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14642812016248601511.kers'
[2026-05-22 20:48:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6174968958194510578.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14642812016248601511.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 237 rows 63 cols 2032 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 20:48:31] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14642812016248601511.kers
Total runtime 3 ms.
[2026-05-22 20:48:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 237/300 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/300 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 300/300 variables, and 77 constraints, problems are : Problem set: 0 solved, 3 unsolved in 566 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 53/63 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 237/300 variables, 63/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/300 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/300 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 5/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/300 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/300 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 300/300 variables, and 86 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2486 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 3071ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 206 ms.
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 237/237 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 235
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 61 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 60 transition count 234
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 9 place count 57 transition count 214
Iterating global reduction 3 with 3 rules applied. Total rules applied 12 place count 57 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 14 place count 57 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 15 place count 56 transition count 212
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 19 place count 54 transition count 210
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 24 place count 54 transition count 205
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 17 rules applied. Total rules applied 41 place count 49 transition count 193
Applied a total of 41 rules in 33 ms. Remains 49 /63 variables (removed 14) and now considering 193/237 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 49/63 places, 193/237 transitions.
RANDOM walk for 40000 steps (527 resets) in 286 ms. (139 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (235 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (378 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16679163811661026160.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4864849700045318996.kers'
[2026-05-22 20:48:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16679163811661026160.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4864849700045318996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 193 rows 49 cols 1764 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 20:48:35] [INFO ] Computed 11 invariants in 1 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4864849700045318996.kers
Total runtime 3 ms.
[2026-05-22 20:48:35] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/49 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 193/242 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/242 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 242/242 variables, and 63 constraints, problems are : Problem set: 0 solved, 2 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/49 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 193/242 variables, 49/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/242 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/242 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/242 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/242 variables, 6/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/242 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 242/242 variables, and 71 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1003 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 49/49 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 1344ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 202 ms.
Support contains 6 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 193/193 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 186
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 48 transition count 185
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 10 place count 47 transition count 179
Applied a total of 10 rules in 23 ms. Remains 47 /49 variables (removed 2) and now considering 179/193 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 47/49 places, 179/193 transitions.
RANDOM walk for 40000 steps (322 resets) in 308 ms. (129 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (387 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 564202 steps, run visited all 1 properties in 1188 ms. (steps per millisecond=474 )
Probabilistic random walk after 564202 steps, saw 90928 distinct states, run finished after 1196 ms. (steps per millisecond=471 ) properties seen :1
Successfully simplified 8 atomic propositions for a total of 16 simplifications.
[2026-05-22 20:48:38] [INFO ] Flatten gal took : 100 ms
[2026-05-22 20:48:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 20:48:38] [INFO ] Flatten gal took : 46 ms
[2026-05-22 20:48:38] [INFO ] Input system was already deterministic with 611 transitions.
Support contains 92 out of 256 places (down from 98) after GAL structural reductions.
Computed a total of 49 stabilizing places and 50 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 242 transition count 597
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 242 transition count 597
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 242 transition count 453
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 178 place count 236 transition count 447
Iterating global reduction 1 with 6 rules applied. Total rules applied 184 place count 236 transition count 447
Applied a total of 184 rules in 22 ms. Remains 236 /256 variables (removed 20) and now considering 447/611 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4489349425314259274.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2090183194971343923.kers'
[2026-05-22 20:48:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4489349425314259274.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2090183194971343923.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 447 rows 236 cols 2554 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-22 20:48:38] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2090183194971343923.kers
Total runtime 4 ms.
[2026-05-22 20:48:38] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-22 20:48:38] [INFO ] Invariant cache hit.
[2026-05-22 20:48:38] [INFO ] Implicit Places using invariants and state equation in 302 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2026-05-22 20:48:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 54 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 43/54 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 11/65 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 446 unsolved
SMT process timed out in 60558ms, After SMT, problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60559ms
Starting structural reductions in LTL mode, iteration 1 : 236/256 places, 447/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61015 ms. Remains : 236/256 places, 447/611 transitions.
[2026-05-22 20:49:39] [INFO ] Flatten gal took : 40 ms
[2026-05-22 20:49:39] [INFO ] Flatten gal took : 40 ms
[2026-05-22 20:49:39] [INFO ] Input system was already deterministic with 447 transitions.
[2026-05-22 20:49:39] [INFO ] Flatten gal took : 33 ms
[2026-05-22 20:49:39] [INFO ] Flatten gal took : 31 ms
[2026-05-22 20:49:39] [INFO ] Time to serialize gal into /tmp/CTLFireability16568638198601985395.gal : 37 ms
[2026-05-22 20:49:39] [INFO ] Time to serialize properties into /tmp/CTLFireability8328749357427063104.ctl : 7 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/CTLFireability16568638198601985395.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8328749357427063104.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.
Detected timeout of ITS tools.
[2026-05-22 20:50:09] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:50:09] [INFO ] Applying decomposition
[2026-05-22 20:50:09] [INFO ] Flatten gal took : 17 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2416338355107584873.txt' '-o' '/tmp/graph2416338355107584873.bin' '-w' '/tmp/graph2416338355107584873.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2416338355107584873.bin' '-l' '-1' '-v' '-w' '/tmp/graph2416338355107584873.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:50:10] [INFO ] Decomposing Gal with order
[2026-05-22 20:50:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:50:10] [INFO ] Removed a total of 851 redundant transitions.
[2026-05-22 20:50:10] [INFO ] Flatten gal took : 146 ms
[2026-05-22 20:50:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 22 ms.
[2026-05-22 20:50:10] [INFO ] Time to serialize gal into /tmp/CTLFireability10465724931730326049.gal : 11 ms
[2026-05-22 20:50:10] [INFO ] Time to serialize properties into /tmp/CTLFireability14102099115585842125.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/CTLFireability10465724931730326049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14102099115585842125.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.05638e+12,0.169526,8680,990,117,8647,1365,574,8572,93,4258,0


Converting to forward existential form...Done !
original formula: (EG((((EG((((u1.p6==0)||(u1.p9==0))||((i10.i1.u49.p175==0)||(u1.p246==0)))) + (u1.p6==0)) + ((u1.p16==0)||(i9.i1.u39.p144==0))) + ((u1.p2...381
=> equivalent forward existential formula: ([(FwdU((((FwdU((Init * EG((((EG((((u1.p6==0)||(u1.p9==0))||((i10.i1.u49.p175==0)||(u1.p246==0)))) + (u1.p6==0))...801
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t226, t250, t274, t298, t340, t358, t444, i1.i1.t214, i1.i1.u9.t193, i1.i1.u18.t1...820
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 17
Fast SCC detection found an SCC at level 18
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Graph (trivial) has 212 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 92 transitions
Trivial Post-agglo rules discarded 92 transitions
Performed 92 trivial Post agglomeration. Transition count delta: 92
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 253 transition count 516
Reduce places removed 92 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 129 rules applied. Total rules applied 222 place count 161 transition count 479
Reduce places removed 22 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 26 rules applied. Total rules applied 248 place count 139 transition count 475
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 252 place count 135 transition count 475
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 252 place count 135 transition count 466
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 270 place count 126 transition count 466
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 280 place count 116 transition count 456
Iterating global reduction 4 with 10 rules applied. Total rules applied 290 place count 116 transition count 456
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 434 place count 116 transition count 312
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 436 place count 114 transition count 300
Iterating global reduction 5 with 2 rules applied. Total rules applied 438 place count 114 transition count 300
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 442 place count 114 transition count 296
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 444 place count 112 transition count 296
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 7 with 60 rules applied. Total rules applied 504 place count 82 transition count 266
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 509 place count 77 transition count 239
Iterating global reduction 7 with 5 rules applied. Total rules applied 514 place count 77 transition count 239
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 517 place count 77 transition count 236
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 518 place count 76 transition count 236
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 522 place count 76 transition count 236
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 523 place count 75 transition count 235
Applied a total of 523 rules in 96 ms. Remains 75 /256 variables (removed 181) and now considering 235/611 (removed 376) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1094658827075736025.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16181259197348622769.kers'
[2026-05-22 20:50:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1094658827075736025.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16181259197348622769.kers]
Normalized transition count is 234 out of 235 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 234 rows 74 cols 1796 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-22 20:50:40] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16181259197348622769.kers
Total runtime 3 ms.
[2026-05-22 20:50:40] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 20:50:40] [INFO ] Invariant cache hit.
[2026-05-22 20:50:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 20:50:40] [INFO ] Implicit Places using invariants and state equation in 206 ms returned [68, 74]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 302 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 73/256 places, 235/611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 73 transition count 234
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 72 transition count 234
Applied a total of 2 rules in 14 ms. Remains 72 /73 variables (removed 1) and now considering 234/235 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16177108439456573682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10363166906214977216.kers'
[2026-05-22 20:50:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16177108439456573682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10363166906214977216.kers]
Normalized transition count is 233 out of 234 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 233 rows 71 cols 1785 entries
Finished phase 1 with 64 SingleSign rule and 0 generalized
[2026-05-22 20:50:40] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10363166906214977216.kers
Total runtime 3 ms.
[2026-05-22 20:50:41] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-22 20:50:41] [INFO ] Invariant cache hit.
[2026-05-22 20:50:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:50:41] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 72/256 places, 234/611 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 622 ms. Remains : 72/256 places, 234/611 transitions.
[2026-05-22 20:50:41] [INFO ] Flatten gal took : 24 ms
[2026-05-22 20:50:41] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:50:41] [INFO ] Input system was already deterministic with 234 transitions.
[2026-05-22 20:50:41] [INFO ] Flatten gal took : 25 ms
[2026-05-22 20:50:41] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:50:41] [INFO ] Time to serialize gal into /tmp/CTLFireability9443453700927889252.gal : 3 ms
[2026-05-22 20:50:41] [INFO ] Time to serialize properties into /tmp/CTLFireability16722386428443338936.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/CTLFireability9443453700927889252.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16722386428443338936.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,7.9719e+07,16.6238,370312,2,23266,5,1.54938e+06,6,0,520,1.25388e+06,0


Converting to forward existential form...Done !
original formula: A(E(EG(((p250==1) + EG((p111==1)))) U !(AF((E((((p6==1)&&(p15==1))&&((p82==1)&&(p246==1))) U (((p6==1)&&(p18==1))&&((p194==1)&&(p246==1))...444
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!((E(!(EG((((p6==1)&&(p15==1))&&((p179==1)&&(p246==1))))) U (!(((p156==1) * E((((p6==1)&&(p...1386
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t5, t10, t12, t13, t16, t17, t19, t20, t23, t25, t26, t30, t32, t35, t36, t38, t3...814
Detected timeout of ITS tools.
[2026-05-22 20:51:11] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:51:11] [INFO ] Applying decomposition
[2026-05-22 20:51:11] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11226603442407204061.txt' '-o' '/tmp/graph11226603442407204061.bin' '-w' '/tmp/graph11226603442407204061.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11226603442407204061.bin' '-l' '-1' '-v' '-w' '/tmp/graph11226603442407204061.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:51:11] [INFO ] Decomposing Gal with order
[2026-05-22 20:51:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:51:11] [INFO ] Removed a total of 701 redundant transitions.
[2026-05-22 20:51:11] [INFO ] Flatten gal took : 29 ms
[2026-05-22 20:51:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 11 ms.
[2026-05-22 20:51:11] [INFO ] Time to serialize gal into /tmp/CTLFireability17309379626866718933.gal : 2 ms
[2026-05-22 20:51:11] [INFO ] Time to serialize properties into /tmp/CTLFireability4965244612263911458.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/CTLFireability17309379626866718933.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4965244612263911458.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.9719e+07,6.7859,179388,2710,121,144731,2959,553,1.73472e+06,80,24065,0


Converting to forward existential form...Done !
original formula: A(E(EG(((i7.u23.p250==1) + EG((i2.u7.p111==1)))) U !(AF((E((((u0.p6==1)&&(u0.p15==1))&&((i1.u4.p82==1)&&(u0.p246==1))) U (((u0.p6==1)&&(u...612
=> equivalent forward existential formula: [((Init * !(EG(!(EG((!((E(!(EG((((u0.p6==1)&&(u0.p15==1))&&((i4.i1.u15.p179==1)&&(u0.p246==1))))) U (!(((i3.u14....1886
Reverse transition relation is NOT exact ! Due to transitions t2, t65, t95, t97, t133, t145, t151, t157, t169, t193, t205, t223, i1.u6.t30, i1.u6.t35, i2.u...535
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Graph (trivial) has 241 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 104 transitions
Trivial Post-agglo rules discarded 104 transitions
Performed 104 trivial Post agglomeration. Transition count delta: 104
Iterating post reduction 0 with 104 rules applied. Total rules applied 105 place count 253 transition count 504
Reduce places removed 104 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 143 rules applied. Total rules applied 248 place count 149 transition count 465
Reduce places removed 23 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 24 rules applied. Total rules applied 272 place count 126 transition count 464
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 273 place count 125 transition count 464
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 273 place count 125 transition count 460
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 281 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 292 place count 110 transition count 449
Iterating global reduction 4 with 11 rules applied. Total rules applied 303 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 4 with 144 rules applied. Total rules applied 447 place count 110 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 447 place count 110 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 451 place count 108 transition count 303
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 454 place count 105 transition count 285
Iterating global reduction 5 with 3 rules applied. Total rules applied 457 place count 105 transition count 285
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 5 rules applied. Total rules applied 462 place count 105 transition count 280
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 465 place count 103 transition count 279
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 466 place count 102 transition count 279
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 8 with 74 rules applied. Total rules applied 540 place count 65 transition count 242
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 550 place count 55 transition count 181
Iterating global reduction 8 with 10 rules applied. Total rules applied 560 place count 55 transition count 181
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 566 place count 55 transition count 175
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 569 place count 52 transition count 175
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 570 place count 52 transition count 174
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 572 place count 50 transition count 172
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 573 place count 49 transition count 172
Applied a total of 573 rules in 83 ms. Remains 49 /256 variables (removed 207) and now considering 172/611 (removed 439) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8126627904870889653.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-396039616128797501.kers'
[2026-05-22 20:51:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8126627904870889653.kers, --Pflows, --basisKERS=/tmp/petrispot-output-396039616128797501.kers]
Normalized transition count is 171 out of 172 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 171 rows 48 cols 1405 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 20:51:41] [INFO ] Computed 9 invariants in 5 ms
Computed 9 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-396039616128797501.kers
Total runtime 9 ms.
[2026-05-22 20:51:41] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 20:51:41] [INFO ] Invariant cache hit.
[2026-05-22 20:51:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:51:41] [INFO ] Implicit Places using invariants and state equation in 137 ms returned [42, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 231 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 47/256 places, 172/611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 171
Applied a total of 2 rules in 14 ms. Remains 46 /47 variables (removed 1) and now considering 171/172 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12823847198462449502.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12109157207515518523.kers'
[2026-05-22 20:51:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12823847198462449502.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12109157207515518523.kers]
Normalized transition count is 170 out of 171 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 46 cols 1400 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 20:51:41] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12109157207515518523.kers
Total runtime 1 ms.
[2026-05-22 20:51:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 20:51:42] [INFO ] Invariant cache hit.
[2026-05-22 20:51:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:51:42] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 46/256 places, 171/611 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 563 ms. Remains : 46/256 places, 171/611 transitions.
[2026-05-22 20:51:42] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:51:42] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:51:42] [INFO ] Input system was already deterministic with 171 transitions.
[2026-05-22 20:51:42] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:51:42] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:51:42] [INFO ] Time to serialize gal into /tmp/CTLFireability11839502394124966430.gal : 5 ms
[2026-05-22 20:51:42] [INFO ] Time to serialize properties into /tmp/CTLFireability9644845236641589095.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/CTLFireability11839502394124966430.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9644845236641589095.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: EG((p154==0))
=> equivalent forward existential formula: [FwdG(Init,(p154==0))] != FALSE
Hit Full ! (commute/partial/dont) 136/0/35
(forward)formula 0,0,1.72943,36944,1,0,71,95861,19,3,3972,103397,70
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 242 transition count 597
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 242 transition count 597
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 242 transition count 453
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 178 place count 236 transition count 447
Iterating global reduction 1 with 6 rules applied. Total rules applied 184 place count 236 transition count 447
Applied a total of 184 rules in 29 ms. Remains 236 /256 variables (removed 20) and now considering 447/611 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5239577560557078742.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16579610599143257573.kers'
[2026-05-22 20:51:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5239577560557078742.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16579610599143257573.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 447 rows 236 cols 2554 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-22 20:51:44] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16579610599143257573.kers
Total runtime 3 ms.
[2026-05-22 20:51:44] [INFO ] Implicit Places using invariants in 141 ms returned []
[2026-05-22 20:51:44] [INFO ] Invariant cache hit.
[2026-05-22 20:51:44] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 236/256 places, 447/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 236/256 places, 447/611 transitions.
[2026-05-22 20:51:44] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:51:44] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:51:44] [INFO ] Input system was already deterministic with 447 transitions.
[2026-05-22 20:51:44] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:51:44] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:51:44] [INFO ] Time to serialize gal into /tmp/CTLFireability6860838216260893725.gal : 17 ms
[2026-05-22 20:51:44] [INFO ] Time to serialize properties into /tmp/CTLFireability15336894961383944009.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/CTLFireability6860838216260893725.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15336894961383944009.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.
Detected timeout of ITS tools.
[2026-05-22 20:52:14] [INFO ] Flatten gal took : 14 ms
[2026-05-22 20:52:14] [INFO ] Applying decomposition
[2026-05-22 20:52:14] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10577356006651737987.txt' '-o' '/tmp/graph10577356006651737987.bin' '-w' '/tmp/graph10577356006651737987.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10577356006651737987.bin' '-l' '-1' '-v' '-w' '/tmp/graph10577356006651737987.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:52:14] [INFO ] Decomposing Gal with order
[2026-05-22 20:52:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:52:15] [INFO ] Removed a total of 848 redundant transitions.
[2026-05-22 20:52:15] [INFO ] Flatten gal took : 62 ms
[2026-05-22 20:52:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 22 ms.
[2026-05-22 20:52:15] [INFO ] Time to serialize gal into /tmp/CTLFireability12509901505298825648.gal : 7 ms
[2026-05-22 20:52:15] [INFO ] Time to serialize properties into /tmp/CTLFireability2530621080053873139.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/CTLFireability12509901505298825648.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2530621080053873139.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.07623e+12,0.290233,9340,774,117,10200,989,579,13510,90,3566,0


Converting to forward existential form...Done !
original formula: EF(((EX(((((((u1.p6==1)&&(u1.p14==1))&&((i7.i1.u45.p144==1)&&(u1.p246==1)))||(i11.i0.u64.p203==1)) * EX((((u1.p6==1)&&(u1.p18==1))&&((i2....402
=> equivalent forward existential formula: [(EY(((FwdU(Init,TRUE) * (EX(((((((u1.p6==1)&&(u1.p14==1))&&((i7.i1.u45.p144==1)&&(u1.p246==1)))||(i11.i0.u64.p2...460
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t226, t250, t274, t298, t334, t364, t444, i2.i0.t214, i2.i0.u12.t194, i2.i0.u20.t...820
(forward)formula 0,0,0.920727,24004,1,0,44749,1180,4496,53490,468,3566,144066
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 241 transition count 596
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 174 place count 241 transition count 452
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 180 place count 235 transition count 446
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 235 transition count 446
Applied a total of 186 rules in 16 ms. Remains 235 /256 variables (removed 21) and now considering 446/611 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4726136519911611074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1449162605535216211.kers'
[2026-05-22 20:52:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4726136519911611074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1449162605535216211.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 446 rows 235 cols 2552 entries
Finished phase 1 with 224 SingleSign rule and 0 generalized
[2026-05-22 20:52:16] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1449162605535216211.kers
Total runtime 3 ms.
[2026-05-22 20:52:16] [INFO ] Implicit Places using invariants in 146 ms returned []
[2026-05-22 20:52:16] [INFO ] Invariant cache hit.
[2026-05-22 20:52:16] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2026-05-22 20:52:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 445 unsolved
SMT process timed out in 30663ms, After SMT, problems are : Problem set: 0 solved, 445 unsolved
Search for dead transitions found 0 dead transitions in 30666ms
Starting structural reductions in LTL mode, iteration 1 : 235/256 places, 446/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31187 ms. Remains : 235/256 places, 446/611 transitions.
[2026-05-22 20:52:47] [INFO ] Flatten gal took : 16 ms
[2026-05-22 20:52:47] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:52:47] [INFO ] Input system was already deterministic with 446 transitions.
[2026-05-22 20:52:47] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:52:47] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:52:47] [INFO ] Time to serialize gal into /tmp/CTLFireability13589432180265103792.gal : 6 ms
[2026-05-22 20:52:47] [INFO ] Time to serialize properties into /tmp/CTLFireability14057623159148745189.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/CTLFireability13589432180265103792.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14057623159148745189.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.
Detected timeout of ITS tools.
[2026-05-22 20:53:17] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:53:17] [INFO ] Applying decomposition
[2026-05-22 20:53:17] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph137343126077314881.txt' '-o' '/tmp/graph137343126077314881.bin' '-w' '/tmp/graph137343126077314881.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph137343126077314881.bin' '-l' '-1' '-v' '-w' '/tmp/graph137343126077314881.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:53:17] [INFO ] Decomposing Gal with order
[2026-05-22 20:53:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:53:17] [INFO ] Removed a total of 846 redundant transitions.
[2026-05-22 20:53:17] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:53:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 7 ms.
[2026-05-22 20:53:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8605400110221039883.gal : 5 ms
[2026-05-22 20:53:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11581543658500725618.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/CTLFireability8605400110221039883.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11581543658500725618.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03205e+12,0.14673,8400,836,112,7024,1570,574,9181,88,8774,0


Converting to forward existential form...Done !
original formula: AX(AX(EF(((((u73.p6==1)&&(u73.p14==1))&&((i6.u35.p117==1)&&(u73.p246==1))) + (AX((i0.i0.u1.p2==1)) * AG((((u73.p6==1)&&(u73.p9==1))&&((i8...194
=> equivalent forward existential formula: [(EY(EY(Init)) * !(E(TRUE U ((((u73.p6==1)&&(u73.p14==1))&&((i6.u35.p117==1)&&(u73.p246==1))) + (!(EX(!((i0.i0.u...265
Reverse transition relation is NOT exact ! Due to transitions t220, t222, t228, t258, t276, t300, t342, t366, t443, i1.i0.t213, i1.i0.u10.t193, i1.i0.u19.t...814
(forward)formula 0,1,1.18132,40484,1,0,81145,2249,4462,99530,470,14105,218163
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 244 transition count 599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 244 transition count 599
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 244 transition count 455
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 172 place count 240 transition count 451
Iterating global reduction 1 with 4 rules applied. Total rules applied 176 place count 240 transition count 451
Applied a total of 176 rules in 13 ms. Remains 240 /256 variables (removed 16) and now considering 451/611 (removed 160) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11153545021661309660.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13212085840759073211.kers'
[2026-05-22 20:53:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11153545021661309660.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13212085840759073211.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 451 rows 240 cols 2562 entries
Finished phase 1 with 229 SingleSign rule and 0 generalized
[2026-05-22 20:53:18] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13212085840759073211.kers
Total runtime 3 ms.
[2026-05-22 20:53:18] [INFO ] Implicit Places using invariants in 148 ms returned []
[2026-05-22 20:53:18] [INFO ] Invariant cache hit.
[2026-05-22 20:53:19] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
Running 450 sub problems to find dead transitions.
[2026-05-22 20:53:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 12/63 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 240/691 variables, and 64 constraints, problems are : Problem set: 0 solved, 450 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/240 constraints, PredecessorRefiner: 450/450 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 450 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 1 (OVERLAPS) 1/240 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 53/64 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 450 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/240 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 450 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 6 (OVERLAPS) 451/691 variables, 240/322 constraints. Problems are: Problem set: 2 solved, 448 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 448/770 constraints. Problems are: Problem set: 2 solved, 448 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 770 constraints, problems are : Problem set: 2 solved, 448 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 240/240 constraints, PredecessorRefiner: 448/450 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60461ms problems are : Problem set: 2 solved, 448 unsolved
Search for dead transitions found 2 dead transitions in 60462ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 240/256 places, 449/611 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 239 transition count 449
Applied a total of 1 rules in 7 ms. Remains 239 /240 variables (removed 1) and now considering 449/449 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15326343037269630329.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12917867945862077047.kers'
[2026-05-22 20:54:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15326343037269630329.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12917867945862077047.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 449 rows 239 cols 2556 entries
Finished phase 1 with 228 SingleSign rule and 0 generalized
[2026-05-22 20:54:19] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-12917867945862077047.kers
Total runtime 6 ms.
[2026-05-22 20:54:19] [INFO ] Implicit Places using invariants in 179 ms returned []
[2026-05-22 20:54:19] [INFO ] Invariant cache hit.
[2026-05-22 20:54:20] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 239/256 places, 449/611 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61541 ms. Remains : 239/256 places, 449/611 transitions.
[2026-05-22 20:54:20] [INFO ] Flatten gal took : 17 ms
[2026-05-22 20:54:20] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:54:20] [INFO ] Input system was already deterministic with 449 transitions.
[2026-05-22 20:54:20] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:54:20] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:54:20] [INFO ] Time to serialize gal into /tmp/CTLFireability14265720788717309115.gal : 9 ms
[2026-05-22 20:54:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6287087974526170196.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/CTLFireability14265720788717309115.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6287087974526170196.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.
Detected timeout of ITS tools.
[2026-05-22 20:54:50] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:54:50] [INFO ] Applying decomposition
[2026-05-22 20:54:50] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9444311830629978938.txt' '-o' '/tmp/graph9444311830629978938.bin' '-w' '/tmp/graph9444311830629978938.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9444311830629978938.bin' '-l' '-1' '-v' '-w' '/tmp/graph9444311830629978938.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:54:50] [INFO ] Decomposing Gal with order
[2026-05-22 20:54:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:54:50] [INFO ] Removed a total of 843 redundant transitions.
[2026-05-22 20:54:50] [INFO ] Flatten gal took : 37 ms
[2026-05-22 20:54:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 4 ms.
[2026-05-22 20:54:50] [INFO ] Time to serialize gal into /tmp/CTLFireability17309424892799948834.gal : 4 ms
[2026-05-22 20:54:50] [INFO ] Time to serialize properties into /tmp/CTLFireability8071945377621672462.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/CTLFireability17309424892799948834.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8071945377621672462.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.16134e+12,0.272861,9956,833,117,12510,1184,564,12596,89,3482,0


Converting to forward existential form...Done !
original formula: E(!(A((!(EX((((u1.p6==1)&&(u1.p15==1))&&((i12.i1.u64.p206==1)&&(u1.p246==1))))) * E(((i12.i1.u63.p203==1)||(((u1.p6==1)&&(u1.p17==1))&&((...725
=> equivalent forward existential formula: [(FwdU((FwdU(Init,!(!((E(!(!(EX(!(((!(((u1.p6==1)&&(u1.p9==1))&&((i5.u26.p89==1)&&(u1.p246==1))))&&((i10.i1.u53....1293
Reverse transition relation is NOT exact ! Due to transitions t223, t225, t233, t251, t275, t299, t341, t365, t446, i1.i1.t196, i1.i1.t216, i1.i1.u19.t197,...792
(forward)formula 0,0,0.898582,26108,1,0,49183,1519,3730,53039,463,4800,159833
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 242 transition count 597
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 242 transition count 597
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 172 place count 242 transition count 453
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 177 place count 237 transition count 448
Iterating global reduction 1 with 5 rules applied. Total rules applied 182 place count 237 transition count 448
Applied a total of 182 rules in 10 ms. Remains 237 /256 variables (removed 19) and now considering 448/611 (removed 163) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1075724607644090392.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5727843310146637912.kers'
[2026-05-22 20:54:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1075724607644090392.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5727843310146637912.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 237 cols 2556 entries
Finished phase 1 with 226 SingleSign rule and 0 generalized
[2026-05-22 20:54:51] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5727843310146637912.kers
Total runtime 3 ms.
[2026-05-22 20:54:51] [INFO ] Implicit Places using invariants in 127 ms returned []
[2026-05-22 20:54:51] [INFO ] Invariant cache hit.
[2026-05-22 20:54:52] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2026-05-22 20:54:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (OVERLAPS) 1/237 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/237 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/237 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 447 unsolved
SMT process timed out in 30550ms, After SMT, problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 30553ms
Starting structural reductions in LTL mode, iteration 1 : 237/256 places, 448/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31154 ms. Remains : 237/256 places, 448/611 transitions.
[2026-05-22 20:55:22] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:55:22] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:55:22] [INFO ] Input system was already deterministic with 448 transitions.
[2026-05-22 20:55:22] [INFO ] Flatten gal took : 22 ms
[2026-05-22 20:55:22] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:55:22] [INFO ] Time to serialize gal into /tmp/CTLFireability2605550591573086337.gal : 4 ms
[2026-05-22 20:55:22] [INFO ] Time to serialize properties into /tmp/CTLFireability17239935200565396102.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/CTLFireability2605550591573086337.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17239935200565396102.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.
Detected timeout of ITS tools.
[2026-05-22 20:55:52] [INFO ] Flatten gal took : 18 ms
[2026-05-22 20:55:52] [INFO ] Applying decomposition
[2026-05-22 20:55:52] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5537175594577132006.txt' '-o' '/tmp/graph5537175594577132006.bin' '-w' '/tmp/graph5537175594577132006.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5537175594577132006.bin' '-l' '-1' '-v' '-w' '/tmp/graph5537175594577132006.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:55:53] [INFO ] Decomposing Gal with order
[2026-05-22 20:55:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:55:53] [INFO ] Removed a total of 842 redundant transitions.
[2026-05-22 20:55:53] [INFO ] Flatten gal took : 52 ms
[2026-05-22 20:55:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 8 ms.
[2026-05-22 20:55:53] [INFO ] Time to serialize gal into /tmp/CTLFireability8347475365520241969.gal : 5 ms
[2026-05-22 20:55:53] [INFO ] Time to serialize properties into /tmp/CTLFireability9511803588134297806.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/CTLFireability8347475365520241969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9511803588134297806.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03205e+12,0.329451,9652,763,119,10959,1387,544,13324,92,4135,0


Converting to forward existential form...Done !
original formula: AG(AX(((i7.u28.p125!=1)||(((i5.i1.u24.p80==1)&&(i14.i1.u71.p237==1))&&((((i2.u2.p6==1)&&(i2.u2.p18==1))&&((i3.i0.u12.p39==1)&&(i2.u2.p246...241
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * !(((i7.u28.p125!=1)||(((i5.i1.u24.p80==1)&&(i14.i1.u71.p237==1))&&((((i2.u2.p6==1)&&(i2....295
(forward)formula 0,0,0.370905,9888,1,0,10959,1387,885,13324,159,4135,10652
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 241 transition count 596
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 174 place count 241 transition count 452
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 179 place count 236 transition count 447
Iterating global reduction 1 with 5 rules applied. Total rules applied 184 place count 236 transition count 447
Applied a total of 184 rules in 16 ms. Remains 236 /256 variables (removed 20) and now considering 447/611 (removed 164) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14363796823215860475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4173014463899798341.kers'
[2026-05-22 20:55:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14363796823215860475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4173014463899798341.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 447 rows 236 cols 2554 entries
Finished phase 1 with 225 SingleSign rule and 0 generalized
[2026-05-22 20:55:53] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4173014463899798341.kers
Total runtime 6 ms.
[2026-05-22 20:55:53] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-22 20:55:53] [INFO ] Invariant cache hit.
[2026-05-22 20:55:54] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 563 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2026-05-22 20:55:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 19/50 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/683 variables, and 50 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 446 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (OVERLAPS) 1/236 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 39/50 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/236 variables, 12/85 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/683 variables, and 85 constraints, problems are : Problem set: 0 solved, 446 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/236 constraints, PredecessorRefiner: 0/446 constraints, Known Traps: 74/74 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60555ms problems are : Problem set: 0 solved, 446 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Starting structural reductions in LTL mode, iteration 1 : 236/256 places, 447/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61143 ms. Remains : 236/256 places, 447/611 transitions.
[2026-05-22 20:56:54] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:56:54] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:56:54] [INFO ] Input system was already deterministic with 447 transitions.
[2026-05-22 20:56:54] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:56:54] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:56:54] [INFO ] Time to serialize gal into /tmp/CTLFireability5001250741018648748.gal : 3 ms
[2026-05-22 20:56:54] [INFO ] Time to serialize properties into /tmp/CTLFireability550343264180638217.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/CTLFireability5001250741018648748.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability550343264180638217.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-22 20:57:24] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:57:24] [INFO ] Applying decomposition
[2026-05-22 20:57:24] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12490325410665010822.txt' '-o' '/tmp/graph12490325410665010822.bin' '-w' '/tmp/graph12490325410665010822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12490325410665010822.bin' '-l' '-1' '-v' '-w' '/tmp/graph12490325410665010822.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:57:24] [INFO ] Decomposing Gal with order
[2026-05-22 20:57:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:57:24] [INFO ] Removed a total of 863 redundant transitions.
[2026-05-22 20:57:24] [INFO ] Flatten gal took : 34 ms
[2026-05-22 20:57:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 5 ms.
[2026-05-22 20:57:24] [INFO ] Time to serialize gal into /tmp/CTLFireability13305698459515247816.gal : 4 ms
[2026-05-22 20:57:24] [INFO ] Time to serialize properties into /tmp/CTLFireability6657694556527527722.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/CTLFireability13305698459515247816.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6657694556527527722.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03205e+12,0.348288,14248,2018,113,22147,1711,562,21144,85,4447,0


Converting to forward existential form...Done !
original formula: A(EG((EX((EF((((u1.p6==1)&&(u1.p16==1))&&((i6.u38.p117==1)&&(u1.p246==1)))) * !((((u1.p6==1)&&(u1.p17==1))&&((i10.u57.p182==1)&&(u1.p246=...645
=> equivalent forward existential formula: [((Init * !(EG(!(EX(!(E(TRUE U !(!((!((((u1.p6==1)&&(u1.p9==1))&&((i8.i1.u42.p144==1)&&(u1.p246==1)))) + EX((i12...1149
Reverse transition relation is NOT exact ! Due to transitions t221, t223, t226, t250, t274, t298, t340, t364, t444, i2.i1.t214, i2.i1.u11.t194, i2.i1.u20.t...844
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Graph (trivial) has 238 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 103 transitions
Trivial Post-agglo rules discarded 103 transitions
Performed 103 trivial Post agglomeration. Transition count delta: 103
Iterating post reduction 0 with 103 rules applied. Total rules applied 104 place count 253 transition count 505
Reduce places removed 103 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 1 with 141 rules applied. Total rules applied 245 place count 150 transition count 467
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 2 with 22 rules applied. Total rules applied 267 place count 128 transition count 467
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 267 place count 128 transition count 463
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 275 place count 124 transition count 463
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 285 place count 114 transition count 453
Iterating global reduction 3 with 10 rules applied. Total rules applied 295 place count 114 transition count 453
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 439 place count 114 transition count 309
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 439 place count 114 transition count 308
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 441 place count 113 transition count 308
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 442 place count 112 transition count 302
Iterating global reduction 4 with 1 rules applied. Total rules applied 443 place count 112 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 445 place count 112 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 446 place count 111 transition count 300
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 520 place count 74 transition count 263
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 530 place count 64 transition count 202
Iterating global reduction 6 with 10 rules applied. Total rules applied 540 place count 64 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 546 place count 64 transition count 196
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 549 place count 61 transition count 196
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 550 place count 61 transition count 195
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 552 place count 59 transition count 193
Applied a total of 552 rules in 53 ms. Remains 59 /256 variables (removed 197) and now considering 193/611 (removed 418) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4719325829090990548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2736894159458319666.kers'
[2026-05-22 20:57:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4719325829090990548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2736894159458319666.kers]
Normalized transition count is 192 out of 193 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 192 rows 57 cols 1579 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 20:57:55] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2736894159458319666.kers
Total runtime 4 ms.
[2026-05-22 20:57:55] [INFO ] Implicit Places using invariants in 167 ms returned []
[2026-05-22 20:57:55] [INFO ] Invariant cache hit.
[2026-05-22 20:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:57:55] [INFO ] Implicit Places using invariants and state equation in 186 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 356 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/256 places, 193/611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 192
Applied a total of 2 rules in 7 ms. Remains 56 /57 variables (removed 1) and now considering 192/193 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17153064102641272909.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4830310211624514529.kers'
[2026-05-22 20:57:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17153064102641272909.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4830310211624514529.kers]
Normalized transition count is 191 out of 192 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 191 rows 55 cols 1574 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-22 20:57:55] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4830310211624514529.kers
Total runtime 2 ms.
[2026-05-22 20:57:55] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 20:57:55] [INFO ] Invariant cache hit.
[2026-05-22 20:57:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:57:55] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/256 places, 192/611 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 696 ms. Remains : 56/256 places, 192/611 transitions.
[2026-05-22 20:57:55] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:57:55] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:57:55] [INFO ] Input system was already deterministic with 192 transitions.
[2026-05-22 20:57:55] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:57:55] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:57:55] [INFO ] Time to serialize gal into /tmp/CTLFireability5534278218800666232.gal : 3 ms
[2026-05-22 20:57:55] [INFO ] Time to serialize properties into /tmp/CTLFireability5935325804050340219.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/CTLFireability5534278218800666232.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5935325804050340219.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,8.51506e+06,9.58821,192432,2,10069,5,508446,6,0,414,477251,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 20:58:25] [INFO ] Flatten gal took : 9 ms
[2026-05-22 20:58:25] [INFO ] Applying decomposition
[2026-05-22 20:58:25] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph8668028850300476565.txt' '-o' '/tmp/graph8668028850300476565.bin' '-w' '/tmp/graph8668028850300476565.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8668028850300476565.bin' '-l' '-1' '-v' '-w' '/tmp/graph8668028850300476565.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:58:25] [INFO ] Decomposing Gal with order
[2026-05-22 20:58:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:58:25] [INFO ] Removed a total of 691 redundant transitions.
[2026-05-22 20:58:25] [INFO ] Flatten gal took : 19 ms
[2026-05-22 20:58:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 3 ms.
[2026-05-22 20:58:25] [INFO ] Time to serialize gal into /tmp/CTLFireability16079571522054679947.gal : 1 ms
[2026-05-22 20:58:25] [INFO ] Time to serialize properties into /tmp/CTLFireability10596700727741536464.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/CTLFireability16079571522054679947.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10596700727741536464.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,8.51506e+06,0.023643,4412,108,44,655,239,188,953,60,512,0


Converting to forward existential form...Done !
original formula: EG(((((i6.u0.p6==0)||(i6.u0.p15==0))||((i0.u1.p39==0)||(i6.u18.p246==0)))||((i4.u9.p130==1)||(((i6.u0.p6==1)&&(i6.u0.p18==1))&&((i4.u10.p...185
=> equivalent forward existential formula: [FwdG(Init,((((i6.u0.p6==0)||(i6.u0.p15==0))||((i0.u1.p39==0)||(i6.u18.p246==0)))||((i4.u9.p130==1)||(((i6.u0.p6...228
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 7
(forward)formula 0,1,0.158144,9720,1,0,11319,930,760,19545,283,5518,18546
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 243 transition count 598
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 243 transition count 598
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 31 place count 238 transition count 593
Iterating global reduction 0 with 5 rules applied. Total rules applied 36 place count 238 transition count 593
Applied a total of 36 rules in 11 ms. Remains 238 /256 variables (removed 18) and now considering 593/611 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7119876736812902917.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6738321362685501747.kers'
[2026-05-22 20:58:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7119876736812902917.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6738321362685501747.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 593 rows 238 cols 3710 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-22 20:58:26] [INFO ] Computed 11 invariants in 3 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6738321362685501747.kers
Total runtime 4 ms.
[2026-05-22 20:58:26] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-22 20:58:26] [INFO ] Invariant cache hit.
[2026-05-22 20:58:26] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Running 592 sub problems to find dead transitions.
[2026-05-22 20:58:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/831 variables, and 61 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 592/302 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 50/61 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 592 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 592 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/831 variables, and 73 constraints, problems are : Problem set: 0 solved, 592 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 290/302 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60625ms problems are : Problem set: 0 solved, 592 unsolved
Search for dead transitions found 0 dead transitions in 60629ms
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 593/611 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61139 ms. Remains : 238/256 places, 593/611 transitions.
[2026-05-22 20:59:27] [INFO ] Flatten gal took : 24 ms
[2026-05-22 20:59:27] [INFO ] Flatten gal took : 27 ms
[2026-05-22 20:59:27] [INFO ] Input system was already deterministic with 593 transitions.
[2026-05-22 20:59:27] [INFO ] Flatten gal took : 25 ms
[2026-05-22 20:59:27] [INFO ] Flatten gal took : 26 ms
[2026-05-22 20:59:27] [INFO ] Time to serialize gal into /tmp/CTLFireability10458720632411577967.gal : 8 ms
[2026-05-22 20:59:27] [INFO ] Time to serialize properties into /tmp/CTLFireability14653149668521295393.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/CTLFireability10458720632411577967.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14653149668521295393.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.
Detected timeout of ITS tools.
[2026-05-22 20:59:57] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:59:57] [INFO ] Applying decomposition
[2026-05-22 20:59:57] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph1300982792133242972.txt' '-o' '/tmp/graph1300982792133242972.bin' '-w' '/tmp/graph1300982792133242972.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1300982792133242972.bin' '-l' '-1' '-v' '-w' '/tmp/graph1300982792133242972.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:59:57] [INFO ] Decomposing Gal with order
[2026-05-22 20:59:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:59:57] [INFO ] Removed a total of 1211 redundant transitions.
[2026-05-22 20:59:57] [INFO ] Flatten gal took : 50 ms
[2026-05-22 20:59:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 7 ms.
[2026-05-22 20:59:57] [INFO ] Time to serialize gal into /tmp/CTLFireability4158689675303778869.gal : 4 ms
[2026-05-22 20:59:57] [INFO ] Time to serialize properties into /tmp/CTLFireability3996725238667602393.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/CTLFireability4158689675303778869.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3996725238667602393.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44207e+12,0.693712,19200,2140,109,32950,2002,604,28358,103,11314,0


Converting to forward existential form...Done !
original formula: AG((EF(AG(((((i1.i0.u10.p52==0)||(u2.p6==0))||((u2.p17==0)||(i10.u51.p182==0)))||(u2.p246==0)))) * ((!(A(EX((((u2.p6==1)&&(u2.p16==1))&&(...468
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E(TRUE U !(E(TRUE U !(((((i1.i0.u10.p52==0)||(u2.p6==0))||((u2.p17==0)||(i10.u51.p182==0)...798
Reverse transition relation is NOT exact ! Due to transitions t222, t224, t231, t291, t339, t375, t459, t507, t590, u2.t226, i1.i0.t215, i1.i0.u12.t195, i1...843
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Graph (trivial) has 225 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 100 place count 253 transition count 509
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 138 rules applied. Total rules applied 238 place count 154 transition count 470
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 2 with 23 rules applied. Total rules applied 261 place count 131 transition count 470
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 261 place count 131 transition count 460
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 281 place count 121 transition count 460
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 292 place count 110 transition count 449
Iterating global reduction 3 with 11 rules applied. Total rules applied 303 place count 110 transition count 449
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 3 with 144 rules applied. Total rules applied 447 place count 110 transition count 305
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 447 place count 110 transition count 304
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 449 place count 109 transition count 304
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 452 place count 106 transition count 286
Iterating global reduction 4 with 3 rules applied. Total rules applied 455 place count 106 transition count 286
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 461 place count 106 transition count 280
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 464 place count 103 transition count 280
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 526 place count 72 transition count 249
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 533 place count 65 transition count 209
Iterating global reduction 6 with 7 rules applied. Total rules applied 540 place count 65 transition count 209
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 546 place count 65 transition count 203
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 549 place count 62 transition count 203
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 550 place count 62 transition count 202
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 552 place count 60 transition count 200
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 553 place count 59 transition count 200
Applied a total of 553 rules in 48 ms. Remains 59 /256 variables (removed 197) and now considering 200/611 (removed 411) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6840851119998408705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7861491092759031360.kers'
[2026-05-22 21:00:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6840851119998408705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7861491092759031360.kers]
Normalized transition count is 199 out of 200 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 199 rows 58 cols 1533 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-22 21:00:27] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7861491092759031360.kers
Total runtime 2 ms.
[2026-05-22 21:00:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 21:00:27] [INFO ] Invariant cache hit.
[2026-05-22 21:00:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:00:27] [INFO ] Implicit Places using invariants and state equation in 134 ms returned [52, 58]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 213 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/256 places, 200/611 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 199
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 199
Applied a total of 2 rules in 9 ms. Remains 56 /57 variables (removed 1) and now considering 199/200 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8934093834460782094.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13852215904915082369.kers'
[2026-05-22 21:00:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8934093834460782094.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13852215904915082369.kers]
Normalized transition count is 198 out of 199 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 198 rows 56 cols 1528 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 21:00:28] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13852215904915082369.kers
Total runtime 1 ms.
[2026-05-22 21:00:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 21:00:28] [INFO ] Invariant cache hit.
[2026-05-22 21:00:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:00:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/256 places, 199/611 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 459 ms. Remains : 56/256 places, 199/611 transitions.
[2026-05-22 21:00:28] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:00:28] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:00:28] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-22 21:00:28] [INFO ] Flatten gal took : 8 ms
[2026-05-22 21:00:28] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:00:28] [INFO ] Time to serialize gal into /tmp/CTLFireability5429726288472513315.gal : 2 ms
[2026-05-22 21:00:28] [INFO ] Time to serialize properties into /tmp/CTLFireability11742478641483136273.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/CTLFireability5429726288472513315.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11742478641483136273.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,8.25373e+06,3.71595,92892,2,5848,5,278620,6,0,421,399335,0


Converting to forward existential form...Done !
original formula: EG(((((p62==0)||(p87==0))||((p124==0)||(p149==0)))||(((p180==0)||(p217==0))||(p247==0))))
=> equivalent forward existential formula: [FwdG(Init,((((p62==0)||(p87==0))||((p124==0)||(p149==0)))||(((p180==0)||(p217==0))||(p247==0))))] != FALSE
Hit Full ! (commute/partial/dont) 122/0/77
(forward)formula 0,1,18.4617,360988,1,0,91,1.23194e+06,19,4,4289,1.52601e+06,89
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 244 transition count 599
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 244 transition count 599
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 168 place count 244 transition count 455
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 173 place count 239 transition count 450
Iterating global reduction 1 with 5 rules applied. Total rules applied 178 place count 239 transition count 450
Applied a total of 178 rules in 11 ms. Remains 239 /256 variables (removed 17) and now considering 450/611 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4200057606591315964.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14273549876260000693.kers'
[2026-05-22 21:00:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4200057606591315964.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14273549876260000693.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 450 rows 239 cols 2560 entries
Finished phase 1 with 228 SingleSign rule and 0 generalized
[2026-05-22 21:00:46] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14273549876260000693.kers
Total runtime 4 ms.
[2026-05-22 21:00:47] [INFO ] Implicit Places using invariants in 180 ms returned []
[2026-05-22 21:00:47] [INFO ] Invariant cache hit.
[2026-05-22 21:00:47] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2026-05-22 21:00:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 14/65 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 239/689 variables, and 68 constraints, problems are : Problem set: 0 solved, 449 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/239 constraints, PredecessorRefiner: 449/449 constraints, Known Traps: 57/57 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 449 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (OVERLAPS) 1/239 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/239 variables, 57/68 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/239 variables, 6/74 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 5/79 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 6 (OVERLAPS) 450/689 variables, 239/318 constraints. Problems are: Problem set: 2 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/689 variables, 447/765 constraints. Problems are: Problem set: 2 solved, 447 unsolved
SMT process timed out in 60529ms, After SMT, problems are : Problem set: 2 solved, 447 unsolved
Search for dead transitions found 2 dead transitions in 60530ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 239/256 places, 448/611 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 238 transition count 448
Applied a total of 1 rules in 8 ms. Remains 238 /239 variables (removed 1) and now considering 448/448 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14075561971220455750.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-793946728218017545.kers'
[2026-05-22 21:01:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14075561971220455750.kers, --Pflows, --basisKERS=/tmp/petrispot-output-793946728218017545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 238 cols 2554 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-22 21:01:48] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-793946728218017545.kers
Total runtime 3 ms.
[2026-05-22 21:01:48] [INFO ] Implicit Places using invariants in 165 ms returned []
[2026-05-22 21:01:48] [INFO ] Invariant cache hit.
[2026-05-22 21:01:48] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 238/256 places, 448/611 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61713 ms. Remains : 238/256 places, 448/611 transitions.
[2026-05-22 21:01:48] [INFO ] Flatten gal took : 17 ms
[2026-05-22 21:01:48] [INFO ] Flatten gal took : 19 ms
[2026-05-22 21:01:48] [INFO ] Input system was already deterministic with 448 transitions.
[2026-05-22 21:01:48] [INFO ] Flatten gal took : 18 ms
[2026-05-22 21:01:48] [INFO ] Flatten gal took : 18 ms
[2026-05-22 21:01:48] [INFO ] Time to serialize gal into /tmp/CTLFireability10122768420186813049.gal : 5 ms
[2026-05-22 21:01:48] [INFO ] Time to serialize properties into /tmp/CTLFireability6021834330036583577.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/CTLFireability10122768420186813049.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6021834330036583577.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.
Detected timeout of ITS tools.
[2026-05-22 21:02:18] [INFO ] Flatten gal took : 34 ms
[2026-05-22 21:02:18] [INFO ] Applying decomposition
[2026-05-22 21:02:18] [INFO ] Flatten gal took : 19 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17884715016698608527.txt' '-o' '/tmp/graph17884715016698608527.bin' '-w' '/tmp/graph17884715016698608527.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17884715016698608527.bin' '-l' '-1' '-v' '-w' '/tmp/graph17884715016698608527.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:02:18] [INFO ] Decomposing Gal with order
[2026-05-22 21:02:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:02:18] [INFO ] Removed a total of 840 redundant transitions.
[2026-05-22 21:02:18] [INFO ] Flatten gal took : 50 ms
[2026-05-22 21:02:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 10 ms.
[2026-05-22 21:02:19] [INFO ] Time to serialize gal into /tmp/CTLFireability13758143429216438247.gal : 6 ms
[2026-05-22 21:02:19] [INFO ] Time to serialize properties into /tmp/CTLFireability8058898840975960828.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/CTLFireability13758143429216438247.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8058898840975960828.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.10031e+12,0.417743,14608,1247,116,21671,1474,597,27173,93,5244,0


Converting to forward existential form...Done !
original formula: (EG(((EX(EG((((i9.u1.p6==1)&&(i9.u1.p16==1))&&((i12.i1.u58.p194==1)&&(i9.u1.p246==1))))) * EG(A((i13.u36.p117==1) U (((i9.u1.p6==1)&&(i9....435
=> equivalent forward existential formula: ([FwdG(Init,((EX(EG((((i9.u1.p6==1)&&(i9.u1.p16==1))&&((i12.i1.u58.p194==1)&&(i9.u1.p246==1))))) * EG(!((E(!((((...779
Reverse transition relation is NOT exact ! Due to transitions t216, t223, t225, t251, t275, t305, t335, t365, t445, i0.i1.t24, i3.t195, i3.u17.t199, i3.u17...789
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 241 transition count 596
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 241 transition count 596
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 174 place count 241 transition count 452
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 180 place count 235 transition count 446
Iterating global reduction 1 with 6 rules applied. Total rules applied 186 place count 235 transition count 446
Applied a total of 186 rules in 9 ms. Remains 235 /256 variables (removed 21) and now considering 446/611 (removed 165) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9163542680795084136.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7700345004688754302.kers'
[2026-05-22 21:02:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9163542680795084136.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7700345004688754302.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 446 rows 235 cols 2552 entries
Finished phase 1 with 224 SingleSign rule and 0 generalized
[2026-05-22 21:02:49] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7700345004688754302.kers
Total runtime 4 ms.
[2026-05-22 21:02:49] [INFO ] Implicit Places using invariants in 172 ms returned []
[2026-05-22 21:02:49] [INFO ] Invariant cache hit.
[2026-05-22 21:02:49] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 482 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2026-05-22 21:02:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 8/39 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/681 variables, and 55 constraints, problems are : Problem set: 0 solved, 445 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/235 constraints, PredecessorRefiner: 445/445 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 445 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (OVERLAPS) 1/235 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 44/55 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 7 (OVERLAPS) 446/681 variables, 235/305 constraints. Problems are: Problem set: 2 solved, 443 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/681 variables, and 748 constraints, problems are : Problem set: 2 solved, 443 unsolved in 30172 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 235/235 constraints, PredecessorRefiner: 443/445 constraints, Known Traps: 59/59 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60590ms problems are : Problem set: 2 solved, 443 unsolved
Search for dead transitions found 2 dead transitions in 60592ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 235/256 places, 444/611 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 234 transition count 444
Applied a total of 1 rules in 4 ms. Remains 234 /235 variables (removed 1) and now considering 444/444 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9051192489592156150.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-303027101508554571.kers'
[2026-05-22 21:03:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9051192489592156150.kers, --Pflows, --basisKERS=/tmp/petrispot-output-303027101508554571.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 444 rows 234 cols 2546 entries
Finished phase 1 with 223 SingleSign rule and 0 generalized
[2026-05-22 21:03:50] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-303027101508554571.kers
Total runtime 3 ms.
[2026-05-22 21:03:50] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-22 21:03:50] [INFO ] Invariant cache hit.
[2026-05-22 21:03:50] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 234/256 places, 444/611 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61549 ms. Remains : 234/256 places, 444/611 transitions.
[2026-05-22 21:03:50] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:03:50] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:03:50] [INFO ] Input system was already deterministic with 444 transitions.
[2026-05-22 21:03:50] [INFO ] Flatten gal took : 18 ms
[2026-05-22 21:03:50] [INFO ] Flatten gal took : 18 ms
[2026-05-22 21:03:50] [INFO ] Time to serialize gal into /tmp/CTLFireability11085044808776294617.gal : 5 ms
[2026-05-22 21:03:50] [INFO ] Time to serialize properties into /tmp/CTLFireability13014589755786259487.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/CTLFireability11085044808776294617.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13014589755786259487.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.
Detected timeout of ITS tools.
[2026-05-22 21:04:20] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:04:20] [INFO ] Applying decomposition
[2026-05-22 21:04:20] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14676167485373893058.txt' '-o' '/tmp/graph14676167485373893058.bin' '-w' '/tmp/graph14676167485373893058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14676167485373893058.bin' '-l' '-1' '-v' '-w' '/tmp/graph14676167485373893058.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:04:20] [INFO ] Decomposing Gal with order
[2026-05-22 21:04:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:04:20] [INFO ] Removed a total of 836 redundant transitions.
[2026-05-22 21:04:20] [INFO ] Flatten gal took : 32 ms
[2026-05-22 21:04:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 7 ms.
[2026-05-22 21:04:20] [INFO ] Time to serialize gal into /tmp/CTLFireability16302040059177384973.gal : 4 ms
[2026-05-22 21:04:20] [INFO ] Time to serialize properties into /tmp/CTLFireability6846655799566357711.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/CTLFireability16302040059177384973.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6846655799566357711.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.03205e+12,0.280118,11324,788,112,14819,1460,575,18783,86,5406,0


Converting to forward existential form...Done !
original formula: EX((((!(E(((i8.i0.u51.p169==1)||(((u1.p6==1)&&(u1.p18==1))&&((i2.i1.u16.p51==1)&&(u1.p246==1)))) U ((((i4.u54.p182==1)&&(u1.p6==1))&&((u1...866
=> equivalent forward existential formula: (([(FwdU((EY(Init) * (!(E(((i8.i0.u51.p169==1)||(((u1.p6==1)&&(u1.p18==1))&&((i2.i1.u16.p51==1)&&(u1.p246==1))))...1733
Reverse transition relation is NOT exact ! Due to transitions t219, t221, t226, t274, t298, t334, t364, t441, i1.t187, i1.u20.t167, i1.u29.t168, i2.i2.t212...817
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,11.5402,289696,1,0,741493,3705,4724,592593,492,22821,815020
FORMULA AutonomousCar-PT-06b-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Graph (trivial) has 210 edges and 256 vertex of which 4 / 256 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 91 place count 253 transition count 518
Reduce places removed 90 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 122 rules applied. Total rules applied 213 place count 163 transition count 486
Reduce places removed 19 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 22 rules applied. Total rules applied 235 place count 144 transition count 483
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 240 place count 141 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 241 place count 140 transition count 481
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 241 place count 140 transition count 473
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 257 place count 132 transition count 473
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 268 place count 121 transition count 462
Iterating global reduction 5 with 11 rules applied. Total rules applied 279 place count 121 transition count 462
Ensure Unique test removed 145 transitions
Reduce isomorphic transitions removed 145 transitions.
Iterating post reduction 5 with 145 rules applied. Total rules applied 424 place count 121 transition count 317
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 427 place count 118 transition count 299
Iterating global reduction 6 with 3 rules applied. Total rules applied 430 place count 118 transition count 299
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 3 rules applied. Total rules applied 433 place count 118 transition count 296
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 117 transition count 296
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 8 with 62 rules applied. Total rules applied 496 place count 86 transition count 265
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 501 place count 81 transition count 239
Iterating global reduction 8 with 5 rules applied. Total rules applied 506 place count 81 transition count 239
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 512 place count 81 transition count 233
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 515 place count 78 transition count 233
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 516 place count 78 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 518 place count 76 transition count 230
Applied a total of 518 rules in 48 ms. Remains 76 /256 variables (removed 180) and now considering 230/611 (removed 381) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6597327297107727552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2489693606403448293.kers'
[2026-05-22 21:04:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6597327297107727552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2489693606403448293.kers]
Normalized transition count is 229 out of 230 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 229 rows 74 cols 1743 entries
Finished phase 1 with 66 SingleSign rule and 0 generalized
[2026-05-22 21:04:32] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2489693606403448293.kers
Total runtime 2 ms.
[2026-05-22 21:04:32] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 21:04:32] [INFO ] Invariant cache hit.
[2026-05-22 21:04:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:04:32] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [67, 75]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 247 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 74/256 places, 230/611 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 2 place count 73 transition count 229
Applied a total of 2 rules in 6 ms. Remains 73 /74 variables (removed 1) and now considering 229/230 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3586507548809508941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6110250742121485584.kers'
[2026-05-22 21:04:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3586507548809508941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6110250742121485584.kers]
Normalized transition count is 228 out of 229 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 228 rows 72 cols 1739 entries
Finished phase 1 with 65 SingleSign rule and 0 generalized
[2026-05-22 21:04:32] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6110250742121485584.kers
Total runtime 1 ms.
[2026-05-22 21:04:32] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 21:04:32] [INFO ] Invariant cache hit.
[2026-05-22 21:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 21:04:33] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 73/256 places, 229/611 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 506 ms. Remains : 73/256 places, 229/611 transitions.
[2026-05-22 21:04:33] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:04:33] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:04:33] [INFO ] Input system was already deterministic with 229 transitions.
[2026-05-22 21:04:33] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:04:33] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:04:33] [INFO ] Time to serialize gal into /tmp/CTLFireability14122086763769585510.gal : 2 ms
[2026-05-22 21:04:33] [INFO ] Time to serialize properties into /tmp/CTLFireability1133775399781301610.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/CTLFireability14122086763769585510.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1133775399781301610.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73316e+07,27.9607,573328,2,20773,5,2.18535e+06,6,0,518,1.80556e+06,0


Converting to forward existential form...Done !
Detected timeout of ITS tools.
[2026-05-22 21:05:03] [INFO ] Flatten gal took : 9 ms
[2026-05-22 21:05:03] [INFO ] Applying decomposition
[2026-05-22 21:05:03] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15711552765243694213.txt' '-o' '/tmp/graph15711552765243694213.bin' '-w' '/tmp/graph15711552765243694213.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15711552765243694213.bin' '-l' '-1' '-v' '-w' '/tmp/graph15711552765243694213.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:05:03] [INFO ] Decomposing Gal with order
[2026-05-22 21:05:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:05:03] [INFO ] Removed a total of 682 redundant transitions.
[2026-05-22 21:05:03] [INFO ] Flatten gal took : 17 ms
[2026-05-22 21:05:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2026-05-22 21:05:03] [INFO ] Time to serialize gal into /tmp/CTLFireability5667201714253637248.gal : 1 ms
[2026-05-22 21:05:03] [INFO ] Time to serialize properties into /tmp/CTLFireability17847660804267692568.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/CTLFireability5667201714253637248.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17847660804267692568.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,6.73316e+07,0.326146,15420,916,104,19932,1284,329,56815,79,9742,0


Converting to forward existential form...Done !
original formula: A(!(AF((i6.i0.u23.p271==1))) U (((i6.i0.u22.p229==1) * AG(((!((i3.u10.p145==1)||(((u0.p6==1)&&(u0.p15==1))&&((i0.u14.p179==1)&&(u0.p246==...383
=> equivalent forward existential formula: [((Init * !(EG(!((((i6.i0.u22.p229==1) * !(E(TRUE U !(((!((i3.u10.p145==1)||(((u0.p6==1)&&(u0.p15==1))&&((i0.u14...1369
Reverse transition relation is NOT exact ! Due to transitions t69, t128, t134, t140, t146, t158, t170, t188, t194, t212, t218, t224, t227, i0.u1.t44, i0.u7...535
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Detected timeout of ITS tools.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 611/611 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 243 transition count 598
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 243 transition count 598
Ensure Unique test removed 144 transitions
Reduce isomorphic transitions removed 144 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 170 place count 243 transition count 454
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 175 place count 238 transition count 449
Iterating global reduction 1 with 5 rules applied. Total rules applied 180 place count 238 transition count 449
Applied a total of 180 rules in 9 ms. Remains 238 /256 variables (removed 18) and now considering 449/611 (removed 162) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11458597733989883986.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1065907711556628063.kers'
[2026-05-22 21:05:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11458597733989883986.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1065907711556628063.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 449 rows 238 cols 2558 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-22 21:05:33] [INFO ] Computed 11 invariants in 2 ms
Computed 11 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1065907711556628063.kers
Total runtime 3 ms.
[2026-05-22 21:05:33] [INFO ] Implicit Places using invariants in 111 ms returned []
[2026-05-22 21:05:33] [INFO ] Invariant cache hit.
[2026-05-22 21:05:33] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2026-05-22 21:05:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/51 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 13/64 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/687 variables, and 67 constraints, problems are : Problem set: 0 solved, 448 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 0/238 constraints, PredecessorRefiner: 448/448 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/237 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (OVERLAPS) 1/238 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 56/67 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 3/77 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 3/80 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Problem TDEAD10 is UNSAT
At refinement iteration 7 (OVERLAPS) 449/687 variables, 238/318 constraints. Problems are: Problem set: 1 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 687/687 variables, and 765 constraints, problems are : Problem set: 1 solved, 447 unsolved in 30273 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 238/238 constraints, PredecessorRefiner: 447/448 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60794ms problems are : Problem set: 1 solved, 447 unsolved
Search for dead transitions found 1 dead transitions in 60797ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 238/256 places, 448/611 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 237 transition count 448
Applied a total of 1 rules in 4 ms. Remains 237 /238 variables (removed 1) and now considering 448/448 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4439028649725037406.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7692597630602887522.kers'
[2026-05-22 21:06:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4439028649725037406.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7692597630602887522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 237 cols 2555 entries
Finished phase 1 with 227 SingleSign rule and 0 generalized
[2026-05-22 21:06:34] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7692597630602887522.kers
Total runtime 3 ms.
[2026-05-22 21:06:34] [INFO ] Implicit Places using invariants in 126 ms returned []
[2026-05-22 21:06:34] [INFO ] Invariant cache hit.
[2026-05-22 21:06:35] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 237/256 places, 448/611 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61652 ms. Remains : 237/256 places, 448/611 transitions.
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 10 ms
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:06:35] [INFO ] Input system was already deterministic with 448 transitions.
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:06:35] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:06:35] [INFO ] Time to serialize gal into /tmp/CTLFireability10277029829553180495.gal : 3 ms
[2026-05-22 21:06:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6171291238515876598.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/CTLFireability10277029829553180495.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6171291238515876598.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.
Detected timeout of ITS tools.
[2026-05-22 21:07:05] [INFO ] Flatten gal took : 11 ms
[2026-05-22 21:07:05] [INFO ] Applying decomposition
[2026-05-22 21:07:05] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5234995137465351490.txt' '-o' '/tmp/graph5234995137465351490.bin' '-w' '/tmp/graph5234995137465351490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5234995137465351490.bin' '-l' '-1' '-v' '-w' '/tmp/graph5234995137465351490.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:07:05] [INFO ] Decomposing Gal with order
[2026-05-22 21:07:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:07:05] [INFO ] Removed a total of 848 redundant transitions.
[2026-05-22 21:07:05] [INFO ] Flatten gal took : 43 ms
[2026-05-22 21:07:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 7 ms.
[2026-05-22 21:07:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4059540571048494007.gal : 5 ms
[2026-05-22 21:07:05] [INFO ] Time to serialize properties into /tmp/CTLFireability10525225732458782866.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/CTLFireability4059540571048494007.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10525225732458782866.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.0653e+12,0.442717,12504,1034,116,18284,1389,538,18631,86,4377,0


Converting to forward existential form...Done !
original formula: EX(A((i13.i1.u60.p192==1) U (((AF(((((i3.u17.p56==1)&&(i4.i1.u29.p93==1))&&((i8.u38.p124==1)&&(i9.i1.u48.p155==1)))&&(((i12.i1.u58.p186==...503
=> equivalent forward existential formula: [((EY(Init) * !(EG(!((((!(EG(!(((((i3.u17.p56==1)&&(i4.i1.u29.p93==1))&&((i8.u38.p124==1)&&(i9.i1.u48.p155==1)))...1526
Reverse transition relation is NOT exact ! Due to transitions t222, t224, t226, t250, t274, t304, t334, t364, t445, i3.t215, i3.u12.t195, i3.u17.t199, i3.u...817
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 17
Detected timeout of ITS tools.
[2026-05-22 21:07:35] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:07:35] [INFO ] Flatten gal took : 15 ms
[2026-05-22 21:07:35] [INFO ] Applying decomposition
[2026-05-22 21:07:35] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4962653958552456687.txt' '-o' '/tmp/graph4962653958552456687.bin' '-w' '/tmp/graph4962653958552456687.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4962653958552456687.bin' '-l' '-1' '-v' '-w' '/tmp/graph4962653958552456687.weights' '-q' '0' '-e' '0.001'
[2026-05-22 21:07:35] [INFO ] Decomposing Gal with order
[2026-05-22 21:07:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:07:35] [INFO ] Removed a total of 1226 redundant transitions.
[2026-05-22 21:07:35] [INFO ] Flatten gal took : 49 ms
[2026-05-22 21:07:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 39 labels/synchronizations in 5 ms.
[2026-05-22 21:07:35] [INFO ] Time to serialize gal into /tmp/CTLFireability6181087857310894954.gal : 4 ms
[2026-05-22 21:07:35] [INFO ] Time to serialize properties into /tmp/CTLFireability13608900172115166793.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/CTLFireability6181087857310894954.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13608900172115166793.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9489e+12,64.556,896920,4411,116,551641,2688,725,9.86694e+06,106,13649,0


Converting to forward existential form...Done !
original formula: (EG((((EG((((i3.u83.p6==0)||(i3.u83.p9==0))||((i9.u58.p175==0)||(i3.u83.p246==0)))) + (i3.u83.p6==0)) + ((i3.u83.p16==0)||(i7.i1.u47.p144...424
=> equivalent forward existential formula: ([(FwdU((((FwdU((Init * EG((((EG((((i3.u83.p6==0)||(i3.u83.p9==0))||((i9.u58.p175==0)||(i3.u83.p246==0)))) + (i3...884
Reverse transition relation is NOT exact ! Due to transitions t56, t119, t156, t177, t203, t239, t241, t296, t356, t392, t464, t524, t608, i0.i1.t26, i2.i2...830
ITS-tools command line returned an error code 139
[2026-05-22 21:19:50] [INFO ] Applying decomposition
[2026-05-22 21:19:50] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:19:50] [INFO ] Decomposing Gal with order
[2026-05-22 21:19:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 21:19:50] [INFO ] Removed a total of 1559 redundant transitions.
[2026-05-22 21:19:50] [INFO ] Flatten gal took : 43 ms
[2026-05-22 21:19:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 6 ms.
[2026-05-22 21:19:50] [INFO ] Time to serialize gal into /tmp/CTLFireability13677392383542989195.gal : 2 ms
[2026-05-22 21:19:50] [INFO ] Time to serialize properties into /tmp/CTLFireability12189064518215184145.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/CTLFireability13677392383542989195.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12189064518215184145.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9489e+12,0.145615,6804,483,841,2740,2608,230,7046,301,12689,0


Converting to forward existential form...Done !
original formula: (EG((((EG((((i0.u2.p6==0)||(i0.u3.p9==0))||((i1.i0.i0.i0.u15.p175==0)||(i1.i0.u17.p246==0)))) + (i0.u2.p6==0)) + ((i0.u3.p16==0)||(i1.i0....512
=> equivalent forward existential formula: ([(FwdU((((FwdU((Init * EG((((EG((((i0.u2.p6==0)||(i0.u3.p9==0))||((i1.i0.i0.i0.u15.p175==0)||(i1.i0.u17.p246==0...1030
Reverse transition relation is NOT exact ! Due to transitions t402, t403, i0.u2.t241, i0.u2.t243, i0.u3.t239, i1.t608, i1.i0.u17.t36, i1.i0.u17.t40, i1.i0....1360
Using saturation style SCC detection
ITS-tools command line returned an error code 139
[2026-05-22 21:32:05] [INFO ] Flatten gal took : 16 ms
[2026-05-22 21:32:05] [INFO ] Input system was already deterministic with 611 transitions.
[2026-05-22 21:32:05] [INFO ] Transformed 256 places.
[2026-05-22 21:32:05] [INFO ] Transformed 611 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-22 21:32:05] [INFO ] Time to serialize gal into /tmp/CTLFireability13314482496889831143.gal : 4 ms
[2026-05-22 21:32:05] [INFO ] Time to serialize properties into /tmp/CTLFireability12864143128748900529.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/CTLFireability13314482496889831143.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12864143128748900529.ctl' '--load-order' '/home/mcc/execution/model.ord' '--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 -...330
Successfully loaded order from file /home/mcc/execution/model.ord
No direction supplied, using forward translation only.
Parsed 7 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.9489e+12,17.6637,364044,2,149241,5,1.81993e+06,6,0,1637,881893,0


Converting to forward existential form...Done !
original formula: (EG((((EG((((p6==0)||(p9==0))||((p175==0)||(p246==0)))) + (p6==0)) + ((p16==0)||(p144==0))) + ((p246==0) + ((p123==0) * EX((((p6==0)||(p1...279
=> equivalent forward existential formula: ([(FwdU((((FwdU((Init * EG((((EG((((p6==0)||(p9==0))||((p175==0)||(p246==0)))) + (p6==0)) + ((p16==0)||(p144==0)...614
Reverse transition relation is NOT exact ! Due to transitions t11, t17, t18, t26, t36, t40, t41, t56, t70, t71, t74, t76, t77, t78, t81, t93, t99, t100, t1...818

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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