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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.1K Mar 5 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 5 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 16:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Mar 5 16:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 16:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 16:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:17 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 31K 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-01b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779472280470

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-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 17:51:22] [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 17:51:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:51:23] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2026-05-22 17:51:23] [INFO ] Transformed 119 places.
[2026-05-22 17:51:23] [INFO ] Transformed 132 transitions.
[2026-05-22 17:51:23] [INFO ] Found NUPN structural information;
[2026-05-22 17:51:23] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 332 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 26 ms.
Support contains 71 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 115 transition count 128
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 115 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 115 transition count 124
Applied a total of 12 rules in 58 ms. Remains 115 /119 variables (removed 4) and now considering 124/132 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3473994966296016579.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7319028913812139241.kers'
[2026-05-22 17:51:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3473994966296016579.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7319028913812139241.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 124 rows 115 cols 299 entries
Finished phase 1 with 109 SingleSign rule and 0 generalized
[2026-05-22 17:51:23] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7319028913812139241.kers
Total runtime 3 ms.
[2026-05-22 17:51:23] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-22 17:51:23] [INFO ] Invariant cache hit.
[2026-05-22 17:51:24] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2026-05-22 17:51:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/115 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/115 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD115 is UNSAT
At refinement iteration 6 (OVERLAPS) 124/239 variables, 115/142 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 1/143 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 9 (OVERLAPS) 0/239 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 143 constraints, problems are : Problem set: 2 solved, 121 unsolved in 15780 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 2/115 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/115 variables, 21/27 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/115 variables, 0/27 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 4 (OVERLAPS) 124/239 variables, 115/142 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 121/263 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/264 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 2/266 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/239 variables, 1/267 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 1/268 constraints. Problems are: Problem set: 2 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/239 variables, 0/268 constraints. Problems are: Problem set: 2 solved, 121 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 239/239 variables, and 268 constraints, problems are : Problem set: 2 solved, 121 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 115/115 constraints, PredecessorRefiner: 121/123 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 45917ms problems are : Problem set: 2 solved, 121 unsolved
Search for dead transitions found 2 dead transitions in 45953ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 115/119 places, 122/132 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 122
Applied a total of 1 rules in 9 ms. Remains 114 /115 variables (removed 1) and now considering 122/122 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3874673720833356538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3682214239697739822.kers'
[2026-05-22 17:52:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3874673720833356538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3682214239697739822.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 122 rows 114 cols 293 entries
Finished phase 1 with 108 SingleSign rule and 0 generalized
[2026-05-22 17:52:10] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3682214239697739822.kers
Total runtime 1 ms.
[2026-05-22 17:52:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2026-05-22 17:52:10] [INFO ] Invariant cache hit.
[2026-05-22 17:52:10] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 114/119 places, 122/132 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46981 ms. Remains : 114/119 places, 122/132 transitions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Applied a total of 0 rules in 5 ms. Remains 114 /114 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2026-05-22 17:52:10] [INFO ] Invariant cache hit.
[2026-05-22 17:52:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 17:52:10] [INFO ] Invariant cache hit.
[2026-05-22 17:52:10] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 121 sub problems to find dead transitions.
[2026-05-22 17:52:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/236 variables, 114/142 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (OVERLAPS) 0/236 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 121 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 143 constraints, problems are : Problem set: 0 solved, 121 unsolved in 13403 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 121 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 1 (OVERLAPS) 1/114 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/114 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/114 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 5 (OVERLAPS) 122/236 variables, 114/144 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 121/265 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/236 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/236 variables, 3/269 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 10 (OVERLAPS) 0/236 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 121 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/236 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 121 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/236 variables, and 270 constraints, problems are : Problem set: 0 solved, 121 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 121/121 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 43451ms problems are : Problem set: 0 solved, 121 unsolved
Search for dead transitions found 0 dead transitions in 43454ms
Finished structural reductions in LTL mode , in 1 iterations and 43682 ms. Remains : 114/114 places, 122/122 transitions.
Support contains 71 out of 114 places after structural reductions.
[2026-05-22 17:52:54] [INFO ] Flatten gal took : 79 ms
[2026-05-22 17:52:54] [INFO ] Flatten gal took : 24 ms
[2026-05-22 17:52:54] [INFO ] Input system was already deterministic with 122 transitions.
Reduction of identical properties reduced properties to check from 71 to 70
RANDOM walk for 40000 steps (14 resets) in 2751 ms. (14 steps per ms) remains 4/70 properties
BEST_FIRST walk for 40002 steps (16 resets) in 479 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (18 resets) in 137 ms. (289 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (23 resets) in 198 ms. (201 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (13 resets) in 145 ms. (273 steps per ms) remains 4/4 properties
[2026-05-22 17:52:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp62 is UNSAT
At refinement iteration 1 (OVERLAPS) 90/104 variables, 5/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 10/114 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/114 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AtomicPropp39 is UNSAT
At refinement iteration 5 (OVERLAPS) 122/236 variables, 114/120 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/236 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/236 variables, 0/120 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 236/236 variables, and 120 constraints, problems are : Problem set: 2 solved, 2 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 114/114 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem AtomicPropp48 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/104 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Problem AtomicPropp45 is UNSAT
After SMT solving in domain Int declared 104/236 variables, and 8 constraints, problems are : Problem set: 4 solved, 0 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 5/6 constraints, State Equation: 0/114 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 523ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2026-05-22 17:52:56] [INFO ] Flatten gal took : 10 ms
[2026-05-22 17:52:56] [INFO ] Flatten gal took : 11 ms
[2026-05-22 17:52:56] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 59 out of 114 places (down from 60) after GAL structural reductions.
Computed a total of 28 stabilizing places and 28 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Graph (trivial) has 92 edges and 114 vertex of which 2 / 114 are part of one of the 1 SCC in 4 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 112 transition count 76
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 55 rules applied. Total rules applied 100 place count 68 transition count 65
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 109 place count 62 transition count 62
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 112 place count 59 transition count 62
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 112 place count 59 transition count 56
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 124 place count 53 transition count 56
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 132 place count 45 transition count 48
Iterating global reduction 4 with 8 rules applied. Total rules applied 140 place count 45 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 141 place count 45 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 141 place count 45 transition count 44
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 147 place count 42 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 149 place count 40 transition count 42
Iterating global reduction 5 with 2 rules applied. Total rules applied 151 place count 40 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 153 place count 40 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 154 place count 39 transition count 40
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 164 place count 34 transition count 35
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 165 place count 33 transition count 33
Iterating global reduction 7 with 1 rules applied. Total rules applied 166 place count 33 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 167 place count 33 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 168 place count 33 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 169 place count 32 transition count 31
Iterating global reduction 7 with 1 rules applied. Total rules applied 170 place count 32 transition count 31
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 172 place count 30 transition count 29
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 173 place count 29 transition count 29
Applied a total of 173 rules in 79 ms. Remains 29 /114 variables (removed 85) and now considering 29/122 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7355857840888156177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10189547611627706392.kers'
[2026-05-22 17:52:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7355857840888156177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10189547611627706392.kers]
Normalized transition count is 28 out of 29 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 28 rows 29 cols 79 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 17:52:56] [INFO ] Computed 5 invariants in 3 ms
Computed 5 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10189547611627706392.kers
Total runtime 5 ms.
[2026-05-22 17:52:56] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-22 17:52:56] [INFO ] Invariant cache hit.
[2026-05-22 17:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:52:56] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-22 17:52:56] [INFO ] Redundant transitions in 0 ms returned []
Running 27 sub problems to find dead transitions.
[2026-05-22 17:52:56] [INFO ] Invariant cache hit.
[2026-05-22 17:52:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (OVERLAPS) 2/29 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (OVERLAPS) 28/57 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (OVERLAPS) 1/58 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 42 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1494 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 2/29 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 6 (OVERLAPS) 28/57 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/57 variables, 27/66 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/57 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/57 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/57 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/57 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/57 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 13 (OVERLAPS) 1/58 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/58 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 15 (OVERLAPS) 0/58 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 27 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 72 constraints, problems are : Problem set: 0 solved, 27 unsolved in 1601 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 3104ms problems are : Problem set: 0 solved, 27 unsolved
Search for dead transitions found 0 dead transitions in 3105ms
Starting structural reductions in SI_CTL mode, iteration 1 : 29/114 places, 29/122 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3322 ms. Remains : 29/114 places, 29/122 transitions.
[2026-05-22 17:52:59] [INFO ] Flatten gal took : 5 ms
[2026-05-22 17:52:59] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:52:59] [INFO ] Input system was already deterministic with 29 transitions.
[2026-05-22 17:52:59] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:52:59] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:52:59] [INFO ] Time to serialize gal into /tmp/CTLFireability17961757845342730465.gal : 3 ms
[2026-05-22 17:52:59] [INFO ] Time to serialize properties into /tmp/CTLFireability14276549386982012845.ctl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability17961757845342730465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14276549386982012845.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,679,0.028406,3916,2,153,5,543,6,0,143,479,0


Converting to forward existential form...Done !
original formula: !(E(AG(!((((E((p63==1) U (p46==1)) + A((p85==1) U (p107==1))) * (p88==1)) * (p112==1)))) U AG((p10==1))))
=> equivalent forward existential formula: [(FwdU(Init,!(E(TRUE U !(!((((E((p63==1) U (p46==1)) + !((E(!((p107==1)) U (!((p85==1)) * !((p107==1)))) + EG(!(...236
Reverse transition relation is NOT exact ! Due to transitions t6, t8, t10, t11, t14, t15, t16, t20, t23, Intersection with reachable at each step enabled....202
(forward)formula 0,1,0.064866,4844,1,0,69,5359,79,31,831,4895,70
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 101 transition count 109
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 101 transition count 109
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 97 transition count 105
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 97 transition count 105
Applied a total of 34 rules in 21 ms. Remains 97 /114 variables (removed 17) and now considering 105/122 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-906828620675800934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7654572462715214065.kers'
[2026-05-22 17:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-906828620675800934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7654572462715214065.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 97 cols 259 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-22 17:53:00] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7654572462715214065.kers
Total runtime 1 ms.
[2026-05-22 17:53:00] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-22 17:53:00] [INFO ] Invariant cache hit.
[2026-05-22 17:53:00] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2026-05-22 17:53:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (OVERLAPS) 105/202 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 126 constraints, problems are : Problem set: 0 solved, 104 unsolved in 11563 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/202 variables, 97/125 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 104/229 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 237 constraints, problems are : Problem set: 0 solved, 104 unsolved in 27038 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 38647ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 38648ms
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 105/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38886 ms. Remains : 97/114 places, 105/122 transitions.
[2026-05-22 17:53:38] [INFO ] Flatten gal took : 7 ms
[2026-05-22 17:53:38] [INFO ] Flatten gal took : 8 ms
[2026-05-22 17:53:39] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-22 17:53:39] [INFO ] Flatten gal took : 7 ms
[2026-05-22 17:53:39] [INFO ] Flatten gal took : 12 ms
[2026-05-22 17:53:39] [INFO ] Time to serialize gal into /tmp/CTLFireability2607299991213385020.gal : 3 ms
[2026-05-22 17:53:39] [INFO ] Time to serialize properties into /tmp/CTLFireability13593403305953129719.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/CTLFireability2607299991213385020.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13593403305953129719.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,72304,0.071103,5192,2,1092,5,4711,6,0,495,3903,0


Converting to forward existential form...Done !
original formula: (EG(((EF((p32==0)) * EF((p18==1))) * AF(((AF((p17==1)) * ((((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))||(p111==1))) * A((p107==1) U (p0==1)...279
=> equivalent forward existential formula: ([FwdG((Init * !(EG(((E(TRUE U (p32==0)) * E(TRUE U (p18==1))) * !(EG(!(((!(EG(!((p17==1)))) * ((((p6==1)&&(p9==...730
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t67, t80, t87, t89, t94, t10...257
(forward)formula 0,0,5.86459,156264,1,0,1156,1.03362e+06,259,634,3070,926153,1749
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 95 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 95 transition count 103
Applied a total of 38 rules in 27 ms. Remains 95 /114 variables (removed 19) and now considering 103/122 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5767311715089053189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11605559863287769494.kers'
[2026-05-22 17:53:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5767311715089053189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11605559863287769494.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 95 cols 255 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-22 17:53:44] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11605559863287769494.kers
Total runtime 2 ms.
[2026-05-22 17:53:45] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 17:53:45] [INFO ] Invariant cache hit.
[2026-05-22 17:53:45] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-22 17:53:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 121 constraints, problems are : Problem set: 0 solved, 102 unsolved in 9061 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/123 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 102/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 2/228 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/198 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 102 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 198/198 variables, and 233 constraints, problems are : Problem set: 0 solved, 102 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 39101ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 39103ms
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 103/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39357 ms. Remains : 95/114 places, 103/122 transitions.
[2026-05-22 17:54:24] [INFO ] Flatten gal took : 10 ms
[2026-05-22 17:54:24] [INFO ] Flatten gal took : 9 ms
[2026-05-22 17:54:24] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-22 17:54:24] [INFO ] Flatten gal took : 9 ms
[2026-05-22 17:54:24] [INFO ] Flatten gal took : 8 ms
[2026-05-22 17:54:24] [INFO ] Time to serialize gal into /tmp/CTLFireability8517630416636826880.gal : 3 ms
[2026-05-22 17:54:24] [INFO ] Time to serialize properties into /tmp/CTLFireability12816287423711542581.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/CTLFireability8517630416636826880.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12816287423711542581.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,65988,0.075204,5180,2,1127,5,4740,6,0,485,4022,0


Converting to forward existential form...Done !
original formula: EG(EX((p5==0)))
=> equivalent forward existential formula: [FwdG(Init,EX((p5==0)))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t77, t84, t86, t87, t88, t92...262
(forward)formula 0,1,1.66975,48588,1,0,556,202841,228,324,2694,274197,522
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 100 transition count 108
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 100 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 97 transition count 105
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 97 transition count 105
Applied a total of 34 rules in 7 ms. Remains 97 /114 variables (removed 17) and now considering 105/122 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15946892112392084548.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10239310782350094644.kers'
[2026-05-22 17:54:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15946892112392084548.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10239310782350094644.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 105 rows 97 cols 259 entries
Finished phase 1 with 91 SingleSign rule and 0 generalized
[2026-05-22 17:54:26] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10239310782350094644.kers
Total runtime 1 ms.
[2026-05-22 17:54:26] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-22 17:54:26] [INFO ] Invariant cache hit.
[2026-05-22 17:54:26] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 104 sub problems to find dead transitions.
[2026-05-22 17:54:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (OVERLAPS) 105/202 variables, 97/121 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 0/202 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 123 constraints, problems are : Problem set: 0 solved, 104 unsolved in 10712 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 19/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/97 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 105/202 variables, 97/122 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/202 variables, 104/226 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/202 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/202 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 12 (OVERLAPS) 0/202 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 232 constraints, problems are : Problem set: 0 solved, 104 unsolved in 26208 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 36932ms problems are : Problem set: 0 solved, 104 unsolved
Search for dead transitions found 0 dead transitions in 36933ms
Starting structural reductions in LTL mode, iteration 1 : 97/114 places, 105/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37088 ms. Remains : 97/114 places, 105/122 transitions.
[2026-05-22 17:55:03] [INFO ] Flatten gal took : 10 ms
[2026-05-22 17:55:03] [INFO ] Flatten gal took : 8 ms
[2026-05-22 17:55:03] [INFO ] Input system was already deterministic with 105 transitions.
[2026-05-22 17:55:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 17:55:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 17:55:03] [INFO ] Time to serialize gal into /tmp/CTLFireability3010494110037866889.gal : 2 ms
[2026-05-22 17:55:03] [INFO ] Time to serialize properties into /tmp/CTLFireability9117502632330144582.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/CTLFireability3010494110037866889.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9117502632330144582.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,69036,0.046665,5260,2,1171,5,5000,6,0,495,4269,0


Converting to forward existential form...Done !
original formula: E(AF((((AX(((p72==1)||(p51==1))) + (p48==1)) + (p67!=1)) * ((AF((((p6==1)&&(p13==1))&&((p76==1)&&(p105==1)))) + (p70==1)) + (((p6==1)&&(p...240
=> equivalent forward existential formula: [FwdG(FwdU((FwdU(Init,!(EG(!((((!(EX(!(((p72==1)||(p51==1))))) + (p48==1)) + (p67!=1)) * ((!(EG(!((((p6==1)&&(p1...303
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t38, t39, t60, t61, t64, t65, t67, t80, t87, t89, t94, t102, Inters...247
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 0
(forward)formula 0,0,5.2829,146228,1,0,1354,983286,256,731,2924,855006,1444
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Graph (trivial) has 105 edges and 114 vertex of which 4 / 114 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 111 transition count 64
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 64 rules applied. Total rules applied 120 place count 56 transition count 55
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 125 place count 52 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 126 place count 51 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 126 place count 51 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 136 place count 46 transition count 49
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 144 place count 38 transition count 41
Iterating global reduction 4 with 8 rules applied. Total rules applied 152 place count 38 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 152 place count 38 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 156 place count 36 transition count 39
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 158 place count 34 transition count 37
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 34 transition count 37
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 178 place count 25 transition count 28
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 179 place count 24 transition count 26
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 24 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 182 place count 24 transition count 24
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 183 place count 24 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 184 place count 23 transition count 23
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 185 place count 23 transition count 23
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 187 place count 21 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 188 place count 20 transition count 21
Applied a total of 188 rules in 17 ms. Remains 20 /114 variables (removed 94) and now considering 21/122 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6687470322300684935.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8026685083663004880.kers'
[2026-05-22 17:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6687470322300684935.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8026685083663004880.kers]
Normalized transition count is 20 out of 21 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 20 rows 18 cols 55 entries
Finished phase 1 with 16 SingleSign rule and 0 generalized
[2026-05-22 17:55:08] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8026685083663004880.kers
Total runtime 0 ms.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2026-05-22 17:55:08] [INFO ] Invariant cache hit.
[2026-05-22 17:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants and state equation in 48 ms returned [14, 19]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 85 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 18/114 places, 21/122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 17 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 16 transition count 19
Applied a total of 4 rules in 3 ms. Remains 16 /18 variables (removed 2) and now considering 19/21 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4224617747831913222.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14215431121727879267.kers'
[2026-05-22 17:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4224617747831913222.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14215431121727879267.kers]
Normalized transition count is 18 out of 19 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 18 rows 15 cols 48 entries
Finished phase 1 with 14 SingleSign rule and 0 generalized
[2026-05-22 17:55:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14215431121727879267.kers
Total runtime 0 ms.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-22 17:55:08] [INFO ] Invariant cache hit.
[2026-05-22 17:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 16/114 places, 19/122 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 169 ms. Remains : 16/114 places, 19/122 transitions.
[2026-05-22 17:55:08] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:55:08] [INFO ] Flatten gal took : 3 ms
[2026-05-22 17:55:08] [INFO ] Input system was already deterministic with 19 transitions.
RANDOM walk for 88 steps (12 resets) in 4 ms. (17 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 17:55:08] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:55:08] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:55:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3166987684896842812.gal : 0 ms
[2026-05-22 17:55:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3136093810424563978.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3166987684896842812.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3136093810424563978.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Graph (trivial) has 97 edges and 114 vertex of which 4 / 114 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 111 transition count 71
Reduce places removed 48 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 56 rules applied. Total rules applied 105 place count 63 transition count 63
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 6 rules applied. Total rules applied 111 place count 59 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 57 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 113 place count 57 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 123 place count 52 transition count 56
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 129 place count 46 transition count 50
Iterating global reduction 4 with 6 rules applied. Total rules applied 135 place count 46 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 135 place count 46 transition count 49
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 137 place count 45 transition count 49
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 138 place count 44 transition count 48
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 44 transition count 48
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 159 place count 34 transition count 38
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 160 place count 33 transition count 36
Iterating global reduction 4 with 1 rules applied. Total rules applied 161 place count 33 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 162 place count 33 transition count 35
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 31 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 165 place count 30 transition count 33
Applied a total of 165 rules in 23 ms. Remains 30 /114 variables (removed 84) and now considering 33/122 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5675198744699709818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10049427778079534543.kers'
[2026-05-22 17:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5675198744699709818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10049427778079534543.kers]
Normalized transition count is 32 out of 33 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 32 rows 29 cols 84 entries
Finished phase 1 with 26 SingleSign rule and 0 generalized
[2026-05-22 17:55:08] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10049427778079534543.kers
Total runtime 0 ms.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 17:55:08] [INFO ] Invariant cache hit.
[2026-05-22 17:55:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [21, 29]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 156 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 28/114 places, 33/122 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 28 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 27 transition count 32
Applied a total of 2 rules in 4 ms. Remains 27 /28 variables (removed 1) and now considering 32/33 (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-5718467897318079628.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1450903072672643778.kers'
[2026-05-22 17:55:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5718467897318079628.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1450903072672643778.kers]
Normalized transition count is 31 out of 32 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 31 rows 26 cols 77 entries
Finished phase 1 with 25 SingleSign rule and 0 generalized
[2026-05-22 17:55:08] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1450903072672643778.kers
Total runtime 0 ms.
[2026-05-22 17:55:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-22 17:55:08] [INFO ] Invariant cache hit.
[2026-05-22 17:55:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:09] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 27/114 places, 32/122 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 247 ms. Remains : 27/114 places, 32/122 transitions.
[2026-05-22 17:55:09] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:55:09] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:09] [INFO ] Input system was already deterministic with 32 transitions.
[2026-05-22 17:55:09] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:09] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:55:09] [INFO ] Time to serialize gal into /tmp/CTLFireability8488603107389573311.gal : 0 ms
[2026-05-22 17:55:09] [INFO ] Time to serialize properties into /tmp/CTLFireability9667575449368081468.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/CTLFireability8488603107389573311.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9667575449368081468.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,244,0.006598,3972,2,93,5,400,6,0,138,363,0


Converting to forward existential form...Done !
original formula: (EG(((p19==0)&&(p78==1))) + AG((!(A((p91==1) U (p59==1))) + AG((p89==1)))))
=> equivalent forward existential formula: [(FwdU((FwdU((Init * !(EG(((p19==0)&&(p78==1))))),TRUE) * !(!(!((E(!((p59==1)) U (!((p91==1)) * !((p59==1)))) + ...205
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t5, t6, t11, t13, t17, t25, t30, Intersection with reachable at each step enabled. (...200
(forward)formula 0,0,0.07625,6064,1,0,205,11389,98,107,847,13170,247
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-05 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 : 114/114 places, 122/122 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 101 transition count 109
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 101 transition count 109
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 99 transition count 107
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 99 transition count 107
Applied a total of 30 rules in 5 ms. Remains 99 /114 variables (removed 15) and now considering 107/122 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-297023773241923005.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11430988722693262892.kers'
[2026-05-22 17:55:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-297023773241923005.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11430988722693262892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 99 cols 263 entries
Finished phase 1 with 93 SingleSign rule and 0 generalized
[2026-05-22 17:55:09] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11430988722693262892.kers
Total runtime 1 ms.
[2026-05-22 17:55:09] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 17:55:09] [INFO ] Invariant cache hit.
[2026-05-22 17:55:09] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 106 sub problems to find dead transitions.
[2026-05-22 17:55:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/99 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (OVERLAPS) 107/206 variables, 99/120 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 2/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (OVERLAPS) 0/206 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 206/206 variables, and 123 constraints, problems are : Problem set: 0 solved, 106 unsolved in 11166 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/206 variables, 99/122 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 106/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 1/229 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/206 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/206 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 12 (OVERLAPS) 0/206 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 206/206 variables, and 234 constraints, problems are : Problem set: 0 solved, 106 unsolved in 26130 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 37312ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 37313ms
Starting structural reductions in LTL mode, iteration 1 : 99/114 places, 107/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37541 ms. Remains : 99/114 places, 107/122 transitions.
[2026-05-22 17:55:46] [INFO ] Flatten gal took : 17 ms
[2026-05-22 17:55:46] [INFO ] Flatten gal took : 9 ms
[2026-05-22 17:55:46] [INFO ] Input system was already deterministic with 107 transitions.
[2026-05-22 17:55:46] [INFO ] Flatten gal took : 8 ms
[2026-05-22 17:55:46] [INFO ] Flatten gal took : 9 ms
[2026-05-22 17:55:46] [INFO ] Time to serialize gal into /tmp/CTLFireability13443629058776063956.gal : 2 ms
[2026-05-22 17:55:46] [INFO ] Time to serialize properties into /tmp/CTLFireability6025149027377514861.ctl : 3 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/CTLFireability13443629058776063956.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6025149027377514861.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,78846,0.065109,5244,2,1118,5,4988,6,0,505,4055,0


Converting to forward existential form...Done !
original formula: EF(((EG((((E((p29==1) U (p59==1)) * (p110==1)) + A((p56==1) U (p34==1))) + AX((p103==1)))) + ((AG((p61==1)) * EX((p29==0))) * ((p93==1)&&...276
=> equivalent forward existential formula: (([FwdG(FwdU(Init,TRUE),(((E((p29==1) U (p59==1)) * (p110==1)) + !((E(!((p34==1)) U (!((p56==1)) * !((p34==1))))...607
Reverse transition relation is NOT exact ! Due to transitions t10, t11, t18, t26, t35, t41, t42, t62, t63, t66, t67, t69, t82, t89, t91, t96, t104, Inters...247
(forward)formula 0,1,4.04271,113524,1,0,901,719102,253,405,2806,679555,1000
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Graph (trivial) has 99 edges and 114 vertex of which 4 / 114 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 111 transition count 66
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 65 rules applied. Total rules applied 119 place count 58 transition count 54
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 125 place count 52 transition count 54
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 125 place count 52 transition count 49
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 135 place count 47 transition count 49
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 143 place count 39 transition count 41
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 39 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 151 place count 39 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 153 place count 38 transition count 40
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 155 place count 36 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 36 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 159 place count 36 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 160 place count 35 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 174 place count 28 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 175 place count 28 transition count 28
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 176 place count 27 transition count 27
Applied a total of 176 rules in 16 ms. Remains 27 /114 variables (removed 87) and now considering 27/122 (removed 95) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12719863496002843818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10541195003264665963.kers'
[2026-05-22 17:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12719863496002843818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10541195003264665963.kers]
Normalized transition count is 26 out of 27 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 26 rows 26 cols 83 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 17:55:50] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10541195003264665963.kers
Total runtime 1 ms.
[2026-05-22 17:55:50] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-22 17:55:50] [INFO ] Invariant cache hit.
[2026-05-22 17:55:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:50] [INFO ] Implicit Places using invariants and state equation in 53 ms returned [19, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 99 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 25/114 places, 27/122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 24 transition count 26
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 24 transition count 25
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 23 transition count 25
Applied a total of 4 rules in 3 ms. Remains 23 /25 variables (removed 2) and now considering 25/27 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14859875340525045288.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8574104185109087229.kers'
[2026-05-22 17:55:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14859875340525045288.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8574104185109087229.kers]
Normalized transition count is 24 out of 25 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 24 rows 23 cols 76 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 17:55:50] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8574104185109087229.kers
Total runtime 0 ms.
[2026-05-22 17:55:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 17:55:50] [INFO ] Invariant cache hit.
[2026-05-22 17:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 23/114 places, 25/122 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 225 ms. Remains : 23/114 places, 25/122 transitions.
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:51] [INFO ] Input system was already deterministic with 25 transitions.
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 3 ms
[2026-05-22 17:55:51] [INFO ] Time to serialize gal into /tmp/CTLFireability9887417656170509827.gal : 0 ms
[2026-05-22 17:55:51] [INFO ] Time to serialize properties into /tmp/CTLFireability4850152912820558659.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/CTLFireability9887417656170509827.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4850152912820558659.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,595,0.012482,4064,2,120,5,725,6,0,115,753,0


Converting to forward existential form...Done !
original formula: EF(EG((AG((p35==1)) * ((p101==1)||(((p6==1)&&(p9==1))&&((p40==1)&&(p76==1)))))))
=> equivalent forward existential formula: [FwdG(FwdU(Init,TRUE),(!(E(TRUE U !((p35==1)))) * ((p101==1)||(((p6==1)&&(p9==1))&&((p40==1)&&(p76==1))))))] != ...160
Reverse transition relation is NOT exact ! Due to transitions t0, t3, t4, t5, t7, t11, t17, t19, t20, t23, Intersection with reachable at each step enable...205
(forward)formula 0,0,0.038576,4644,1,0,74,3782,78,30,744,3842,70
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Graph (trivial) has 99 edges and 114 vertex of which 2 / 114 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 112 transition count 65
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 67 rules applied. Total rules applied 123 place count 57 transition count 53
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 129 place count 51 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 129 place count 51 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 139 place count 46 transition count 48
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 146 place count 39 transition count 41
Iterating global reduction 3 with 7 rules applied. Total rules applied 153 place count 39 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 153 place count 39 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 155 place count 38 transition count 40
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 157 place count 36 transition count 38
Iterating global reduction 3 with 2 rules applied. Total rules applied 159 place count 36 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 161 place count 36 transition count 36
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 162 place count 35 transition count 36
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 178 place count 27 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 27 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 180 place count 26 transition count 26
Applied a total of 180 rules in 15 ms. Remains 26 /114 variables (removed 88) and now considering 26/122 (removed 96) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16500969731599241748.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9753122470787486817.kers'
[2026-05-22 17:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16500969731599241748.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9753122470787486817.kers]
Normalized transition count is 25 out of 26 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 25 rows 25 cols 81 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-22 17:55:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9753122470787486817.kers
Total runtime 0 ms.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants in 36 ms returned []
[2026-05-22 17:55:51] [INFO ] Invariant cache hit.
[2026-05-22 17:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants and state equation in 58 ms returned [19, 25]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 107 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 24/114 places, 26/122 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 23 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 23 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 22 transition count 24
Applied a total of 4 rules in 13 ms. Remains 22 /24 variables (removed 2) and now considering 24/26 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18215418186183560.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16341256253166839292.kers'
[2026-05-22 17:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18215418186183560.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16341256253166839292.kers]
Normalized transition count is 23 out of 24 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 23 rows 22 cols 74 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-22 17:55:51] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16341256253166839292.kers
Total runtime 0 ms.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-22 17:55:51] [INFO ] Invariant cache hit.
[2026-05-22 17:55:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 22/114 places, 24/122 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 234 ms. Remains : 22/114 places, 24/122 transitions.
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 3 ms
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:51] [INFO ] Input system was already deterministic with 24 transitions.
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:55:51] [INFO ] Flatten gal took : 2 ms
[2026-05-22 17:55:51] [INFO ] Time to serialize gal into /tmp/CTLFireability5330755568149259587.gal : 0 ms
[2026-05-22 17:55:51] [INFO ] Time to serialize properties into /tmp/CTLFireability637794844928062675.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/CTLFireability5330755568149259587.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability637794844928062675.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...282
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,461,0.011284,4020,2,97,5,637,6,0,110,639,0


Converting to forward existential form...Done !
original formula: AF((((E((p63==1) U (((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))) * (p6==1)) * ((p9==1)&&(p40==1))) * (p76==1)))
=> equivalent forward existential formula: [FwdG(Init,!((((E((p63==1) U (((p6==1)&&(p9==1))&&((p37==1)&&(p76==1)))) * (p6==1)) * ((p9==1)&&(p40==1))) * (p7...172
Reverse transition relation is NOT exact ! Due to transitions t0, t4, t5, t7, t16, t18, t22, Intersection with reachable at each step enabled. (destroyed/...190
(forward)formula 0,0,0.036085,4512,1,0,64,2826,74,32,724,2967,71
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 95 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 95 transition count 103
Applied a total of 38 rules in 8 ms. Remains 95 /114 variables (removed 19) and now considering 103/122 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6342748425900017707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17599485038984756155.kers'
[2026-05-22 17:55:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6342748425900017707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17599485038984756155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 95 cols 255 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-22 17:55:51] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17599485038984756155.kers
Total runtime 1 ms.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-22 17:55:51] [INFO ] Invariant cache hit.
[2026-05-22 17:55:51] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-22 17:55:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 17/23 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (OVERLAPS) 0/198 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 122 constraints, problems are : Problem set: 0 solved, 102 unsolved in 8660 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 20/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 103/198 variables, 95/121 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/198 variables, 102/223 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/198 variables, 2/225 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/198 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/198 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 12 (OVERLAPS) 0/198 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 231 constraints, problems are : Problem set: 0 solved, 102 unsolved in 24904 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 95/95 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 33577ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 33578ms
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 103/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33791 ms. Remains : 95/114 places, 103/122 transitions.
[2026-05-22 17:56:25] [INFO ] Flatten gal took : 6 ms
[2026-05-22 17:56:25] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:25] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-22 17:56:25] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:25] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:25] [INFO ] Time to serialize gal into /tmp/CTLFireability3864769979733134386.gal : 1 ms
[2026-05-22 17:56:25] [INFO ] Time to serialize properties into /tmp/CTLFireability5450463145167831192.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/CTLFireability3864769979733134386.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability5450463145167831192.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,66852,0.04138,5148,2,1080,5,4597,6,0,485,3815,0


Converting to forward existential form...Done !
original formula: AG(EX((!(A((((p6==1)&&(p13==1))&&((p76==1)&&(p105==1))) U (p72==1))) * EF((p69==1)))))
=> equivalent forward existential formula: [(FwdU(Init,TRUE) * !(EX((!(!((E(!((p72==1)) U (!((((p6==1)&&(p13==1))&&((p76==1)&&(p105==1)))) * !((p72==1)))) ...209
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t38, t58, t59, t62, t63, t65, t78, t85, t87, t92, t100, I...252
(forward)formula 0,0,3.63515,108724,1,0,790,729398,239,354,2852,602164,912
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 98 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 98 transition count 106
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 95 transition count 103
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 95 transition count 103
Applied a total of 38 rules in 3 ms. Remains 95 /114 variables (removed 19) and now considering 103/122 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10622571558621310860.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13778498280948419016.kers'
[2026-05-22 17:56:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10622571558621310860.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13778498280948419016.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 95 cols 255 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-22 17:56:28] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13778498280948419016.kers
Total runtime 1 ms.
[2026-05-22 17:56:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2026-05-22 17:56:28] [INFO ] Invariant cache hit.
[2026-05-22 17:56:29] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 195 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 103/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 95/114 places, 103/122 transitions.
[2026-05-22 17:56:29] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:29] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:29] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-22 17:56:29] [INFO ] Flatten gal took : 5 ms
[2026-05-22 17:56:29] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:29] [INFO ] Time to serialize gal into /tmp/CTLFireability10405247026984778217.gal : 0 ms
[2026-05-22 17:56:29] [INFO ] Time to serialize properties into /tmp/CTLFireability4502442110350326115.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/CTLFireability10405247026984778217.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4502442110350326115.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,65988,0.039962,5160,2,1118,5,4582,6,0,485,3853,0


Converting to forward existential form...Done !
original formula: EX(EF(((AX(AF((p117==1))) * (p79==0)) * ((p80==0) + EG((p90==0))))))
=> equivalent forward existential formula: ([((FwdU(EY(Init),TRUE) * (!(EX(!(!(EG(!((p117==1))))))) * (p79==0))) * (p80==0))] != FALSE + [FwdG((FwdU(EY(Ini...230
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t33, t37, t38, t58, t59, t62, t63, t65, t78, t85, t87, t92, t100, Inters...247
(forward)formula 0,1,3.16141,103852,1,0,870,670554,232,383,2867,600603,995
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-10 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 : 114/114 places, 122/122 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 107
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 95 transition count 103
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 95 transition count 103
Applied a total of 38 rules in 4 ms. Remains 95 /114 variables (removed 19) and now considering 103/122 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5874954940991063787.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10680355118976199424.kers'
[2026-05-22 17:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5874954940991063787.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10680355118976199424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 103 rows 95 cols 255 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-22 17:56:32] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-10680355118976199424.kers
Total runtime 0 ms.
[2026-05-22 17:56:32] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 17:56:32] [INFO ] Invariant cache hit.
[2026-05-22 17:56:32] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 95/114 places, 103/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 152 ms. Remains : 95/114 places, 103/122 transitions.
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:56:32] [INFO ] Input system was already deterministic with 103 transitions.
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 3 ms
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 3 ms
[2026-05-22 17:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability2536752113742586027.gal : 1 ms
[2026-05-22 17:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability7807528488119998712.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/CTLFireability2536752113742586027.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7807528488119998712.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,67878,0.056781,5052,2,989,5,4209,6,0,485,3223,0


Converting to forward existential form...Done !
original formula: AX(AG((p97==0)))
=> equivalent forward existential formula: [(FwdU(EY(Init),TRUE) * !((p97==0)))] = FALSE
(forward)formula 0,0,0.091334,5320,1,0,9,4371,10,2,937,3223,4
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Graph (trivial) has 103 edges and 114 vertex of which 4 / 114 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 56 place count 111 transition count 64
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 63 rules applied. Total rules applied 119 place count 56 transition count 56
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 123 place count 53 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 52 transition count 55
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 124 place count 52 transition count 50
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 134 place count 47 transition count 50
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 142 place count 39 transition count 42
Iterating global reduction 4 with 8 rules applied. Total rules applied 150 place count 39 transition count 42
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 150 place count 39 transition count 40
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 154 place count 37 transition count 40
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 156 place count 35 transition count 38
Iterating global reduction 4 with 2 rules applied. Total rules applied 158 place count 35 transition count 38
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 176 place count 26 transition count 29
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 177 place count 25 transition count 27
Iterating global reduction 4 with 1 rules applied. Total rules applied 178 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 180 place count 25 transition count 25
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 1 rules applied. Total rules applied 181 place count 25 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 182 place count 24 transition count 24
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 184 place count 24 transition count 24
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 186 place count 22 transition count 22
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 187 place count 21 transition count 22
Applied a total of 187 rules in 35 ms. Remains 21 /114 variables (removed 93) and now considering 22/122 (removed 100) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15070178261508844131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-349186882374431513.kers'
[2026-05-22 17:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15070178261508844131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-349186882374431513.kers]
Normalized transition count is 21 out of 22 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 21 rows 19 cols 60 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-22 17:56:32] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-349186882374431513.kers
Total runtime 0 ms.
[2026-05-22 17:56:32] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-22 17:56:32] [INFO ] Invariant cache hit.
[2026-05-22 17:56:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:56:32] [INFO ] Implicit Places using invariants and state equation in 60 ms returned [15, 20]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 138 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 19/114 places, 22/122 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 19 transition count 21
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 18 transition count 21
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 18 transition count 20
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 17 transition count 20
Applied a total of 4 rules in 6 ms. Remains 17 /19 variables (removed 2) and now considering 20/22 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10434627481267801567.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16540531025601542390.kers'
[2026-05-22 17:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10434627481267801567.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16540531025601542390.kers]
Normalized transition count is 19 out of 20 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 19 rows 16 cols 52 entries
Finished phase 1 with 15 SingleSign rule and 0 generalized
[2026-05-22 17:56:32] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16540531025601542390.kers
Total runtime 1 ms.
[2026-05-22 17:56:32] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-22 17:56:32] [INFO ] Invariant cache hit.
[2026-05-22 17:56:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 17:56:32] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 17/114 places, 20/122 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 285 ms. Remains : 17/114 places, 20/122 transitions.
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:56:32] [INFO ] Input system was already deterministic with 20 transitions.
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:56:32] [INFO ] Flatten gal took : 1 ms
[2026-05-22 17:56:32] [INFO ] Time to serialize gal into /tmp/CTLFireability5272507657367650342.gal : 0 ms
[2026-05-22 17:56:32] [INFO ] Time to serialize properties into /tmp/CTLFireability6461664831550940185.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/CTLFireability5272507657367650342.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6461664831550940185.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,136,0.008538,3888,2,47,5,213,6,0,87,183,0


Converting to forward existential form...Done !
original formula: EF(((p62==1) * EG((p18==1))))
=> equivalent forward existential formula: [FwdG((FwdU(Init,TRUE) * (p62==1)),(p18==1))] != FALSE
Hit Full ! (commute/partial/dont) 18/0/2
Hit Full ! (commute/partial/dont) 0/0/2
(forward)formula 0,1,0.016539,4160,1,0,12,1005,20,4,446,643,9
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 122/122 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 99 transition count 107
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 99 transition count 107
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 96 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 96 transition count 104
Applied a total of 36 rules in 4 ms. Remains 96 /114 variables (removed 18) and now considering 104/122 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10038365196940914138.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2742895435866795225.kers'
[2026-05-22 17:56:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10038365196940914138.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2742895435866795225.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 104 rows 96 cols 257 entries
Finished phase 1 with 90 SingleSign rule and 0 generalized
[2026-05-22 17:56:32] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2742895435866795225.kers
Total runtime 1 ms.
[2026-05-22 17:56:33] [INFO ] Implicit Places using invariants in 79 ms returned []
[2026-05-22 17:56:33] [INFO ] Invariant cache hit.
[2026-05-22 17:56:33] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 103 sub problems to find dead transitions.
[2026-05-22 17:56:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 5/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 124 constraints, problems are : Problem set: 0 solved, 103 unsolved in 10871 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 1 (OVERLAPS) 1/96 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/96 variables, 21/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/96 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 4 (OVERLAPS) 104/200 variables, 96/123 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 103/226 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/200 variables, 4/232 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/200 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 103 unsolved
At refinement iteration 10 (OVERLAPS) 0/200 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 103 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 232 constraints, problems are : Problem set: 0 solved, 103 unsolved in 17377 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 96/96 constraints, PredecessorRefiner: 103/103 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 28259ms problems are : Problem set: 0 solved, 103 unsolved
Search for dead transitions found 0 dead transitions in 28260ms
Starting structural reductions in LTL mode, iteration 1 : 96/114 places, 104/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28503 ms. Remains : 96/114 places, 104/122 transitions.
[2026-05-22 17:57:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:57:01] [INFO ] Flatten gal took : 7 ms
[2026-05-22 17:57:01] [INFO ] Input system was already deterministic with 104 transitions.
[2026-05-22 17:57:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:57:01] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:57:01] [INFO ] Time to serialize gal into /tmp/CTLFireability17125026520867307323.gal : 1 ms
[2026-05-22 17:57:01] [INFO ] Time to serialize properties into /tmp/CTLFireability3269131359872472914.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/CTLFireability17125026520867307323.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3269131359872472914.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,68760,0.042452,5212,2,1173,5,4837,6,0,490,4009,0


Converting to forward existential form...Done !
original formula: EX((EX(EG(((p111==0)||((p1==1)&&(p91==1))))) + ((p62==1) * (EF(!(E((p91==1) U (p66==1)))) + ((AF((p66==0)) + EX((p36==0))) * ((p110==1)||...181
=> equivalent forward existential formula: ([FwdG(EY(EY(Init)),((p111==0)||((p1==1)&&(p91==1))))] != FALSE + ([(FwdU((EY(Init) * (p62==1)),TRUE) * !(E((p91...373
Hit Full ! (commute/partial/dont) 95/0/9
(forward)formula 0,1,0.644031,26376,1,0,93,103563,19,4,2322,93723,89
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-13 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 : 114/114 places, 122/122 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 98 transition count 106
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 98 transition count 106
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 94 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 94 transition count 102
Applied a total of 40 rules in 2 ms. Remains 94 /114 variables (removed 20) and now considering 102/122 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1389168958769155853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16556900302580732837.kers'
[2026-05-22 17:57:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1389168958769155853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16556900302580732837.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 94 cols 253 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-22 17:57:02] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16556900302580732837.kers
Total runtime 1 ms.
[2026-05-22 17:57:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-22 17:57:02] [INFO ] Invariant cache hit.
[2026-05-22 17:57:02] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 17:57:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 117 constraints, problems are : Problem set: 0 solved, 101 unsolved in 9156 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/93 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/94 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/94 variables, 16/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 102/196 variables, 94/116 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 101/217 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/224 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/196 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/196 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/196 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 101 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/196 variables, and 227 constraints, problems are : Problem set: 0 solved, 101 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 7/7 constraints]
After SMT, in 39178ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 39179ms
Starting structural reductions in LTL mode, iteration 1 : 94/114 places, 102/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39344 ms. Remains : 94/114 places, 102/122 transitions.
[2026-05-22 17:57:41] [INFO ] Flatten gal took : 7 ms
[2026-05-22 17:57:41] [INFO ] Flatten gal took : 6 ms
[2026-05-22 17:57:41] [INFO ] Input system was already deterministic with 102 transitions.
[2026-05-22 17:57:41] [INFO ] Flatten gal took : 12 ms
[2026-05-22 17:57:41] [INFO ] Flatten gal took : 5 ms
[2026-05-22 17:57:41] [INFO ] Time to serialize gal into /tmp/CTLFireability5373497412172845099.gal : 2 ms
[2026-05-22 17:57:41] [INFO ] Time to serialize properties into /tmp/CTLFireability14896507600156747902.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/CTLFireability5373497412172845099.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14896507600156747902.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,65988,0.068245,5124,2,1074,5,4446,6,0,480,3733,0


Converting to forward existential form...Done !
original formula: EX(AF(AG(AF((p62==0)))))
=> equivalent forward existential formula: [(EY(Init) * !(EG(!(!(E(TRUE U !(!(EG(!((p62==0)))))))))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t10, t16, t17, t24, t32, t35, t36, t37, t57, t58, t61, t62, t64, t77, t84, t86, t91, t99, In...251
(forward)formula 0,1,1.18698,30636,1,0,335,139083,235,139,2684,125274,422
FORMULA AutonomousCar-PT-01b-CTLFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is TRUE !

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

[2026-05-22 17:57:42] [INFO ] Flatten gal took : 4 ms
[2026-05-22 17:57:42] [INFO ] Flatten gal took : 3 ms
Total runtime 379802 ms.

BK_STOP 1779472662841

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

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