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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.7K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 159K 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-05b-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-12
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-13
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-14
FORMULA_NAME AutonomousCar-PT-05b-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779479291255

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-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202604301425
[2026-05-22 19:48:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:48:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:48:14] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2026-05-22 19:48:14] [INFO ] Transformed 255 places.
[2026-05-22 19:48:14] [INFO ] Transformed 490 transitions.
[2026-05-22 19:48:14] [INFO ] Found NUPN structural information;
[2026-05-22 19:48:14] [INFO ] Parsed PT model containing 255 places and 490 transitions and 2527 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Support contains 82 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 490/490 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 229 transition count 464
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 229 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 228 transition count 463
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 228 transition count 463
Applied a total of 54 rules in 99 ms. Remains 228 /255 variables (removed 27) and now considering 463/490 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15501830802806721229.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16285836103597242286.kers'
[2026-05-22 19:48:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15501830802806721229.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16285836103597242286.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 228 cols 2473 entries
Finished phase 1 with 218 SingleSign rule and 0 generalized
[2026-05-22 19:48:14] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16285836103597242286.kers
Total runtime 4 ms.
[2026-05-22 19:48:14] [INFO ] Implicit Places using invariants in 469 ms returned []
[2026-05-22 19:48:14] [INFO ] Invariant cache hit.
[2026-05-22 19:48:15] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2026-05-22 19:48:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 13/43 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 228/691 variables, and 43 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/228 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 33/33 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/227 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/228 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 33/43 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 4/47 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/228 variables, 6/53 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD420 is UNSAT
At refinement iteration 6 (OVERLAPS) 463/691 variables, 228/281 constraints. Problems are: Problem set: 2 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/691 variables, 460/741 constraints. Problems are: Problem set: 2 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 741 constraints, problems are : Problem set: 2 solved, 460 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 228/228 constraints, PredecessorRefiner: 460/462 constraints, Known Traps: 43/43 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61506ms problems are : Problem set: 2 solved, 460 unsolved
Search for dead transitions found 2 dead transitions in 61568ms
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 : 228/255 places, 461/490 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 227 transition count 461
Applied a total of 1 rules in 11 ms. Remains 227 /228 variables (removed 1) and now considering 461/461 (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-568857473955228092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11686986463479857587.kers'
[2026-05-22 19:49:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-568857473955228092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11686986463479857587.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 227 cols 2467 entries
Finished phase 1 with 217 SingleSign rule and 0 generalized
[2026-05-22 19:49:17] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11686986463479857587.kers
Total runtime 4 ms.
[2026-05-22 19:49:17] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 19:49:17] [INFO ] Invariant cache hit.
[2026-05-22 19:49:17] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 227/255 places, 461/490 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63285 ms. Remains : 227/255 places, 461/490 transitions.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Applied a total of 0 rules in 6 ms. Remains 227 /227 variables (removed 0) and now considering 461/461 (removed 0) transitions.
[2026-05-22 19:49:17] [INFO ] Invariant cache hit.
[2026-05-22 19:49:17] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-22 19:49:17] [INFO ] Invariant cache hit.
[2026-05-22 19:49:18] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-22 19:49:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/688 variables, and 50 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/227 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 40/40 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/226 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/227 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/227 variables, 40/50 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/227 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/227 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 6 (OVERLAPS) 461/688 variables, 227/290 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/688 variables, 460/750 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 750 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60658ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60662ms
Finished structural reductions in LTL mode , in 1 iterations and 61130 ms. Remains : 227/227 places, 461/461 transitions.
Support contains 82 out of 227 places after structural reductions.
[2026-05-22 19:50:19] [INFO ] Flatten gal took : 124 ms
[2026-05-22 19:50:19] [INFO ] Flatten gal took : 58 ms
[2026-05-22 19:50:19] [INFO ] Input system was already deterministic with 461 transitions.
RANDOM walk for 40000 steps (122 resets) in 2825 ms. (14 steps per ms) remains 23/67 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4001 steps (9 resets) in 61 ms. (64 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (9 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 22/23 properties
BEST_FIRST walk for 4004 steps (10 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (10 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (9 resets) in 18 ms. (210 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4001 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
[2026-05-22 19:50:20] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 22 unsolved
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp51 is UNSAT
At refinement iteration 1 (OVERLAPS) 174/218 variables, 9/9 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 3/12 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 9/227 variables, 1/13 constraints. Problems are: Problem set: 2 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 11/24 constraints. Problems are: Problem set: 2 solved, 20 unsolved
Problem AtomicPropp52 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 5/29 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 227/688 variables, and 29 constraints, problems are : Problem set: 3 solved, 19 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/227 constraints, PredecessorRefiner: 22/20 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 188/218 variables, 9/9 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 11/20 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 0/20 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 9/227 variables, 1/21 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/227 variables, 8/29 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/227 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 461/688 variables, 227/256 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/688 variables, 18/274 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 3/277 constraints. Problems are: Problem set: 3 solved, 19 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 2/279 constraints. Problems are: Problem set: 3 solved, 19 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 279 constraints, problems are : Problem set: 3 solved, 19 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 227/227 constraints, PredecessorRefiner: 19/20 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10099ms problems are : Problem set: 3 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 227 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 227/227 places, 461/461 transitions.
Graph (trivial) has 172 edges and 227 vertex of which 2 / 227 are part of one of the 1 SCC in 8 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 728 edges and 226 vertex of which 223 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 223 transition count 382
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 1 with 99 rules applied. Total rules applied 176 place count 149 transition count 357
Reduce places removed 14 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 16 rules applied. Total rules applied 192 place count 135 transition count 355
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 133 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 132 transition count 353
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 197 place count 132 transition count 343
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 217 place count 122 transition count 343
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 226 place count 113 transition count 334
Iterating global reduction 5 with 9 rules applied. Total rules applied 235 place count 113 transition count 334
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 335 place count 113 transition count 234
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 6 with 64 rules applied. Total rules applied 399 place count 81 transition count 202
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 400 place count 81 transition count 201
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 402 place count 79 transition count 195
Iterating global reduction 7 with 2 rules applied. Total rules applied 404 place count 79 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 405 place count 79 transition count 194
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 407 place count 78 transition count 193
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 408 place count 78 transition count 192
Free-agglomeration rule applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 422 place count 78 transition count 178
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 436 place count 64 transition count 178
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 437 place count 64 transition count 178
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 438 place count 63 transition count 177
Applied a total of 438 rules in 153 ms. Remains 63 /227 variables (removed 164) and now considering 177/461 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 63/227 places, 177/461 transitions.
RANDOM walk for 40000 steps (358 resets) in 392 ms. (101 steps per ms) remains 7/19 properties
BEST_FIRST walk for 40000 steps (154 resets) in 109 ms. (363 steps per ms) remains 5/7 properties
BEST_FIRST walk for 40004 steps (328 resets) in 111 ms. (357 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (193 resets) in 68 ms. (579 steps per ms) remains 2/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-116793612844871134.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8931702257927996202.kers'
[2026-05-22 19:50:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-116793612844871134.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8931702257927996202.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 177 rows 62 cols 1254 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-22 19:50:31] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8931702257927996202.kers
Total runtime 2 ms.
[2026-05-22 19:50:31] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 176/237 variables, 61/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 3/240 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/240 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 240/240 variables, and 74 constraints, problems are : Problem set: 0 solved, 2 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 46/61 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/61 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 176/237 variables, 61/71 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/240 variables, 2/78 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/240 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 240/240 variables, and 80 constraints, problems are : Problem set: 0 solved, 2 unsolved in 944 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 63/63 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1105ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 664 ms.
Support contains 15 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 177/177 transitions.
Graph (trivial) has 22 edges and 63 vertex of which 2 / 63 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 425 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output 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 0 with 4 rules applied. Total rules applied 6 place count 61 transition count 171
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 57 transition count 171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 57 transition count 170
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 12 place count 56 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 55 transition count 165
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 55 transition count 165
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 55 transition count 164
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 54 transition count 163
Free-agglomeration rule applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 22 place count 54 transition count 158
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 15 rules applied. Total rules applied 37 place count 49 transition count 148
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 39 place count 49 transition count 148
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 48 transition count 142
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 48 transition count 142
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 47 transition count 141
Applied a total of 42 rules in 38 ms. Remains 47 /63 variables (removed 16) and now considering 141/177 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 47/63 places, 141/177 transitions.
RANDOM walk for 40000 steps (534 resets) in 200 ms. (199 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (111 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10023303310431723262.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-74716086708728718.kers'
[2026-05-22 19:50:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10023303310431723262.kers, --Pflows, --basisKERS=/tmp/petrispot-output-74716086708728718.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 141 rows 45 cols 983 entries
Finished phase 1 with 38 SingleSign rule and 0 generalized
[2026-05-22 19:50:32] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-74716086708728718.kers
Total runtime 1 ms.
[2026-05-22 19:50:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 137/179 variables, 42/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/188 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/188 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/188 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 188/188 variables, and 57 constraints, problems are : Problem set: 0 solved, 1 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/42 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 137/179 variables, 42/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/179 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/188 variables, 5/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/188 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/188 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/188 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 188/188 variables, and 61 constraints, problems are : Problem set: 0 solved, 1 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 47/47 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 545ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 13 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 141/141 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 46 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 46 transition count 135
Applied a total of 2 rules in 7 ms. Remains 46 /47 variables (removed 1) and now considering 135/141 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 46/47 places, 135/141 transitions.
RANDOM walk for 40000 steps (534 resets) in 119 ms. (333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (110 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 960607 steps, run visited all 1 properties in 1269 ms. (steps per millisecond=756 )
Probabilistic random walk after 960607 steps, saw 148256 distinct states, run finished after 1276 ms. (steps per millisecond=752 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2026-05-22 19:50:34] [INFO ] Flatten gal took : 40 ms
[2026-05-22 19:50:34] [INFO ] Flatten gal took : 37 ms
[2026-05-22 19:50:35] [INFO ] Input system was already deterministic with 461 transitions.
Support contains 71 out of 227 places (down from 73) after GAL structural reductions.
Computed a total of 43 stabilizing places and 43 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Graph (trivial) has 213 edges and 227 vertex of which 4 / 227 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 93 transitions
Trivial Post-agglo rules discarded 93 transitions
Performed 93 trivial Post agglomeration. Transition count delta: 93
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 224 transition count 365
Reduce places removed 93 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 125 rules applied. Total rules applied 219 place count 131 transition count 333
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 2 with 19 rules applied. Total rules applied 238 place count 112 transition count 333
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 238 place count 112 transition count 328
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 248 place count 107 transition count 328
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 258 place count 97 transition count 318
Iterating global reduction 3 with 10 rules applied. Total rules applied 268 place count 97 transition count 318
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 368 place count 97 transition count 218
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 369 place count 96 transition count 213
Iterating global reduction 4 with 1 rules applied. Total rules applied 370 place count 96 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 372 place count 96 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 373 place count 95 transition count 211
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 6 with 68 rules applied. Total rules applied 441 place count 61 transition count 177
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 442 place count 61 transition count 176
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 451 place count 52 transition count 131
Iterating global reduction 7 with 9 rules applied. Total rules applied 460 place count 52 transition count 131
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 7 with 8 rules applied. Total rules applied 468 place count 52 transition count 123
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 472 place count 48 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 474 place count 47 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 475 place count 47 transition count 121
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 477 place count 45 transition count 119
Applied a total of 477 rules in 71 ms. Remains 45 /227 variables (removed 182) and now considering 119/461 (removed 342) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10154457471501971820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1091222756341879759.kers'
[2026-05-22 19:50:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10154457471501971820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1091222756341879759.kers]
Normalized transition count is 118 out of 119 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 118 rows 43 cols 837 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 19:50:35] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1091222756341879759.kers
Total runtime 1 ms.
[2026-05-22 19:50:35] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-22 19:50:35] [INFO ] Invariant cache hit.
[2026-05-22 19:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:50:35] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [39, 44]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 193 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 43/227 places, 119/461 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 43 transition count 118
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 118
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 42 transition count 117
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 41 transition count 117
Applied a total of 4 rules in 13 ms. Remains 41 /43 variables (removed 2) and now considering 117/119 (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-6906140776893514513.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15169243011278448538.kers'
[2026-05-22 19:50:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6906140776893514513.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15169243011278448538.kers]
Normalized transition count is 116 out of 117 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 116 rows 40 cols 830 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-22 19:50:35] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15169243011278448538.kers
Total runtime 1 ms.
[2026-05-22 19:50:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 19:50:35] [INFO ] Invariant cache hit.
[2026-05-22 19:50:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:50:35] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 41/227 places, 117/461 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 471 ms. Remains : 41/227 places, 117/461 transitions.
[2026-05-22 19:50:35] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:50:35] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:50:35] [INFO ] Input system was already deterministic with 117 transitions.
[2026-05-22 19:50:35] [INFO ] Flatten gal took : 19 ms
[2026-05-22 19:50:35] [INFO ] Flatten gal took : 18 ms
[2026-05-22 19:50:35] [INFO ] Time to serialize gal into /tmp/CTLFireability17950072489531188097.gal : 13 ms
[2026-05-22 19:50:35] [INFO ] Time to serialize properties into /tmp/CTLFireability6767537767072396675.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/CTLFireability17950072489531188097.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6767537767072396675.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,448800,2.41364,57720,2,2770,5,153756,6,0,280,155869,0


Converting to forward existential form...Done !
original formula: AF(EG((((p6==1)&&(p16==1))&&((p114==1)&&(p212==1)))))
=> equivalent forward existential formula: [FwdG(Init,!(EG((((p6==1)&&(p16==1))&&((p114==1)&&(p212==1))))))] = FALSE
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t20, t22, t58, t115, Intersection with reac...232
(forward)formula 0,0,19.0823,388600,1,0,478,1.26987e+06,259,335,4213,1.9279e+06,499
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-00 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 : 227/227 places, 461/461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 213 transition count 447
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 213 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 128 place count 213 transition count 347
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 207 transition count 341
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 206 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 206 transition count 340
Applied a total of 142 rules in 22 ms. Remains 206 /227 variables (removed 21) and now considering 340/461 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12313464210287097259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1095163562487767287.kers'
[2026-05-22 19:50:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12313464210287097259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1095163562487767287.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 206 cols 1625 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 19:50:55] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-1095163562487767287.kers
Total runtime 4 ms.
[2026-05-22 19:50:55] [INFO ] Implicit Places using invariants in 271 ms returned []
[2026-05-22 19:50:55] [INFO ] Invariant cache hit.
[2026-05-22 19:50:55] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-22 19:50:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 206/546 variables, and 52 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/546 variables, 206/258 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 339/597 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 601 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60369ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60372ms
Starting structural reductions in LTL mode, iteration 1 : 206/227 places, 340/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61187 ms. Remains : 206/227 places, 340/461 transitions.
[2026-05-22 19:51:56] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:51:56] [INFO ] Flatten gal took : 18 ms
[2026-05-22 19:51:56] [INFO ] Input system was already deterministic with 340 transitions.
[2026-05-22 19:51:56] [INFO ] Flatten gal took : 31 ms
[2026-05-22 19:51:56] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:51:56] [INFO ] Time to serialize gal into /tmp/CTLFireability12585496153494824299.gal : 18 ms
[2026-05-22 19:51:56] [INFO ] Time to serialize properties into /tmp/CTLFireability13915998731994008099.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/CTLFireability12585496153494824299.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13915998731994008099.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...285
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Detected timeout of ITS tools.
[2026-05-22 19:52:26] [INFO ] Flatten gal took : 14 ms
[2026-05-22 19:52:26] [INFO ] Applying decomposition
[2026-05-22 19:52:26] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph7911944214256493961.txt' '-o' '/tmp/graph7911944214256493961.bin' '-w' '/tmp/graph7911944214256493961.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph7911944214256493961.bin' '-l' '-1' '-v' '-w' '/tmp/graph7911944214256493961.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:52:26] [INFO ] Decomposing Gal with order
[2026-05-22 19:52:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:52:27] [INFO ] Removed a total of 452 redundant transitions.
[2026-05-22 19:52:27] [INFO ] Flatten gal took : 287 ms
[2026-05-22 19:52:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 64 ms.
[2026-05-22 19:52:27] [INFO ] Time to serialize gal into /tmp/CTLFireability11835747303365378250.gal : 27 ms
[2026-05-22 19:52:27] [INFO ] Time to serialize properties into /tmp/CTLFireability11795482582141071718.ctl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability11835747303365378250.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability11795482582141071718.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84316e+10,0.187607,7304,601,106,5732,623,485,7983,85,2041,0


Converting to forward existential form...Done !
original formula: EX(EG((i14.i0.u1.p2==0)))
=> equivalent forward existential formula: [FwdG(EY(Init),(i14.i0.u1.p2==0))] != FALSE
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,3.76347,111848,1,0,271969,1444,2220,235805,378,6410,372857
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 215 transition count 449
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 215 transition count 449
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 124 place count 215 transition count 349
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 130 place count 209 transition count 343
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 208 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 208 transition count 342
Applied a total of 138 rules in 16 ms. Remains 208 /227 variables (removed 19) and now considering 342/461 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9029381580948695717.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13733404374397476148.kers'
[2026-05-22 19:52:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9029381580948695717.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13733404374397476148.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 19:52:31] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13733404374397476148.kers
Total runtime 2 ms.
[2026-05-22 19:52:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-22 19:52:31] [INFO ] Invariant cache hit.
[2026-05-22 19:52:31] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-05-22 19:52:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 14/44 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 5/49 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 3/52 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 55 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 45/55 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 342/550 variables, 208/270 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/550 variables, 341/611 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 612 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 53/53 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60213ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60216ms
Starting structural reductions in LTL mode, iteration 1 : 208/227 places, 342/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60557 ms. Remains : 208/227 places, 342/461 transitions.
[2026-05-22 19:53:31] [INFO ] Flatten gal took : 25 ms
[2026-05-22 19:53:31] [INFO ] Flatten gal took : 22 ms
[2026-05-22 19:53:31] [INFO ] Input system was already deterministic with 342 transitions.
[2026-05-22 19:53:31] [INFO ] Flatten gal took : 21 ms
[2026-05-22 19:53:31] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:53:31] [INFO ] Time to serialize gal into /tmp/CTLFireability6654048600712138901.gal : 7 ms
[2026-05-22 19:53:31] [INFO ] Time to serialize properties into /tmp/CTLFireability497908343297342152.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/CTLFireability6654048600712138901.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability497908343297342152.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.0861e+10,0.158721,6956,509,102,4676,699,484,7544,84,2909,0


Converting to forward existential form...Done !
original formula: AF((EG(AG(((((i12.u2.p6==0)||(i12.u2.p17==0))||((i1.i0.u11.p36==0)||(i12.u2.p212==0))) * A((((i12.u2.p6==1)&&(i12.u2.p15==1))&&((i10.i1.u...864
=> equivalent forward existential formula: [FwdG(Init,!((EG(!(E(TRUE U !(((((i12.u2.p6==0)||(i12.u2.p17==0))||((i1.i0.u11.p36==0)||(i12.u2.p212==0))) * !((...1116
Reverse transition relation is NOT exact ! Due to transitions t196, t198, t223, t253, t273, t339, i1.i1.t187, i1.i1.u10.t167, i1.i1.u18.t168, i2.u15.t171, ...723
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,27.7492,626136,1,0,1.28122e+06,4971,3986,1.72126e+06,474,41190,1328717
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 213 transition count 447
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 213 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 128 place count 213 transition count 347
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 208 transition count 342
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 207 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 207 transition count 341
Applied a total of 140 rules in 15 ms. Remains 207 /227 variables (removed 20) and now considering 341/461 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6676543749554883472.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8410944768279682550.kers'
[2026-05-22 19:54:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6676543749554883472.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8410944768279682550.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 207 cols 1627 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-22 19:54:30] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8410944768279682550.kers
Total runtime 3 ms.
[2026-05-22 19:54:30] [INFO ] Implicit Places using invariants in 171 ms returned []
[2026-05-22 19:54:30] [INFO ] Invariant cache hit.
[2026-05-22 19:54:30] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-05-22 19:54:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 4/51 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/207 variables, 4/56 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 56 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 46/46 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/207 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (OVERLAPS) 341/548 variables, 207/273 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 340/613 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 613 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 56/56 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60173ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60174ms
Starting structural reductions in LTL mode, iteration 1 : 207/227 places, 341/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60630 ms. Remains : 207/227 places, 341/461 transitions.
[2026-05-22 19:55:30] [INFO ] Flatten gal took : 17 ms
[2026-05-22 19:55:30] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:55:30] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-22 19:55:30] [INFO ] Flatten gal took : 16 ms
[2026-05-22 19:55:30] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:55:30] [INFO ] Time to serialize gal into /tmp/CTLFireability3690825948505998825.gal : 7 ms
[2026-05-22 19:55:30] [INFO ] Time to serialize properties into /tmp/CTLFireability6151991309928086449.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/CTLFireability3690825948505998825.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6151991309928086449.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.
Detected timeout of ITS tools.
[2026-05-22 19:56:01] [INFO ] Flatten gal took : 11 ms
[2026-05-22 19:56:01] [INFO ] Applying decomposition
[2026-05-22 19:56:01] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph10314200187472309885.txt' '-o' '/tmp/graph10314200187472309885.bin' '-w' '/tmp/graph10314200187472309885.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph10314200187472309885.bin' '-l' '-1' '-v' '-w' '/tmp/graph10314200187472309885.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:56:01] [INFO ] Decomposing Gal with order
[2026-05-22 19:56:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:56:01] [INFO ] Removed a total of 453 redundant transitions.
[2026-05-22 19:56:01] [INFO ] Flatten gal took : 33 ms
[2026-05-22 19:56:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 8 ms.
[2026-05-22 19:56:01] [INFO ] Time to serialize gal into /tmp/CTLFireability16091621705837845577.gal : 4 ms
[2026-05-22 19:56:01] [INFO ] Time to serialize properties into /tmp/CTLFireability4102753062384300452.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/CTLFireability16091621705837845577.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4102753062384300452.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.88564e+10,0.119373,7388,730,102,6054,1037,516,7549,86,3032,0


Converting to forward existential form...Done !
original formula: EX(EG(AX((i12.i1.u62.p200==0))))
=> equivalent forward existential formula: [FwdG(EY(Init),!(EX(!((i12.i1.u62.p200==0)))))] != FALSE
Reverse transition relation is NOT exact ! Due to transitions t194, t199, t219, t254, t274, t294, t338, i0.t192, i2.u16.t169, i2.u16.t172, i2.u17.t170, i3....722
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,1,11.2671,334812,1,0,862821,3452,3186,646207,437,23389,1104265
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 214 transition count 448
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 214 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 126 place count 214 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 132 place count 208 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 207 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 207 transition count 341
Applied a total of 140 rules in 10 ms. Remains 207 /227 variables (removed 20) and now considering 341/461 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8501133049043307824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10353858070038085551.kers'
[2026-05-22 19:56:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8501133049043307824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10353858070038085551.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 207 cols 1627 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-22 19:56:12] [INFO ] Computed 10 invariants in 4 ms
Computed 10 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-10353858070038085551.kers
Total runtime 13 ms.
[2026-05-22 19:56:12] [INFO ] Implicit Places using invariants in 207 ms returned []
[2026-05-22 19:56:12] [INFO ] Invariant cache hit.
[2026-05-22 19:56:13] [INFO ] Implicit Places using invariants and state equation in 372 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 207/227 places, 341/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 606 ms. Remains : 207/227 places, 341/461 transitions.
[2026-05-22 19:56:13] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:56:13] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:56:13] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-22 19:56:13] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:56:13] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:56:13] [INFO ] Time to serialize gal into /tmp/CTLFireability15462778363886559999.gal : 8 ms
[2026-05-22 19:56:13] [INFO ] Time to serialize properties into /tmp/CTLFireability14082383665725707695.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/CTLFireability15462778363886559999.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14082383665725707695.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84316e+10,0.136846,7540,515,102,5486,1165,462,11638,81,6460,0


Converting to forward existential form...Done !
original formula: AF((EG((((i13.u1.p6==1)&&(i13.u1.p14==1))&&((i3.u16.p52==1)&&(i13.u1.p212==1)))) * (AX((((((i13.u1.p6==0)||(i13.u1.p14==0))||((i4.i1.u24....327
=> equivalent forward existential formula: [FwdG(Init,!((EG((((i13.u1.p6==1)&&(i13.u1.p14==1))&&((i3.u16.p52==1)&&(i13.u1.p212==1)))) * (!(EX(!((((((i13.u1...378
Reverse transition relation is NOT exact ! Due to transitions t195, t197, t222, t247, t272, t292, t338, i0.u64.t32, i0.u64.t35, i0.u64.t36, i0.u64.t37, i3....713
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
(forward)formula 0,0,8.84789,237236,1,0,587134,3430,2742,521884,449,36652,688612
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Graph (trivial) has 200 edges and 227 vertex of which 4 / 227 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 85 transitions
Trivial Post-agglo rules discarded 85 transitions
Performed 85 trivial Post agglomeration. Transition count delta: 85
Iterating post reduction 0 with 85 rules applied. Total rules applied 86 place count 224 transition count 373
Reduce places removed 85 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 113 rules applied. Total rules applied 199 place count 139 transition count 345
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 18 rules applied. Total rules applied 217 place count 123 transition count 343
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 219 place count 121 transition count 343
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 219 place count 121 transition count 335
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 235 place count 113 transition count 335
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 244 place count 104 transition count 326
Iterating global reduction 4 with 9 rules applied. Total rules applied 253 place count 104 transition count 326
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 353 place count 104 transition count 226
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 354 place count 103 transition count 221
Iterating global reduction 5 with 1 rules applied. Total rules applied 355 place count 103 transition count 221
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 357 place count 103 transition count 219
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 358 place count 102 transition count 219
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 7 with 62 rules applied. Total rules applied 420 place count 71 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 421 place count 71 transition count 187
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 428 place count 64 transition count 153
Iterating global reduction 8 with 7 rules applied. Total rules applied 435 place count 64 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 441 place count 64 transition count 147
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 444 place count 61 transition count 147
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 446 place count 60 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 447 place count 60 transition count 145
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 449 place count 60 transition count 145
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 450 place count 59 transition count 144
Iterating global reduction 10 with 1 rules applied. Total rules applied 451 place count 59 transition count 144
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 452 place count 58 transition count 143
Applied a total of 452 rules in 61 ms. Remains 58 /227 variables (removed 169) and now considering 143/461 (removed 318) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5408419624729773282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8338818341473017295.kers'
[2026-05-22 19:56:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5408419624729773282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8338818341473017295.kers]
Normalized transition count is 142 out of 143 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 142 rows 58 cols 1007 entries
Finished phase 1 with 49 SingleSign rule and 0 generalized
[2026-05-22 19:56:52] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8338818341473017295.kers
Total runtime 2 ms.
[2026-05-22 19:56:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2026-05-22 19:56:52] [INFO ] Invariant cache hit.
[2026-05-22 19:56:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:56:52] [INFO ] Implicit Places using invariants and state equation in 133 ms returned [51]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 229 ms to find 1 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 57/227 places, 143/461 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 56 transition count 142
Applied a total of 2 rules in 10 ms. Remains 56 /57 variables (removed 1) and now considering 142/143 (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-17388079111059140256.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10490160214943268876.kers'
[2026-05-22 19:56:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17388079111059140256.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10490160214943268876.kers]
Normalized transition count is 141 out of 142 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 141 rows 56 cols 1003 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-22 19:56:52] [INFO ] Computed 8 invariants in 1 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10490160214943268876.kers
Total runtime 2 ms.
[2026-05-22 19:56:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-22 19:56:52] [INFO ] Invariant cache hit.
[2026-05-22 19:56:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:56:53] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 56/227 places, 142/461 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 563 ms. Remains : 56/227 places, 142/461 transitions.
[2026-05-22 19:56:53] [INFO ] Flatten gal took : 8 ms
[2026-05-22 19:56:53] [INFO ] Flatten gal took : 10 ms
[2026-05-22 19:56:53] [INFO ] Input system was already deterministic with 142 transitions.
[2026-05-22 19:56:53] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:56:53] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:56:53] [INFO ] Time to serialize gal into /tmp/CTLFireability12739763806330255697.gal : 2 ms
[2026-05-22 19:56:53] [INFO ] Time to serialize properties into /tmp/CTLFireability894061381977688739.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/CTLFireability12739763806330255697.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability894061381977688739.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,2.16346e+06,3.51629,72956,2,3265,5,194711,6,0,364,195853,0


Converting to forward existential form...Done !
original formula: AF((E(!(EG((p2==1))) U ((EF((((p6==1)&&(p9==1))&&((p52==1)&&(p212==1)))) * E((((p6==1)&&(p14==1))&&((p176==1)&&(p212==1))) U (((p6==1)&&(...302
=> equivalent forward existential formula: [FwdG(Init,!((E(!(EG((p2==1))) U ((E(TRUE U (((p6==1)&&(p9==1))&&((p52==1)&&(p212==1)))) * E((((p6==1)&&(p14==1)...365
Reverse transition relation is NOT exact ! Due to transitions t0, t2, t3, t6, t8, t13, t14, t16, t18, t20, t22, t24, t26, t28, t32, t34, t36, t38, t40, t42...299
Detected timeout of ITS tools.
[2026-05-22 19:57:23] [INFO ] Flatten gal took : 9 ms
[2026-05-22 19:57:23] [INFO ] Applying decomposition
[2026-05-22 19:57:23] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15530604021608924503.txt' '-o' '/tmp/graph15530604021608924503.bin' '-w' '/tmp/graph15530604021608924503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15530604021608924503.bin' '-l' '-1' '-v' '-w' '/tmp/graph15530604021608924503.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:57:23] [INFO ] Decomposing Gal with order
[2026-05-22 19:57:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:57:23] [INFO ] Removed a total of 383 redundant transitions.
[2026-05-22 19:57:23] [INFO ] Flatten gal took : 20 ms
[2026-05-22 19:57:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 4 ms.
[2026-05-22 19:57:23] [INFO ] Time to serialize gal into /tmp/CTLFireability976010225004278488.gal : 2 ms
[2026-05-22 19:57:23] [INFO ] Time to serialize properties into /tmp/CTLFireability12001308992396904709.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/CTLFireability976010225004278488.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability12001308992396904709.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,2.16346e+06,0.036315,4872,115,43,1734,245,177,3161,63,750,0


Converting to forward existential form...Done !
original formula: AF((E(!(EG((i0.u0.p2==1))) U ((EF((((i0.u0.p6==1)&&(i0.u1.p9==1))&&((i1.u2.p52==1)&&(i0.u17.p212==1)))) * E((((i0.u0.p6==1)&&(i0.u0.p14==...435
=> equivalent forward existential formula: [FwdG(Init,!((E(!(EG((i0.u0.p2==1))) U ((E(TRUE U (((i0.u0.p6==1)&&(i0.u1.p9==1))&&((i1.u2.p52==1)&&(i0.u17.p212...498
Reverse transition relation is NOT exact ! Due to transitions t44, t141, u13.t8, u13.t73, i0.u0.t67, i0.u1.t68, i1.u2.t28, i1.u2.t72, i1.u3.t26, i2.u4.t24,...365
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 5
Fast SCC detection found an SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,0,1.7286,63572,1,0,124934,1358,1034,208580,298,10636,124531
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 214 transition count 448
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 214 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 126 place count 214 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 209 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 208 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 208 transition count 342
Applied a total of 138 rules in 10 ms. Remains 208 /227 variables (removed 19) and now considering 342/461 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3700997459805586839.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2795518762963033591.kers'
[2026-05-22 19:57:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3700997459805586839.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2795518762963033591.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 19:57:25] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2795518762963033591.kers
Total runtime 3 ms.
[2026-05-22 19:57:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2026-05-22 19:57:25] [INFO ] Invariant cache hit.
[2026-05-22 19:57:25] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-05-22 19:57:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/56 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 208/550 variables, and 70 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 60/70 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (OVERLAPS) 342/550 variables, 208/278 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 341/619 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 1/620 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 620 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60246ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Starting structural reductions in LTL mode, iteration 1 : 208/227 places, 342/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 208/227 places, 342/461 transitions.
[2026-05-22 19:58:25] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:58:25] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:58:25] [INFO ] Input system was already deterministic with 342 transitions.
[2026-05-22 19:58:25] [INFO ] Flatten gal took : 12 ms
[2026-05-22 19:58:25] [INFO ] Flatten gal took : 13 ms
[2026-05-22 19:58:25] [INFO ] Time to serialize gal into /tmp/CTLFireability17008373315270899828.gal : 4 ms
[2026-05-22 19:58:25] [INFO ] Time to serialize properties into /tmp/CTLFireability9349141127389332431.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/CTLFireability17008373315270899828.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability9349141127389332431.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.93973e+10,0.7283,17492,1197,109,29919,1531,509,34066,82,6090,0


Converting to forward existential form...Done !
original formula: EG((((i5.i1.u20.p65==1) + EX(EG(((((i0.u1.p6==1)&&(i0.u1.p17==1))&&((i2.i1.u10.p36==1)&&(i0.u1.p212==1)))||(i11.u54.p176==1))))) + EG(AF(...230
=> equivalent forward existential formula: [FwdG(Init,(((i5.i1.u20.p65==1) + EX(EG(((((i0.u1.p6==1)&&(i0.u1.p17==1))&&((i2.i1.u10.p36==1)&&(i0.u1.p212==1))...279
Reverse transition relation is NOT exact ! Due to transitions t196, t201, t221, t256, t276, t296, t339, i0.t194, i2.i0.t187, i2.i0.u9.t167, i2.i0.u17.t168,...733
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Graph (trivial) has 196 edges and 227 vertex of which 4 / 227 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 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 224 transition count 382
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 99 rules applied. Total rules applied 176 place count 148 transition count 359
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 19 rules applied. Total rules applied 195 place count 135 transition count 353
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 205 place count 129 transition count 349
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 207 place count 127 transition count 349
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 207 place count 127 transition count 341
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 223 place count 119 transition count 341
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 233 place count 109 transition count 331
Iterating global reduction 5 with 10 rules applied. Total rules applied 243 place count 109 transition count 331
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 5 with 100 rules applied. Total rules applied 343 place count 109 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 343 place count 109 transition count 230
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 345 place count 108 transition count 230
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 346 place count 107 transition count 225
Iterating global reduction 6 with 1 rules applied. Total rules applied 347 place count 107 transition count 225
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 6 with 62 rules applied. Total rules applied 409 place count 76 transition count 194
Discarding 9 places :
Symmetric choice reduction at 6 with 9 rule applications. Total rules 418 place count 67 transition count 148
Iterating global reduction 6 with 9 rules applied. Total rules applied 427 place count 67 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 6 with 6 rules applied. Total rules applied 433 place count 67 transition count 142
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 436 place count 64 transition count 142
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 438 place count 64 transition count 142
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 440 place count 62 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 441 place count 61 transition count 140
Applied a total of 441 rules in 40 ms. Remains 61 /227 variables (removed 166) and now considering 140/461 (removed 321) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-556247928664549463.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9117314472645973776.kers'
[2026-05-22 19:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-556247928664549463.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9117314472645973776.kers]
Normalized transition count is 139 out of 140 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 139 rows 61 cols 833 entries
Finished phase 1 with 53 SingleSign rule and 0 generalized
[2026-05-22 19:59:26] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9117314472645973776.kers
Total runtime 1 ms.
[2026-05-22 19:59:26] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 19:59:26] [INFO ] Invariant cache hit.
[2026-05-22 19:59:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 19:59:26] [INFO ] Implicit Places using invariants and state equation in 114 ms returned [55, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 184 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/227 places, 140/461 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 59 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 139
Applied a total of 2 rules in 6 ms. Remains 58 /59 variables (removed 1) and now considering 139/140 (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-12753387881586953554.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16705231875887083920.kers'
[2026-05-22 19:59:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12753387881586953554.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16705231875887083920.kers]
Normalized transition count is 138 out of 139 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 138 rows 58 cols 823 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 19:59:26] [INFO ] Computed 6 invariants in 1 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16705231875887083920.kers
Total runtime 2 ms.
[2026-05-22 19:59:26] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-22 19:59:26] [INFO ] Invariant cache hit.
[2026-05-22 19:59:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 19:59:26] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 58/227 places, 139/461 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 468 ms. Remains : 58/227 places, 139/461 transitions.
[2026-05-22 19:59:26] [INFO ] Flatten gal took : 6 ms
[2026-05-22 19:59:26] [INFO ] Flatten gal took : 4 ms
[2026-05-22 19:59:26] [INFO ] Input system was already deterministic with 139 transitions.
[2026-05-22 19:59:26] [INFO ] Flatten gal took : 5 ms
[2026-05-22 19:59:26] [INFO ] Flatten gal took : 15 ms
[2026-05-22 19:59:26] [INFO ] Time to serialize gal into /tmp/CTLFireability12467434856682115545.gal : 1 ms
[2026-05-22 19:59:26] [INFO ] Time to serialize properties into /tmp/CTLFireability14982663908825160333.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/CTLFireability12467434856682115545.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14982663908825160333.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,2.40081e+06,2.11679,43280,2,5160,5,153029,6,0,368,128946,0


Converting to forward existential form...Done !
original formula: EF((((E((((p73==1)||(p132==1))||(p246==1)) U E((p205==1) U (p128==1))) * EG((p218!=1))) * (AG((p23==1)) * (p197==1))) * (p56!=1)))
=> equivalent forward existential formula: [((((FwdU(Init,TRUE) * (p56!=1)) * (E((((p73==1)||(p132==1))||(p246==1)) U E((p205==1) U (p128==1))) * EG((p218!...212
Reverse transition relation is NOT exact ! Due to transitions t1, t2, t5, t7, t9, t11, t19, t21, t23, t25, t30, t33, t35, t36, t37, t38, t39, t40, t41, t42...644
(forward)formula 0,0,3.8138,61212,1,0,357,249884,299,136,4386,200226,290
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Formula is FALSE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 214 transition count 448
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 214 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 126 place count 214 transition count 348
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 132 place count 208 transition count 342
Iterating global reduction 1 with 6 rules applied. Total rules applied 138 place count 208 transition count 342
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 139 place count 207 transition count 341
Iterating global reduction 1 with 1 rules applied. Total rules applied 140 place count 207 transition count 341
Applied a total of 140 rules in 21 ms. Remains 207 /227 variables (removed 20) and now considering 341/461 (removed 120) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8509154212312599130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-596982228636530816.kers'
[2026-05-22 19:59:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8509154212312599130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-596982228636530816.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 341 rows 207 cols 1627 entries
Finished phase 1 with 197 SingleSign rule and 0 generalized
[2026-05-22 19:59:30] [INFO ] Computed 10 invariants in 2 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-596982228636530816.kers
Total runtime 4 ms.
[2026-05-22 19:59:30] [INFO ] Implicit Places using invariants in 174 ms returned []
[2026-05-22 19:59:30] [INFO ] Invariant cache hit.
[2026-05-22 19:59:31] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 597 ms to find 0 implicit places.
Running 340 sub problems to find dead transitions.
[2026-05-22 19:59:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 10/60 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 207/548 variables, and 64 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 340 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 1 (OVERLAPS) 1/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 5 (OVERLAPS) 341/548 variables, 207/276 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 340/616 constraints. Problems are: Problem set: 0 solved, 340 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 2/618 constraints. Problems are: Problem set: 0 solved, 340 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 618 constraints, problems are : Problem set: 0 solved, 340 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 207/207 constraints, PredecessorRefiner: 340/340 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60219ms problems are : Problem set: 0 solved, 340 unsolved
Search for dead transitions found 0 dead transitions in 60221ms
Starting structural reductions in LTL mode, iteration 1 : 207/227 places, 341/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60841 ms. Remains : 207/227 places, 341/461 transitions.
[2026-05-22 20:00:31] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:00:31] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:00:31] [INFO ] Input system was already deterministic with 341 transitions.
[2026-05-22 20:00:31] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:00:31] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:00:31] [INFO ] Time to serialize gal into /tmp/CTLFireability9921868758514168969.gal : 2 ms
[2026-05-22 20:00:31] [INFO ] Time to serialize properties into /tmp/CTLFireability6372902713775038342.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/CTLFireability9921868758514168969.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability6372902713775038342.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.
Detected timeout of ITS tools.
[2026-05-22 20:01:01] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:01:01] [INFO ] Applying decomposition
[2026-05-22 20:01:01] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph11695468680327437235.txt' '-o' '/tmp/graph11695468680327437235.bin' '-w' '/tmp/graph11695468680327437235.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11695468680327437235.bin' '-l' '-1' '-v' '-w' '/tmp/graph11695468680327437235.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:01:01] [INFO ] Decomposing Gal with order
[2026-05-22 20:01:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:01:01] [INFO ] Removed a total of 447 redundant transitions.
[2026-05-22 20:01:01] [INFO ] Flatten gal took : 38 ms
[2026-05-22 20:01:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 5 ms.
[2026-05-22 20:01:01] [INFO ] Time to serialize gal into /tmp/CTLFireability15394775311248343580.gal : 3 ms
[2026-05-22 20:01:01] [INFO ] Time to serialize properties into /tmp/CTLFireability15816838100691674513.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/CTLFireability15394775311248343580.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15816838100691674513.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.0054e+10,0.126224,7704,690,106,6751,1149,503,8634,85,3204,0


Converting to forward existential form...Done !
original formula: AG(A((((i0.u1.p6==1)&&(i0.u1.p14==1))&&((i10.u54.p179==1)&&(i0.u1.p212==1))) U AF(EG(EX((i3.i1.u13.p38==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!(EG(EX((i3.i1.u13.p38==1)))))))) * !((((i0.u1.p6==1)&&(i0.u1.p14==1))&&((i1...305
Reverse transition relation is NOT exact ! Due to transitions t195, t201, t221, t256, t276, t296, t338, i0.t193, i2.t186, i2.u10.t165, i2.u17.t169, i2.u17....704
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Detected timeout of ITS tools.
Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Graph (trivial) has 198 edges and 227 vertex of which 4 / 227 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.
Drop transitions (Trivial Post-Agglo cleanup.) removed 83 transitions
Trivial Post-agglo rules discarded 83 transitions
Performed 83 trivial Post agglomeration. Transition count delta: 83
Iterating post reduction 0 with 83 rules applied. Total rules applied 84 place count 225 transition count 376
Reduce places removed 83 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 112 rules applied. Total rules applied 196 place count 142 transition count 347
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 20 rules applied. Total rules applied 216 place count 125 transition count 344
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 221 place count 122 transition count 342
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 222 place count 121 transition count 342
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 222 place count 121 transition count 336
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 234 place count 115 transition count 336
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 242 place count 107 transition count 328
Iterating global reduction 5 with 8 rules applied. Total rules applied 250 place count 107 transition count 328
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 251 place count 106 transition count 318
Iterating global reduction 5 with 1 rules applied. Total rules applied 252 place count 106 transition count 318
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 254 place count 106 transition count 316
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 255 place count 105 transition count 316
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 7 with 70 rules applied. Total rules applied 325 place count 70 transition count 281
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 326 place count 70 transition count 280
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 332 place count 64 transition count 227
Iterating global reduction 8 with 6 rules applied. Total rules applied 338 place count 64 transition count 227
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 342 place count 64 transition count 223
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 344 place count 62 transition count 223
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 346 place count 61 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 347 place count 61 transition count 221
Applied a total of 347 rules in 60 ms. Remains 61 /227 variables (removed 166) and now considering 221/461 (removed 240) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1209167494074478780.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8327522344885879446.kers'
[2026-05-22 20:01:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1209167494074478780.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8327522344885879446.kers]
Normalized transition count is 220 out of 221 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 61 cols 1619 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-22 20:01:31] [INFO ] Computed 9 invariants in 2 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8327522344885879446.kers
Total runtime 3 ms.
[2026-05-22 20:01:31] [INFO ] Implicit Places using invariants in 78 ms returned []
[2026-05-22 20:01:31] [INFO ] Invariant cache hit.
[2026-05-22 20:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:01:32] [INFO ] Implicit Places using invariants and state equation in 154 ms returned [55, 60]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 235 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 59/227 places, 221/461 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 59 transition count 220
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 58 transition count 220
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 58 transition count 219
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 57 transition count 219
Applied a total of 4 rules in 15 ms. Remains 57 /59 variables (removed 2) and now considering 219/221 (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-15225100247552318263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5484757319522393510.kers'
[2026-05-22 20:01:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15225100247552318263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5484757319522393510.kers]
Normalized transition count is 218 out of 219 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 218 rows 57 cols 1609 entries
Finished phase 1 with 50 SingleSign rule and 0 generalized
[2026-05-22 20:01:32] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5484757319522393510.kers
Total runtime 1 ms.
[2026-05-22 20:01:32] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-22 20:01:32] [INFO ] Invariant cache hit.
[2026-05-22 20:01:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:01:32] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 57/227 places, 219/461 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 524 ms. Remains : 57/227 places, 219/461 transitions.
[2026-05-22 20:01:32] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:01:32] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:01:32] [INFO ] Input system was already deterministic with 219 transitions.
[2026-05-22 20:01:32] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:01:32] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:01:32] [INFO ] Time to serialize gal into /tmp/CTLFireability10445239212251385951.gal : 3 ms
[2026-05-22 20:01:32] [INFO ] Time to serialize properties into /tmp/CTLFireability15344090154145361115.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/CTLFireability10445239212251385951.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability15344090154145361115.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,3.15337e+06,5.31131,134132,2,5044,5,264432,6,0,445,268935,0


Converting to forward existential form...Done !
original formula: (EF(EG(!(A(((p89==1)||(((p6==1)&&(p16==1))&&((p117==1)&&(p212==1)))) U AF((((p6==1)&&(p17==1))&&((p160==1)&&(p212==1)))))))) * EF(((p114=...317
=> equivalent forward existential formula: ([(FwdU((Init * E(TRUE U EG(!(!((E(!(!(EG(!((((p6==1)&&(p17==1))&&((p160==1)&&(p212==1))))))) U (!(((p89==1)||((...1058
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t11, t13, t15, t17, t19, t20, t21, t22, t24, t29, t39, t40, t41, t71,...277
Detected timeout of ITS tools.
[2026-05-22 20:02:02] [INFO ] Flatten gal took : 13 ms
[2026-05-22 20:02:02] [INFO ] Applying decomposition
[2026-05-22 20:02:02] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph14505918651061626505.txt' '-o' '/tmp/graph14505918651061626505.bin' '-w' '/tmp/graph14505918651061626505.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph14505918651061626505.bin' '-l' '-1' '-v' '-w' '/tmp/graph14505918651061626505.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:02:02] [INFO ] Decomposing Gal with order
[2026-05-22 20:02:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:02:02] [INFO ] Removed a total of 806 redundant transitions.
[2026-05-22 20:02:02] [INFO ] Flatten gal took : 34 ms
[2026-05-22 20:02:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2026-05-22 20:02:02] [INFO ] Time to serialize gal into /tmp/CTLFireability7285195424596822107.gal : 2 ms
[2026-05-22 20:02:02] [INFO ] Time to serialize properties into /tmp/CTLFireability477224755178166585.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/CTLFireability7285195424596822107.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability477224755178166585.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...261
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.15337e+06,0.034376,4828,144,24,1595,109,250,2701,42,252,0


Converting to forward existential form...Done !
original formula: (EF(EG(!(A(((i1.u9.p89==1)||(((i6.u19.p6==1)&&(i6.u1.p16==1))&&((i2.u10.p117==1)&&(i6.u18.p212==1)))) U AF((((i6.u19.p6==1)&&(i6.u2.p17==...460
=> equivalent forward existential formula: ([(FwdU((Init * E(TRUE U EG(!(!((E(!(!(EG(!((((i6.u19.p6==1)&&(i6.u2.p17==1))&&((i4.u14.p160==1)&&(i6.u18.p212==...1461
Reverse transition relation is NOT exact ! Due to transitions t3, t36, u15.t6, u15.t74, i0.t21, i0.u5.t24, i0.u6.t22, i1.u8.t20, i1.u9.t19, i2.u10.t17, i2....384
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 6
Fast SCC detection found an SCC at level 7
(forward)formula 0,1,0.912333,32688,1,0,57817,256,1630,92252,212,662,65396
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in SI_CTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Graph (trivial) has 207 edges and 227 vertex of which 4 / 227 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 89 transitions
Trivial Post-agglo rules discarded 89 transitions
Performed 89 trivial Post agglomeration. Transition count delta: 89
Iterating post reduction 0 with 89 rules applied. Total rules applied 90 place count 224 transition count 369
Reduce places removed 89 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 1 with 119 rules applied. Total rules applied 209 place count 135 transition count 339
Reduce places removed 17 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 19 rules applied. Total rules applied 228 place count 118 transition count 337
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 230 place count 116 transition count 337
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 230 place count 116 transition count 331
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 242 place count 110 transition count 331
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 252 place count 100 transition count 321
Iterating global reduction 4 with 10 rules applied. Total rules applied 262 place count 100 transition count 321
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 4 with 100 rules applied. Total rules applied 362 place count 100 transition count 221
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 363 place count 99 transition count 216
Iterating global reduction 5 with 1 rules applied. Total rules applied 364 place count 99 transition count 216
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 366 place count 99 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 367 place count 98 transition count 214
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 433 place count 65 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 434 place count 65 transition count 180
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 443 place count 56 transition count 134
Iterating global reduction 8 with 9 rules applied. Total rules applied 452 place count 56 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 8 with 6 rules applied. Total rules applied 458 place count 56 transition count 128
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 461 place count 53 transition count 128
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 462 place count 53 transition count 127
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 463 place count 52 transition count 126
Applied a total of 463 rules in 30 ms. Remains 52 /227 variables (removed 175) and now considering 126/461 (removed 335) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2297532593268919318.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16305355397215285950.kers'
[2026-05-22 20:02:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2297532593268919318.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16305355397215285950.kers]
Normalized transition count is 125 out of 126 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 51 cols 909 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-22 20:02:03] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16305355397215285950.kers
Total runtime 1 ms.
[2026-05-22 20:02:03] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-22 20:02:03] [INFO ] Invariant cache hit.
[2026-05-22 20:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:02:03] [INFO ] Implicit Places using invariants and state equation in 103 ms returned [46, 51]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 168 ms to find 2 implicit places.
Starting structural reductions in SI_CTL mode, iteration 1 : 50/227 places, 126/461 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 50 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 125
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 49 transition count 124
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 48 transition count 124
Applied a total of 4 rules in 4 ms. Remains 48 /50 variables (removed 2) and now considering 124/126 (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-11718977657947268611.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14494925623206154917.kers'
[2026-05-22 20:02:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11718977657947268611.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14494925623206154917.kers]
Normalized transition count is 123 out of 124 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 48 cols 902 entries
Finished phase 1 with 41 SingleSign rule and 0 generalized
[2026-05-22 20:02:03] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14494925623206154917.kers
Total runtime 1 ms.
[2026-05-22 20:02:03] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 20:02:03] [INFO ] Invariant cache hit.
[2026-05-22 20:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-22 20:02:03] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in SI_CTL mode, iteration 2 : 48/227 places, 124/461 transitions.
Finished structural reductions in SI_CTL mode , in 2 iterations and 379 ms. Remains : 48/227 places, 124/461 transitions.
[2026-05-22 20:02:03] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:02:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:02:03] [INFO ] Input system was already deterministic with 124 transitions.
[2026-05-22 20:02:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:02:03] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:02:03] [INFO ] Time to serialize gal into /tmp/CTLFireability4384894192409543101.gal : 1 ms
[2026-05-22 20:02:03] [INFO ] Time to serialize properties into /tmp/CTLFireability10156668051289772544.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/CTLFireability4384894192409543101.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability10156668051289772544.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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


Converting to forward existential form...Done !
original formula: AF(AG(((AF((p181==0)) + EG((p208==0))) + AG((((p6==0)||(p9==0))||((p36==0)||(p212==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EG(!((p181==0)))) + EG((p208==0))) + !(E(TRUE U !((((p6==0)||(p9==0))||((p36==0)||...184
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t2, t3, t4, t6, t8, t10, t12, t14, t16, t18, t20, t22, t28, t29, t30, t31, t32, t33, ...396
Detected timeout of ITS tools.
[2026-05-22 20:02:33] [INFO ] Flatten gal took : 5 ms
[2026-05-22 20:02:33] [INFO ] Applying decomposition
[2026-05-22 20:02:33] [INFO ] Flatten gal took : 5 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph977821460562986325.txt' '-o' '/tmp/graph977821460562986325.bin' '-w' '/tmp/graph977821460562986325.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph977821460562986325.bin' '-l' '-1' '-v' '-w' '/tmp/graph977821460562986325.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:02:33] [INFO ] Decomposing Gal with order
[2026-05-22 20:02:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:02:34] [INFO ] Removed a total of 378 redundant transitions.
[2026-05-22 20:02:34] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:02:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 1 ms.
[2026-05-22 20:02:34] [INFO ] Time to serialize gal into /tmp/CTLFireability735099193784641397.gal : 1 ms
[2026-05-22 20:02:34] [INFO ] Time to serialize properties into /tmp/CTLFireability14965800150570486625.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/CTLFireability735099193784641397.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability14965800150570486625.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...262
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,1.3968e+06,0.035604,5036,133,28,2161,168,184,3561,46,455,0


Converting to forward existential form...Done !
original formula: AF(AG(((AF((i5.u12.p181==0)) + EG((i6.u16.p208==0))) + AG((((i0.u0.p6==0)||(i0.u1.p9==0))||((i1.u2.p36==0)||(i0.u15.p212==0)))))))
=> equivalent forward existential formula: [FwdG(Init,!(!(E(TRUE U !(((!(EG(!((i5.u12.p181==0)))) + EG((i6.u16.p208==0))) + !(E(TRUE U !((((i0.u0.p6==0)||(...223
Reverse transition relation is NOT exact ! Due to transitions t49, i0.t64, i1.u4.t22, i1.u5.t20, i2.u6.t18, i2.u7.t16, i3.u8.t14, i3.u9.t12, i4.u10.t10, i4...346
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 6
(forward)formula 0,0,0.877261,29288,1,0,55436,294,928,84934,217,1147,72569
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 214 transition count 448
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 214 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 126 place count 214 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 209 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 209 transition count 343
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 137 place count 208 transition count 342
Iterating global reduction 1 with 1 rules applied. Total rules applied 138 place count 208 transition count 342
Applied a total of 138 rules in 9 ms. Remains 208 /227 variables (removed 19) and now considering 342/461 (removed 119) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3735950194651062158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1620950571157751424.kers'
[2026-05-22 20:02:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3735950194651062158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1620950571157751424.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 342 rows 208 cols 1629 entries
Finished phase 1 with 198 SingleSign rule and 0 generalized
[2026-05-22 20:02:34] [INFO ] Computed 10 invariants in 1 ms
Computed 10 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1620950571157751424.kers
Total runtime 2 ms.
[2026-05-22 20:02:35] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-22 20:02:35] [INFO ] Invariant cache hit.
[2026-05-22 20:02:35] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
Running 341 sub problems to find dead transitions.
[2026-05-22 20:02:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 8/58 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (OVERLAPS) 342/550 variables, 208/266 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/550 variables, and 267 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 341 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 1 (OVERLAPS) 1/208 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 49/59 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/208 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 7 (OVERLAPS) 342/550 variables, 208/271 constraints. Problems are: Problem set: 0 solved, 341 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/550 variables, 341/612 constraints. Problems are: Problem set: 0 solved, 341 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/550 variables, and 614 constraints, problems are : Problem set: 0 solved, 341 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 208/208 constraints, PredecessorRefiner: 341/341 constraints, Known Traps: 55/55 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 341 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in LTL mode, iteration 1 : 208/227 places, 342/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60683 ms. Remains : 208/227 places, 342/461 transitions.
[2026-05-22 20:03:35] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:03:35] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:03:35] [INFO ] Input system was already deterministic with 342 transitions.
[2026-05-22 20:03:35] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:03:35] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:03:35] [INFO ] Time to serialize gal into /tmp/CTLFireability9448904116537286465.gal : 4 ms
[2026-05-22 20:03:35] [INFO ] Time to serialize properties into /tmp/CTLFireability7290828893730960309.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/CTLFireability9448904116537286465.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7290828893730960309.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.
Detected timeout of ITS tools.
[2026-05-22 20:04:05] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:04:05] [INFO ] Applying decomposition
[2026-05-22 20:04:05] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph585853261515460347.txt' '-o' '/tmp/graph585853261515460347.bin' '-w' '/tmp/graph585853261515460347.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph585853261515460347.bin' '-l' '-1' '-v' '-w' '/tmp/graph585853261515460347.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:04:05] [INFO ] Decomposing Gal with order
[2026-05-22 20:04:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:04:05] [INFO ] Removed a total of 455 redundant transitions.
[2026-05-22 20:04:05] [INFO ] Flatten gal took : 31 ms
[2026-05-22 20:04:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 3 ms.
[2026-05-22 20:04:05] [INFO ] Time to serialize gal into /tmp/CTLFireability4233821221015915013.gal : 2 ms
[2026-05-22 20:04:05] [INFO ] Time to serialize properties into /tmp/CTLFireability13087181643064764016.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/CTLFireability4233821221015915013.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability13087181643064764016.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.92811e+10,0.147376,8068,620,105,7956,695,487,9782,83,2476,0


Converting to forward existential form...Done !
original formula: EG(EX((AF((i12.i0.u59.p197==0)) + EF((EG((i12.i1.u60.p199==1)) + AG((((i0.u2.p6==1)&&(i0.u2.p14==1))&&((i7.u33.p117==1)&&(i0.u2.p212==1))...162
=> equivalent forward existential formula: [FwdG(Init,EX((!(EG(!((i12.i0.u59.p197==0)))) + E(TRUE U (EG((i12.i1.u60.p199==1)) + !(E(TRUE U !((((i0.u2.p6==1...229
Reverse transition relation is NOT exact ! Due to transitions t195, t199, t219, t254, t269, t294, t339, i0.t193, i2.u15.t170, i2.u15.t173, i2.u16.t171, i3....709
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,12.3084,314556,1,0,775763,2691,3544,649794,452,19248,1052636
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 213 transition count 447
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 213 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 128 place count 213 transition count 347
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 207 transition count 341
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 206 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 206 transition count 340
Applied a total of 142 rules in 9 ms. Remains 206 /227 variables (removed 21) and now considering 340/461 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15032845927233223958.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3119581880793176512.kers'
[2026-05-22 20:04:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15032845927233223958.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3119581880793176512.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 340 rows 206 cols 1625 entries
Finished phase 1 with 196 SingleSign rule and 0 generalized
[2026-05-22 20:04:18] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3119581880793176512.kers
Total runtime 4 ms.
[2026-05-22 20:04:18] [INFO ] Implicit Places using invariants in 151 ms returned []
[2026-05-22 20:04:18] [INFO ] Invariant cache hit.
[2026-05-22 20:04:18] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
Running 339 sub problems to find dead transitions.
[2026-05-22 20:04:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (OVERLAPS) 340/546 variables, 206/258 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 546/546 variables, and 258 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 339 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 1 (OVERLAPS) 1/206 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 42/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/206 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 4 (OVERLAPS) 340/546 variables, 206/258 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/546 variables, 339/597 constraints. Problems are: Problem set: 0 solved, 339 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/546 variables, 2/599 constraints. Problems are: Problem set: 0 solved, 339 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 546/546 variables, and 599 constraints, problems are : Problem set: 0 solved, 339 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 206/206 constraints, PredecessorRefiner: 339/339 constraints, Known Traps: 44/44 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 339 unsolved
Search for dead transitions found 0 dead transitions in 60199ms
Starting structural reductions in LTL mode, iteration 1 : 206/227 places, 340/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60608 ms. Remains : 206/227 places, 340/461 transitions.
[2026-05-22 20:05:18] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:05:18] [INFO ] Flatten gal took : 6 ms
[2026-05-22 20:05:18] [INFO ] Input system was already deterministic with 340 transitions.
[2026-05-22 20:05:18] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:05:18] [INFO ] Flatten gal took : 7 ms
[2026-05-22 20:05:18] [INFO ] Time to serialize gal into /tmp/CTLFireability13251845750690093246.gal : 2 ms
[2026-05-22 20:05:18] [INFO ] Time to serialize properties into /tmp/CTLFireability17675254395265929767.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/CTLFireability13251845750690093246.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17675254395265929767.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84316e+10,0.114972,7356,638,105,6201,694,506,7897,82,2487,0


Converting to forward existential form...Done !
original formula: EX((((i1.u1.p6==1)&&(i1.u1.p9==1))&&((i9.i1.u41.p141==1)&&(i1.u1.p212==1))))
=> equivalent forward existential formula: [(EY(Init) * (((i1.u1.p6==1)&&(i1.u1.p9==1))&&((i9.i1.u41.p141==1)&&(i1.u1.p212==1))))] != FALSE
(forward)formula 0,0,0.118237,7592,1,0,6201,694,684,7897,110,2487,958
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

ITS tools runner thread asked to quit. Dying gracefully.
Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 213 transition count 447
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 213 transition count 447
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 128 place count 213 transition count 347
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 134 place count 207 transition count 341
Iterating global reduction 1 with 6 rules applied. Total rules applied 140 place count 207 transition count 341
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 141 place count 206 transition count 340
Iterating global reduction 1 with 1 rules applied. Total rules applied 142 place count 206 transition count 340
Applied a total of 142 rules in 10 ms. Remains 206 /227 variables (removed 21) and now considering 340/461 (removed 121) transitions.
[2026-05-22 20:05:49] [INFO ] Invariant cache hit.
[2026-05-22 20:05:49] [INFO ] Implicit Places using invariants in 122 ms returned []
[2026-05-22 20:05:49] [INFO ] Invariant cache hit.
[2026-05-22 20:05:49] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 206/227 places, 340/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 441 ms. Remains : 206/227 places, 340/461 transitions.
[2026-05-22 20:05:49] [INFO ] Flatten gal took : 10 ms
[2026-05-22 20:05:49] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:05:49] [INFO ] Input system was already deterministic with 340 transitions.
[2026-05-22 20:05:49] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:05:49] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:05:49] [INFO ] Time to serialize gal into /tmp/CTLFireability7688046473510796147.gal : 3 ms
[2026-05-22 20:05:49] [INFO ] Time to serialize properties into /tmp/CTLFireability3707542434220970688.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/CTLFireability7688046473510796147.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability3707542434220970688.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.
Detected timeout of ITS tools.
[2026-05-22 20:06:19] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:06:19] [INFO ] Applying decomposition
[2026-05-22 20:06:19] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4360442099295917624.txt' '-o' '/tmp/graph4360442099295917624.bin' '-w' '/tmp/graph4360442099295917624.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4360442099295917624.bin' '-l' '-1' '-v' '-w' '/tmp/graph4360442099295917624.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:06:19] [INFO ] Decomposing Gal with order
[2026-05-22 20:06:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:06:19] [INFO ] Removed a total of 452 redundant transitions.
[2026-05-22 20:06:19] [INFO ] Flatten gal took : 21 ms
[2026-05-22 20:06:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2026-05-22 20:06:19] [INFO ] Time to serialize gal into /tmp/CTLFireability17460094235846086675.gal : 3 ms
[2026-05-22 20:06:19] [INFO ] Time to serialize properties into /tmp/CTLFireability4995582682814706379.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/CTLFireability17460094235846086675.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability4995582682814706379.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,3.84316e+10,0.132148,6660,450,102,4043,708,473,6828,81,3032,0


Converting to forward existential form...Done !
original formula: E((((i13.u1.p6==1)&&(i13.u1.p14==1))&&((i5.i1.u28.p110==1)&&(i13.u1.p212==1))) U !(EX(AF((((i13.u1.p6==1)&&(i13.u1.p16==1))&&((i9.u54.p17...184
=> equivalent forward existential formula: [(FwdU(Init,(((i13.u1.p6==1)&&(i13.u1.p14==1))&&((i5.i1.u28.p110==1)&&(i13.u1.p212==1)))) * !(EX(!(EG(!((((i13.u...236
Reverse transition relation is NOT exact ! Due to transitions t194, t196, t216, t246, t271, t291, t337, i2.t185, i2.u9.t165, i2.u15.t169, i2.u15.t170, i2.u...716
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 2
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,8.56325,212732,1,0,423905,3727,3441,599564,454,25704,430853
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 216 transition count 450
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 216 transition count 450
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 122 place count 216 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 211 transition count 345
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 211 transition count 345
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 133 place count 210 transition count 344
Iterating global reduction 1 with 1 rules applied. Total rules applied 134 place count 210 transition count 344
Applied a total of 134 rules in 14 ms. Remains 210 /227 variables (removed 17) and now considering 344/461 (removed 117) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1480357121329367114.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7498837657005881766.kers'
[2026-05-22 20:06:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1480357121329367114.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7498837657005881766.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 210 cols 1633 entries
Finished phase 1 with 200 SingleSign rule and 0 generalized
[2026-05-22 20:06:28] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7498837657005881766.kers
Total runtime 5 ms.
[2026-05-22 20:06:28] [INFO ] Implicit Places using invariants in 159 ms returned []
[2026-05-22 20:06:28] [INFO ] Invariant cache hit.
[2026-05-22 20:06:29] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2026-05-22 20:06:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 17/67 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 210/554 variables, and 68 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/210 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 58/58 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/209 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (OVERLAPS) 1/210 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 58/68 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 3/71 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (OVERLAPS) 344/554 variables, 210/281 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 343/624 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/554 variables, 1/625 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 554/554 variables, and 625 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 210/210 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 60162ms
Starting structural reductions in LTL mode, iteration 1 : 210/227 places, 344/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 210/227 places, 344/461 transitions.
[2026-05-22 20:07:29] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:07:29] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:07:29] [INFO ] Input system was already deterministic with 344 transitions.
[2026-05-22 20:07:29] [INFO ] Flatten gal took : 8 ms
[2026-05-22 20:07:29] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:07:29] [INFO ] Time to serialize gal into /tmp/CTLFireability15457662866451316003.gal : 3 ms
[2026-05-22 20:07:29] [INFO ] Time to serialize properties into /tmp/CTLFireability16346374492365485845.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/CTLFireability15457662866451316003.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability16346374492365485845.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.09953e+10,0.170614,6956,673,105,5082,666,523,6436,88,2326,0


Converting to forward existential form...Done !
original formula: A(AF((i14.i1.u68.p218==1)) U ((A((i3.u10.p31==1) U (AG((((i0.u1.p6==1)&&(i0.u1.p17==1))&&((i5.i1.u19.p79==1)&&(i0.u1.p212==1)))) * !(EX((...672
=> equivalent forward existential formula: [((Init * !(EG(!(((!((E(!((!(E(TRUE U !((((i0.u1.p6==1)&&(i0.u1.p17==1))&&((i5.i1.u19.p79==1)&&(i0.u1.p212==1)))...3047
Reverse transition relation is NOT exact ! Due to transitions t198, t223, t253, t278, t298, t341, i0.t196, i3.t189, i3.u10.t168, i3.u16.t172, i3.u16.t173, ...713
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 2
Fast SCC detection found an SCC at level 3
Fast SCC detection found an SCC at level 4
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,26.545,654872,1,0,1.40069e+06,4373,4361,1.59378e+06,500,26787,1652537
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

Starting structural reductions in LTL mode, iteration 0 : 227/227 places, 461/461 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 214 transition count 448
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 214 transition count 448
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 126 place count 214 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 209 transition count 343
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 209 transition count 343
Applied a total of 136 rules in 8 ms. Remains 209 /227 variables (removed 18) and now considering 343/461 (removed 118) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6116891553701710672.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5648738443268650674.kers'
[2026-05-22 20:08:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6116891553701710672.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5648738443268650674.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 343 rows 209 cols 1631 entries
Finished phase 1 with 199 SingleSign rule and 0 generalized
[2026-05-22 20:08:26] [INFO ] Computed 10 invariants in 3 ms
Computed 10 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5648738443268650674.kers
Total runtime 4 ms.
[2026-05-22 20:08:26] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-22 20:08:26] [INFO ] Invariant cache hit.
[2026-05-22 20:08:26] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
Running 342 sub problems to find dead transitions.
[2026-05-22 20:08:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 17/47 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 15/62 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 209/552 variables, and 64 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/209 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 54/54 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 342 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 1 (OVERLAPS) 1/209 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 7/71 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 5/76 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/209 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/209 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 7 (OVERLAPS) 343/552 variables, 209/288 constraints. Problems are: Problem set: 0 solved, 342 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/552 variables, 342/630 constraints. Problems are: Problem set: 0 solved, 342 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 552/552 variables, and 630 constraints, problems are : Problem set: 0 solved, 342 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 209/209 constraints, PredecessorRefiner: 342/342 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60245ms problems are : Problem set: 0 solved, 342 unsolved
Search for dead transitions found 0 dead transitions in 60246ms
Starting structural reductions in LTL mode, iteration 1 : 209/227 places, 343/461 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60810 ms. Remains : 209/227 places, 343/461 transitions.
[2026-05-22 20:09:27] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:09:27] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:09:27] [INFO ] Input system was already deterministic with 343 transitions.
[2026-05-22 20:09:27] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:09:27] [INFO ] Flatten gal took : 12 ms
[2026-05-22 20:09:27] [INFO ] Time to serialize gal into /tmp/CTLFireability17852994184053661239.gal : 4 ms
[2026-05-22 20:09:27] [INFO ] Time to serialize properties into /tmp/CTLFireability17944249399538276121.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/CTLFireability17852994184053661239.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability17944249399538276121.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

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

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...263
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,4.29018e+10,0.119486,5836,443,105,2768,533,470,3469,81,1299,0


Converting to forward existential form...Done !
original formula: EG(A(!(EX(((((i13.u1.p6==1)&&(i13.u1.p16==1))&&((i7.i0.u39.p129==1)&&(i13.u1.p212==1)))||(i9.i1.u51.p173==1)))) U (EG(AX((i3.u24.p80==1))...237
=> equivalent forward existential formula: [FwdG(Init,!((E(!((EG(!(EX(!((i3.u24.p80==1))))) + !((E(!(E((i5.i0.u32.p103==1) U (i15.i0.u68.p234==1))) U (!(!(...908
Reverse transition relation is NOT exact ! Due to transitions t196, t203, t223, t253, t273, t293, t340, i1.t187, i1.u10.t167, i1.u16.t171, i1.u16.t172, i1....693
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 14
Fast SCC detection found an SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found an SCC at level 16
(forward)formula 0,0,19.8755,462164,1,0,929808,4276,3465,1.24962e+06,469,22868,874997
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

[2026-05-22 20:10:17] [INFO ] Flatten gal took : 15 ms
[2026-05-22 20:10:17] [INFO ] Flatten gal took : 11 ms
[2026-05-22 20:10:17] [INFO ] Applying decomposition
[2026-05-22 20:10:17] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph208209477390516435.txt' '-o' '/tmp/graph208209477390516435.bin' '-w' '/tmp/graph208209477390516435.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph208209477390516435.bin' '-l' '-1' '-v' '-w' '/tmp/graph208209477390516435.weights' '-q' '0' '-e' '0.001'
[2026-05-22 20:10:17] [INFO ] Decomposing Gal with order
[2026-05-22 20:10:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 20:10:17] [INFO ] Removed a total of 893 redundant transitions.
[2026-05-22 20:10:17] [INFO ] Flatten gal took : 29 ms
[2026-05-22 20:10:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 5 ms.
[2026-05-22 20:10:17] [INFO ] Time to serialize gal into /tmp/CTLFireability10904063943636017919.gal : 4 ms
[2026-05-22 20:10:17] [INFO ] Time to serialize properties into /tmp/CTLFireability18184594283581938489.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/CTLFireability10904063943636017919.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability18184594283581938489.ctl'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...264
No direction supplied, using forward translation only.
Parsed 2 CTL formulae.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.87222e+10,0.241182,8156,708,55,7381,290,628,9773,72,862,0


Converting to forward existential form...Done !
original formula: EG((((i4.i1.u22.p65==1) + EX(EG(((((i0.u2.p6==1)&&(i0.u2.p17==1))&&((i3.i0.u11.p36==1)&&(i0.u72.p212==1)))||(i11.u58.p176==1))))) + EG(AF...233
=> equivalent forward existential formula: [FwdG(Init,(((i4.i1.u22.p65==1) + EX(EG(((((i0.u2.p6==1)&&(i0.u2.p17==1))&&((i3.i0.u11.p36==1)&&(i0.u72.p212==1)...282
Reverse transition relation is NOT exact ! Due to transitions t146, t203, t210, t212, t268, t269, t273, t274, t328, t329, t333, t334, t458, i0.u2.t213, i2....785
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Using saturation style SCC detection
Fast SCC detection found an SCC at level 1
Fast SCC detection found an SCC at level 2
Fast SCC detection found a local SCC at level 1
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 0,1,50.4844,890904,1,0,1.73216e+06,815,4253,2.04223e+06,358,4550,2173573
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is TRUE !

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

original formula: AG(A((((i0.u2.p6==1)&&(i0.u72.p14==1))&&((i11.u57.p179==1)&&(i0.u72.p212==1))) U AF(EG(EX((i3.i0.u12.p38==1))))))
=> equivalent forward existential formula: ([FwdG((FwdU(FwdU(Init,TRUE),!(!(EG(!(EG(EX((i3.i0.u12.p38==1)))))))) * !((((i0.u2.p6==1)&&(i0.u72.p14==1))&&((i...307
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
Fast SCC detection found a local SCC at level 15
Fast SCC detection found an SCC at level 16
(forward)formula 1,0,66.3732,1212848,1,0,2.28534e+06,827,4264,2.81981e+06,358,4647,2798359
FORMULA AutonomousCar-PT-05b-CTLFireability-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Formula is FALSE !

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

Total runtime 1390458 ms.

BK_STOP 1779480684211

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

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