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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.9K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:18 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 75K 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-03b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779474711274

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-03b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 18:31:53] [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 18:31:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:31:54] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2026-05-22 18:31:54] [INFO ] Transformed 190 places.
[2026-05-22 18:31:54] [INFO ] Transformed 273 transitions.
[2026-05-22 18:31:54] [INFO ] Found NUPN structural information;
[2026-05-22 18:31:54] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 379 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 18 ms.
Support contains 91 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 182 transition count 265
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 182 transition count 265
Applied a total of 16 rules in 46 ms. Remains 182 /190 variables (removed 8) and now considering 265/273 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7066068148298697579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3151450399750753502.kers'
[2026-05-22 18:31:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7066068148298697579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3151450399750753502.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 265 rows 182 cols 1035 entries
Finished phase 1 with 174 SingleSign rule and 0 generalized
[2026-05-22 18:31:54] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3151450399750753502.kers
Total runtime 4 ms.
[2026-05-22 18:31:54] [INFO ] Implicit Places using invariants in 449 ms returned []
[2026-05-22 18:31:54] [INFO ] Invariant cache hit.
[2026-05-22 18:31:55] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 863 ms to find 0 implicit places.
Running 264 sub problems to find dead transitions.
[2026-05-22 18:31:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 1 (OVERLAPS) 1/182 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 11/39 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 3/42 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 264 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 264 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD248 is UNSAT
At refinement iteration 7 (OVERLAPS) 265/447 variables, 182/226 constraints. Problems are: Problem set: 2 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 447/447 variables, and 226 constraints, problems are : Problem set: 2 solved, 262 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 264/264 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 2/182 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/182 variables, 36/44 constraints. Problems are: Problem set: 2 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 262 unsolved
At refinement iteration 4 (OVERLAPS) 265/447 variables, 182/226 constraints. Problems are: Problem set: 2 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/447 variables, 262/488 constraints. Problems are: Problem set: 2 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/447 variables, 6/494 constraints. Problems are: Problem set: 2 solved, 262 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 447/447 variables, and 494 constraints, problems are : Problem set: 2 solved, 262 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 182/182 constraints, PredecessorRefiner: 262/264 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60533ms problems are : Problem set: 2 solved, 262 unsolved
Search for dead transitions found 2 dead transitions in 60565ms
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 : 182/190 places, 263/273 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 9 ms. Remains 182 /182 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61578 ms. Remains : 182/190 places, 263/273 transitions.
Starting structural reductions in LTL mode, iteration 0 : 182/182 places, 263/263 transitions.
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 0 rules in 8 ms. Remains 182 /182 variables (removed 0) and now considering 263/263 (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-1293143677677418061.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13240029971864151229.kers'
[2026-05-22 18:32:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1293143677677418061.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13240029971864151229.kers]
Culling trivial invariants: removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 263 rows 181 cols 1029 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-22 18:32:55] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13240029971864151229.kers
Total runtime 3 ms.
[2026-05-22 18:32:55] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 18:32:55] [INFO ] Invariant cache hit.
[2026-05-22 18:32:56] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-22 18:32:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 12/40 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/444 variables, 181/230 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/445 variables, and 231 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 181/182 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/180 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (OVERLAPS) 1/181 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 41/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/444 variables, 181/235 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 262/497 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/445 variables, and 499 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 8/9 constraints, State Equation: 181/182 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60209ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Finished structural reductions in LTL mode , in 1 iterations and 60503 ms. Remains : 182/182 places, 263/263 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Support contains 90 out of 181 places after structural reductions.
[2026-05-22 18:33:56] [INFO ] Flatten gal took : 105 ms
[2026-05-22 18:33:56] [INFO ] Flatten gal took : 52 ms
[2026-05-22 18:33:56] [INFO ] Input system was already deterministic with 263 transitions.
Reduction of identical properties reduced properties to check from 93 to 92
RANDOM walk for 40000 steps (28 resets) in 2825 ms. (14 steps per ms) remains 14/92 properties
BEST_FIRST walk for 40001 steps (64 resets) in 670 ms. (59 steps per ms) remains 7/14 properties
BEST_FIRST walk for 40001 steps (67 resets) in 337 ms. (118 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40000 steps (22 resets) in 219 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (20 resets) in 189 ms. (210 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (41 resets) in 138 ms. (287 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (118 resets) in 201 ms. (198 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (106 resets) in 130 ms. (305 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (78 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7094016150135558031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7939052393235658913.kers'
[2026-05-22 18:33:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7094016150135558031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7939052393235658913.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 181 cols 1029 entries
Finished phase 1 with 173 SingleSign rule and 0 generalized
[2026-05-22 18:33:58] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7939052393235658913.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp80 is UNSAT
At refinement iteration 1 (OVERLAPS) 167/181 variables, 8/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp24 is UNSAT
At refinement iteration 3 (OVERLAPS) 263/444 variables, 181/189 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 1/190 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/444 variables, 1/191 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/444 variables, 0/191 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 191 constraints, problems are : Problem set: 3 solved, 1 unsolved in 618 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 111/116 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 65/181 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/9 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 2/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 263/444 variables, 181/192 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/193 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 1/194 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/444 variables, 1/195 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 1/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/444 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/444 variables, 0/196 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 196 constraints, problems are : Problem set: 3 solved, 1 unsolved in 773 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1418ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 5 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 263/263 transitions.
Graph (trivial) has 166 edges and 181 vertex of which 4 / 181 are part of one of the 2 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 424 edges and 179 vertex of which 172 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.2 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 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 79 rules applied. Total rules applied 81 place count 172 transition count 175
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 183 place count 95 transition count 150
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 15 rules applied. Total rules applied 198 place count 81 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 80 transition count 149
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 199 place count 80 transition count 143
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 211 place count 74 transition count 143
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 223 place count 62 transition count 131
Iterating global reduction 4 with 12 rules applied. Total rules applied 235 place count 62 transition count 131
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 271 place count 62 transition count 95
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 271 place count 62 transition count 94
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 273 place count 61 transition count 94
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 274 place count 60 transition count 91
Iterating global reduction 5 with 1 rules applied. Total rules applied 275 place count 60 transition count 91
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 5 with 2 rules applied. Total rules applied 277 place count 60 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 278 place count 59 transition count 89
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 322 place count 37 transition count 67
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 327 place count 32 transition count 51
Iterating global reduction 7 with 5 rules applied. Total rules applied 332 place count 32 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 333 place count 32 transition count 50
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 337 place count 30 transition count 68
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 339 place count 30 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 341 place count 28 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 342 place count 27 transition count 65
Applied a total of 342 rules in 95 ms. Remains 27 /181 variables (removed 154) and now considering 65/263 (removed 198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 27/181 places, 65/263 transitions.
RANDOM walk for 34553 steps (2063 resets) in 339 ms. (101 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-22 18:34:00] [INFO ] Flatten gal took : 37 ms
[2026-05-22 18:34:00] [INFO ] Flatten gal took : 41 ms
[2026-05-22 18:34:00] [INFO ] Input system was already deterministic with 263 transitions.
Support contains 86 out of 181 places (down from 87) after GAL structural reductions.
Computed a total of 40 stabilizing places and 40 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 159 transition count 241
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 159 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 80 place count 159 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 154 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 153 transition count 199
Applied a total of 92 rules in 37 ms. Remains 153 /181 variables (removed 28) and now considering 199/263 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13540590835822050298.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15596491222268230625.kers'
[2026-05-22 18:34:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13540590835822050298.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15596491222268230625.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 153 cols 685 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-22 18:34:00] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15596491222268230625.kers
Total runtime 2 ms.
[2026-05-22 18:34:00] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 18:34:00] [INFO ] Invariant cache hit.
[2026-05-22 18:34:00] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-22 18:34:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 197 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/194 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/392 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 2/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60073ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 153/181 places, 199/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60364 ms. Remains : 153/181 places, 199/263 transitions.
[2026-05-22 18:35:00] [INFO ] Flatten gal took : 16 ms
[2026-05-22 18:35:00] [INFO ] Flatten gal took : 15 ms
[2026-05-22 18:35:00] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-22 18:35:00] [INFO ] Flatten gal took : 13 ms
[2026-05-22 18:35:00] [INFO ] Flatten gal took : 12 ms
[2026-05-22 18:35:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3729601904428718133.gal : 8 ms
[2026-05-22 18:35:00] [INFO ] Time to serialize properties into /tmp/CTLFireability5756550050826374934.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability3729601904428718133.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5756550050826374934.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,4.9176e+07,1.85954,42460,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: E(A(((p26!=1) * E(EF((p52==1)) U AX((((p6==1)&&(p9==1))&&((p80==1)&&(p147==1)))))) U !(AG((p21==1)))) U EG((((!(EF((p181==1))) * (p50==1)...196
=> equivalent forward existential formula: [FwdG(FwdU(Init,!((E(!(!(!(E(TRUE U !((p21==1)))))) U (!(((p26!=1) * E(E(TRUE U (p52==1)) U !(EX(!((((p6==1)&&(p...353
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
(forward)formula 0,1,23.0107,520296,1,0,612,2.80918e+06,438,243,5989,2.58499e+06,713
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 155 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 200
Applied a total of 90 rules in 16 ms. Remains 154 /181 variables (removed 27) and now considering 200/263 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7603625224575334438.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10626801190714852389.kers'
[2026-05-22 18:35:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7603625224575334438.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10626801190714852389.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 18:35:24] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10626801190714852389.kers
Total runtime 1 ms.
[2026-05-22 18:35:24] [INFO ] Implicit Places using invariants in 83 ms returned []
[2026-05-22 18:35:24] [INFO ] Invariant cache hit.
[2026-05-22 18:35:24] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 18:35:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (OVERLAPS) 0/354 variables, 1/199 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/354 variables, and 199 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/196 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/395 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/402 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 405 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60062ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 154/181 places, 200/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60337 ms. Remains : 154/181 places, 200/263 transitions.
[2026-05-22 18:36:24] [INFO ] Flatten gal took : 20 ms
[2026-05-22 18:36:24] [INFO ] Flatten gal took : 19 ms
[2026-05-22 18:36:24] [INFO ] Input system was already deterministic with 200 transitions.
[2026-05-22 18:36:24] [INFO ] Flatten gal took : 18 ms
[2026-05-22 18:36:24] [INFO ] Flatten gal took : 18 ms
[2026-05-22 18:36:24] [INFO ] Time to serialize gal into /tmp/CTLFireability15362197993665493576.gal : 6 ms
[2026-05-22 18:36:24] [INFO ] Time to serialize properties into /tmp/CTLFireability10079181923863665367.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/CTLFireability15362197993665493576.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10079181923863665367.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.11971e+07,2.82144,62772,2,6758,5,223526,6,0,818,301323,0


Converting to forward existential form...Done !
original formula: A((p27==1) U (E(AF(AX((((p6==1)&&(p15==1))&&((p76==1)&&(p147==1))))) U (((p6==1)&&(p14==1))&&((p95==1)&&(p147==1)))) + (p30==1)))
=> equivalent forward existential formula: [((Init * !(EG(!((E(!(EG(!(!(EX(!((((p6==1)&&(p15==1))&&((p76==1)&&(p147==1))))))))) U (((p6==1)&&(p14==1))&&((p...490
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Using saturation style SCC detection
Detected timeout of ITS tools.
[2026-05-22 18:36:54] [INFO ] Flatten gal took : 12 ms
[2026-05-22 18:36:54] [INFO ] Applying decomposition
[2026-05-22 18:36:54] [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/graph9171653069610967875.txt' '-o' '/tmp/graph9171653069610967875.bin' '-w' '/tmp/graph9171653069610967875.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9171653069610967875.bin' '-l' '-1' '-v' '-w' '/tmp/graph9171653069610967875.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:36:54] [INFO ] Decomposing Gal with order
[2026-05-22 18:36:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:36:54] [INFO ] Removed a total of 119 redundant transitions.
[2026-05-22 18:36:55] [INFO ] Flatten gal took : 97 ms
[2026-05-22 18:36:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 17 ms.
[2026-05-22 18:36:55] [INFO ] Time to serialize gal into /tmp/CTLFireability8208142599683284658.gal : 7 ms
[2026-05-22 18:36:55] [INFO ] Time to serialize properties into /tmp/CTLFireability15638431908226216165.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/CTLFireability8208142599683284658.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15638431908226216165.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,5.11971e+07,0.058278,5580,383,80,2589,488,384,3273,71,1153,0


Converting to forward existential form...Done !
original formula: A((i0.u6.p27==1) U (E(AF(AX((((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i5.u23.p76==1)&&(i10.u1.p147==1))))) U (((i10.u1.p6==1)&&(i10.u1.p14==1...219
=> equivalent forward existential formula: [((Init * !(EG(!((E(!(EG(!(!(EX(!((((i10.u1.p6==1)&&(i10.u1.p15==1))&&((i5.u23.p76==1)&&(i10.u1.p147==1)))))))))...694
Reverse transition relation is NOT exact ! Due to transitions t146, t167, t179, t197, i1.i2.t135, i1.i2.u9.t114, i1.i2.u17.t115, i2.u15.t118, i2.u15.t119, ...539
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 a local SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
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 a local SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an 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 a local SCC at level 11
Fast SCC detection found an 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,4.62,132428,1,0,258415,1628,2108,404945,372,7875,263937
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 161 transition count 243
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 161 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 161 transition count 207
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 156 transition count 202
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 156 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 155 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 155 transition count 201
Applied a total of 88 rules in 18 ms. Remains 155 /181 variables (removed 26) and now considering 201/263 (removed 62) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16454864818837282254.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16625899466256784373.kers'
[2026-05-22 18:36:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16454864818837282254.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16625899466256784373.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 201 rows 155 cols 689 entries
Finished phase 1 with 147 SingleSign rule and 0 generalized
[2026-05-22 18:36:59] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16625899466256784373.kers
Total runtime 3 ms.
[2026-05-22 18:36:59] [INFO ] Implicit Places using invariants in 121 ms returned []
[2026-05-22 18:36:59] [INFO ] Invariant cache hit.
[2026-05-22 18:37:00] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
Running 200 sub problems to find dead transitions.
[2026-05-22 18:37:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 17/25 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/155 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/155 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (OVERLAPS) 201/356 variables, 155/188 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 2/191 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 356/356 variables, and 194 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 28/28 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 200 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 1 (OVERLAPS) 1/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 28/36 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/155 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 4 (OVERLAPS) 201/356 variables, 155/191 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/356 variables, 200/391 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/356 variables, 1/392 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/356 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 200 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 200 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 356/356 variables, and 398 constraints, problems are : Problem set: 0 solved, 200 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 155/155 constraints, PredecessorRefiner: 200/200 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60067ms problems are : Problem set: 0 solved, 200 unsolved
Search for dead transitions found 0 dead transitions in 60069ms
Starting structural reductions in LTL mode, iteration 1 : 155/181 places, 201/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60426 ms. Remains : 155/181 places, 201/263 transitions.
[2026-05-22 18:38:00] [INFO ] Flatten gal took : 12 ms
[2026-05-22 18:38:00] [INFO ] Flatten gal took : 10 ms
[2026-05-22 18:38:00] [INFO ] Input system was already deterministic with 201 transitions.
[2026-05-22 18:38:00] [INFO ] Flatten gal took : 9 ms
[2026-05-22 18:38:00] [INFO ] Flatten gal took : 9 ms
[2026-05-22 18:38:00] [INFO ] Time to serialize gal into /tmp/CTLFireability3262420419440219673.gal : 2 ms
[2026-05-22 18:38:00] [INFO ] Time to serialize properties into /tmp/CTLFireability6926090840523606757.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/CTLFireability3262420419440219673.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6926090840523606757.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,5.32181e+07,2.64135,64656,2,6924,5,234500,6,0,823,316338,0


Converting to forward existential form...Done !
original formula: (EX(EG((p143==0))) + (EG(EX((p16==1))) * !(E((p29==1) U (A((((p6==1)&&(p13==1))&&((p147==1)&&(p176==1))) U (((p6==1)&&(p15==1))&&((p76==1...200
=> equivalent forward existential formula: ([((Init * !(EX(EG((p143==0))))) * !(EG(EX((p16==1)))))] = FALSE * [(((FwdU((Init * !(EX(EG((p143==0))))),(p29==...412
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Detected timeout of ITS tools.
[2026-05-22 18:38:30] [INFO ] Flatten gal took : 14 ms
[2026-05-22 18:38:30] [INFO ] Applying decomposition
[2026-05-22 18:38:30] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14454210981565603165.txt' '-o' '/tmp/graph14454210981565603165.bin' '-w' '/tmp/graph14454210981565603165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14454210981565603165.bin' '-l' '-1' '-v' '-w' '/tmp/graph14454210981565603165.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:38:30] [INFO ] Decomposing Gal with order
[2026-05-22 18:38:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:38:30] [INFO ] Removed a total of 120 redundant transitions.
[2026-05-22 18:38:30] [INFO ] Flatten gal took : 22 ms
[2026-05-22 18:38:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 6 ms.
[2026-05-22 18:38:30] [INFO ] Time to serialize gal into /tmp/CTLFireability11500608666938201027.gal : 5 ms
[2026-05-22 18:38:30] [INFO ] Time to serialize properties into /tmp/CTLFireability2999214645983398160.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/CTLFireability11500608666938201027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2999214645983398160.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,5.32181e+07,0.084715,6328,382,78,3781,458,402,6812,72,1948,0


Converting to forward existential form...Done !
original formula: (EX(EG((i0.u37.p143==0))) + (EG(EX((i0.u0.p16==1))) * !(E((i4.i0.u8.p29==1) U (A((((i1.u2.p6==1)&&(i1.u2.p13==1))&&((i1.u2.p147==1)&&(i14...292
=> equivalent forward existential formula: ([((Init * !(EX(EG((i0.u37.p143==0))))) * !(EG(EX((i0.u0.p16==1)))))] = FALSE * [(((FwdU((Init * !(EX(EG((i0.u37...567
Reverse transition relation is NOT exact ! Due to transitions t149, t170, t179, t198, i0.u37.t32, i0.u37.t35, i0.u37.t36, i0.u37.t37, i1.t145, i1.t143, i4....527
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
(forward)formula 0,1,5.91327,185096,1,0,359530,2320,2731,472575,404,18194,411044
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 155 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 200
Applied a total of 90 rules in 11 ms. Remains 154 /181 variables (removed 27) and now considering 200/263 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2265762286896796120.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13165985428524698158.kers'
[2026-05-22 18:38:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2265762286896796120.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13165985428524698158.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 18:38:36] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-13165985428524698158.kers
Total runtime 3 ms.
[2026-05-22 18:38:36] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 18:38:36] [INFO ] Invariant cache hit.
[2026-05-22 18:38:36] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 18:38:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/192 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 2/196 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/354 variables, and 198 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 33/41 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/195 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/394 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 403 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 154/181 places, 200/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60388 ms. Remains : 154/181 places, 200/263 transitions.
[2026-05-22 18:39:36] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:39:36] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:39:36] [INFO ] Input system was already deterministic with 200 transitions.
[2026-05-22 18:39:36] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:39:36] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:39:36] [INFO ] Time to serialize gal into /tmp/CTLFireability15772536006058805343.gal : 4 ms
[2026-05-22 18:39:36] [INFO ] Time to serialize properties into /tmp/CTLFireability2398697043580648336.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/CTLFireability15772536006058805343.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2398697043580648336.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,5.11971e+07,1.85351,50816,2,6141,5,181347,6,0,818,243522,0


Converting to forward existential form...Done !
original formula: (AG(E((p143==1) U (EX(EX((p36==1))) + AX((p92!=1))))) * A((EX((((p6==1)&&(p15==1))&&((p80==1)&&(p147==1)))) * (p77==1)) U !((((EG(((p70==...359
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((p143==1) U (EX(EX((p36==1))) + !(EX(!((p92!=1))))))))] = FALSE * ([(((FwdU(Init,!(!(((...1081
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t84, t90, t91, t94, t95, t97...371
Detected timeout of ITS tools.
[2026-05-22 18:40:06] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:40:06] [INFO ] Applying decomposition
[2026-05-22 18:40:06] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16836760347427009870.txt' '-o' '/tmp/graph16836760347427009870.bin' '-w' '/tmp/graph16836760347427009870.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16836760347427009870.bin' '-l' '-1' '-v' '-w' '/tmp/graph16836760347427009870.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:40:06] [INFO ] Decomposing Gal with order
[2026-05-22 18:40:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:40:06] [INFO ] Removed a total of 120 redundant transitions.
[2026-05-22 18:40:06] [INFO ] Flatten gal took : 16 ms
[2026-05-22 18:40:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2026-05-22 18:40:06] [INFO ] Time to serialize gal into /tmp/CTLFireability1843272246452250491.gal : 3 ms
[2026-05-22 18:40:06] [INFO ] Time to serialize properties into /tmp/CTLFireability14105678639925073817.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/CTLFireability1843272246452250491.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14105678639925073817.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,5.11971e+07,0.094129,5896,347,74,3114,731,411,4809,72,1925,0


Converting to forward existential form...Done !
original formula: (AG(E((i0.u43.p143==1) U (EX(EX((i2.i0.u10.p36==1))) + AX((i6.u31.p92!=1))))) * A((EX((((i10.u2.p6==1)&&(i10.u2.p15==1))&&((i5.i0.u24.p80...552
=> equivalent forward existential formula: ([(FwdU(Init,TRUE) * !(E((i0.u43.p143==1) U (EX(EX((i2.i0.u10.p36==1))) + !(EX(!((i6.u31.p92!=1))))))))] = FALSE...1590
Reverse transition relation is NOT exact ! Due to transitions t148, t169, t181, t197, i0.u43.t32, i0.u43.t35, i0.u43.t36, i0.u43.t37, i3.t135, i3.u8.t115, ...544
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 a local SCC at level 4
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,3.0595,96456,1,0,202345,2219,2581,264273,388,15119,241909
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 161 transition count 243
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 161 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 161 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 79 place count 158 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 82 place count 158 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 157 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 157 transition count 203
Applied a total of 84 rules in 17 ms. Remains 157 /181 variables (removed 24) and now considering 203/263 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2539349649930698.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8439222265922375140.kers'
[2026-05-22 18:40:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2539349649930698.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8439222265922375140.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 157 cols 693 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-22 18:40:10] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8439222265922375140.kers
Total runtime 2 ms.
[2026-05-22 18:40:10] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 18:40:10] [INFO ] Invariant cache hit.
[2026-05-22 18:40:10] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-22 18:40:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (OVERLAPS) 203/360 variables, 157/194 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (OVERLAPS) 0/360 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 202 unsolved
No progress, stopping.
After SMT solving in domain Real declared 360/360 variables, and 198 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 203/360 variables, 157/199 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 202/401 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 407 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 157/181 places, 203/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60405 ms. Remains : 157/181 places, 203/263 transitions.
[2026-05-22 18:41:10] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:41:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:41:10] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-22 18:41:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:41:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:41:10] [INFO ] Time to serialize gal into /tmp/CTLFireability3896074050955863006.gal : 2 ms
[2026-05-22 18:41:10] [INFO ] Time to serialize properties into /tmp/CTLFireability16192067758348628037.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/CTLFireability3896074050955863006.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16192067758348628037.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,5.38337e+07,2.13667,53756,2,6815,5,194185,6,0,833,256125,0


Converting to forward existential form...Done !
original formula: (E(AG((((p6==1)&&(p9==1))&&((p83==1)&&(p147==1)))) U ((((((p50==1)&&(p81==1))&&((p112==1)&&(p148==1))) + AG(((p162==1)||(p80==1)))) + ((p...375
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !((((p6==1)&&(p9==1))&&((p83==1)&&(p147==1))))))) * (((((p50==1)&&(p81==1))&&((p112==1)...629
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t65, t66, t69, t70, t72, t75, t86, t92, t93, t96, t97, t99...377
Detected timeout of ITS tools.
[2026-05-22 18:41:40] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:41:40] [INFO ] Applying decomposition
[2026-05-22 18:41:40] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9509341131168648026.txt' '-o' '/tmp/graph9509341131168648026.bin' '-w' '/tmp/graph9509341131168648026.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9509341131168648026.bin' '-l' '-1' '-v' '-w' '/tmp/graph9509341131168648026.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:41:40] [INFO ] Decomposing Gal with order
[2026-05-22 18:41:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:41:40] [INFO ] Removed a total of 121 redundant transitions.
[2026-05-22 18:41:40] [INFO ] Flatten gal took : 33 ms
[2026-05-22 18:41:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 4 ms.
[2026-05-22 18:41:40] [INFO ] Time to serialize gal into /tmp/CTLFireability5770068180217779050.gal : 5 ms
[2026-05-22 18:41:40] [INFO ] Time to serialize properties into /tmp/CTLFireability11716241055269990195.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/CTLFireability5770068180217779050.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11716241055269990195.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,5.38337e+07,0.087311,6184,488,74,3757,578,391,5004,70,1692,0


Converting to forward existential form...Done !
original formula: (E(AG((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.u26.p83==1)&&(i11.u1.p147==1)))) U ((((((i2.u16.p50==1)&&(i5.u26.p81==1))&&((i9.u36.p112==1...555
=> equivalent forward existential formula: ([((FwdU(Init,!(E(TRUE U !((((i11.u1.p6==1)&&(i11.u1.p9==1))&&((i5.u26.p83==1)&&(i11.u1.p147==1))))))) * (((((i2...839
Reverse transition relation is NOT exact ! Due to transitions t147, t149, t170, t179, t200, i2.u15.t122, i2.u15.t125, i2.u16.t123, i3.t138, i3.t118, i3.u10...513
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,5.94684,192512,1,0,434451,2034,2673,484730,388,12060,631083
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 244
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 74 place count 162 transition count 208
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 76 place count 160 transition count 206
Iterating global reduction 1 with 2 rules applied. Total rules applied 78 place count 160 transition count 206
Applied a total of 78 rules in 11 ms. Remains 160 /181 variables (removed 21) and now considering 206/263 (removed 57) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-195359503794762967.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11036696556436906789.kers'
[2026-05-22 18:41:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-195359503794762967.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11036696556436906789.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 206 rows 160 cols 699 entries
Finished phase 1 with 152 SingleSign rule and 0 generalized
[2026-05-22 18:41:46] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11036696556436906789.kers
Total runtime 2 ms.
[2026-05-22 18:41:46] [INFO ] Implicit Places using invariants in 81 ms returned []
[2026-05-22 18:41:46] [INFO ] Invariant cache hit.
[2026-05-22 18:41:46] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
Running 205 sub problems to find dead transitions.
[2026-05-22 18:41:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 5/33 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (OVERLAPS) 206/366 variables, 160/197 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 3/201 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 366/366 variables, and 201 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/159 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 1 (OVERLAPS) 1/160 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 4 (OVERLAPS) 206/366 variables, 160/198 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/366 variables, 205/403 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 205 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/366 variables, 3/408 constraints. Problems are: Problem set: 0 solved, 205 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 366/366 variables, and 408 constraints, problems are : Problem set: 0 solved, 205 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 205/205 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60049ms problems are : Problem set: 0 solved, 205 unsolved
Search for dead transitions found 0 dead transitions in 60049ms
Starting structural reductions in LTL mode, iteration 1 : 160/181 places, 206/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60318 ms. Remains : 160/181 places, 206/263 transitions.
[2026-05-22 18:42:47] [INFO ] Flatten gal took : 9 ms
[2026-05-22 18:42:47] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:42:47] [INFO ] Input system was already deterministic with 206 transitions.
[2026-05-22 18:42:47] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:42:47] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:42:47] [INFO ] Time to serialize gal into /tmp/CTLFireability18033015204691563832.gal : 3 ms
[2026-05-22 18:42:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8710992657978629067.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/CTLFireability18033015204691563832.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8710992657978629067.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,5.67591e+07,1.91196,46244,2,6596,5,160877,6,0,848,209774,0


Converting to forward existential form...Done !
original formula: A(EX((((!(((A((p144==1) U (((p6==1)&&(p9==1))&&((p95==1)&&(p147==1)))) * (p86==1)) * (p31==1))) * AX((((p6==1)&&(p13==1))&&((p147==1)&&(p...319
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E((E(TRUE U (p137==1)) * !(EG(!((p88==1))))) U (p129==1)) * E(TRUE U (p173==1))))...747
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t33, t37, t38, t39, t65, t66, t69, t70, t72, t85, t93, t94, t97, t98, t10...378
Detected timeout of ITS tools.
[2026-05-22 18:43:17] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:43:17] [INFO ] Applying decomposition
[2026-05-22 18:43:17] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph2034630785393550814.txt' '-o' '/tmp/graph2034630785393550814.bin' '-w' '/tmp/graph2034630785393550814.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2034630785393550814.bin' '-l' '-1' '-v' '-w' '/tmp/graph2034630785393550814.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:43:17] [INFO ] Decomposing Gal with order
[2026-05-22 18:43:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:43:17] [INFO ] Removed a total of 121 redundant transitions.
[2026-05-22 18:43:17] [INFO ] Flatten gal took : 15 ms
[2026-05-22 18:43:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2026-05-22 18:43:17] [INFO ] Time to serialize gal into /tmp/CTLFireability8359834315615292354.gal : 2 ms
[2026-05-22 18:43:17] [INFO ] Time to serialize properties into /tmp/CTLFireability11386923833823926640.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/CTLFireability8359834315615292354.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11386923833823926640.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,5.67591e+07,0.064306,5652,369,78,2780,499,399,3623,69,1024,0


Converting to forward existential form...Done !
original formula: A(EX((((!(((A((i9.u47.p144==1) U (((i0.u2.p6==1)&&(i0.u2.p9==1))&&((i6.i0.u31.p95==1)&&(i0.u2.p147==1)))) * (i5.u28.p86==1)) * (i3.u10.p3...480
=> equivalent forward existential formula: [((Init * !(EG(!(!(E(TRUE U !((E((E(TRUE U (i8.i2.u44.p137==1)) * !(EG(!((i5.u19.p88==1))))) U (i8.i1.u41.p129==...1040
Reverse transition relation is NOT exact ! Due to transitions t151, t172, t184, t203, i0.t149, i0.t147, i3.t140, i3.t129, i3.u15.t123, i3.u15.t124, i3.u15....528
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 2
Fast SCC detection found a local SCC at level 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
(forward)formula 0,0,2.25582,79676,1,0,169147,1751,2505,216262,365,8768,210626
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 155 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 200
Applied a total of 90 rules in 6 ms. Remains 154 /181 variables (removed 27) and now considering 200/263 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10856823830433425232.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-293786582804322907.kers'
[2026-05-22 18:43:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10856823830433425232.kers, --Pflows, --basisKERS=/tmp/petrispot-output-293786582804322907.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 18:43:19] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-293786582804322907.kers
Total runtime 1 ms.
[2026-05-22 18:43:19] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-22 18:43:19] [INFO ] Invariant cache hit.
[2026-05-22 18:43:19] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 18:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/189 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 4/193 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/354 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 12 (OVERLAPS) 0/354 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 200 constraints, problems are : Problem set: 0 solved, 199 unsolved in 26664 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (OVERLAPS) 200/354 variables, 154/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/354 variables, 199/396 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 403 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 56705ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 56705ms
Starting structural reductions in LTL mode, iteration 1 : 154/181 places, 200/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56962 ms. Remains : 154/181 places, 200/263 transitions.
[2026-05-22 18:44:16] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:44:16] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:44:16] [INFO ] Input system was already deterministic with 200 transitions.
[2026-05-22 18:44:16] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:44:16] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:44:16] [INFO ] Time to serialize gal into /tmp/CTLFireability8813420175794532485.gal : 2 ms
[2026-05-22 18:44:16] [INFO ] Time to serialize properties into /tmp/CTLFireability14527736157469252968.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/CTLFireability8813420175794532485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14527736157469252968.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,5.11971e+07,1.62399,45232,2,6377,5,160810,6,0,818,212741,0


Converting to forward existential form...Done !
original formula: AX((AX(AG(A((p11==1) U (p60==1)))) + EF(((E((p138==1) U (((p50==1)&&(p81==1))&&((p118==1)&&(p148==1)))) * (p189==1)) * (p68==1)))))
=> equivalent forward existential formula: ([(FwdU(FwdU(EY((EY(Init) * !(E(TRUE U ((E((p138==1) U (((p50==1)&&(p81==1))&&((p118==1)&&(p148==1)))) * (p189==...394
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Hit Full ! (commute/partial/dont) 198/0/2
(forward)formula 0,0,17.961,435072,1,0,513,1.98922e+06,437,192,5904,2.33416e+06,591
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 161 transition count 243
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 161 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 76 place count 161 transition count 207
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 80 place count 157 transition count 203
Iterating global reduction 1 with 4 rules applied. Total rules applied 84 place count 157 transition count 203
Applied a total of 84 rules in 4 ms. Remains 157 /181 variables (removed 24) and now considering 203/263 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10465492712805979764.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7378031192332449423.kers'
[2026-05-22 18:44:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10465492712805979764.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7378031192332449423.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 157 cols 693 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-22 18:44:34] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7378031192332449423.kers
Total runtime 2 ms.
[2026-05-22 18:44:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-22 18:44:34] [INFO ] Invariant cache hit.
[2026-05-22 18:44:34] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-22 18:44:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 10/40 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (OVERLAPS) 203/360 variables, 157/200 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/360 variables, and 203 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/360 variables, 157/200 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 202/402 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 1/403 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 410 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 36/36 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 60056ms
Starting structural reductions in LTL mode, iteration 1 : 157/181 places, 203/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60317 ms. Remains : 157/181 places, 203/263 transitions.
[2026-05-22 18:45:34] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:45:34] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:45:34] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-22 18:45:34] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:45:34] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:45:34] [INFO ] Time to serialize gal into /tmp/CTLFireability7550649056235360932.gal : 2 ms
[2026-05-22 18:45:34] [INFO ] Time to serialize properties into /tmp/CTLFireability150125987511381793.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/CTLFireability7550649056235360932.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability150125987511381793.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,5.54361e+07,1.58575,41444,2,6148,5,147930,6,0,833,189757,0


Converting to forward existential form...Done !
original formula: EX(EG(AF(((p128==1)||(p171==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(((p128==1)||(p171==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t37, t38, t39, t66, t67, t70, t71, t73, t86, t92, t93, t96, t97, t99...371
Detected timeout of ITS tools.
[2026-05-22 18:46:05] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:46:05] [INFO ] Applying decomposition
[2026-05-22 18:46:05] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12785657954776709195.txt' '-o' '/tmp/graph12785657954776709195.bin' '-w' '/tmp/graph12785657954776709195.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12785657954776709195.bin' '-l' '-1' '-v' '-w' '/tmp/graph12785657954776709195.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:46:05] [INFO ] Decomposing Gal with order
[2026-05-22 18:46:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:46:05] [INFO ] Removed a total of 113 redundant transitions.
[2026-05-22 18:46:05] [INFO ] Flatten gal took : 13 ms
[2026-05-22 18:46:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 3 ms.
[2026-05-22 18:46:05] [INFO ] Time to serialize gal into /tmp/CTLFireability3386662507974897370.gal : 2 ms
[2026-05-22 18:46:05] [INFO ] Time to serialize properties into /tmp/CTLFireability2099155670024177669.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/CTLFireability3386662507974897370.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2099155670024177669.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,5.54361e+07,0.067478,5852,416,80,3174,484,380,4743,69,1366,0


Converting to forward existential form...Done !
original formula: EX(EG(AF(((i9.i0.u37.p128==1)||(i12.i0.u52.p171==1)))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EG(!(((i9.i0.u37.p128==1)||(i12.i0.u52.p171==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t151, t169, t181, t200, i0.t146, i0.t144, i2.i0.u15.t121, i2.i0.u15.t122, i2.i0.u15.t124, i2....538
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,2.78469,84980,1,0,176366,1656,2347,247434,359,8161,205760
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 155 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 200
Applied a total of 90 rules in 7 ms. Remains 154 /181 variables (removed 27) and now considering 200/263 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4158989831614275346.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1782251564037821695.kers'
[2026-05-22 18:46:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4158989831614275346.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1782251564037821695.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 18:46:07] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1782251564037821695.kers
Total runtime 1 ms.
[2026-05-22 18:46:07] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 18:46:07] [INFO ] Invariant cache hit.
[2026-05-22 18:46:08] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 18:46:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 16/24 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 6/35 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 3/38 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/154 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/154 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/154 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (OVERLAPS) 200/354 variables, 154/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 3/197 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 354/354 variables, and 197 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 32/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/195 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 199/394 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 402 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60066ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 60067ms
Starting structural reductions in LTL mode, iteration 1 : 154/181 places, 200/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60386 ms. Remains : 154/181 places, 200/263 transitions.
[2026-05-22 18:47:08] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:47:08] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:47:08] [INFO ] Input system was already deterministic with 200 transitions.
[2026-05-22 18:47:08] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:47:08] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:47:08] [INFO ] Time to serialize gal into /tmp/CTLFireability5313374857673487151.gal : 2 ms
[2026-05-22 18:47:08] [INFO ] Time to serialize properties into /tmp/CTLFireability6419771240549825265.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/CTLFireability5313374857673487151.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6419771240549825265.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,5.03244e+07,2.04901,48436,2,6806,5,170024,6,0,818,226396,0


Converting to forward existential form...Done !
original formula: AX(((EX(((EX((p129==1)) * EF((p55==1))) * (((p111==1)||(p48==1)) * AF((p138==1))))) + EG((((p50==0)||(p81==0))||((p118==0)||(p148==0)))))...205
=> equivalent forward existential formula: [(((EY(Init) * !((((p6==1)&&(p14==1))&&((p114==1)&&(p147==1))))) * !(EG((((p50==0)||(p81==0))||((p118==0)||(p148...270
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...359
Detected timeout of ITS tools.
[2026-05-22 18:47:38] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:47:38] [INFO ] Applying decomposition
[2026-05-22 18:47:38] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4515629679601037686.txt' '-o' '/tmp/graph4515629679601037686.bin' '-w' '/tmp/graph4515629679601037686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4515629679601037686.bin' '-l' '-1' '-v' '-w' '/tmp/graph4515629679601037686.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:47:38] [INFO ] Decomposing Gal with order
[2026-05-22 18:47:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:47:38] [INFO ] Removed a total of 118 redundant transitions.
[2026-05-22 18:47:38] [INFO ] Flatten gal took : 12 ms
[2026-05-22 18:47:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2026-05-22 18:47:38] [INFO ] Time to serialize gal into /tmp/CTLFireability16872616866247105937.gal : 2 ms
[2026-05-22 18:47:38] [INFO ] Time to serialize properties into /tmp/CTLFireability17361837796910463414.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/CTLFireability16872616866247105937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17361837796910463414.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,5.03244e+07,0.054888,5500,376,77,2311,420,388,2734,73,974,0


Converting to forward existential form...Done !
original formula: AX(((EX(((EX((i10.i1.u39.p129==1)) * EF((i4.u16.p55==1))) * (((i8.i0.u33.p111==1)||(i3.u14.p48==1)) * AF((i10.i2.u41.p138==1))))) + EG(((...310
=> equivalent forward existential formula: [(((EY(Init) * !((((i11.u2.p6==1)&&(i11.u2.p14==1))&&((i8.i0.u32.p114==1)&&(i11.u2.p147==1))))) * !(EG((((i3.u14...375
Reverse transition relation is NOT exact ! Due to transitions t144, t147, t180, t197, u42.t32, u42.t35, u42.t36, u42.t37, i3.u13.t118, i3.u13.t122, i3.u14....521
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
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local 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,1,3.14613,110504,1,0,247374,1600,2446,266863,387,6944,295226
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 159 transition count 241
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 159 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 80 place count 159 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 154 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 153 transition count 199
Applied a total of 92 rules in 6 ms. Remains 153 /181 variables (removed 28) and now considering 199/263 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3004300543935667903.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10891468030692439660.kers'
[2026-05-22 18:47:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3004300543935667903.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10891468030692439660.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 153 cols 685 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-22 18:47:41] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10891468030692439660.kers
Total runtime 1 ms.
[2026-05-22 18:47:41] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 18:47:41] [INFO ] Invariant cache hit.
[2026-05-22 18:47:41] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-22 18:47:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 198 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/195 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Starting structural reductions in LTL mode, iteration 1 : 153/181 places, 199/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60272 ms. Remains : 153/181 places, 199/263 transitions.
[2026-05-22 18:48:41] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:48:41] [INFO ] Flatten gal took : 3 ms
[2026-05-22 18:48:41] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-22 18:48:41] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:48:41] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:48:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5968713883074985136.gal : 1 ms
[2026-05-22 18:48:41] [INFO ] Time to serialize properties into /tmp/CTLFireability13026718463808151006.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/CTLFireability5968713883074985136.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13026718463808151006.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,4.9176e+07,1.42963,42536,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: (AF(AG(E((E((p55==1) U (p175==1)) * EG((((p6==1)&&(p14==1))&&((p45==1)&&(p147==1))))) U AG((((p6==1)&&(p9==1))&&((p64==1)&&(p147==1))))))...194
=> equivalent forward existential formula: [FwdG(EY((Init * !(!(EG(!(!(E(TRUE U !(E((E((p55==1) U (p175==1)) * EG((((p6==1)&&(p14==1))&&((p45==1)&&(p147==1...278
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t63, t64, t67, t68, t70, t83, t89, t90, t93, t94, t96...371
Detected timeout of ITS tools.
[2026-05-22 18:49:12] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:49:12] [INFO ] Applying decomposition
[2026-05-22 18:49:12] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17576206441369482686.txt' '-o' '/tmp/graph17576206441369482686.bin' '-w' '/tmp/graph17576206441369482686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17576206441369482686.bin' '-l' '-1' '-v' '-w' '/tmp/graph17576206441369482686.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:49:12] [INFO ] Decomposing Gal with order
[2026-05-22 18:49:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:49:12] [INFO ] Removed a total of 116 redundant transitions.
[2026-05-22 18:49:12] [INFO ] Flatten gal took : 22 ms
[2026-05-22 18:49:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 3 ms.
[2026-05-22 18:49:12] [INFO ] Time to serialize gal into /tmp/CTLFireability16020020356231281215.gal : 12 ms
[2026-05-22 18:49:12] [INFO ] Time to serialize properties into /tmp/CTLFireability8198976169042162200.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/CTLFireability16020020356231281215.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8198976169042162200.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,4.9176e+07,0.075808,6148,421,80,3744,649,408,5400,74,1667,0


Converting to forward existential form...Done !
original formula: (AF(AG(E((E((i4.u17.p55==1) U (i12.i1.u50.p175==1)) * EG((((i1.u2.p6==1)&&(i1.u2.p14==1))&&((i3.i1.u14.p45==1)&&(i1.u2.p147==1))))) U AG(...282
=> equivalent forward existential formula: [FwdG(EY((Init * !(!(EG(!(!(E(TRUE U !(E((E((i4.u17.p55==1) U (i12.i1.u50.p175==1)) * EG((((i1.u2.p6==1)&&(i1.u2...366
Reverse transition relation is NOT exact ! Due to transitions t147, t168, t177, t196, u42.t32, u42.t35, u42.t36, u42.t37, i1.t143, i1.t141, i4.t134, i4.u9....521
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,5.07159,164488,1,0,357484,2498,2664,436668,400,14935,490307
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Graph (trivial) has 169 edges and 181 vertex of which 4 / 181 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 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 178 transition count 177
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 106 rules applied. Total rules applied 190 place count 95 transition count 154
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 203 place count 82 transition count 154
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 203 place count 82 transition count 148
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 215 place count 76 transition count 148
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 228 place count 63 transition count 135
Iterating global reduction 3 with 13 rules applied. Total rules applied 241 place count 63 transition count 135
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 277 place count 63 transition count 99
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 277 place count 63 transition count 97
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 281 place count 61 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 283 place count 59 transition count 91
Iterating global reduction 4 with 2 rules applied. Total rules applied 285 place count 59 transition count 91
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 4 with 4 rules applied. Total rules applied 289 place count 59 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 291 place count 57 transition count 87
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 327 place count 39 transition count 69
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 332 place count 34 transition count 53
Iterating global reduction 6 with 5 rules applied. Total rules applied 337 place count 34 transition count 53
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 339 place count 34 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 340 place count 33 transition count 51
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 341 place count 33 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 343 place count 31 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 344 place count 30 transition count 48
Applied a total of 344 rules in 43 ms. Remains 30 /181 variables (removed 151) and now considering 48/263 (removed 215) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6783704662354489631.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16869110558021144319.kers'
[2026-05-22 18:49:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6783704662354489631.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16869110558021144319.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 47 rows 29 cols 220 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 18:49:17] [INFO ] Computed 6 invariants in 4 ms
Computed 6 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-16869110558021144319.kers
Total runtime 8 ms.
[2026-05-22 18:49:17] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-22 18:49:17] [INFO ] Invariant cache hit.
[2026-05-22 18:49:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:49:17] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [24, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 127 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/181 places, 48/263 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 28 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 27 transition count 47
Applied a total of 2 rules in 3 ms. Remains 27 /28 variables (removed 1) and now considering 47/48 (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-7155399674397021122.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12445682101628125790.kers'
[2026-05-22 18:49:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7155399674397021122.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12445682101628125790.kers]
Normalized transition count is 46 out of 47 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 46 rows 27 cols 215 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-22 18:49:17] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12445682101628125790.kers
Total runtime 0 ms.
[2026-05-22 18:49:17] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-22 18:49:17] [INFO ] Invariant cache hit.
[2026-05-22 18:49:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:49:17] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 27/181 places, 47/263 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 280 ms. Remains : 27/181 places, 47/263 transitions.
[2026-05-22 18:49:17] [INFO ] Flatten gal took : 3 ms
[2026-05-22 18:49:17] [INFO ] Flatten gal took : 3 ms
[2026-05-22 18:49:17] [INFO ] Input system was already deterministic with 47 transitions.
[2026-05-22 18:49:17] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:49:17] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:49:17] [INFO ] Time to serialize gal into /tmp/CTLFireability9634946805000053843.gal : 1 ms
[2026-05-22 18:49:17] [INFO ] Time to serialize properties into /tmp/CTLFireability12294918734195343608.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/CTLFireability9634946805000053843.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12294918734195343608.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,5764,0.039948,4520,2,155,5,2361,6,0,154,2845,0


Converting to forward existential form...Done !
original formula: EF(AG((p182==1)))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U !((p182==1)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t6, t8, t10, t12, t14, t16, Intersection with reachable at each step enabled...204
(forward)formula 0,0,0.098421,5368,1,0,109,6522,115,47,1437,6139,103
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 162 transition count 244
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 162 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 74 place count 162 transition count 208
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 158 transition count 204
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 158 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 157 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 157 transition count 203
Applied a total of 84 rules in 17 ms. Remains 157 /181 variables (removed 24) and now considering 203/263 (removed 60) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4981720016499588275.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8189788562234173580.kers'
[2026-05-22 18:49:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4981720016499588275.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8189788562234173580.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 203 rows 157 cols 693 entries
Finished phase 1 with 149 SingleSign rule and 0 generalized
[2026-05-22 18:49:17] [INFO ] Computed 8 invariants in 3 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8189788562234173580.kers
Total runtime 4 ms.
[2026-05-22 18:49:17] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-22 18:49:17] [INFO ] Invariant cache hit.
[2026-05-22 18:49:18] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 202 sub problems to find dead transitions.
[2026-05-22 18:49:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 8/36 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (OVERLAPS) 203/360 variables, 157/200 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/360 variables, 2/202 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 3/205 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 360/360 variables, and 205 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 202 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 1 (OVERLAPS) 1/157 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 4 (OVERLAPS) 203/360 variables, 157/202 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 202/404 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/360 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 202 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/360 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 202 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 360/360 variables, and 410 constraints, problems are : Problem set: 0 solved, 202 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 157/157 constraints, PredecessorRefiner: 202/202 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60055ms problems are : Problem set: 0 solved, 202 unsolved
Search for dead transitions found 0 dead transitions in 60055ms
Starting structural reductions in LTL mode, iteration 1 : 157/181 places, 203/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60427 ms. Remains : 157/181 places, 203/263 transitions.
[2026-05-22 18:50:18] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:50:18] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:50:18] [INFO ] Input system was already deterministic with 203 transitions.
[2026-05-22 18:50:18] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:50:18] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:50:18] [INFO ] Time to serialize gal into /tmp/CTLFireability12490015785185845823.gal : 2 ms
[2026-05-22 18:50:18] [INFO ] Time to serialize properties into /tmp/CTLFireability7489634479857249232.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/CTLFireability12490015785185845823.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7489634479857249232.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,5.03244e+07,1.86988,45144,2,6576,5,155126,6,0,833,204846,0


Converting to forward existential form...Done !
original formula: AF(!(E(((((p6==1)&&(p15==1))&&((p49==1)&&(p147==1))) + E((p101==1) U (p120==1))) U (!(AX((((p6==1)&&(p14==1))&&((p111==1)&&(p147==1))))) ...184
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((((p6==1)&&(p15==1))&&((p49==1)&&(p147==1))) + E((p101==1) U (p120==1))) U (!(!(EX(!((((p6==1)...235
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t64, t65, t68, t69, t71, t83, t84, t90, t91, t94, t96...363
Detected timeout of ITS tools.
[2026-05-22 18:50:48] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:50:48] [INFO ] Applying decomposition
[2026-05-22 18:50:48] [INFO ] Flatten gal took : 3 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12814114212323480271.txt' '-o' '/tmp/graph12814114212323480271.bin' '-w' '/tmp/graph12814114212323480271.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12814114212323480271.bin' '-l' '-1' '-v' '-w' '/tmp/graph12814114212323480271.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:50:48] [INFO ] Decomposing Gal with order
[2026-05-22 18:50:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:50:48] [INFO ] Removed a total of 115 redundant transitions.
[2026-05-22 18:50:48] [INFO ] Flatten gal took : 12 ms
[2026-05-22 18:50:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2026-05-22 18:50:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1764696124791717556.gal : 3 ms
[2026-05-22 18:50:48] [INFO ] Time to serialize properties into /tmp/CTLFireability16159728457243072891.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/CTLFireability1764696124791717556.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16159728457243072891.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,5.03244e+07,0.083651,6444,488,76,4517,663,407,5645,76,1537,0


Converting to forward existential form...Done !
original formula: AF(!(E(((((i11.u2.p6==1)&&(i11.u2.p15==1))&&((i3.u17.p49==1)&&(i11.u2.p147==1))) + E((i8.u34.p101==1) U (i7.u39.p120==1))) U (!(AX((((i11...270
=> equivalent forward existential formula: [FwdG(Init,!(!(E(((((i11.u2.p6==1)&&(i11.u2.p15==1))&&((i3.u17.p49==1)&&(i11.u2.p147==1))) + E((i8.u34.p101==1) ...321
Reverse transition relation is NOT exact ! Due to transitions t153, t171, t200, i2.i1.t118, i2.i1.t138, i2.i1.u19.t119, i3.u16.t122, i3.u16.t125, i3.u17.t1...545
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 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
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,3.72255,110392,1,0,249163,1978,2575,253656,393,10751,424155
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 160 transition count 242
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 160 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 78 place count 160 transition count 206
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 155 transition count 201
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 155 transition count 201
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 89 place count 154 transition count 200
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 154 transition count 200
Applied a total of 90 rules in 13 ms. Remains 154 /181 variables (removed 27) and now considering 200/263 (removed 63) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8182387284750884810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14120790039590786960.kers'
[2026-05-22 18:50:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8182387284750884810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14120790039590786960.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 200 rows 154 cols 687 entries
Finished phase 1 with 146 SingleSign rule and 0 generalized
[2026-05-22 18:50:52] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14120790039590786960.kers
Total runtime 3 ms.
[2026-05-22 18:50:52] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-22 18:50:52] [INFO ] Invariant cache hit.
[2026-05-22 18:50:52] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 199 sub problems to find dead transitions.
[2026-05-22 18:50:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (OVERLAPS) 200/354 variables, 154/191 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/354 variables, 3/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (OVERLAPS) 0/354 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
No progress, stopping.
After SMT solving in domain Real declared 354/354 variables, and 194 constraints, problems are : Problem set: 0 solved, 199 unsolved in 26006 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 199 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 1 (OVERLAPS) 1/154 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/154 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/154 variables, 2/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/154 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 6 (OVERLAPS) 200/354 variables, 154/194 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/354 variables, 199/393 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/354 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/354 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 199 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/354 variables, 4/401 constraints. Problems are: Problem set: 0 solved, 199 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 354/354 variables, and 401 constraints, problems are : Problem set: 0 solved, 199 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 154/154 constraints, PredecessorRefiner: 199/199 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 56049ms problems are : Problem set: 0 solved, 199 unsolved
Search for dead transitions found 0 dead transitions in 56052ms
Starting structural reductions in LTL mode, iteration 1 : 154/181 places, 200/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56389 ms. Remains : 154/181 places, 200/263 transitions.
[2026-05-22 18:51:48] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:51:48] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:51:48] [INFO ] Input system was already deterministic with 200 transitions.
[2026-05-22 18:51:48] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:51:48] [INFO ] Flatten gal took : 4 ms
[2026-05-22 18:51:48] [INFO ] Time to serialize gal into /tmp/CTLFireability1941689085349308064.gal : 1 ms
[2026-05-22 18:51:48] [INFO ] Time to serialize properties into /tmp/CTLFireability17582161630552499303.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/CTLFireability1941689085349308064.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17582161630552499303.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,5.11023e+07,1.56264,42024,2,6390,5,150315,6,0,818,192666,0


Converting to forward existential form...Done !
original formula: A((!(AF((!(E((p86==1) U (p177==1))) * EF((p18==1))))) * (p90==1)) U (AF((((p6==1)&&(p14==1))&&((p83==1)&&(p147==1)))) + (!(EF(((p10!=1) *...292
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!((((p6==1)&&(p14==1))&&((p83==1)&&(p147==1)))))) + (!(E(TRUE U ((p10!=1) * !(EG(!((((p6=...881
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t25, t29, t33, t36, t37, t38, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95...382
Detected timeout of ITS tools.
[2026-05-22 18:52:18] [INFO ] Flatten gal took : 3 ms
[2026-05-22 18:52:18] [INFO ] Applying decomposition
[2026-05-22 18:52:18] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3419809679208850206.txt' '-o' '/tmp/graph3419809679208850206.bin' '-w' '/tmp/graph3419809679208850206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3419809679208850206.bin' '-l' '-1' '-v' '-w' '/tmp/graph3419809679208850206.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:52:18] [INFO ] Decomposing Gal with order
[2026-05-22 18:52:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:52:18] [INFO ] Removed a total of 121 redundant transitions.
[2026-05-22 18:52:18] [INFO ] Flatten gal took : 23 ms
[2026-05-22 18:52:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 4 ms.
[2026-05-22 18:52:18] [INFO ] Time to serialize gal into /tmp/CTLFireability11076107197616110927.gal : 3 ms
[2026-05-22 18:52:18] [INFO ] Time to serialize properties into /tmp/CTLFireability9976440271623663695.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/CTLFireability11076107197616110927.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9976440271623663695.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,5.11023e+07,0.133656,6648,411,75,4538,501,394,6781,66,1586,0


Converting to forward existential form...Done !
original formula: A((!(AF((!(E((i8.i1.u28.p86==1) U (i15.i1.u55.p177==1))) * EF((i2.i1.u8.p18==1))))) * (i11.u30.p90==1)) U (AF((((i1.u1.p6==1)&&(i1.u1.p14...420
=> equivalent forward existential formula: [((Init * !(EG(!((!(EG(!((((i1.u1.p6==1)&&(i1.u1.p14==1))&&((i7.u25.p83==1)&&(i1.u1.p147==1)))))) + (!(E(TRUE U ...1189
Reverse transition relation is NOT exact ! Due to transitions t146, t167, t179, t183, t197, u46.t33, u46.t36, u46.t37, u46.t38, i1.t144, i1.t142, i4.u15.t1...537
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 a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 13
Fast SCC detection found an SCC at level 14
Fast SCC detection found an SCC at level 15
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 a local SCC at level 1
Fast SCC detection found a local 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 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,11.0677,346416,1,0,677045,2306,2855,1.00528e+06,371,16365,906455
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-12 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 : 181/181 places, 263/263 transitions.
Graph (trivial) has 168 edges and 181 vertex of which 4 / 181 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 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 178 transition count 177
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 106 rules applied. Total rules applied 190 place count 95 transition count 154
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 203 place count 82 transition count 154
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 203 place count 82 transition count 148
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 215 place count 76 transition count 148
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 228 place count 63 transition count 135
Iterating global reduction 3 with 13 rules applied. Total rules applied 241 place count 63 transition count 135
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 277 place count 63 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 277 place count 63 transition count 98
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 279 place count 62 transition count 98
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 281 place count 60 transition count 92
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 60 transition count 92
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 4 with 4 rules applied. Total rules applied 287 place count 60 transition count 88
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 289 place count 58 transition count 88
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 325 place count 40 transition count 70
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 329 place count 36 transition count 58
Iterating global reduction 6 with 4 rules applied. Total rules applied 333 place count 36 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 335 place count 36 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 336 place count 35 transition count 56
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 337 place count 35 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 339 place count 33 transition count 53
Applied a total of 339 rules in 30 ms. Remains 33 /181 variables (removed 148) and now considering 53/263 (removed 210) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15268053761688649542.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14767694488812411135.kers'
[2026-05-22 18:52:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15268053761688649542.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14767694488812411135.kers]
Normalized transition count is 52 out of 53 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 52 rows 31 cols 263 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-22 18:52:29] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14767694488812411135.kers
Total runtime 2 ms.
[2026-05-22 18:52:29] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-22 18:52:29] [INFO ] Invariant cache hit.
[2026-05-22 18:52:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:52:29] [INFO ] Implicit Places using invariants and state equation in 57 ms returned [27, 32]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 113 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 31/181 places, 53/263 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 31 transition count 52
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 30 transition count 52
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 30 transition count 51
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 29 transition count 51
Applied a total of 4 rules in 4 ms. Remains 29 /31 variables (removed 2) and now considering 51/53 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16625529245742516123.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4097536283706170528.kers'
[2026-05-22 18:52:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16625529245742516123.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4097536283706170528.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 50 rows 28 cols 256 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 18:52:29] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4097536283706170528.kers
Total runtime 1 ms.
[2026-05-22 18:52:29] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-22 18:52:29] [INFO ] Invariant cache hit.
[2026-05-22 18:52:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 18:52:30] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 29/181 places, 51/263 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 273 ms. Remains : 29/181 places, 51/263 transitions.
[2026-05-22 18:52:30] [INFO ] Flatten gal took : 3 ms
[2026-05-22 18:52:30] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:52:30] [INFO ] Input system was already deterministic with 51 transitions.
[2026-05-22 18:52:30] [INFO ] Flatten gal took : 2 ms
[2026-05-22 18:52:30] [INFO ] Flatten gal took : 3 ms
[2026-05-22 18:52:30] [INFO ] Time to serialize gal into /tmp/CTLFireability9298121030513098011.gal : 2 ms
[2026-05-22 18:52:30] [INFO ] Time to serialize properties into /tmp/CTLFireability3453595612036641741.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/CTLFireability9298121030513098011.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3453595612036641741.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,11520,0.097922,5544,2,274,5,5467,6,0,166,7286,0


Converting to forward existential form...Done !
original formula: EG((((p6==0)||(p15==0))||((p111==0)||(p147==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p6==0)||(p15==0))||((p111==0)||(p147==0))))] != FALSE
Hit Full ! (commute/partial/dont) 19/0/32
(forward)formula 0,1,0.284978,8716,1,0,9,22130,19,4,1159,22346,8
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 165 transition count 247
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 165 transition count 247
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 37 place count 160 transition count 242
Iterating global reduction 0 with 5 rules applied. Total rules applied 42 place count 160 transition count 242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 159 transition count 241
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 159 transition count 241
Applied a total of 44 rules in 18 ms. Remains 159 /181 variables (removed 22) and now considering 241/263 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6579678504227424571.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4838131309453672213.kers'
[2026-05-22 18:52:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6579678504227424571.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4838131309453672213.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 241 rows 159 cols 985 entries
Finished phase 1 with 151 SingleSign rule and 0 generalized
[2026-05-22 18:52:30] [INFO ] Computed 8 invariants in 2 ms
Computed 8 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-4838131309453672213.kers
Total runtime 4 ms.
[2026-05-22 18:52:30] [INFO ] Implicit Places using invariants in 106 ms returned []
[2026-05-22 18:52:30] [INFO ] Invariant cache hit.
[2026-05-22 18:52:30] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 240 sub problems to find dead transitions.
[2026-05-22 18:52:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 6/34 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 241/400 variables, 159/193 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/400 variables, and 201 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (OVERLAPS) 1/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 31/39 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 8/47 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (OVERLAPS) 241/400 variables, 159/208 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 240/448 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 1/449 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 3/452 constraints. Problems are: Problem set: 0 solved, 240 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/400 variables, and 452 constraints, problems are : Problem set: 0 solved, 240 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 159/181 places, 241/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60530 ms. Remains : 159/181 places, 241/263 transitions.
[2026-05-22 18:53:30] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:53:30] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:53:30] [INFO ] Input system was already deterministic with 241 transitions.
[2026-05-22 18:53:30] [INFO ] Flatten gal took : 7 ms
[2026-05-22 18:53:30] [INFO ] Flatten gal took : 8 ms
[2026-05-22 18:53:30] [INFO ] Time to serialize gal into /tmp/CTLFireability7088506706463607696.gal : 3 ms
[2026-05-22 18:53:30] [INFO ] Time to serialize properties into /tmp/CTLFireability5948968761461388205.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/CTLFireability7088506706463607696.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5948968761461388205.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,7.1549e+07,2.11686,52476,2,7168,5,175047,6,0,879,238102,0


Converting to forward existential form...Done !
original formula: EF(((((p140==0) * (((AF((p108==0)) + (p6==0)) + ((p15==0)||(p33==0))) + ((p147==0) + ((A((p5==1) U (p101==1)) * EG((p154==1))) * ((p66==0...505
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((p140==0) * (((!(EG(!((p108==0)))) + (p6==0)) + ((p15==0)||(p33==0))) + ((p147==0) + ((!...1061
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t37, t39, t53, t65, t66, t69, t70, t72, t85, t91, t92, t95, t97...411
Detected timeout of ITS tools.
[2026-05-22 18:54:00] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:54:00] [INFO ] Applying decomposition
[2026-05-22 18:54:00] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph16892056343872798385.txt' '-o' '/tmp/graph16892056343872798385.bin' '-w' '/tmp/graph16892056343872798385.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16892056343872798385.bin' '-l' '-1' '-v' '-w' '/tmp/graph16892056343872798385.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:54:01] [INFO ] Decomposing Gal with order
[2026-05-22 18:54:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:54:01] [INFO ] Removed a total of 201 redundant transitions.
[2026-05-22 18:54:01] [INFO ] Flatten gal took : 20 ms
[2026-05-22 18:54:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 3 ms.
[2026-05-22 18:54:01] [INFO ] Time to serialize gal into /tmp/CTLFireability6229032695053760937.gal : 3 ms
[2026-05-22 18:54:01] [INFO ] Time to serialize properties into /tmp/CTLFireability17383819509081341197.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/CTLFireability6229032695053760937.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17383819509081341197.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.1549e+07,0.088826,5428,379,106,2126,498,394,2475,87,1242,0


Converting to forward existential form...Done !
original formula: EF(((((i0.u43.p140==0) * (((AF((i8.i1.u32.p108==0)) + (u45.p6==0)) + ((u45.p15==0)||(i3.i1.u10.p33==0))) + ((u45.p147==0) + ((A((u45.p5==...732
=> equivalent forward existential formula: (([((FwdU(Init,TRUE) * ((i0.u43.p140==0) * (((!(EG(!((i8.i1.u32.p108==0)))) + (u45.p6==0)) + ((u45.p15==0)||(i3....1477
Reverse transition relation is NOT exact ! Due to transitions t145, t147, t160, t196, u45.t148, u45.t149, u45.t150, i0.t39, i0.t37, i0.t35, i0.u42.t32, i0....557
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 10
Fast SCC detection found an SCC at level 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,1,1.7073,59068,1,0,129283,1996,2258,155394,461,9431,179756
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 181/181 places, 263/263 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 159 transition count 241
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 159 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 80 place count 159 transition count 205
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 154 transition count 200
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 154 transition count 200
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 91 place count 153 transition count 199
Iterating global reduction 1 with 1 rules applied. Total rules applied 92 place count 153 transition count 199
Applied a total of 92 rules in 14 ms. Remains 153 /181 variables (removed 28) and now considering 199/263 (removed 64) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1708507908015733641.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1421448949804867304.kers'
[2026-05-22 18:54:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1708507908015733641.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1421448949804867304.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 153 cols 685 entries
Finished phase 1 with 145 SingleSign rule and 0 generalized
[2026-05-22 18:54:02] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1421448949804867304.kers
Total runtime 2 ms.
[2026-05-22 18:54:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-22 18:54:02] [INFO ] Invariant cache hit.
[2026-05-22 18:54:03] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2026-05-22 18:54:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/153 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (OVERLAPS) 199/352 variables, 153/193 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/352 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/352 variables, 1/198 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 352/352 variables, and 198 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 34/34 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/152 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (OVERLAPS) 1/153 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (OVERLAPS) 199/352 variables, 153/195 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/352 variables, 198/393 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/352 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/352 variables, 3/397 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/352 variables, 3/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 352/352 variables, and 400 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 153/153 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 60068ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 60070ms
Starting structural reductions in LTL mode, iteration 1 : 153/181 places, 199/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60343 ms. Remains : 153/181 places, 199/263 transitions.
[2026-05-22 18:55:03] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:55:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 18:55:03] [INFO ] Input system was already deterministic with 199 transitions.
[2026-05-22 18:55:03] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:55:03] [INFO ] Flatten gal took : 6 ms
[2026-05-22 18:55:03] [INFO ] Time to serialize gal into /tmp/CTLFireability9556576258369595841.gal : 1 ms
[2026-05-22 18:55:03] [INFO ] Time to serialize properties into /tmp/CTLFireability7819172261188365279.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/CTLFireability9556576258369595841.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7819172261188365279.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,4.9176e+07,1.76646,42572,2,6282,5,151031,6,0,813,196128,0


Converting to forward existential form...Done !
original formula: EX((EX((EG((((p6==0)||(p15==0))||((p95==0)||(p147==0)))) + (((p6==1)&&(p9==1))&&((p107==1)&&(p147==1))))) + (((p6==1)&&(p14==1))&&((p52==...172
=> equivalent forward existential formula: (([FwdG(EY(EY(Init)),(((p6==0)||(p15==0))||((p95==0)||(p147==0))))] != FALSE + [(EY(EY(Init)) * (((p6==1)&&(p9==...267
Hit Full ! (commute/partial/dont) 151/0/48
(forward)formula 0,1,19.4708,453344,1,0,181,2.21033e+06,19,4,4375,2.46053e+06,178
FORMULA AutonomousCar-PT-03b-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-22 18:55:22] [INFO ] Flatten gal took : 17 ms
[2026-05-22 18:55:22] [INFO ] Flatten gal took : 9 ms
Total runtime 1409179 ms.

BK_STOP 1779476122886

--------------------
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-03b"
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-03b, 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-177946787900042"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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