fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r018-smll-177946787900050
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for AutonomousCar-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
887.512 416910.00 459533.00 1243.20 FFTTFTFTFFFFTTTT normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.3K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 5 16:49 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 72K 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-04a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779476377736

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-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 18:59:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:59:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:59:40] [INFO ] Load time of PNML (sax parser for PT used): 164 ms
[2026-05-22 18:59:40] [INFO ] Transformed 49 places.
[2026-05-22 18:59:40] [INFO ] Transformed 193 transitions.
[2026-05-22 18:59:40] [INFO ] Found NUPN structural information;
[2026-05-22 18:59:40] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 394 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
Support contains 40 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 20 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2026-05-22 18:59:40] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-821162168177161569.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5290643974358943504.kers'
[2026-05-22 18:59:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-821162168177161569.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5290643974358943504.kers]
Normalized transition count is 116 out of 117 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 116 rows 48 cols 635 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 18:59:40] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5290643974358943504.kers
Total runtime 3 ms.
[2026-05-22 18:59:41] [INFO ] Implicit Places using invariants in 402 ms returned []
[2026-05-22 18:59:41] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2026-05-22 18:59:41] [INFO ] Invariant cache hit.
[2026-05-22 18:59:41] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-22 18:59:41] [INFO ] Implicit Places using invariants and state equation in 281 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 757 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 118/118 transitions.
Applied a total of 0 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 816 ms. Remains : 47/49 places, 118/118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2026-05-22 18:59:41] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9851708497033443552.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5979716250487423024.kers'
[2026-05-22 18:59:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9851708497033443552.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5979716250487423024.kers]
Normalized transition count is 116 out of 117 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 116 rows 46 cols 628 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 18:59:41] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5979716250487423024.kers
Total runtime 1 ms.
[2026-05-22 18:59:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 18:59:41] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2026-05-22 18:59:41] [INFO ] Invariant cache hit.
[2026-05-22 18:59:41] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-22 18:59:41] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
Running 117 sub problems to find dead transitions.
[2026-05-22 18:59:41] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2026-05-22 18:59:41] [INFO ] Invariant cache hit.
[2026-05-22 18:59:41] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 116/163 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (OVERLAPS) 1/164 variables, 1/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 0/164 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 164/164 variables, and 171 constraints, problems are : Problem set: 0 solved, 117 unsolved in 10999 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 46/46 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 1/47 variables, 7/53 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/47 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (OVERLAPS) 116/163 variables, 47/104 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/163 variables, 66/170 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 117/287 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/163 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 11 (OVERLAPS) 1/164 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/164 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 13 (OVERLAPS) 0/164 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 164/164 variables, and 291 constraints, problems are : Problem set: 0 solved, 117 unsolved in 15488 ms.
Refiners :[Domain max(s): 47/47 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 47/47 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 26975ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 27005ms
Finished structural reductions in LTL mode , in 1 iterations and 27300 ms. Remains : 47/47 places, 118/118 transitions.
Support contains 40 out of 47 places after structural reductions.
[2026-05-22 19:00:09] [INFO ] Flatten gal took : 58 ms
[2026-05-22 19:00:09] [INFO ] Flatten gal took : 29 ms
[2026-05-22 19:00:09] [INFO ] Input system was already deterministic with 118 transitions.
Reduction of identical properties reduced properties to check from 71 to 65
RANDOM walk for 40000 steps (2311 resets) in 2572 ms. (15 steps per ms) remains 6/65 properties
BEST_FIRST walk for 40004 steps (384 resets) in 145 ms. (274 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (366 resets) in 128 ms. (310 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (537 resets) in 239 ms. (166 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (469 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (372 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
[2026-05-22 19:00:10] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2026-05-22 19:00:10] [INFO ] Invariant cache hit.
[2026-05-22 19:00:10] [INFO ] State equation strengthened by 67 read => feed constraints.
Problem AtomicPropp51 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 20/20 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp66 is UNSAT
After SMT solving in domain Real declared 43/164 variables, and 27 constraints, problems are : Problem set: 5 solved, 0 unsolved in 78 ms.
Refiners :[Domain max(s): 20/47 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/47 constraints, ReadFeed: 0/67 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 19:00:10] [INFO ] Flatten gal took : 26 ms
[2026-05-22 19:00:10] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 19:00:10] [INFO ] Flatten gal took : 29 ms
[2026-05-22 19:00:10] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 37 out of 47 places (down from 39) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 10 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16627427439884277427.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13118773761394332798.kers'
[2026-05-22 19:00:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16627427439884277427.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13118773761394332798.kers]
Normalized transition count is 106 out of 107 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 106 rows 43 cols 576 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 19:00:10] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13118773761394332798.kers
Total runtime 1 ms.
[2026-05-22 19:00:10] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-22 19:00:10] [INFO ] Invariant cache hit.
[2026-05-22 19:00:10] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 19:00:10] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-22 19:00:10] [INFO ] Invariant cache hit.
[2026-05-22 19:00:10] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 1/151 variables, 1/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 112 constraints, problems are : Problem set: 0 solved, 106 unsolved in 7277 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 106/150 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 58/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 106/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/151 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/151 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 221 constraints, problems are : Problem set: 0 solved, 106 unsolved in 12875 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 20238ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 20240ms
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20414 ms. Remains : 44/47 places, 107/118 transitions.
[2026-05-22 19:00:31] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:00:31] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:00:31] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-22 19:00:31] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:00:31] [INFO ] Flatten gal took : 19 ms
[2026-05-22 19:00:31] [INFO ] Time to serialize gal into /tmp/CTLFireability15509758370328659167.gal : 8 ms
[2026-05-22 19:00:31] [INFO ] Time to serialize properties into /tmp/CTLFireability2434670741386445375.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/CTLFireability15509758370328659167.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2434670741386445375.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,156254,0.270333,11080,2,1605,5,22480,6,0,279,25812,0


Converting to forward existential form...Done !
original formula: EX(EG((AG((((p1==0)||(p5==0))||((p17==0)||(p41==0)))) * (((p1==0)||(p7==0))||((p33==0)||(p41==0))))))
=> equivalent forward existential formula: [FwdG(EY(Init),(!(E(TRUE U !((((p1==0)||(p5==0))||((p17==0)||(p41==0)))))) * (((p1==0)||(p7==0))||((p33==0)||(p4...174
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t16, t19, t20, t23, t39, t81, t83, t84, t85, t89, t10...263
(forward)formula 0,0,3.59273,87492,1,0,366,315661,242,162,3159,374132,402
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8609351938377198405.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9064353460838954446.kers'
[2026-05-22 19:00:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8609351938377198405.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9064353460838954446.kers]
Normalized transition count is 106 out of 107 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 106 rows 43 cols 576 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 19:00:34] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9064353460838954446.kers
Total runtime 1 ms.
[2026-05-22 19:00:34] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 19:00:34] [INFO ] Invariant cache hit.
[2026-05-22 19:00:35] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 19:00:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 206 ms. Remains : 44/47 places, 107/118 transitions.
[2026-05-22 19:00:35] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:00:35] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:00:35] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-22 19:00:35] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:00:35] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:00:35] [INFO ] Time to serialize gal into /tmp/CTLFireability3271039673182488822.gal : 5 ms
[2026-05-22 19:00:35] [INFO ] Time to serialize properties into /tmp/CTLFireability14312697891562513189.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/CTLFireability3271039673182488822.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14312697891562513189.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,156254,0.410327,11404,2,1565,5,24056,6,0,279,25453,0


Converting to forward existential form...Done !
original formula: ((E(AG(AX((p9==1))) U AF(AG((((p1==1)&&(p2==1))&&((p12==1)&&(p41==1)))))) * AX(AX(AX((((p1==0)||(p7==0))||((p17==0)||(p41==0))))))) * A(E...253
=> equivalent forward existential formula: (([(Init * !(E(!(E(TRUE U !(!(EX(!((p9==1))))))) U !(EG(!(!(E(TRUE U !((((p1==1)&&(p2==1))&&((p12==1)&&(p41==1))...509
Hit Full ! (commute/partial/dont) 31/0/76
(forward)formula 0,0,1.94217,43412,1,0,57,140369,20,4,2146,165448,55
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 112
Applied a total of 4 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 112/118 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4310681201012573841.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-52517719688014173.kers'
[2026-05-22 19:00:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4310681201012573841.kers, --Pflows, --basisKERS=/tmp/petrispot-output-52517719688014173.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 44 cols 602 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 19:00:37] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-52517719688014173.kers
Total runtime 1 ms.
[2026-05-22 19:00:37] [INFO ] Implicit Places using invariants in 42 ms returned []
[2026-05-22 19:00:37] [INFO ] Invariant cache hit.
[2026-05-22 19:00:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-22 19:00:37] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-22 19:00:37] [INFO ] Invariant cache hit.
[2026-05-22 19:00:37] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 111/156 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 62/113 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 1/157 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 0/157 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 117 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7137 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 111/156 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 62/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 111/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 231 constraints, problems are : Problem set: 0 solved, 111 unsolved in 14658 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21858ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 21861ms
Starting structural reductions in LTL mode, iteration 1 : 45/47 places, 112/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21994 ms. Remains : 45/47 places, 112/118 transitions.
[2026-05-22 19:00:59] [INFO ] Flatten gal took : 11 ms
[2026-05-22 19:00:59] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:00:59] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-22 19:00:59] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:00:59] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:00:59] [INFO ] Time to serialize gal into /tmp/CTLFireability1788610259312381442.gal : 3 ms
[2026-05-22 19:00:59] [INFO ] Time to serialize properties into /tmp/CTLFireability6427488640434324872.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/CTLFireability1788610259312381442.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6427488640434324872.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,179660,0.304282,11952,2,1676,5,24930,6,0,288,28616,0


Converting to forward existential form...Done !
original formula: ((!(E(AF((((p1==1)&&(p5==1))&&((p24==1)&&(p41==1)))) U AG(((((p11==1)&&(p21==1))&&((p25==1)&&(p35==1)))&&(p42==1))))) * A((!(EX((((p1==1)...444
=> equivalent forward existential formula: (([(FwdU(Init,!(EG(!((((p1==1)&&(p5==1))&&((p24==1)&&(p41==1))))))) * !(E(TRUE U !(((((p11==1)&&(p21==1))&&((p25...869
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t17, t20, t21, t24, t40, t80, t86, t88, t94, t10...263
(forward)formula 0,1,11.0996,255248,1,0,916,1.09233e+06,277,457,3257,1.19353e+06,1195
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-02 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 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 112
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 112/118 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16682602651196541439.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16798549274527730575.kers'
[2026-05-22 19:01:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16682602651196541439.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16798549274527730575.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 44 cols 602 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 19:01:10] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16798549274527730575.kers
Total runtime 1 ms.
[2026-05-22 19:01:10] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-22 19:01:10] [INFO ] Invariant cache hit.
[2026-05-22 19:01:10] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-22 19:01:10] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 45/47 places, 112/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 142 ms. Remains : 45/47 places, 112/118 transitions.
[2026-05-22 19:01:10] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:01:10] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:01:10] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-22 19:01:10] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:01:10] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:01:10] [INFO ] Time to serialize gal into /tmp/CTLFireability16244393647178541081.gal : 2 ms
[2026-05-22 19:01:10] [INFO ] Time to serialize properties into /tmp/CTLFireability7559592283190441610.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/CTLFireability16244393647178541081.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7559592283190441610.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,179660,0.267194,12408,2,1673,5,26533,6,0,288,29569,0


Converting to forward existential form...Done !
original formula: (EG((((p1==0)||(p2==0))||((p10==0)||(p41==0)))) * !(E((((A(AX((((p1==1)&&(p5==1))&&((p20==1)&&(p41==1)))) U (((p26==1)||(p19==1))&&((((p1...539
=> equivalent forward existential formula: ([(Init * !(EG((((p1==0)||(p2==0))||((p10==0)||(p41==0))))))] = FALSE * [(FwdU(Init,(((!((E(!((((p26==1)||(p19==...868
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t16, t19, t20, t21, t36, t52, t80, t86, t88, t101, t1...264
(forward)formula 0,1,11.0378,274836,1,0,1130,1.23647e+06,267,514,3379,1.34387e+06,1300
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-03 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 : 47/47 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 117
Applied a total of 2 rules in 2 ms. Remains 46 /47 variables (removed 1) and now considering 117/118 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4405355078536552453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8987290550797859630.kers'
[2026-05-22 19:01:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4405355078536552453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8987290550797859630.kers]
Normalized transition count is 116 out of 117 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 116 rows 45 cols 628 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 19:01:21] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8987290550797859630.kers
Total runtime 1 ms.
[2026-05-22 19:01:21] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-22 19:01:21] [INFO ] Invariant cache hit.
[2026-05-22 19:01:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-22 19:01:21] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-22 19:01:21] [INFO ] Invariant cache hit.
[2026-05-22 19:01:21] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/162 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 122 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9525 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 116/162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 66/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 116/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 241 constraints, problems are : Problem set: 0 solved, 116 unsolved in 19680 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 29307ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 29308ms
Starting structural reductions in LTL mode, iteration 1 : 46/47 places, 117/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29481 ms. Remains : 46/47 places, 117/118 transitions.
[2026-05-22 19:01:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:01:51] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:01:51] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-22 19:01:51] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:01:51] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:01:51] [INFO ] Time to serialize gal into /tmp/CTLFireability10605835992127615322.gal : 2 ms
[2026-05-22 19:01:51] [INFO ] Time to serialize properties into /tmp/CTLFireability13263348486364242080.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/CTLFireability10605835992127615322.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13263348486364242080.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,206492,0.501058,13180,2,1805,5,28611,6,0,297,32721,0


Converting to forward existential form...Done !
original formula: A(!(((EX(!((((p1==1)&&(p7==1))&&((p10==1)&&(p41==1))))) * E(!((((p1==1)&&(p5==1))&&((p17==1)&&(p41==1)))) U ((((p20==1)&&(p1==1))&&((p2==...643
=> equivalent forward existential formula: [((Init * !(EG(!(((EX((((p1==1)&&(p6==1))&&((p31==1)&&(p41==1)))) * EX((((((p1==1)&&(p5==1))&&((p27==1)&&(p41==1...1911
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t17, t20, t21, t22, t25, t41, t57, t85, t91, t93...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,22.9421,476448,1,0,1785,2.138e+06,293,1019,3533,2.53213e+06,1974
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 3 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17017259689482763042.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3009391691510800443.kers'
[2026-05-22 19:02:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17017259689482763042.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3009391691510800443.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 42 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:02:14] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3009391691510800443.kers
Total runtime 1 ms.
[2026-05-22 19:02:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 19:02:14] [INFO ] Invariant cache hit.
[2026-05-22 19:02:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:02:14] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 19:02:14] [INFO ] Invariant cache hit.
[2026-05-22 19:02:14] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8202 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 211 constraints, problems are : Problem set: 0 solved, 101 unsolved in 20430 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 28689ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 28690ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 102/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28839 ms. Remains : 43/47 places, 102/118 transitions.
[2026-05-22 19:02:43] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:02:43] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:02:43] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-22 19:02:43] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:02:43] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:02:43] [INFO ] Time to serialize gal into /tmp/CTLFireability18220765916750544980.gal : 3 ms
[2026-05-22 19:02:43] [INFO ] Time to serialize properties into /tmp/CTLFireability289804251356676177.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/CTLFireability18220765916750544980.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability289804251356676177.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,135866,0.373891,10444,2,1497,5,20713,6,0,270,24496,0


Converting to forward existential form...Done !
original formula: AX(AF(EX(E(!((((p1==1)&&(p6==1))&&((p26==1)&&(p41==1)))) U A((((p1==1)&&(p7==1))&&((p26==1)&&(p41==1))) U (((p1==1)&&(p6==1))&&((p26==1)&...171
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(E(!((((p1==1)&&(p6==1))&&((p26==1)&&(p41==1)))) U !((E(!((((p1==1)&&(p6==1))&&((p26==1)&&(p4...329
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t18, t19, t70, t76, t78, t84, t85, t86, t91, t92, t93...272
(forward)formula 0,1,5.83594,137616,1,0,880,625295,234,399,3076,771673,953
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 116
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 45 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 43 transition count 114
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 43 transition count 113
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 42 transition count 113
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 40 transition count 103
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 39 transition count 102
Applied a total of 16 rules in 39 ms. Remains 39 /47 variables (removed 8) and now considering 102/118 (removed 16) transitions.
[2026-05-22 19:02:49] [INFO ] Flow matrix only has 101 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14681180704582622203.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12877362761804806816.kers'
[2026-05-22 19:02:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14681180704582622203.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12877362761804806816.kers]
Normalized transition count is 100 out of 101 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 100 rows 38 cols 564 entries
Finished phase 1 with 32 SingleSign rule and 0 generalized
[2026-05-22 19:02:49] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12877362761804806816.kers
Total runtime 1 ms.
[2026-05-22 19:02:49] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 19:02:49] [INFO ] Flow matrix only has 101 transitions (discarded 1 similar events)
[2026-05-22 19:02:49] [INFO ] Invariant cache hit.
[2026-05-22 19:02:49] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 19:02:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-22 19:02:49] [INFO ] Redundant transitions in 5 ms returned []
Running 101 sub problems to find dead transitions.
[2026-05-22 19:02:49] [INFO ] Flow matrix only has 101 transitions (discarded 1 similar events)
[2026-05-22 19:02:49] [INFO ] Invariant cache hit.
[2026-05-22 19:02:49] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 100/139 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 58/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/140 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/140 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 140/140 variables, and 106 constraints, problems are : Problem set: 0 solved, 101 unsolved in 6193 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/39 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 100/139 variables, 39/47 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 58/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/139 variables, 101/206 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/139 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/139 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 1/140 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/140 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (OVERLAPS) 0/140 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 140/140 variables, and 211 constraints, problems are : Problem set: 0 solved, 101 unsolved in 13864 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 39/39 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 20167ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 20169ms
Starting structural reductions in SI_CTL mode, iteration 1 : 39/47 places, 102/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20421 ms. Remains : 39/47 places, 102/118 transitions.
[2026-05-22 19:03:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:03:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:03:09] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-22 19:03:09] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:03:09] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:03:09] [INFO ] Time to serialize gal into /tmp/CTLFireability11881165836694775275.gal : 2 ms
[2026-05-22 19:03:09] [INFO ] Time to serialize properties into /tmp/CTLFireability2123402105974456126.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/CTLFireability11881165836694775275.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability2123402105974456126.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,57278,0.317186,10672,2,1018,5,21488,6,0,251,25688,0


Converting to forward existential form...Done !
original formula: A(!(E((((p1==1)&&(p7==1))&&((p10==1)&&(p41==1))) U (p16==1))) U (!(A(AG(!((((p1==1)&&(p2==1))&&((p8==1)&&(p41==1))))) U EF((((p1==1)&&(p6...307
=> equivalent forward existential formula: [((Init * !(EG(!((!(!((E(!(E(TRUE U (((p1==1)&&(p6==1))&&((p27==1)&&(p41==1))))) U (!(!(E(TRUE U !(!((((p1==1)&&...1303
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t5, t6, t7, t8, t11, t12, t13, t17, t18, t20, t24, t43, t46, t74, Intersecti...243
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,12.9598,303692,1,0,1193,1.34254e+06,252,698,3154,1.43224e+06,1241
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 4 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9402745327933367616.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9467143345194150723.kers'
[2026-05-22 19:03:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9402745327933367616.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9467143345194150723.kers]
Normalized transition count is 106 out of 107 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 106 rows 43 cols 576 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 19:03:22] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9467143345194150723.kers
Total runtime 1 ms.
[2026-05-22 19:03:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 19:03:22] [INFO ] Invariant cache hit.
[2026-05-22 19:03:22] [INFO ] State equation strengthened by 59 read => feed constraints.
[2026-05-22 19:03:22] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 146 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-22 19:03:22] [INFO ] Invariant cache hit.
[2026-05-22 19:03:22] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (OVERLAPS) 106/150 variables, 44/50 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 58/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (OVERLAPS) 1/151 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/151 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/151 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 151/151 variables, and 112 constraints, problems are : Problem set: 0 solved, 106 unsolved in 8143 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 106/150 variables, 44/53 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 58/111 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/150 variables, 106/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 1/151 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/151 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (OVERLAPS) 0/151 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 151/151 variables, and 221 constraints, problems are : Problem set: 0 solved, 106 unsolved in 17193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 44/44 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 25387ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 25388ms
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 107/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25539 ms. Remains : 44/47 places, 107/118 transitions.
[2026-05-22 19:03:48] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:03:48] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:03:48] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-22 19:03:48] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:03:48] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:03:48] [INFO ] Time to serialize gal into /tmp/CTLFireability14455454636247774104.gal : 3 ms
[2026-05-22 19:03:48] [INFO ] Time to serialize properties into /tmp/CTLFireability9446008714321560212.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/CTLFireability14455454636247774104.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9446008714321560212.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,156254,0.402457,10960,2,1664,5,21990,6,0,279,27271,0


Converting to forward existential form...Done !
original formula: !(A((!((((AX((((p1==1)&&(p7==1))&&((p22==1)&&(p41==1)))) * E((((p1==1)&&(p2==1))&&((p8==1)&&(p41==1))) U (p16==1))) * ((p1==1)&&(p6==1)))...295
=> equivalent forward existential formula: ([(EY((FwdU(Init,!(!(EX(!(((((p1==1)&&(p2==1))&&((p33==1)&&(p41==1)))||(p12==1))))))) * !((!((((!(EX(!((((p1==1)...510
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t18, t19, t20, t23, t51, t81, t83, t84, t86, t90, t10...263
(forward)formula 0,1,3.70205,89936,1,0,503,296961,246,276,3221,475618,450
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-07 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 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 112
Applied a total of 4 rules in 3 ms. Remains 45 /47 variables (removed 2) and now considering 112/118 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6270813605276063319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-113503301308009119.kers'
[2026-05-22 19:03:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6270813605276063319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-113503301308009119.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 44 cols 602 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 19:03:52] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-113503301308009119.kers
Total runtime 2 ms.
[2026-05-22 19:03:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-22 19:03:52] [INFO ] Invariant cache hit.
[2026-05-22 19:03:52] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-22 19:03:52] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Running 111 sub problems to find dead transitions.
[2026-05-22 19:03:52] [INFO ] Invariant cache hit.
[2026-05-22 19:03:52] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (OVERLAPS) 111/156 variables, 45/51 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 62/113 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 2/115 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (OVERLAPS) 0/157 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 117 constraints, problems are : Problem set: 0 solved, 111 unsolved in 7690 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (OVERLAPS) 1/45 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/45 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 111/156 variables, 45/54 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 62/116 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 111/227 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 1/157 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/157 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 11 (OVERLAPS) 0/157 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 231 constraints, problems are : Problem set: 0 solved, 111 unsolved in 13566 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 45/45 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21301ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 21302ms
Starting structural reductions in LTL mode, iteration 1 : 45/47 places, 112/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21436 ms. Remains : 45/47 places, 112/118 transitions.
[2026-05-22 19:04:13] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:04:13] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:04:13] [INFO ] Input system was already deterministic with 112 transitions.
[2026-05-22 19:04:13] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:04:13] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:04:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15367554670340456485.gal : 2 ms
[2026-05-22 19:04:13] [INFO ] Time to serialize properties into /tmp/CTLFireability9129019388747182038.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/CTLFireability15367554670340456485.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9129019388747182038.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,179660,0.318998,12452,2,1673,5,26533,6,0,288,29569,0


Converting to forward existential form...Done !
original formula: AX(E(!((!((((((p11==1)&&(p18==1))&&((p25==1)&&(p32==1)))&&(p42==1)) + AG((p39==1)))) + AX(((((p1==1)&&(p2==1))&&((p12==1)&&(p41==1)))||((...318
=> equivalent forward existential formula: [(EY(Init) * !(E(!((!((((((p11==1)&&(p18==1))&&((p25==1)&&(p32==1)))&&(p42==1)) + !(E(TRUE U !((p39==1)))))) + !...389
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t9, t10, t11, t14, t15, t16, t19, t20, t21, t36, t52, t80, t86, t88, t101, t1...264
(forward)formula 0,0,7.284,177680,1,0,747,828802,264,349,3269,922872,846
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 103
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 103/118 (removed 15) transitions.
[2026-05-22 19:04:20] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11471580001579869940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16184015103799905029.kers'
[2026-05-22 19:04:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11471580001579869940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16184015103799905029.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 43 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:04:20] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16184015103799905029.kers
Total runtime 0 ms.
[2026-05-22 19:04:20] [INFO ] Implicit Places using invariants in 38 ms returned []
[2026-05-22 19:04:20] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2026-05-22 19:04:20] [INFO ] Invariant cache hit.
[2026-05-22 19:04:21] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:04:21] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-22 19:04:21] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2026-05-22 19:04:21] [INFO ] Invariant cache hit.
[2026-05-22 19:04:21] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 101/145 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 54/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/146 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 109 constraints, problems are : Problem set: 0 solved, 102 unsolved in 6930 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 101/145 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 54/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 102/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/146 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 214 constraints, problems are : Problem set: 0 solved, 102 unsolved in 17289 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 24261ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 24263ms
Starting structural reductions in LTL mode, iteration 1 : 44/47 places, 103/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24392 ms. Remains : 44/47 places, 103/118 transitions.
[2026-05-22 19:04:45] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:04:45] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:04:45] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-22 19:04:45] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:04:45] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:04:45] [INFO ] Time to serialize gal into /tmp/CTLFireability4544567080802340879.gal : 2 ms
[2026-05-22 19:04:45] [INFO ] Time to serialize properties into /tmp/CTLFireability17893193050520431540.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/CTLFireability4544567080802340879.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17893193050520431540.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,135866,0.233334,9980,2,1386,5,18833,6,0,272,22841,0


Converting to forward existential form...Done !
original formula: E(!((E((!((((p1==1)&&(p2==1))&&((p31==1)&&(p41==1)))) + AX((((p1==1)&&(p6==1))&&((p8==1)&&(p41==1))))) U EF(EG((((p1==1)&&(p2==1))&&((p8=...398
=> equivalent forward existential formula: [(FwdU(Init,!((E((!((((p1==1)&&(p2==1))&&((p31==1)&&(p41==1)))) + !(EX(!((((p1==1)&&(p6==1))&&((p8==1)&&(p41==1)...569
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t14, t15, t18, t19, t22, t76, t79, t80, t81, t82, t84, t85, t86...262
(forward)formula 0,0,5.58933,135800,1,0,817,574127,260,370,3189,721322,943
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2308292173946127882.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14735610015217936533.kers'
[2026-05-22 19:04:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2308292173946127882.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14735610015217936533.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 42 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:04:50] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14735610015217936533.kers
Total runtime 2 ms.
[2026-05-22 19:04:51] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 19:04:51] [INFO ] Invariant cache hit.
[2026-05-22 19:04:51] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:04:51] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 19:04:51] [INFO ] Invariant cache hit.
[2026-05-22 19:04:51] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7877 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 211 constraints, problems are : Problem set: 0 solved, 101 unsolved in 13699 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21612ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 21612ms
Starting structural reductions in LTL mode, iteration 1 : 43/47 places, 102/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21744 ms. Remains : 43/47 places, 102/118 transitions.
[2026-05-22 19:05:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:05:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:05:12] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-22 19:05:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:05:12] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:05:12] [INFO ] Time to serialize gal into /tmp/CTLFireability2192964657282931961.gal : 2 ms
[2026-05-22 19:05:12] [INFO ] Time to serialize properties into /tmp/CTLFireability9378793041282080946.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/CTLFireability2192964657282931961.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9378793041282080946.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,135866,0.3488,10172,2,1540,5,19313,6,0,270,23776,0


Converting to forward existential form...Done !
original formula: (EG(AX(AG((((p1==0)||(p6==0))||((p27==0)||(p41==0)))))) * AG((AF(((((p1==1)&&(p7==1))&&((p8==1)&&(p41==1)))||(((p1==1)&&(p6==1))&&((p31==...185
=> equivalent forward existential formula: ([(Init * !(EG(!(EX(!(!(E(TRUE U !((((p1==0)||(p6==0))||((p27==0)||(p41==0))))))))))))] = FALSE * [FwdG((FwdU(In...280
Hit Full ! (commute/partial/dont) 29/1/73
(forward)formula 0,0,1.67454,37984,1,0,61,123686,22,6,2084,165497,56
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 93
Applied a total of 26 rules in 22 ms. Remains 34 /47 variables (removed 13) and now considering 93/118 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2468085677479663311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13237275111455763557.kers'
[2026-05-22 19:05:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2468085677479663311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13237275111455763557.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 33 cols 532 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:05:14] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13237275111455763557.kers
Total runtime 1 ms.
[2026-05-22 19:05:14] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 19:05:14] [INFO ] Invariant cache hit.
[2026-05-22 19:05:14] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:05:14] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2026-05-22 19:05:14] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-22 19:05:14] [INFO ] Invariant cache hit.
[2026-05-22 19:05:14] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 92/126 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 54/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 97 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5871 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 92/126 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 92/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 192 constraints, problems are : Problem set: 0 solved, 92 unsolved in 11051 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 16965ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 16965ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/47 places, 93/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17138 ms. Remains : 34/47 places, 93/118 transitions.
[2026-05-22 19:05:31] [INFO ] Flatten gal took : 7 ms
[2026-05-22 19:05:31] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:05:31] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-22 19:05:31] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:05:31] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:05:31] [INFO ] Time to serialize gal into /tmp/CTLFireability10443937583655111720.gal : 2 ms
[2026-05-22 19:05:31] [INFO ] Time to serialize properties into /tmp/CTLFireability13205158946471633122.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/CTLFireability10443937583655111720.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13205158946471633122.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,28801,0.204875,7496,2,682,5,9729,6,0,225,13140,0


Converting to forward existential form...Done !
original formula: AG(EF((((p1==0)||(p7==0))||((p31==0)||(p41==0)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(E(TRUE U (((p1==0)||(p7==0))||((p31==0)||(p41==0))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t7, t9, t10, t12, t13, t15, t16, t17, t18, t20, t21, t22, t35, t37, t38, ...258
(forward)formula 0,1,0.535456,11008,1,0,192,29676,206,92,2914,30390,195
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 117
Applied a total of 2 rules in 3 ms. Remains 46 /47 variables (removed 1) and now considering 117/118 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12431862346261539092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9818856842827994685.kers'
[2026-05-22 19:05:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12431862346261539092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9818856842827994685.kers]
Normalized transition count is 116 out of 117 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 116 rows 45 cols 628 entries
Finished phase 1 with 40 SingleSign rule and 0 generalized
[2026-05-22 19:05:32] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9818856842827994685.kers
Total runtime 2 ms.
[2026-05-22 19:05:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-22 19:05:32] [INFO ] Invariant cache hit.
[2026-05-22 19:05:32] [INFO ] State equation strengthened by 67 read => feed constraints.
[2026-05-22 19:05:32] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
Running 116 sub problems to find dead transitions.
[2026-05-22 19:05:32] [INFO ] Invariant cache hit.
[2026-05-22 19:05:32] [INFO ] State equation strengthened by 67 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (OVERLAPS) 116/162 variables, 46/52 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 3/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (OVERLAPS) 1/163 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/163 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 0/163 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Real declared 163/163 variables, and 122 constraints, problems are : Problem set: 0 solved, 116 unsolved in 9364 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 116 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 4 (OVERLAPS) 116/162 variables, 46/55 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 66/121 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/162 variables, 116/237 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/162 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 9 (OVERLAPS) 1/163 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/163 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
At refinement iteration 11 (OVERLAPS) 0/163 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 116 unsolved
No progress, stopping.
After SMT solving in domain Int declared 163/163 variables, and 241 constraints, problems are : Problem set: 0 solved, 116 unsolved in 19268 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 46/46 constraints, ReadFeed: 67/67 constraints, PredecessorRefiner: 116/116 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 28713ms problems are : Problem set: 0 solved, 116 unsolved
Search for dead transitions found 0 dead transitions in 28713ms
Starting structural reductions in LTL mode, iteration 1 : 46/47 places, 117/118 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28911 ms. Remains : 46/47 places, 117/118 transitions.
[2026-05-22 19:06:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:06:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:06:01] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-22 19:06:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:06:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:06:01] [INFO ] Time to serialize gal into /tmp/CTLFireability8189972735282656678.gal : 1 ms
[2026-05-22 19:06:01] [INFO ] Time to serialize properties into /tmp/CTLFireability12906973794162946925.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/CTLFireability8189972735282656678.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12906973794162946925.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,206492,0.386226,13152,2,1805,5,28611,6,0,297,32721,0


Converting to forward existential form...Done !
original formula: A(!(AF((((p1==1)&&(p7==1))&&((p34==1)&&(p41==1))))) U ((AX((p24==1)) + AX(AF((((p1==1)&&(p5==1))&&((p17==1)&&(p41==1)))))) + (!(AF(((((!(...350
=> equivalent forward existential formula: [((Init * !(EG(!(((!(EX(!((p24==1)))) + !(EX(!(!(EG(!((((p1==1)&&(p5==1))&&((p17==1)&&(p41==1)))))))))) + (!(!(E...1059
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t6, t7, t10, t11, t12, t15, t16, t17, t20, t21, t22, t25, t41, t57, t85, t91, t93...268
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,1,15.3112,334120,1,0,1467,1.52582e+06,277,668,3387,1.70499e+06,1668
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 47 transition count 112
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
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 14 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 93
Applied a total of 26 rules in 16 ms. Remains 34 /47 variables (removed 13) and now considering 93/118 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-901665193961727776.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2512224247265361897.kers'
[2026-05-22 19:06:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-901665193961727776.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2512224247265361897.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 92 rows 33 cols 532 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:06:16] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2512224247265361897.kers
Total runtime 1 ms.
[2026-05-22 19:06:16] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-22 19:06:16] [INFO ] Invariant cache hit.
[2026-05-22 19:06:16] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:06:16] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-22 19:06:16] [INFO ] Redundant transitions in 2 ms returned []
Running 92 sub problems to find dead transitions.
[2026-05-22 19:06:16] [INFO ] Invariant cache hit.
[2026-05-22 19:06:16] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (OVERLAPS) 92/126 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 54/94 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 2/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (OVERLAPS) 1/127 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 97 constraints, problems are : Problem set: 0 solved, 92 unsolved in 6043 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (OVERLAPS) 92/126 variables, 34/42 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 54/96 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 92/188 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 192 constraints, problems are : Problem set: 0 solved, 92 unsolved in 10700 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 16789ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 16790ms
Starting structural reductions in SI_CTL mode, iteration 1 : 34/47 places, 93/118 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16968 ms. Remains : 34/47 places, 93/118 transitions.
[2026-05-22 19:06:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:06:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:06:33] [INFO ] Input system was already deterministic with 93 transitions.
[2026-05-22 19:06:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:06:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:06:33] [INFO ] Time to serialize gal into /tmp/CTLFireability4706744408043102774.gal : 2 ms
[2026-05-22 19:06:33] [INFO ] Time to serialize properties into /tmp/CTLFireability16614070308220821250.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/CTLFireability4706744408043102774.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16614070308220821250.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,28801,0.196936,7484,2,666,5,10016,6,0,225,13312,0


Converting to forward existential form...Done !
original formula: EG((((p1==0)||(p7==0))||((p26==0)||(p41==0))))
=> equivalent forward existential formula: [FwdG(Init,(((p1==0)||(p7==0))||((p26==0)||(p41==0))))] != FALSE
Hit Full ! (commute/partial/dont) 20/0/73
(forward)formula 0,1,0.986669,22568,1,0,45,62132,19,4,1863,77712,43
FORMULA AutonomousCar-PT-04a-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-22 19:06:34] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:06:34] [INFO ] Flatten gal took : 4 ms
Total runtime 414458 ms.

BK_STOP 1779476794646

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

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