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-177946787900052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is AutonomousCar-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946787900052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 548K
-rw-r--r-- 1 mcc users 8.3K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 132K Mar 5 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Mar 5 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 72K Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779476875769

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 19:07:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 19:07:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 19:07:58] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2026-05-22 19:07:58] [INFO ] Transformed 49 places.
[2026-05-22 19:07:58] [INFO ] Transformed 193 transitions.
[2026-05-22 19:07:58] [INFO ] Found NUPN structural information;
[2026-05-22 19:07:58] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 399 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
FORMULA AutonomousCar-PT-04a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 113
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 113
Applied a total of 2 rules in 34 ms. Remains 48 /49 variables (removed 1) and now considering 113/118 (removed 5) transitions.
[2026-05-22 19:07:59] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-47370480517947565.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3612509010505668919.kers'
[2026-05-22 19:07:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-47370480517947565.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3612509010505668919.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 47 cols 609 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 19:07:59] [INFO ] Computed 9 invariants in 1 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3612509010505668919.kers
Total runtime 2 ms.
[2026-05-22 19:07:59] [INFO ] Implicit Places using invariants in 375 ms returned []
[2026-05-22 19:07:59] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
[2026-05-22 19:07:59] [INFO ] Invariant cache hit.
[2026-05-22 19:07:59] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-22 19:07:59] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [43, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 691 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/49 places, 113/118 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 113/113 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 775 ms. Remains : 46/49 places, 113/118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 113/113 (removed 0) transitions.
[2026-05-22 19:07:59] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9972804711453806436.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4678816114510024030.kers'
[2026-05-22 19:07:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9972804711453806436.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4678816114510024030.kers]
Normalized transition count is 111 out of 112 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 111 rows 45 cols 602 entries
Finished phase 1 with 39 SingleSign rule and 0 generalized
[2026-05-22 19:07:59] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4678816114510024030.kers
Total runtime 1 ms.
[2026-05-22 19:07:59] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-22 19:07:59] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
[2026-05-22 19:07:59] [INFO ] Invariant cache hit.
[2026-05-22 19:07:59] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-22 19:07:59] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 112 sub problems to find dead transitions.
[2026-05-22 19:07:59] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
[2026-05-22 19:07:59] [INFO ] Invariant cache hit.
[2026-05-22 19:08:00] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 111/157 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 62/118 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 1/158 variables, 1/119 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (OVERLAPS) 0/158 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 119 constraints, problems are : Problem set: 0 solved, 112 unsolved in 8588 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (OVERLAPS) 1/46 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (OVERLAPS) 111/157 variables, 46/56 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 62/118 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/157 variables, 112/230 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/157 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/157 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 1/158 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 11 (OVERLAPS) 0/158 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 158/158 variables, and 234 constraints, problems are : Problem set: 0 solved, 112 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 29089ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 29113ms
Finished structural reductions in LTL mode , in 1 iterations and 29371 ms. Remains : 46/46 places, 113/113 transitions.
Support contains 29 out of 46 places after structural reductions.
[2026-05-22 19:08:29] [INFO ] Flatten gal took : 58 ms
[2026-05-22 19:08:29] [INFO ] Flatten gal took : 25 ms
[2026-05-22 19:08:29] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 40000 steps (2296 resets) in 2031 ms. (19 steps per ms) remains 1/24 properties
BEST_FIRST walk for 40002 steps (367 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
[2026-05-22 19:08:30] [INFO ] Flow matrix only has 112 transitions (discarded 1 similar events)
[2026-05-22 19:08:30] [INFO ] Invariant cache hit.
[2026-05-22 19:08:30] [INFO ] State equation strengthened by 63 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/42 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 108/150 variables, 42/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 62/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 6/156 variables, 3/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/157 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/157 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/158 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/158 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 158/158 variables, and 116 constraints, problems are : Problem set: 0 solved, 1 unsolved in 118 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 46/46 constraints, ReadFeed: 63/63 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 42/158 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/46 constraints, ReadFeed: 0/63 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 171ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
FORMULA AutonomousCar-PT-04a-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 3 stabilizing places and 2 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1||X(p2)))))))'
Support contains 10 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 44 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 44 transition count 103
Applied a total of 4 rules in 5 ms. Remains 44 /46 variables (removed 2) and now considering 103/113 (removed 10) transitions.
[2026-05-22 19:08:30] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3520352617590327336.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9822144978688625151.kers'
[2026-05-22 19:08:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3520352617590327336.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9822144978688625151.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 43 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:08:30] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9822144978688625151.kers
Total runtime 1 ms.
[2026-05-22 19:08:31] [INFO ] Implicit Places using invariants in 80 ms returned []
[2026-05-22 19:08:31] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2026-05-22 19:08:31] [INFO ] Invariant cache hit.
[2026-05-22 19:08:31] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:08:31] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Running 102 sub problems to find dead transitions.
[2026-05-22 19:08:31] [INFO ] Flow matrix only has 102 transitions (discarded 1 similar events)
[2026-05-22 19:08:31] [INFO ] Invariant cache hit.
[2026-05-22 19:08:31] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 101/145 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 54/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (OVERLAPS) 1/146 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/146 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 0/146 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Real declared 146/146 variables, and 109 constraints, problems are : Problem set: 0 solved, 102 unsolved in 7392 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 102 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 1 (OVERLAPS) 1/44 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/44 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 4 (OVERLAPS) 101/145 variables, 44/54 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/145 variables, 54/108 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 102/210 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 3/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 9 (OVERLAPS) 1/146 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
At refinement iteration 11 (OVERLAPS) 0/146 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 102 unsolved
No progress, stopping.
After SMT solving in domain Int declared 146/146 variables, and 214 constraints, problems are : Problem set: 0 solved, 102 unsolved in 14263 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 44/44 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 102/102 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21806ms problems are : Problem set: 0 solved, 102 unsolved
Search for dead transitions found 0 dead transitions in 21808ms
Starting structural reductions in LTL mode, iteration 1 : 44/46 places, 103/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22051 ms. Remains : 44/46 places, 103/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((p0||X(p1)))||p2))))'
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-01
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 5 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-01 finished in 22626 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p1)&&(!p2 U (p3||G(!p2)))))||p0))))'
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 46 transition count 108
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 41 transition count 108
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 41 transition count 107
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 37 transition count 96
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 37 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 35 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 24 place count 34 transition count 94
Applied a total of 24 rules in 65 ms. Remains 34 /46 variables (removed 12) and now considering 94/113 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3453251656747218741.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2278199168024456504.kers'
[2026-05-22 19:08:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3453251656747218741.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2278199168024456504.kers]
Normalized transition count is 93 out of 94 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 93 rows 33 cols 539 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 19:08:53] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-2278199168024456504.kers
Total runtime 3 ms.
[2026-05-22 19:08:53] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-22 19:08:53] [INFO ] Invariant cache hit.
[2026-05-22 19:08:53] [INFO ] State equation strengthened by 57 read => feed constraints.
[2026-05-22 19:08:53] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2026-05-22 19:08:53] [INFO ] Redundant transitions in 31 ms returned []
Running 93 sub problems to find dead transitions.
[2026-05-22 19:08:53] [INFO ] Invariant cache hit.
[2026-05-22 19:08:53] [INFO ] State equation strengthened by 57 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (OVERLAPS) 93/127 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 56/96 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (OVERLAPS) 1/128 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 98 constraints, problems are : Problem set: 0 solved, 93 unsolved in 6071 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 93 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 1 (OVERLAPS) 1/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 4 (OVERLAPS) 93/127 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 56/97 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 93/190 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/127 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 9 (OVERLAPS) 1/128 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 93 unsolved
At refinement iteration 11 (OVERLAPS) 0/128 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 93 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 194 constraints, problems are : Problem set: 0 solved, 93 unsolved in 16193 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 93/93 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 22343ms problems are : Problem set: 0 solved, 93 unsolved
Search for dead transitions found 0 dead transitions in 22346ms
Starting structural reductions in SI_LTL mode, iteration 1 : 34/46 places, 94/113 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22730 ms. Remains : 34/46 places, 94/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((F(p1)&&(!p2 U (p3||G(!p2)))))||p0))))'
Stuttering acceptance computed with spot in 239 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 395 ms.
Product exploration explored 100000 steps with 3 reset in 288 ms.
Computed a total of 5 stabilizing places and 6 stable transitions
Computed a total of 5 stabilizing places and 6 stable transitions
Knowledge based reduction with 19 factoid took 78 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
RANDOM walk for 40000 steps (2938 resets) in 626 ms. (63 steps per ms) remains 4/9 properties
BEST_FIRST walk for 40003 steps (409 resets) in 312 ms. (127 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (417 resets) in 218 ms. (182 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (413 resets) in 187 ms. (212 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (409 resets) in 191 ms. (208 steps per ms) remains 4/4 properties
[2026-05-22 19:09:17] [INFO ] Invariant cache hit.
[2026-05-22 19:09:17] [INFO ] State equation strengthened by 57 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 8/15 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/30 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 91/121 variables, 30/36 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 56/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/92 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 6/127 variables, 4/96 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/127 variables, 0/96 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/128 variables, 1/97 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/128 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 97 constraints, problems are : Problem set: 2 solved, 2 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 34/34 constraints, ReadFeed: 57/57 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Problem apf1 is UNSAT
Problem apf5 is UNSAT
After SMT solving in domain Int declared 15/128 variables, and 3 constraints, problems are : Problem set: 4 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 3/6 constraints, State Equation: 0/34 constraints, ReadFeed: 0/57 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 246ms problems are : Problem set: 4 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 4 invariant AP formulas.
Knowledge based reduction with 23 factoid took 164 ms. Proved property starting from automaton with 4 states, 11 edges and 4 AP (stutter insensitive
Knowledge-based reduction took 971 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-02 finished in 24677 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((p0 U p1) U X(!(G(p1) U X(p0))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 98
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 98
Applied a total of 6 rules in 4 ms. Remains 43 /46 variables (removed 3) and now considering 98/113 (removed 15) transitions.
[2026-05-22 19:09:18] [INFO ] Flow matrix only has 97 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17124654120078860482.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8237910563181662255.kers'
[2026-05-22 19:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17124654120078860482.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8237910563181662255.kers]
Normalized transition count is 96 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 96 rows 42 cols 524 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 19:09:18] [INFO ] Computed 7 invariants in 1 ms
Computed 7 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8237910563181662255.kers
Total runtime 1 ms.
[2026-05-22 19:09:18] [INFO ] Implicit Places using invariants in 141 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 98/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 42 /42 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 150 ms. Remains : 42/46 places, 98/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(!((p0 U p1) U X(!(G(p1) U X(p0))))))'
Stuttering acceptance computed with spot in 435 ms :[(NOT p0), (NOT p0), (NOT p0), (AND p1 (NOT p0)), (NOT p0), (NOT p0), true, (AND p1 (NOT p0)), (NOT p1), (AND p1 (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-03 finished in 652 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(!p0))&&(p1||F(G(p2)))) U X(p0)))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 3 ms. Remains 43 /46 variables (removed 3) and now considering 102/113 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13714775085643792695.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13717108342898524558.kers'
[2026-05-22 19:09:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13714775085643792695.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13717108342898524558.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 42 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:09:18] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13717108342898524558.kers
Total runtime 1 ms.
[2026-05-22 19:09:18] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 19:09:18] [INFO ] Invariant cache hit.
[2026-05-22 19:09:18] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:09:18] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 19:09:18] [INFO ] Invariant cache hit.
[2026-05-22 19:09:18] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 2/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 8466 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 211 constraints, problems are : Problem set: 0 solved, 101 unsolved in 18894 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 27412ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 27413ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27586 ms. Remains : 43/46 places, 102/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(F(!p0))&&(p1||F(G(p2)))) U X(p0)))'
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-04
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-04 finished in 27789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0))||F(p1)))&&X(X(F(!(p0 U p1))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 102/113 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16462932034803705934.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12674824292661595017.kers'
[2026-05-22 19:09:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16462932034803705934.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12674824292661595017.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 42 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:09:46] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12674824292661595017.kers
Total runtime 1 ms.
[2026-05-22 19:09:46] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-22 19:09:46] [INFO ] Invariant cache hit.
[2026-05-22 19:09:46] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:09:46] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 43/46 places, 102/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(X(p0))||F(p1)))&&X(X(F(!(p0 U p1))))))'
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) p1), (AND (NOT p1) (NOT p0)), p1, (AND (NOT p1) (NOT p0)), p1, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-06
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-06 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(X(G(p2))))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 97/113 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1204553843664490682.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17321262140748374407.kers'
[2026-05-22 19:09:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1204553843664490682.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17321262140748374407.kers]
Normalized transition count is 96 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 96 rows 41 cols 524 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 19:09:47] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17321262140748374407.kers
Total runtime 1 ms.
[2026-05-22 19:09:47] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 19:09:47] [INFO ] Invariant cache hit.
[2026-05-22 19:09:47] [INFO ] State equation strengthened by 51 read => feed constraints.
[2026-05-22 19:09:47] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2026-05-22 19:09:47] [INFO ] Invariant cache hit.
[2026-05-22 19:09:47] [INFO ] State equation strengthened by 51 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (OVERLAPS) 96/138 variables, 42/48 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 50/98 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (OVERLAPS) 1/139 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 102 constraints, problems are : Problem set: 0 solved, 96 unsolved in 7374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/42 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (OVERLAPS) 96/138 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/138 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 96/197 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/138 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (OVERLAPS) 1/139 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/139 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/139 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 201 constraints, problems are : Problem set: 0 solved, 96 unsolved in 14402 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 21843ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 21844ms
Starting structural reductions in LTL mode, iteration 1 : 42/46 places, 97/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22060 ms. Remains : 42/46 places, 97/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(p1)&&X(X(G(p2))))))'
Stuttering acceptance computed with spot in 403 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p0)), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-08
Product exploration explored 100000 steps with 16 reset in 444 ms.
Product exploration explored 100000 steps with 38 reset in 204 ms.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Knowledge based reduction with 14 factoid took 76 ms. Reduced automaton from 9 states, 19 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (2273 resets) in 155 ms. (256 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (444 resets) in 66 ms. (597 steps per ms) remains 1/1 properties
[2026-05-22 19:10:10] [INFO ] Invariant cache hit.
[2026-05-22 19:10:10] [INFO ] State equation strengthened by 51 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/125 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 11/136 variables, 6/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/136 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/138 variables, 2/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/139 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/139 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/139 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 139/139 variables, and 99 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 18/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 91/125 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/125 variables, 50/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/125 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/125 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/136 variables, 6/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/136 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/136 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/138 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/138 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/139 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/139 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 139/139 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 42/42 constraints, ReadFeed: 51/51 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 513ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 5 out of 42 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 42/42 places, 97/97 transitions.
Graph (complete) has 250 edges and 42 vertex of which 41 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 41 transition count 89
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 13 place count 36 transition count 89
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 19 place count 33 transition count 86
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 33 transition count 82
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 39 place count 29 transition count 70
Applied a total of 39 rules in 47 ms. Remains 29 /42 variables (removed 13) and now considering 70/97 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 29/42 places, 70/97 transitions.
RANDOM walk for 40000 steps (1228 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (621 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11473 steps, run visited all 1 properties in 38 ms. (steps per millisecond=301 )
Probabilistic random walk after 11473 steps, saw 2631 distinct states, run finished after 43 ms. (steps per millisecond=266 ) properties seen :1
Negative knowledge disproves property using: (G (OR p0 p2))
Knowledge based reduction with 14 factoid took 119 ms. Proved property starting from automaton with 6 states, 11 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 1058 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-08 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-08 finished in 24237 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(F(p2))))'
Support contains 8 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 2 ms. Remains 42 /46 variables (removed 4) and now considering 97/113 (removed 16) transitions.
[2026-05-22 19:10:11] [INFO ] Invariant cache hit.
[2026-05-22 19:10:11] [INFO ] Implicit Places using invariants in 94 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/113 transitions.
Applied a total of 0 rules in 0 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 98 ms. Remains : 41/46 places, 97/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(F(p2))))'
Stuttering acceptance computed with spot in 208 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-11
Product exploration explored 100000 steps with 39944 reset in 626 ms.
Product exploration explored 100000 steps with 39950 reset in 557 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 11 ms. Proved property starting from automaton with 4 states, 6 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 14 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property AutonomousCar-PT-04a-LTLFireability-11 finished in 1544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U p1)))'
Support contains 7 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 43 transition count 102
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 43 transition count 102
Applied a total of 6 rules in 2 ms. Remains 43 /46 variables (removed 3) and now considering 102/113 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9250505837460459437.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4088439170641852359.kers'
[2026-05-22 19:10:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9250505837460459437.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4088439170641852359.kers]
Normalized transition count is 101 out of 102 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 101 rows 42 cols 550 entries
Finished phase 1 with 37 SingleSign rule and 0 generalized
[2026-05-22 19:10:12] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4088439170641852359.kers
Total runtime 1 ms.
[2026-05-22 19:10:12] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-22 19:10:12] [INFO ] Invariant cache hit.
[2026-05-22 19:10:12] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-22 19:10:13] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 101 sub problems to find dead transitions.
[2026-05-22 19:10:13] [INFO ] Invariant cache hit.
[2026-05-22 19:10:13] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (OVERLAPS) 101/144 variables, 43/49 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 54/103 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (OVERLAPS) 1/145 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 0/145 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 107 constraints, problems are : Problem set: 0 solved, 101 unsolved in 7320 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 101 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 1 (OVERLAPS) 1/43 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 4 (OVERLAPS) 101/144 variables, 43/52 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 54/106 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 101/207 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/144 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/144 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 9 (OVERLAPS) 1/145 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
At refinement iteration 11 (OVERLAPS) 0/145 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 101 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 211 constraints, problems are : Problem set: 0 solved, 101 unsolved in 16512 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 43/43 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 101/101 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 23884ms problems are : Problem set: 0 solved, 101 unsolved
Search for dead transitions found 0 dead transitions in 23885ms
Starting structural reductions in LTL mode, iteration 1 : 43/46 places, 102/113 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24064 ms. Remains : 43/46 places, 102/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0) U p1)))'
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-12
Stuttering criterion allowed to conclude after 77 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-12 finished in 24256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G((p1||X(p0)))&&X(p1)))))'
Support contains 6 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 42 transition count 97
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 42 transition count 97
Applied a total of 8 rules in 3 ms. Remains 42 /46 variables (removed 4) and now considering 97/113 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8447062947003001268.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5201504802459895839.kers'
[2026-05-22 19:10:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8447062947003001268.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5201504802459895839.kers]
Normalized transition count is 96 out of 97 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 96 rows 41 cols 524 entries
Finished phase 1 with 36 SingleSign rule and 0 generalized
[2026-05-22 19:10:37] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5201504802459895839.kers
Total runtime 2 ms.
[2026-05-22 19:10:37] [INFO ] Implicit Places using invariants in 107 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 109 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 97/113 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113 ms. Remains : 41/46 places, 97/113 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(G((p1||X(p0)))&&X(p1)))))'
Stuttering acceptance computed with spot in 374 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), true, (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-04a-LTLFireability-15
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-04a-LTLFireability-15 finished in 537 ms.
All properties solved by simple procedures.
Total runtime 159499 ms.

BK_STOP 1779477037703

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04a"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-04a, examination is LTLFireability"
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-177946787900052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-04a.tgz
mv AutonomousCar-PT-04a execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;