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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Mar 5 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Mar 5 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 5 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Mar 5 16:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 5 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 5 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 5 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 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 110K 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-04b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779477051413

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-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 19:10: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 19:10:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:10:53] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2026-05-22 19:10:53] [INFO ] Transformed 221 places.
[2026-05-22 19:10:53] [INFO ] Transformed 368 transitions.
[2026-05-22 19:10:53] [INFO ] Found NUPN structural information;
[2026-05-22 19:10:53] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 35 ms.
Support contains 78 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 199 transition count 346
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 199 transition count 346
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 108 place count 199 transition count 282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 110 place count 197 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 112 place count 197 transition count 280
Applied a total of 112 rules in 126 ms. Remains 197 /221 variables (removed 24) and now considering 280/368 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14862644938397884586.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-140091106097537516.kers'
[2026-05-22 19:10:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14862644938397884586.kers, --Pflows, --basisKERS=/tmp/petrispot-output-140091106097537516.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 280 rows 197 cols 1098 entries
Finished phase 1 with 188 SingleSign rule and 0 generalized
[2026-05-22 19:10:54] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-140091106097537516.kers
Total runtime 5 ms.
[2026-05-22 19:10:54] [INFO ] Implicit Places using invariants in 551 ms returned []
[2026-05-22 19:10:54] [INFO ] Invariant cache hit.
[2026-05-22 19:10:55] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 1071 ms to find 0 implicit places.
Running 279 sub problems to find dead transitions.
[2026-05-22 19:10:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/197 variables, 2/52 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 197/477 variables, and 53 constraints, problems are : Problem set: 0 solved, 279 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/197 constraints, PredecessorRefiner: 279/279 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 1 (OVERLAPS) 1/197 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/197 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/197 variables, 2/55 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/197 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/197 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 279 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/197 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 279 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD255 is UNSAT
At refinement iteration 7 (OVERLAPS) 280/477 variables, 197/254 constraints. Problems are: Problem set: 2 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 277/531 constraints. Problems are: Problem set: 2 solved, 277 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/477 variables, 2/533 constraints. Problems are: Problem set: 2 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 477/477 variables, and 533 constraints, problems are : Problem set: 2 solved, 277 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 197/197 constraints, PredecessorRefiner: 277/279 constraints, Known Traps: 50/50 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60513ms problems are : Problem set: 2 solved, 277 unsolved
Search for dead transitions found 2 dead transitions in 60546ms
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 : 197/221 places, 278/368 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 196 transition count 278
Applied a total of 1 rules in 21 ms. Remains 196 /197 variables (removed 1) and now considering 278/278 (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-10674550639701888587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7447175802435799339.kers'
[2026-05-22 19:11:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10674550639701888587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7447175802435799339.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 278 rows 196 cols 1092 entries
Finished phase 1 with 187 SingleSign rule and 0 generalized
[2026-05-22 19:11:55] [INFO ] Computed 9 invariants in 7 ms
Computed 9 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-7447175802435799339.kers
Total runtime 8 ms.
[2026-05-22 19:11:56] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-22 19:11:56] [INFO ] Invariant cache hit.
[2026-05-22 19:11:56] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 196/221 places, 278/368 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62273 ms. Remains : 196/221 places, 278/368 transitions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Applied a total of 0 rules in 7 ms. Remains 196 /196 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2026-05-22 19:11:56] [INFO ] Invariant cache hit.
[2026-05-22 19:11:56] [INFO ] Implicit Places using invariants in 98 ms returned []
[2026-05-22 19:11:56] [INFO ] Invariant cache hit.
[2026-05-22 19:11:56] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
Running 277 sub problems to find dead transitions.
[2026-05-22 19:11:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (OVERLAPS) 278/474 variables, 196/245 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 474/474 variables, and 245 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 277 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/195 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 1 (OVERLAPS) 1/196 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 5 (OVERLAPS) 278/474 variables, 196/246 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 277/523 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 277 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 2/526 constraints. Problems are: Problem set: 0 solved, 277 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 474/474 variables, and 526 constraints, problems are : Problem set: 0 solved, 277 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 277/277 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60208ms problems are : Problem set: 0 solved, 277 unsolved
Search for dead transitions found 0 dead transitions in 60212ms
Finished structural reductions in LTL mode , in 1 iterations and 60602 ms. Remains : 196/196 places, 278/278 transitions.
Support contains 78 out of 196 places after structural reductions.
[2026-05-22 19:12:57] [INFO ] Flatten gal took : 99 ms
[2026-05-22 19:12:57] [INFO ] Flatten gal took : 50 ms
[2026-05-22 19:12:57] [INFO ] Input system was already deterministic with 278 transitions.
Support contains 74 out of 196 places (down from 78) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 64 to 63
RANDOM walk for 40000 steps (46 resets) in 2085 ms. (19 steps per ms) remains 10/63 properties
BEST_FIRST walk for 40003 steps (84 resets) in 278 ms. (143 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (77 resets) in 108 ms. (366 steps per ms) remains 6/10 properties
BEST_FIRST walk for 40001 steps (62 resets) in 119 ms. (333 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40000 steps (50 resets) in 105 ms. (377 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40002 steps (65 resets) in 151 ms. (263 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (112 resets) in 75 ms. (526 steps per ms) remains 3/4 properties
[2026-05-22 19:12:58] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 77/196 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 278/474 variables, 196/211 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 2/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/474 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 0/474 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 474/474 variables, and 213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1186 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem AtomicPropp1 is UNSAT
At refinement iteration 1 (OVERLAPS) 112/119 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 77/196 variables, 5/9 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 4/19 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 278/474 variables, 196/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/474 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/474 variables, 2/222 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/474 variables, 2/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/474 variables, 0/224 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 474/474 variables, and 224 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1550 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 196/196 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 2745ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 275 ms.
Support contains 4 out of 196 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 196/196 places, 278/278 transitions.
Graph (trivial) has 179 edges and 196 vertex of which 4 / 196 are part of one of the 2 SCC in 8 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 532 edges and 194 vertex of which 192 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 79 rules applied. Total rules applied 81 place count 192 transition count 195
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 106 rules applied. Total rules applied 187 place count 114 transition count 167
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 17 rules applied. Total rules applied 204 place count 98 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 205 place count 97 transition count 166
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 205 place count 97 transition count 159
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 219 place count 90 transition count 159
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 227 place count 82 transition count 151
Iterating global reduction 4 with 8 rules applied. Total rules applied 235 place count 82 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 235 place count 82 transition count 149
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 239 place count 80 transition count 149
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 62 rules applied. Total rules applied 301 place count 49 transition count 118
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 310 place count 40 transition count 81
Iterating global reduction 4 with 9 rules applied. Total rules applied 319 place count 40 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 323 place count 40 transition count 77
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
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 325 place count 39 transition count 90
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 326 place count 39 transition count 89
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 328 place count 39 transition count 87
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 330 place count 37 transition count 87
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 331 place count 37 transition count 87
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 332 place count 36 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 333 place count 35 transition count 86
Applied a total of 333 rules in 98 ms. Remains 35 /196 variables (removed 161) and now considering 86/278 (removed 192) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 35/196 places, 86/278 transitions.
RANDOM walk for 40000 steps (1698 resets) in 275 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (389 resets) in 134 ms. (296 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (383 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-449436111909556566.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3896137330173422124.kers'
[2026-05-22 19:13:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-449436111909556566.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3896137330173422124.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 86 rows 34 cols 551 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:13:01] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3896137330173422124.kers
Total runtime 2 ms.
[2026-05-22 19:13:01] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/99 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 14/113 variables, 9/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/114 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/114 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/114 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 7/121 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/121 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/121 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/121 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/121 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/121 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 121/121 variables, and 53 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4/20 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 79/99 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/113 variables, 9/43 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/113 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/113 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/113 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/114 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/114 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/114 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 7/121 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/121 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/121 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/121 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/121 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 121/121 variables, and 56 constraints, problems are : Problem set: 0 solved, 1 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 422ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 86/86 transitions.
Graph (complete) has 208 edges and 35 vertex of which 33 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 33 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 32 transition count 83
Applied a total of 3 rules in 12 ms. Remains 32 /35 variables (removed 3) and now considering 83/86 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 32/35 places, 83/86 transitions.
RANDOM walk for 40000 steps (1219 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (263 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Probably explored full state space saw : 14979 states, properties seen :0
Probabilistic random walk after 75432 steps, saw 14979 distinct states, run finished after 163 ms. (steps per millisecond=462 ) properties seen :0
Explored full state space saw : 14979 states, properties seen :0
Exhaustive walk after 75432 steps, saw 14979 distinct states, run finished after 60 ms. (steps per millisecond=1257 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 19:13:02] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:13:02] [INFO ] Flatten gal took : 23 ms
[2026-05-22 19:13:02] [INFO ] Input system was already deterministic with 278 transitions.
Computed a total of 37 stabilizing places and 37 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Graph (trivial) has 174 edges and 196 vertex of which 4 / 196 are part of one of the 2 SCC in 0 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 193 transition count 192
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 111 rules applied. Total rules applied 195 place count 110 transition count 164
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 211 place count 94 transition count 164
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 211 place count 94 transition count 159
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 221 place count 89 transition count 159
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 230 place count 80 transition count 150
Iterating global reduction 3 with 9 rules applied. Total rules applied 239 place count 80 transition count 150
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 239 place count 80 transition count 149
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 241 place count 79 transition count 149
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 3 with 44 rules applied. Total rules applied 285 place count 57 transition count 127
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 292 place count 50 transition count 100
Iterating global reduction 3 with 7 rules applied. Total rules applied 299 place count 50 transition count 100
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 307 place count 50 transition count 92
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 311 place count 46 transition count 92
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 312 place count 46 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 314 place count 44 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 315 place count 43 transition count 89
Applied a total of 315 rules in 42 ms. Remains 43 /196 variables (removed 153) and now considering 89/278 (removed 189) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10961337015485341383.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9859469534989770709.kers'
[2026-05-22 19:13:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10961337015485341383.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9859469534989770709.kers]
Normalized transition count is 88 out of 89 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 88 rows 42 cols 470 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 19:13:02] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-9859469534989770709.kers
Total runtime 4 ms.
[2026-05-22 19:13:02] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 19:13:02] [INFO ] Invariant cache hit.
[2026-05-22 19:13:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:13:02] [INFO ] Implicit Places using invariants and state equation in 90 ms returned [37, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 148 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/196 places, 89/278 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 41 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 40 transition count 88
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 40 transition count 87
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 39 transition count 87
Applied a total of 4 rules in 8 ms. Remains 39 /41 variables (removed 2) and now considering 87/89 (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-15467336925522931197.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2828390655738859549.kers'
[2026-05-22 19:13:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15467336925522931197.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2828390655738859549.kers]
Normalized transition count is 86 out of 87 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 39 cols 463 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-22 19:13:02] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2828390655738859549.kers
Total runtime 5 ms.
[2026-05-22 19:13:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 19:13:03] [INFO ] Invariant cache hit.
[2026-05-22 19:13:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:13:03] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/196 places, 87/278 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 324 ms. Remains : 39/196 places, 87/278 transitions.
[2026-05-22 19:13:03] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:13:03] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:13:03] [INFO ] Input system was already deterministic with 87 transitions.
[2026-05-22 19:13:03] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:13:03] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:13:03] [INFO ] Time to serialize gal into /tmp/CTLFireability2761840879724796554.gal : 4 ms
[2026-05-22 19:13:03] [INFO ] Time to serialize properties into /tmp/CTLFireability1753333908777647927.ctl : 5 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/CTLFireability2761840879724796554.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1753333908777647927.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,108171,0.855582,26388,2,1630,5,92656,6,0,242,94928,0


Converting to forward existential form...Done !
original formula: AF(((((p56==1)&&(p81==1))&&((p112==1)&&(p149==1)))&&(p179==1)))
=> equivalent forward existential formula: [FwdG(Init,!(((((p56==1)&&(p81==1))&&((p112==1)&&(p149==1)))&&(p179==1))))] = FALSE
Hit Full ! (commute/partial/dont) 62/0/25
(forward)formula 0,0,2.11649,42920,1,0,13,178847,20,4,1778,163860,11
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 183 transition count 265
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 183 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 182 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 182 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 181 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 181 transition count 263
Applied a total of 30 rules in 16 ms. Remains 181 /196 variables (removed 15) and now considering 263/278 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10067884198819079536.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2048238672090791220.kers'
[2026-05-22 19:13:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10067884198819079536.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2048238672090791220.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 181 cols 1062 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-22 19:13:05] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2048238672090791220.kers
Total runtime 2 ms.
[2026-05-22 19:13:05] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 19:13:05] [INFO ] Invariant cache hit.
[2026-05-22 19:13:05] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-22 19:13:05] [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, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 12/48 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (OVERLAPS) 263/444 variables, 181/230 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 234 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 2/2 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, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/444 variables, 181/233 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 262/495 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 2/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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 444/444 variables, and 498 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60153ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60155ms
Starting structural reductions in LTL mode, iteration 1 : 181/196 places, 263/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 181/196 places, 263/278 transitions.
[2026-05-22 19:14:05] [INFO ] Flatten gal took : 30 ms
[2026-05-22 19:14:05] [INFO ] Flatten gal took : 28 ms
[2026-05-22 19:14:05] [INFO ] Input system was already deterministic with 263 transitions.
[2026-05-22 19:14:05] [INFO ] Flatten gal took : 29 ms
[2026-05-22 19:14:06] [INFO ] Flatten gal took : 25 ms
[2026-05-22 19:14:06] [INFO ] Time to serialize gal into /tmp/CTLFireability11735407324794201910.gal : 14 ms
[2026-05-22 19:14:06] [INFO ] Time to serialize properties into /tmp/CTLFireability6038713197100378293.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/CTLFireability11735407324794201910.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6038713197100378293.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44469e+09,9.40554,197048,2,15072,5,762867,6,0,989,948600,0


Converting to forward existential form...Done !
original formula: AF((EF(((E((p213==1) U (p173==1)) * (p111==1)) * (p154==1))) * (((EF((((p6==1)&&(p16==1))&&((p52==1)&&(p178==1)))) + E((p47==1) U (p77==1...288
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((E((p213==1) U (p173==1)) * (p111==1)) * (p154==1))) * (((E(TRUE U (((p6==1)&&(p16==1))&...351
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t34, t38, t39, t40, t54, t64, t65, t68, t69, t71, t84, t90, t91, t94, t95...448
Detected timeout of ITS tools.
[2026-05-22 19:14:36] [INFO ] Flatten gal took : 14 ms
[2026-05-22 19:14:36] [INFO ] Applying decomposition
[2026-05-22 19:14:36] [INFO ] Flatten gal took : 13 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/graph2459342656414017050.txt' '-o' '/tmp/graph2459342656414017050.bin' '-w' '/tmp/graph2459342656414017050.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph2459342656414017050.bin' '-l' '-1' '-v' '-w' '/tmp/graph2459342656414017050.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:14:36] [INFO ] Decomposing Gal with order
[2026-05-22 19:14:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:14:36] [INFO ] Removed a total of 238 redundant transitions.
[2026-05-22 19:14:36] [INFO ] Flatten gal took : 106 ms
[2026-05-22 19:14:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 12 ms.
[2026-05-22 19:14:36] [INFO ] Time to serialize gal into /tmp/CTLFireability14650664245924053543.gal : 12 ms
[2026-05-22 19:14:36] [INFO ] Time to serialize properties into /tmp/CTLFireability8179903103126333061.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/CTLFireability14650664245924053543.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8179903103126333061.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.44469e+09,0.084239,6388,452,96,3964,664,460,5565,72,1874,0


Converting to forward existential form...Done !
original formula: AF((EF(((E((i13.i2.u69.p213==1) U (i11.u54.p173==1)) * (i6.u34.p111==1)) * (i11.u55.p154==1))) * (((EF((((i10.u2.p6==1)&&(i10.u2.p16==1))...447
=> equivalent forward existential formula: [FwdG(Init,!((E(TRUE U ((E((i13.i2.u69.p213==1) U (i11.u54.p173==1)) * (i6.u34.p111==1)) * (i11.u55.p154==1))) *...510
Reverse transition relation is NOT exact ! Due to transitions t170, t175, t191, t207, t231, i1.u15.t145, i1.u15.t148, i1.u16.t146, i2.i1.t161, i2.i1.u9.t14...626
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,2.23741,76044,1,0,181293,2074,2965,173311,387,10697,245945
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 262
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 178 transition count 260
Applied a total of 36 rules in 15 ms. Remains 178 /196 variables (removed 18) and now considering 260/278 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14783879896124194564.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9194729459157887761.kers'
[2026-05-22 19:14:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14783879896124194564.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9194729459157887761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:14:38] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9194729459157887761.kers
Total runtime 2 ms.
[2026-05-22 19:14:38] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 19:14:38] [INFO ] Invariant cache hit.
[2026-05-22 19:14:39] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 19:14:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 226 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/225 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/484 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 489 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60099ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60100ms
Starting structural reductions in LTL mode, iteration 1 : 178/196 places, 260/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60429 ms. Remains : 178/196 places, 260/278 transitions.
[2026-05-22 19:15:39] [INFO ] Flatten gal took : 18 ms
[2026-05-22 19:15:39] [INFO ] Flatten gal took : 17 ms
[2026-05-22 19:15:39] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-22 19:15:39] [INFO ] Flatten gal took : 17 ms
[2026-05-22 19:15:39] [INFO ] Flatten gal took : 17 ms
[2026-05-22 19:15:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3115226605772851656.gal : 6 ms
[2026-05-22 19:15:39] [INFO ] Time to serialize properties into /tmp/CTLFireability12455654129245424511.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/CTLFireability3115226605772851656.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12455654129245424511.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,9.91931,216460,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: AG((!(A(A((((p6==1)&&(p16==1))&&((p107==1)&&(p178==1))) U (p169==1)) U EX(((((p56==1)&&(p87==1))&&((p112==1)&&(p143==1)))&&(p179==1))))) ...240
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!(EX(((((p56==1)&&(p87==1))&&((p112==1)&&(p143==1)))&&(p179==1)))) U (!(!((E(...551
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2026-05-22 19:16:09] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:16:09] [INFO ] Applying decomposition
[2026-05-22 19:16:09] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3634609741895887729.txt' '-o' '/tmp/graph3634609741895887729.bin' '-w' '/tmp/graph3634609741895887729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3634609741895887729.bin' '-l' '-1' '-v' '-w' '/tmp/graph3634609741895887729.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:16:09] [INFO ] Decomposing Gal with order
[2026-05-22 19:16:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:16:09] [INFO ] Removed a total of 237 redundant transitions.
[2026-05-22 19:16:09] [INFO ] Flatten gal took : 27 ms
[2026-05-22 19:16:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2026-05-22 19:16:09] [INFO ] Time to serialize gal into /tmp/CTLFireability1501959113470145961.gal : 5 ms
[2026-05-22 19:16:09] [INFO ] Time to serialize properties into /tmp/CTLFireability16637036513560240038.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/CTLFireability1501959113470145961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16637036513560240038.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.083627,6392,446,102,4124,498,389,6068,78,1561,0


Converting to forward existential form...Done !
original formula: AG((!(A(A((((i0.u2.p6==1)&&(i0.u2.p16==1))&&((i7.u28.p107==1)&&(i0.u2.p178==1))) U (i11.i1.u51.p169==1)) U EX(((((i4.u17.p56==1)&&(i6.i1....360
=> equivalent forward existential formula: [(FwdU((FwdU(Init,TRUE) * !(!(!((E(!(EX(((((i4.u17.p56==1)&&(i6.i1.u27.p87==1))&&((i8.u34.p112==1)&&(i10.u43.p14...791
Reverse transition relation is NOT exact ! Due to transitions t167, t172, t188, t208, t228, t257, i0.t165, i1.u52.t32, i1.u52.t35, i1.u52.t36, i1.u52.t37, ...607
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
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 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,1,6.51971,198304,1,0,446679,2599,2475,451265,411,12204,449079
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 184 transition count 266
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 184 transition count 266
Applied a total of 24 rules in 4 ms. Remains 184 /196 variables (removed 12) and now considering 266/278 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4177499236798247308.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-64410495986986067.kers'
[2026-05-22 19:16:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4177499236798247308.kers, --Pflows, --basisKERS=/tmp/petrispot-output-64410495986986067.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 266 rows 184 cols 1068 entries
Finished phase 1 with 175 SingleSign rule and 0 generalized
[2026-05-22 19:16:16] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-64410495986986067.kers
Total runtime 7 ms.
[2026-05-22 19:16:16] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 19:16:16] [INFO ] Invariant cache hit.
[2026-05-22 19:16:16] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
Running 265 sub problems to find dead transitions.
[2026-05-22 19:16:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/184 variables, 12/46 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/184 variables, 5/51 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 4/63 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/450 variables, and 63 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/184 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 265 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/183 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 1 (OVERLAPS) 1/184 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/184 variables, 54/63 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/184 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 4 (OVERLAPS) 266/450 variables, 184/247 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 265/512 constraints. Problems are: Problem set: 0 solved, 265 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/450 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 265 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/450 variables, and 519 constraints, problems are : Problem set: 0 solved, 265 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 184/184 constraints, PredecessorRefiner: 265/265 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 60089ms problems are : Problem set: 0 solved, 265 unsolved
Search for dead transitions found 0 dead transitions in 60090ms
Starting structural reductions in LTL mode, iteration 1 : 184/196 places, 266/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60355 ms. Remains : 184/196 places, 266/278 transitions.
[2026-05-22 19:17:16] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:17:16] [INFO ] Flatten gal took : 32 ms
[2026-05-22 19:17:16] [INFO ] Input system was already deterministic with 266 transitions.
[2026-05-22 19:17:16] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:17:16] [INFO ] Flatten gal took : 11 ms
[2026-05-22 19:17:16] [INFO ] Time to serialize gal into /tmp/CTLFireability14264170222036247890.gal : 5 ms
[2026-05-22 19:17:16] [INFO ] Time to serialize properties into /tmp/CTLFireability17391169832943694907.ctl : 5 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/CTLFireability14264170222036247890.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17391169832943694907.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,1.68065e+09,9.32052,199032,2,14401,5,760750,6,0,1004,971305,0


Converting to forward existential form...Done !
original formula: (AF(((AG((p55==0)) + !(E(((p55==1)&&(p202==1)) U (((((p50==1)&&(p87==1))&&((p112==1)&&(p143==1)))&&(p179==1))||(p35==1))))) * AF(((p38==1...786
=> equivalent forward existential formula: (([((Init * !(!(EG(!(((!(E(TRUE U !((p55==0)))) + !(E(((p55==1)&&(p202==1)) U (((((p50==1)&&(p87==1))&&((p112==1...1376
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t26, t34, t37, t38, t39, t64, t65, t68, t69, t71, t84, t85, t91, t92, t95, t96...454
Detected timeout of ITS tools.
[2026-05-22 19:17:46] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:17:46] [INFO ] Applying decomposition
[2026-05-22 19:17:46] [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/graph3762343243070554729.txt' '-o' '/tmp/graph3762343243070554729.bin' '-w' '/tmp/graph3762343243070554729.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3762343243070554729.bin' '-l' '-1' '-v' '-w' '/tmp/graph3762343243070554729.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:17:46] [INFO ] Decomposing Gal with order
[2026-05-22 19:17:46] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:17:46] [INFO ] Removed a total of 241 redundant transitions.
[2026-05-22 19:17:46] [INFO ] Flatten gal took : 33 ms
[2026-05-22 19:17:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 7 ms.
[2026-05-22 19:17:46] [INFO ] Time to serialize gal into /tmp/CTLFireability3768432929557165833.gal : 7 ms
[2026-05-22 19:17:46] [INFO ] Time to serialize properties into /tmp/CTLFireability434512984615259999.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/CTLFireability3768432929557165833.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability434512984615259999.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 -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.68065e+09,0.144491,7020,544,101,5635,501,479,7563,80,1435,0


Converting to forward existential form...Done !
original formula: (AF(((AG((i2.i1.u17.p55==0)) + !(E(((i2.i1.u17.p55==1)&&(i14.i1.u66.p202==1)) U (((((i3.u15.p50==1)&&(i4.u26.p87==1))&&((i6.i0.u34.p112==...1241
=> equivalent forward existential formula: (([((Init * !(!(EG(!(((!(E(TRUE U !((i2.i1.u17.p55==0)))) + !(E(((i2.i1.u17.p55==1)&&(i14.i1.u66.p202==1)) U (((...2073
Reverse transition relation is NOT exact ! Due to transitions t172, t177, t193, t209, t237, t263, i0.t170, i2.i1.t163, i2.i1.u8.t142, i2.i1.u17.t143, i3.u1...649
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
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 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 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
(forward)formula 0,1,18.7226,510508,1,0,1.01299e+06,3859,3722,1.21605e+06,465,28419,1170299
FORMULA AutonomousCar-PT-04b-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 : 196/196 places, 278/278 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 262
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 178 transition count 260
Applied a total of 36 rules in 7 ms. Remains 178 /196 variables (removed 18) and now considering 260/278 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18041531870994495050.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15872129535750482407.kers'
[2026-05-22 19:18:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18041531870994495050.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15872129535750482407.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:18:05] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15872129535750482407.kers
Total runtime 2 ms.
[2026-05-22 19:18:05] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 19:18:05] [INFO ] Invariant cache hit.
[2026-05-22 19:18:05] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 19:18:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 226 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/225 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/484 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 489 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 178/196 places, 260/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60391 ms. Remains : 178/196 places, 260/278 transitions.
[2026-05-22 19:19:06] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:19:06] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:19:06] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-22 19:19:06] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:19:06] [INFO ] Flatten gal took : 11 ms
[2026-05-22 19:19:06] [INFO ] Time to serialize gal into /tmp/CTLFireability17235143668632680625.gal : 5 ms
[2026-05-22 19:19:06] [INFO ] Time to serialize properties into /tmp/CTLFireability3041617989574257867.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/CTLFireability17235143668632680625.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3041617989574257867.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,10.1472,215440,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: EF(EX((((p6==1)&&(p16==1))&&((p126==1)&&(p178==1)))))
=> equivalent forward existential formula: [(EY(FwdU(Init,TRUE)) * (((p6==1)&&(p16==1))&&((p126==1)&&(p178==1))))] != FALSE
(forward)formula 0,1,10.5501,215440,1,0,8,812872,8,1,1867,1.05478e+06,2
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 183 transition count 265
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 183 transition count 265
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 182 transition count 264
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 182 transition count 264
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 181 transition count 263
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 181 transition count 263
Applied a total of 30 rules in 6 ms. Remains 181 /196 variables (removed 15) and now considering 263/278 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7428794255910200246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12634769780010524307.kers'
[2026-05-22 19:19:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7428794255910200246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12634769780010524307.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 263 rows 181 cols 1062 entries
Finished phase 1 with 172 SingleSign rule and 0 generalized
[2026-05-22 19:19:16] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12634769780010524307.kers
Total runtime 2 ms.
[2026-05-22 19:19:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2026-05-22 19:19:16] [INFO ] Invariant cache hit.
[2026-05-22 19:19:17] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-22 19:19:17] [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, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (OVERLAPS) 263/444 variables, 181/223 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/444 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 444/444 variables, and 229 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 181/181 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 2/2 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, 9/9 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 37/46 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/181 variables, 4/50 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (OVERLAPS) 263/444 variables, 181/232 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/444 variables, 262/494 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 2/497 constraints. Problems are: Problem set: 0 solved, 262 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
SMT process timed out in 60116ms, After SMT, problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Starting structural reductions in LTL mode, iteration 1 : 181/196 places, 263/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60421 ms. Remains : 181/196 places, 263/278 transitions.
[2026-05-22 19:20:17] [INFO ] Flatten gal took : 14 ms
[2026-05-22 19:20:17] [INFO ] Flatten gal took : 11 ms
[2026-05-22 19:20:17] [INFO ] Input system was already deterministic with 263 transitions.
[2026-05-22 19:20:17] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:20:17] [INFO ] Flatten gal took : 11 ms
[2026-05-22 19:20:17] [INFO ] Time to serialize gal into /tmp/CTLFireability13000084665710084972.gal : 4 ms
[2026-05-22 19:20:17] [INFO ] Time to serialize properties into /tmp/CTLFireability1151244760908686467.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/CTLFireability13000084665710084972.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1151244760908686467.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54719e+09,10.5856,220168,2,14267,5,803947,6,0,989,1.05558e+06,0


Converting to forward existential form...Done !
original formula: !(A(EF((p80!=1)) U A(EG((p92==1)) U ((EX((p82==1)) * (!(A((((p6==1)&&(p16==1))&&((p114==1)&&(p178==1))) U ((((p50==1)&&(p87==1))&&((p118=...266
=> equivalent forward existential formula: (((([((FwdU((FwdU(Init,!(!((E(!(((EX((p82==1)) * (!(!((E(!(((((p50==1)&&(p87==1))&&((p118==1)&&(p149==1)))&&(p17...7876
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t82, t88, t89, t92, t93, t95...431
Detected timeout of ITS tools.
[2026-05-22 19:20:47] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:20:47] [INFO ] Applying decomposition
[2026-05-22 19:20:47] [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/graph14461078122178308475.txt' '-o' '/tmp/graph14461078122178308475.bin' '-w' '/tmp/graph14461078122178308475.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14461078122178308475.bin' '-l' '-1' '-v' '-w' '/tmp/graph14461078122178308475.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:20:47] [INFO ] Decomposing Gal with order
[2026-05-22 19:20:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:20:47] [INFO ] Removed a total of 238 redundant transitions.
[2026-05-22 19:20:47] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:20:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2026-05-22 19:20:47] [INFO ] Time to serialize gal into /tmp/CTLFireability3665352890716669071.gal : 4 ms
[2026-05-22 19:20:47] [INFO ] Time to serialize properties into /tmp/CTLFireability8176629268420860254.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/CTLFireability3665352890716669071.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability8176629268420860254.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.54719e+09,0.126598,6588,497,99,4057,715,467,6972,79,3003,0


Converting to forward existential form...Done !
original formula: !(A(EF((i5.u26.p80!=1)) U A(EG((i6.i1.u33.p92==1)) U ((EX((i5.u25.p82==1)) * (!(A((((i11.u2.p6==1)&&(i11.u2.p16==1))&&((i7.u36.p114==1)&&...404
=> equivalent forward existential formula: (((([((FwdU((FwdU(Init,!(!((E(!(((EX((i5.u25.p82==1)) * (!(!((E(!(((((i2.u16.p50==1)&&(i4.i2.u28.p87==1))&&((i7....12044
Reverse transition relation is NOT exact ! Due to transitions t170, t172, t204, t228, t260, i0.u55.t32, i0.u55.t35, i0.u55.t36, i0.u55.t37, i2.u15.t145, i2...627
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
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 12
Fast SCC detection found an SCC at level 13
Fast SCC detection found an SCC at level 14
(forward)formula 0,1,9.95517,301248,1,0,637194,3985,3604,805957,453,32003,724751
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Graph (trivial) has 182 edges and 196 vertex of which 4 / 196 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 193 transition count 194
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 109 rules applied. Total rules applied 191 place count 112 transition count 166
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 207 place count 96 transition count 166
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 207 place count 96 transition count 160
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 219 place count 90 transition count 160
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 228 place count 81 transition count 151
Iterating global reduction 3 with 9 rules applied. Total rules applied 237 place count 81 transition count 151
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 237 place count 81 transition count 150
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 239 place count 80 transition count 150
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 291 place count 54 transition count 124
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 299 place count 46 transition count 92
Iterating global reduction 3 with 8 rules applied. Total rules applied 307 place count 46 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 315 place count 46 transition count 84
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 319 place count 42 transition count 84
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 320 place count 42 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 40 transition count 81
Applied a total of 322 rules in 34 ms. Remains 40 /196 variables (removed 156) and now considering 81/278 (removed 197) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5056539825940838904.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2659383979373561103.kers'
[2026-05-22 19:20:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5056539825940838904.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2659383979373561103.kers]
Normalized transition count is 80 out of 81 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 80 rows 38 cols 474 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-22 19:20:57] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2659383979373561103.kers
Total runtime 1 ms.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 19:20:57] [INFO ] Invariant cache hit.
[2026-05-22 19:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [34, 39]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 135 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 38/196 places, 81/278 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 38 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 37 transition count 80
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 37 transition count 79
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 36 transition count 79
Applied a total of 4 rules in 5 ms. Remains 36 /38 variables (removed 2) and now considering 79/81 (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-5405440561078794514.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12143917692504904030.kers'
[2026-05-22 19:20:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5405440561078794514.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12143917692504904030.kers]
Normalized transition count is 78 out of 79 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 78 rows 35 cols 467 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 19:20:57] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12143917692504904030.kers
Total runtime 1 ms.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-22 19:20:57] [INFO ] Invariant cache hit.
[2026-05-22 19:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 111 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 36/196 places, 79/278 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 285 ms. Remains : 36/196 places, 79/278 transitions.
[2026-05-22 19:20:57] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:20:57] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:20:57] [INFO ] Input system was already deterministic with 79 transitions.
[2026-05-22 19:20:57] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:20:57] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:20:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17714797608076899622.gal : 1 ms
[2026-05-22 19:20:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3127677237040713760.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17714797608076899622.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3127677237040713760.prop' '--nowitness' '--gen-order' 'FOLLOW'

RANDOM walk for 8961 steps (537 resets) in 81 ms. (109 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Graph (trivial) has 182 edges and 196 vertex of which 4 / 196 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 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 193 transition count 193
Reduce places removed 82 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 108 rules applied. Total rules applied 191 place count 111 transition count 167
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 207 place count 96 transition count 166
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 210 place count 95 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 94 transition count 164
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 211 place count 94 transition count 159
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 221 place count 89 transition count 159
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 230 place count 80 transition count 150
Iterating global reduction 5 with 9 rules applied. Total rules applied 239 place count 80 transition count 150
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 239 place count 80 transition count 148
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 243 place count 78 transition count 148
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 295 place count 52 transition count 122
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 304 place count 43 transition count 85
Iterating global reduction 5 with 9 rules applied. Total rules applied 313 place count 43 transition count 85
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 5 with 7 rules applied. Total rules applied 320 place count 43 transition count 78
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 323 place count 40 transition count 78
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 324 place count 40 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 326 place count 38 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 327 place count 37 transition count 75
Applied a total of 327 rules in 27 ms. Remains 37 /196 variables (removed 159) and now considering 75/278 (removed 203) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6476015353521420234.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16750075463078473039.kers'
[2026-05-22 19:20:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6476015353521420234.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16750075463078473039.kers]
Normalized transition count is 74 out of 75 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 36 cols 410 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 19:20:57] [INFO ] Computed 7 invariants in 3 ms
Computed 7 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16750075463078473039.kers
Total runtime 4 ms.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 19:20:57] [INFO ] Invariant cache hit.
[2026-05-22 19:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:20:57] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [31, 36]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 144 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 35/196 places, 75/278 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 35 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 34 transition count 74
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 34 transition count 73
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 33 transition count 73
Applied a total of 4 rules in 7 ms. Remains 33 /35 variables (removed 2) and now considering 73/75 (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-12041230086800308989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10815854214142328491.kers'
[2026-05-22 19:20:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12041230086800308989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10815854214142328491.kers]
Normalized transition count is 72 out of 73 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 72 rows 33 cols 403 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:20:57] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10815854214142328491.kers
Total runtime 1 ms.
[2026-05-22 19:20:58] [INFO ] Implicit Places using invariants in 74 ms returned []
[2026-05-22 19:20:58] [INFO ] Invariant cache hit.
[2026-05-22 19:20:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:20:58] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 33/196 places, 73/278 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 364 ms. Remains : 33/196 places, 73/278 transitions.
[2026-05-22 19:20:58] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:20:58] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:20:58] [INFO ] Input system was already deterministic with 73 transitions.
RANDOM walk for 53 steps (3 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 19:20:58] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:20:58] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:20:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8846421028280049775.gal : 2 ms
[2026-05-22 19:20:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18310455001777418986.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8846421028280049775.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18310455001777418986.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 263
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 180 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 179 transition count 261
Applied a total of 34 rules in 10 ms. Remains 179 /196 variables (removed 17) and now considering 261/278 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1934982271012856022.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3355005219532867348.kers'
[2026-05-22 19:20:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1934982271012856022.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3355005219532867348.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 179 cols 1058 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-22 19:20:58] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3355005219532867348.kers
Total runtime 3 ms.
[2026-05-22 19:20:58] [INFO ] Implicit Places using invariants in 112 ms returned []
[2026-05-22 19:20:58] [INFO ] Invariant cache hit.
[2026-05-22 19:20:58] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-22 19:20:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 5/34 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 11/45 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 3/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 179/440 variables, and 56 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 0/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 47/47 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (OVERLAPS) 261/440 variables, 179/236 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 260/496 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 502 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 60087ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60088ms
Starting structural reductions in LTL mode, iteration 1 : 179/196 places, 261/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60543 ms. Remains : 179/196 places, 261/278 transitions.
[2026-05-22 19:21:58] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:21:58] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:21:58] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-22 19:21:58] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:21:58] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:21:58] [INFO ] Time to serialize gal into /tmp/CTLFireability4487025892214859720.gal : 4 ms
[2026-05-22 19:21:58] [INFO ] Time to serialize properties into /tmp/CTLFireability1359584224750290925.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/CTLFireability4487025892214859720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1359584224750290925.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,10.0103,206744,2,14634,5,784331,6,0,979,1.00398e+06,0


Converting to forward existential form...Done !
original formula: A(EF(AX((p89==1))) U (((p6==1)&&(p15==1))&&((p95==1)&&(p178==1))))
=> equivalent forward existential formula: [((Init * !(EG(!((((p6==1)&&(p15==1))&&((p95==1)&&(p178==1))))))) * !(E(!((((p6==1)&&(p15==1))&&((p95==1)&&(p178...261
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...455
Detected timeout of ITS tools.
[2026-05-22 19:22:28] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:22:28] [INFO ] Applying decomposition
[2026-05-22 19:22:28] [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/graph8624365936735289761.txt' '-o' '/tmp/graph8624365936735289761.bin' '-w' '/tmp/graph8624365936735289761.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8624365936735289761.bin' '-l' '-1' '-v' '-w' '/tmp/graph8624365936735289761.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:22:28] [INFO ] Decomposing Gal with order
[2026-05-22 19:22:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:22:28] [INFO ] Removed a total of 243 redundant transitions.
[2026-05-22 19:22:28] [INFO ] Flatten gal took : 25 ms
[2026-05-22 19:22:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 7 ms.
[2026-05-22 19:22:28] [INFO ] Time to serialize gal into /tmp/CTLFireability11371149119619481499.gal : 4 ms
[2026-05-22 19:22:29] [INFO ] Time to serialize properties into /tmp/CTLFireability1584923993493592943.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/CTLFireability11371149119619481499.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1584923993493592943.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.173556,6928,509,100,5312,485,450,7579,78,1501,0


Converting to forward existential form...Done !
original formula: A(EF(AX((i6.i0.u19.p89==1))) U (((i1.u2.p6==1)&&(i1.u2.p15==1))&&((i7.i0.u32.p95==1)&&(i1.u2.p178==1))))
=> equivalent forward existential formula: [((Init * !(EG(!((((i1.u2.p6==1)&&(i1.u2.p15==1))&&((i7.i0.u32.p95==1)&&(i1.u2.p178==1))))))) * !(E(!((((i1.u2.p...355
Reverse transition relation is NOT exact ! Due to transitions t168, t173, t189, t205, t229, t258, i0.u49.t32, i0.u49.t35, i0.u49.t36, i0.u49.t37, i1.t166, ...646
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
Fast SCC detection found an SCC at level 14
(forward)formula 0,0,9.93614,276400,1,0,591390,3130,2937,699845,413,20048,682460
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-09 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 : 196/196 places, 278/278 transitions.
Graph (trivial) has 173 edges and 196 vertex of which 4 / 196 are part of one of the 2 SCC in 0 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 75 transitions
Trivial Post-agglo rules discarded 75 transitions
Performed 75 trivial Post agglomeration. Transition count delta: 75
Iterating post reduction 0 with 75 rules applied. Total rules applied 76 place count 193 transition count 200
Reduce places removed 75 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 99 rules applied. Total rules applied 175 place count 118 transition count 176
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 191 place count 105 transition count 173
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 194 place count 102 transition count 173
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 194 place count 102 transition count 166
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 208 place count 95 transition count 166
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 214 place count 89 transition count 160
Iterating global reduction 4 with 6 rules applied. Total rules applied 220 place count 89 transition count 160
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 220 place count 89 transition count 159
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 222 place count 88 transition count 159
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 268 place count 65 transition count 136
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 275 place count 58 transition count 109
Iterating global reduction 4 with 7 rules applied. Total rules applied 282 place count 58 transition count 109
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 288 place count 58 transition count 103
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 291 place count 55 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 292 place count 55 transition count 102
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 293 place count 55 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 295 place count 53 transition count 100
Applied a total of 295 rules in 34 ms. Remains 53 /196 variables (removed 143) and now considering 100/278 (removed 178) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-937781588205686305.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5672297327961071333.kers'
[2026-05-22 19:22:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-937781588205686305.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5672297327961071333.kers]
Normalized transition count is 99 out of 100 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 99 rows 52 cols 536 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-22 19:22:39] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5672297327961071333.kers
Total runtime 1 ms.
[2026-05-22 19:22:39] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 19:22:39] [INFO ] Invariant cache hit.
[2026-05-22 19:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:22:39] [INFO ] Implicit Places using invariants and state equation in 99 ms returned [46, 52]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 169 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 51/196 places, 100/278 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 51 transition count 99
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 49 transition count 98
Applied a total of 4 rules in 4 ms. Remains 49 /51 variables (removed 2) and now considering 98/100 (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-14116758089746156191.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1014811747248641233.kers'
[2026-05-22 19:22:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14116758089746156191.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1014811747248641233.kers]
Normalized transition count is 97 out of 98 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 97 rows 48 cols 527 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-22 19:22:39] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1014811747248641233.kers
Total runtime 2 ms.
[2026-05-22 19:22:39] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-22 19:22:39] [INFO ] Invariant cache hit.
[2026-05-22 19:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:22:39] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 49/196 places, 98/278 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 353 ms. Remains : 49/196 places, 98/278 transitions.
[2026-05-22 19:22:39] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:22:39] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:22:39] [INFO ] Input system was already deterministic with 98 transitions.
[2026-05-22 19:22:39] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:22:39] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:22:39] [INFO ] Time to serialize gal into /tmp/CTLFireability3460930986069069388.gal : 1 ms
[2026-05-22 19:22:39] [INFO ] Time to serialize properties into /tmp/CTLFireability14374592038783423570.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/CTLFireability3460930986069069388.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14374592038783423570.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,261672,0.73553,17800,2,2303,5,46618,6,0,291,47782,0


Converting to forward existential form...Done !
original formula: (EF((p59==0)) * AG(AF((((A((p153==1) U (p79==1)) * (p72==0)) * ((((p6==0)||(p14==0))||((p114==0)||(p178==0)))&&(p113==0))) * (p198==0))))...156
=> equivalent forward existential formula: ([(Init * !(E(TRUE U (p59==0))))] = FALSE * [FwdG(FwdU(Init,TRUE),!((((!((E(!((p79==1)) U (!((p153==1)) * !((p79...281
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t5, t7, t9, t11, t13, t14, t16, t18, t19, t24, t26, t39, t46, t53, t54, t58, t59,...429
(forward)formula 0,0,11.4254,244180,1,0,750,1.32744e+06,229,298,3288,1.23311e+06,772
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 263
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 180 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 179 transition count 261
Applied a total of 34 rules in 7 ms. Remains 179 /196 variables (removed 17) and now considering 261/278 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7739817956642226500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8891727272813553701.kers'
[2026-05-22 19:22:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7739817956642226500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8891727272813553701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 179 cols 1058 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-22 19:22:50] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8891727272813553701.kers
Total runtime 2 ms.
[2026-05-22 19:22:51] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-22 19:22:51] [INFO ] Invariant cache hit.
[2026-05-22 19:22:51] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 179/196 places, 261/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 179/196 places, 261/278 transitions.
[2026-05-22 19:22:51] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:22:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:22:51] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-22 19:22:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:22:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:22:51] [INFO ] Time to serialize gal into /tmp/CTLFireability6014163865451680483.gal : 2 ms
[2026-05-22 19:22:51] [INFO ] Time to serialize properties into /tmp/CTLFireability10324296146603759147.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/CTLFireability6014163865451680483.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10324296146603759147.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,9.38529,212440,2,14913,5,805916,6,0,979,1.03625e+06,0


Converting to forward existential form...Done !
original formula: AF(AX(AG((p7==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(E(TRUE U !((p7==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...455
Detected timeout of ITS tools.
[2026-05-22 19:23:21] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:23:21] [INFO ] Applying decomposition
[2026-05-22 19:23:21] [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/graph11903370519197871649.txt' '-o' '/tmp/graph11903370519197871649.bin' '-w' '/tmp/graph11903370519197871649.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11903370519197871649.bin' '-l' '-1' '-v' '-w' '/tmp/graph11903370519197871649.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:23:21] [INFO ] Decomposing Gal with order
[2026-05-22 19:23:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:23:21] [INFO ] Removed a total of 236 redundant transitions.
[2026-05-22 19:23:21] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:23:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2026-05-22 19:23:21] [INFO ] Time to serialize gal into /tmp/CTLFireability1218082547782235536.gal : 3 ms
[2026-05-22 19:23:21] [INFO ] Time to serialize properties into /tmp/CTLFireability9360589566226859795.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/CTLFireability1218082547782235536.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9360589566226859795.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.11899,7184,479,106,4916,764,449,10098,78,4097,0


Converting to forward existential form...Done !
original formula: AF(AX(AG((i0.u2.p7==1))))
=> equivalent forward existential formula: [FwdG(Init,!(!(EX(!(!(E(TRUE U !((i0.u2.p7==1)))))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t168, t170, t190, t202, t226, t258, i0.u52.t32, i0.u52.t35, i0.u52.t36, i0.u52.t37, i1.t165, ...632
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 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.58561,148936,1,0,339957,2902,2932,310317,411,29448,477899
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-11 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 : 196/196 places, 278/278 transitions.
Graph (trivial) has 182 edges and 196 vertex of which 4 / 196 are part of one of the 2 SCC in 0 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 193 transition count 194
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 1 with 108 rules applied. Total rules applied 190 place count 112 transition count 167
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 16 rules applied. Total rules applied 206 place count 97 transition count 166
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 207 place count 96 transition count 166
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 207 place count 96 transition count 161
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 217 place count 91 transition count 161
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 225 place count 83 transition count 153
Iterating global reduction 4 with 8 rules applied. Total rules applied 233 place count 83 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 233 place count 83 transition count 152
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 235 place count 82 transition count 152
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 287 place count 56 transition count 126
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 295 place count 48 transition count 93
Iterating global reduction 4 with 8 rules applied. Total rules applied 303 place count 48 transition count 93
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 309 place count 48 transition count 87
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 312 place count 45 transition count 87
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 45 transition count 86
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 315 place count 43 transition count 84
Applied a total of 315 rules in 19 ms. Remains 43 /196 variables (removed 153) and now considering 84/278 (removed 194) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-950668968688254116.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10347123363083512600.kers'
[2026-05-22 19:23:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-950668968688254116.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10347123363083512600.kers]
Normalized transition count is 83 out of 84 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 83 rows 41 cols 484 entries
Finished phase 1 with 35 SingleSign rule and 0 generalized
[2026-05-22 19:23:27] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10347123363083512600.kers
Total runtime 1 ms.
[2026-05-22 19:23:27] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 19:23:27] [INFO ] Invariant cache hit.
[2026-05-22 19:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:23:27] [INFO ] Implicit Places using invariants and state equation in 75 ms returned [37, 42]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 129 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 41/196 places, 84/278 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 41 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 40 transition count 83
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 40 transition count 82
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 39 transition count 82
Applied a total of 4 rules in 2 ms. Remains 39 /41 variables (removed 2) and now considering 82/84 (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-13494934603958761045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16646604261323816605.kers'
[2026-05-22 19:23:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13494934603958761045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16646604261323816605.kers]
Normalized transition count is 81 out of 82 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 81 rows 38 cols 477 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 19:23:27] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16646604261323816605.kers
Total runtime 1 ms.
[2026-05-22 19:23:27] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-22 19:23:27] [INFO ] Invariant cache hit.
[2026-05-22 19:23:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:23:27] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 39/196 places, 82/278 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 290 ms. Remains : 39/196 places, 82/278 transitions.
[2026-05-22 19:23:27] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:23:27] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:23:27] [INFO ] Input system was already deterministic with 82 transitions.
[2026-05-22 19:23:27] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:23:27] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:23:27] [INFO ] Time to serialize gal into /tmp/CTLFireability14917591896355229889.gal : 1 ms
[2026-05-22 19:23:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11844396382060570980.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/CTLFireability14917591896355229889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11844396382060570980.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,97524,0.67805,17760,2,1217,5,47278,6,0,236,51095,0


Converting to forward existential form...Done !
original formula: EG(AF((((EF((p152==1)) * (p6==1)) * ((p15==1)&&(p95==1))) * (p178==1))))
=> equivalent forward existential formula: [FwdG(Init,!(EG(!((((E(TRUE U (p152==1)) * (p6==1)) * ((p15==1)&&(p95==1))) * (p178==1))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t10, t15, t17, t19, t21, t24, t80, Intersection with reachable a...223
(forward)formula 0,0,4.52451,89996,1,0,449,474841,194,219,2805,351995,468
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 262
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 179 transition count 261
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 178 transition count 260
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 178 transition count 260
Applied a total of 36 rules in 11 ms. Remains 178 /196 variables (removed 18) and now considering 260/278 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10105011207319192829.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-471947391569434628.kers'
[2026-05-22 19:23:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10105011207319192829.kers, --Pflows, --basisKERS=/tmp/petrispot-output-471947391569434628.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 260 rows 178 cols 1056 entries
Finished phase 1 with 169 SingleSign rule and 0 generalized
[2026-05-22 19:23:32] [INFO ] Computed 9 invariants in 3 ms
Computed 9 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-471947391569434628.kers
Total runtime 4 ms.
[2026-05-22 19:23:32] [INFO ] Implicit Places using invariants in 149 ms returned []
[2026-05-22 19:23:32] [INFO ] Invariant cache hit.
[2026-05-22 19:23:32] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 428 ms to find 0 implicit places.
Running 259 sub problems to find dead transitions.
[2026-05-22 19:23:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 20/29 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 13/42 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/178 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (OVERLAPS) 260/438 variables, 178/222 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/226 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 438/438 variables, and 226 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 259 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/177 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 1 (OVERLAPS) 1/178 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/178 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/178 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/178 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 5 (OVERLAPS) 260/438 variables, 178/225 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 259/484 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 1/485 constraints. Problems are: Problem set: 0 solved, 259 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 4/489 constraints. Problems are: Problem set: 0 solved, 259 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 489 constraints, problems are : Problem set: 0 solved, 259 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 178/178 constraints, PredecessorRefiner: 259/259 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 259 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Starting structural reductions in LTL mode, iteration 1 : 178/196 places, 260/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60571 ms. Remains : 178/196 places, 260/278 transitions.
[2026-05-22 19:24:32] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:24:32] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:24:32] [INFO ] Input system was already deterministic with 260 transitions.
[2026-05-22 19:24:32] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:24:32] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:24:32] [INFO ] Time to serialize gal into /tmp/CTLFireability7281432661257774819.gal : 3 ms
[2026-05-22 19:24:32] [INFO ] Time to serialize properties into /tmp/CTLFireability11586045000189668966.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/CTLFireability7281432661257774819.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11586045000189668966.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,9.94995,216048,2,14885,5,812872,6,0,974,1.05478e+06,0


Converting to forward existential form...Done !
original formula: AG((EF((p145==1)) + EX((p212==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX((p212==1)))) * !(E(TRUE U (p145==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...449
Detected timeout of ITS tools.
[2026-05-22 19:25:02] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:25:02] [INFO ] Applying decomposition
[2026-05-22 19:25:02] [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/graph14822388773531605908.txt' '-o' '/tmp/graph14822388773531605908.bin' '-w' '/tmp/graph14822388773531605908.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14822388773531605908.bin' '-l' '-1' '-v' '-w' '/tmp/graph14822388773531605908.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:25:02] [INFO ] Decomposing Gal with order
[2026-05-22 19:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:25:02] [INFO ] Removed a total of 240 redundant transitions.
[2026-05-22 19:25:02] [INFO ] Flatten gal took : 25 ms
[2026-05-22 19:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 19 ms.
[2026-05-22 19:25:02] [INFO ] Time to serialize gal into /tmp/CTLFireability1341983418535649989.gal : 3 ms
[2026-05-22 19:25:02] [INFO ] Time to serialize properties into /tmp/CTLFireability13146767739998468457.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/CTLFireability1341983418535649989.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13146767739998468457.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.104708,5896,466,102,3099,473,435,3905,78,1148,0


Converting to forward existential form...Done !
original formula: AG((EF((i9.u43.p145==1)) + EX((i13.u61.p212==1))))
=> equivalent forward existential formula: [((FwdU(Init,TRUE) * !(EX((i13.u61.p212==1)))) * !(E(TRUE U (i9.u43.p145==1))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t167, t169, t185, t201, t225, t257, i0.u47.t32, i0.u47.t35, i0.u47.t36, i0.u47.t37, i2.t158, ...611
(forward)formula 0,0,0.54649,15676,1,0,26554,1201,2590,32387,382,3020,67318
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 181 transition count 263
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 181 transition count 263
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 180 transition count 262
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 180 transition count 262
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 179 transition count 261
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 179 transition count 261
Applied a total of 34 rules in 7 ms. Remains 179 /196 variables (removed 17) and now considering 261/278 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16873808434503480666.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3313738020581622714.kers'
[2026-05-22 19:25:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16873808434503480666.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3313738020581622714.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 261 rows 179 cols 1058 entries
Finished phase 1 with 170 SingleSign rule and 0 generalized
[2026-05-22 19:25:03] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3313738020581622714.kers
Total runtime 1 ms.
[2026-05-22 19:25:03] [INFO ] Implicit Places using invariants in 89 ms returned []
[2026-05-22 19:25:03] [INFO ] Invariant cache hit.
[2026-05-22 19:25:03] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-22 19:25:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 15/39 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 261/440 variables, 179/229 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 440/440 variables, and 233 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 41/41 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/178 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (OVERLAPS) 1/179 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/179 variables, 41/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/179 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (OVERLAPS) 261/440 variables, 179/229 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/440 variables, 260/489 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 4/495 constraints. Problems are: Problem set: 0 solved, 260 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 440/440 variables, and 495 constraints, problems are : Problem set: 0 solved, 260 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 179/179 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 179/196 places, 261/278 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60367 ms. Remains : 179/196 places, 261/278 transitions.
[2026-05-22 19:26:03] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:26:03] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:26:03] [INFO ] Input system was already deterministic with 261 transitions.
[2026-05-22 19:26:03] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:26:03] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:26:03] [INFO ] Time to serialize gal into /tmp/CTLFireability8153711498353188415.gal : 3 ms
[2026-05-22 19:26:03] [INFO ] Time to serialize properties into /tmp/CTLFireability12963132783761419345.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/CTLFireability8153711498353188415.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12963132783761419345.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...284
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,9.46125,203092,2,14339,5,756725,6,0,979,980636,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(((AF((p59==1)) * (p58==0)) * ((((p6==0)||(p15==0))||((p126==0)||(p178==0)))&&((p185==1)||(((p6==1)&&(p9==1))&&((p114==1)&&(p178=...166
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(((!(EG(!((p59==1)))) * (p58==0)) * ((((p6==0)||(p15==0))||((p126==0)||(p178==0)))&&((...229
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t61, t62, t65, t66, t68, t81, t87, t88, t91, t92, t94...455
Detected timeout of ITS tools.
[2026-05-22 19:26:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:26:33] [INFO ] Applying decomposition
[2026-05-22 19:26:33] [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/graph14576684166797450134.txt' '-o' '/tmp/graph14576684166797450134.bin' '-w' '/tmp/graph14576684166797450134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14576684166797450134.bin' '-l' '-1' '-v' '-w' '/tmp/graph14576684166797450134.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:26:34] [INFO ] Decomposing Gal with order
[2026-05-22 19:26:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:26:34] [INFO ] Removed a total of 242 redundant transitions.
[2026-05-22 19:26:34] [INFO ] Flatten gal took : 17 ms
[2026-05-22 19:26:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 3 ms.
[2026-05-22 19:26:34] [INFO ] Time to serialize gal into /tmp/CTLFireability17015349124001973423.gal : 2 ms
[2026-05-22 19:26:34] [INFO ] Time to serialize properties into /tmp/CTLFireability1075625682343907871.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/CTLFireability17015349124001973423.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability1075625682343907871.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.39231e+09,0.105603,6700,481,99,4738,557,446,6704,76,1628,0


Converting to forward existential form...Done !
original formula: EX(AF(AX(((AF((i4.i1.u20.p59==1)) * (i3.i2.u17.p58==0)) * ((((i0.u1.p6==0)||(i0.u1.p15==0))||((i9.i0.u40.p126==0)||(i0.u1.p178==0)))&&((i...250
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(EX(!(((!(EG(!((i4.i1.u20.p59==1)))) * (i3.i2.u17.p58==0)) * ((((i0.u1.p6==0)||(i0.u1.p15==...313
Reverse transition relation is NOT exact ! Due to transitions t173, t189, t209, t233, t258, i0.t168, i0.t166, i2.u14.t143, i2.u14.t144, i2.u14.t146, i3.i2....659
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
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 11
Fast SCC detection found an SCC at level 12
Fast SCC detection found an SCC at level 13
(forward)formula 0,0,8.99761,245184,1,0,508356,2502,3195,635660,425,13281,586158
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 196/196 places, 278/278 transitions.
Graph (trivial) has 185 edges and 196 vertex of which 4 / 196 are part of one of the 2 SCC in 0 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 193 transition count 192
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 111 rules applied. Total rules applied 195 place count 110 transition count 164
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 211 place count 94 transition count 164
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 211 place count 94 transition count 159
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 221 place count 89 transition count 159
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 229 place count 81 transition count 151
Iterating global reduction 3 with 8 rules applied. Total rules applied 237 place count 81 transition count 151
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 237 place count 81 transition count 149
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 241 place count 79 transition count 149
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 293 place count 53 transition count 123
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 301 place count 45 transition count 91
Iterating global reduction 3 with 8 rules applied. Total rules applied 309 place count 45 transition count 91
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 8 rules applied. Total rules applied 317 place count 45 transition count 83
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 321 place count 41 transition count 83
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 322 place count 41 transition count 82
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 324 place count 39 transition count 80
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 325 place count 38 transition count 80
Applied a total of 325 rules in 22 ms. Remains 38 /196 variables (removed 158) and now considering 80/278 (removed 198) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11857058822496526483.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1261220879410472426.kers'
[2026-05-22 19:26:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11857058822496526483.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1261220879410472426.kers]
Normalized transition count is 79 out of 80 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 79 rows 37 cols 436 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 19:26:43] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1261220879410472426.kers
Total runtime 1 ms.
[2026-05-22 19:26:43] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 19:26:43] [INFO ] Invariant cache hit.
[2026-05-22 19:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:26:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned [32, 37]
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 : 36/196 places, 80/278 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 36 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 35 transition count 79
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 35 transition count 78
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 34 transition count 78
Applied a total of 4 rules in 6 ms. Remains 34 /36 variables (removed 2) and now considering 78/80 (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-10339984742733843472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5655750603226273761.kers'
[2026-05-22 19:26:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10339984742733843472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5655750603226273761.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 34 cols 429 entries
Finished phase 1 with 29 SingleSign rule and 0 generalized
[2026-05-22 19:26:43] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5655750603226273761.kers
Total runtime 1 ms.
[2026-05-22 19:26:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-22 19:26:43] [INFO ] Invariant cache hit.
[2026-05-22 19:26:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:26:43] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 34/196 places, 78/278 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 273 ms. Remains : 34/196 places, 78/278 transitions.
[2026-05-22 19:26:43] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:26:43] [INFO ] Flatten gal took : 3 ms
[2026-05-22 19:26:43] [INFO ] Input system was already deterministic with 78 transitions.
RANDOM walk for 200 steps (12 resets) in 4 ms. (40 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-04b-CTLFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 19:26:43] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:26:43] [INFO ] Flatten gal took : 2 ms
[2026-05-22 19:26:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13565703874322339474.gal : 1 ms
[2026-05-22 19:26:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3737378311305683545.prop : 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-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13565703874322339474.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3737378311305683545.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 19:26:43] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:26:43] [INFO ] Flatten gal took : 6 ms
Total runtime 950027 ms.

BK_STOP 1779478003498

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

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