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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 8.3K Mar 5 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 5 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Mar 5 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 5 16:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K 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 95K Mar 5 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:18 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 42K 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-03a-LTLFireability-00
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-01
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-02
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-03
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-04
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-05
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-06
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-07
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-08
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-09
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-10
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-11
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-12
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-13
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-14
FORMULA_NAME AutonomousCar-PT-03a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779474577298

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-03a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 18:29:39] [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 18:29:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:29:40] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2026-05-22 18:29:40] [INFO ] Transformed 41 places.
[2026-05-22 18:29:40] [INFO ] Transformed 121 transitions.
[2026-05-22 18:29:40] [INFO ] Found NUPN structural information;
[2026-05-22 18:29:40] [INFO ] Parsed PT model containing 41 places and 121 transitions and 745 arcs in 372 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
FORMULA AutonomousCar-PT-03a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-03a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 76/76 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 40 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 40 transition count 75
Applied a total of 2 rules in 32 ms. Remains 40 /41 variables (removed 1) and now considering 75/76 (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-16811016545148903716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3589789712576698708.kers'
[2026-05-22 18:29:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16811016545148903716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3589789712576698708.kers]
Normalized transition count is 74 out of 75 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 39 cols 358 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 18:29:40] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3589789712576698708.kers
Total runtime 2 ms.
[2026-05-22 18:29:41] [INFO ] Implicit Places using invariants in 330 ms returned []
[2026-05-22 18:29:41] [INFO ] Invariant cache hit.
[2026-05-22 18:29:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-22 18:29:41] [INFO ] Implicit Places using invariants and state equation in 208 ms returned [36, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 629 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 38/41 places, 75/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 38 /38 variables (removed 0) and now considering 75/75 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 699 ms. Remains : 38/41 places, 75/76 transitions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Applied a total of 0 rules in 3 ms. Remains 38 /38 variables (removed 0) and now considering 75/75 (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-13934493958984560016.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-363485809912228255.kers'
[2026-05-22 18:29:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13934493958984560016.kers, --Pflows, --basisKERS=/tmp/petrispot-output-363485809912228255.kers]
Normalized transition count is 74 out of 75 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 74 rows 37 cols 351 entries
Finished phase 1 with 33 SingleSign rule and 0 generalized
[2026-05-22 18:29:41] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-363485809912228255.kers
Total runtime 1 ms.
[2026-05-22 18:29:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-22 18:29:41] [INFO ] Invariant cache hit.
[2026-05-22 18:29:41] [INFO ] State equation strengthened by 39 read => feed constraints.
[2026-05-22 18:29:41] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 74 sub problems to find dead transitions.
[2026-05-22 18:29:41] [INFO ] Invariant cache hit.
[2026-05-22 18:29:41] [INFO ] State equation strengthened by 39 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (OVERLAPS) 74/112 variables, 38/43 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 38/81 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (OVERLAPS) 0/113 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Real declared 113/113 variables, and 85 constraints, problems are : Problem set: 0 solved, 74 unsolved in 5319 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 74 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 1 (OVERLAPS) 1/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 4 (OVERLAPS) 74/112 variables, 38/46 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 38/84 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 74/158 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 2/160 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 9 (OVERLAPS) 1/113 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/113 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
At refinement iteration 11 (OVERLAPS) 0/113 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 74 unsolved
No progress, stopping.
After SMT solving in domain Int declared 113/113 variables, and 161 constraints, problems are : Problem set: 0 solved, 74 unsolved in 6977 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 38/38 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 74/74 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 12538ms problems are : Problem set: 0 solved, 74 unsolved
Search for dead transitions found 0 dead transitions in 12559ms
Finished structural reductions in LTL mode , in 1 iterations and 12793 ms. Remains : 38/38 places, 75/75 transitions.
Support contains 27 out of 38 places after structural reductions.
[2026-05-22 18:29:54] [INFO ] Flatten gal took : 49 ms
[2026-05-22 18:29:54] [INFO ] Flatten gal took : 20 ms
[2026-05-22 18:29:54] [INFO ] Input system was already deterministic with 75 transitions.
RANDOM walk for 10789 steps (590 resets) in 505 ms. (21 steps per ms) remains 0/22 properties
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(G((p0||X(X((F(G(!p0)) U (p1 U p2))))))))'
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 5 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11277505846608036328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3665433738562862900.kers'
[2026-05-22 18:29:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11277505846608036328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3665433738562862900.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 35 cols 311 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 18:29:55] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3665433738562862900.kers
Total runtime 1 ms.
[2026-05-22 18:29:55] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 18:29:55] [INFO ] Invariant cache hit.
[2026-05-22 18:29:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-22 18:29:55] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-05-22 18:29:55] [INFO ] Invariant cache hit.
[2026-05-22 18:29:55] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4097 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 145 constraints, problems are : Problem set: 0 solved, 66 unsolved in 6674 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 10851ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 10853ms
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11045 ms. Remains : 36/38 places, 67/75 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((X(X((F(G(!p0)) U (p1 U p2))))||p0))))'
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), p0]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-00
Product exploration explored 100000 steps with 5 reset in 379 ms.
Stuttering criterion allowed to conclude after 177 steps with 16 reset in 6 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-00 finished in 12106 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||X(X(!p1))) U (G((p0||X(X(!p1))))||((p0||X(X(!p1)))&&X(G(!p2)))))))'
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 3 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17604116318916363377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5007434405680556410.kers'
[2026-05-22 18:30:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17604116318916363377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5007434405680556410.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 35 cols 311 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 18:30:07] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5007434405680556410.kers
Total runtime 1 ms.
[2026-05-22 18:30:07] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 18:30:07] [INFO ] Invariant cache hit.
[2026-05-22 18:30:07] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-22 18:30:07] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 36/38 places, 67/75 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||X(X(!p1))) U (G((p0||X(X(!p1))))||(X(G(!p2))&&(p0||X(X(!p1))))))))'
Stuttering acceptance computed with spot in 459 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p2 p1), p1, true, (AND p1 p2), (AND p2 p1), p2]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-01
Product exploration explored 100000 steps with 6 reset in 220 ms.
Product exploration explored 100000 steps with 24 reset in 232 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 6 factoid took 111 ms. Reduced automaton from 9 states, 15 edges and 3 AP (stutter sensitive) to 9 states, 14 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (2314 resets) in 390 ms. (102 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40003 steps (611 resets) in 241 ms. (165 steps per ms) remains 1/1 properties
[2026-05-22 18:30:08] [INFO ] Invariant cache hit.
[2026-05-22 18:30:08] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Real declared 15/103 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 3/5 constraints, State Equation: 0/36 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 7 factoid took 188 ms. Reduced automaton from 9 states, 14 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 452 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND (NOT p0) p2 p1), p1, true, (AND p1 p2), (AND p1 p2), p2]
Knowledge-based reduction took 1003 ms.
Stuttering acceptance computed with spot in 422 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND (NOT p0) p2 p1), p1, true, (AND p1 p2), (AND p1 p2), p2]
Support contains 5 out of 36 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 36/36 places, 67/67 transitions.
Applied a total of 0 rules in 1 ms. Remains 36 /36 variables (removed 0) and now considering 67/67 (removed 0) transitions.
[2026-05-22 18:30:10] [INFO ] Invariant cache hit.
[2026-05-22 18:30:10] [INFO ] Implicit Places using invariants in 58 ms returned []
[2026-05-22 18:30:10] [INFO ] Invariant cache hit.
[2026-05-22 18:30:10] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-22 18:30:10] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 36/36 places, 67/67 transitions.
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 5 factoid took 96 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
RANDOM walk for 1738 steps (100 resets) in 11 ms. (144 steps per ms) remains 0/5 properties
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 396 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND (NOT p0) p2 p1), p1, true, (AND p1 p2), (AND p1 p2), p2]
Knowledge-based reduction took 674 ms.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND (NOT p0) p2 p1), p1, true, (AND p1 p2), (AND p1 p2), p2]
Stuttering acceptance computed with spot in 426 ms :[(AND (NOT p0) p2 p1), (AND (NOT p0) p2 p1), p1, (AND (NOT p0) p2 p1), p1, true, (AND p1 p2), (AND p1 p2), p2]
Product exploration explored 100000 steps with 6 reset in 113 ms.
Product exploration explored 100000 steps with 114 reset in 213 ms.
Spot run failed in 159 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin8877854122993600988
[2026-05-22 18:30:12] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8877854122993600988
Running compilation step : cd /tmp/ltsmin8877854122993600988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 614 ms.
Running link step : cd /tmp/ltsmin8877854122993600988;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin8877854122993600988;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased1232467907930596415.hoa' '--buchi-type=spotba'
LTSmin run took 405 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property AutonomousCar-PT-03a-LTLFireability-01 finished in 5910 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(X(G(p0))))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 4 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5894505699586414462.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6280579552195755585.kers'
[2026-05-22 18:30:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5894505699586414462.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6280579552195755585.kers]
Normalized transition count is 62 out of 63 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 34 cols 291 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 18:30:13] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6280579552195755585.kers
Total runtime 1 ms.
[2026-05-22 18:30:13] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-22 18:30:13] [INFO ] Invariant cache hit.
[2026-05-22 18:30:13] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-22 18:30:13] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2026-05-22 18:30:13] [INFO ] Invariant cache hit.
[2026-05-22 18:30:13] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 62/97 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 73 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3762 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 137 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5249 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9053ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 9055ms
Starting structural reductions in LTL mode, iteration 1 : 35/38 places, 63/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9266 ms. Remains : 35/38 places, 63/75 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(X(G(p0))))'
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-02
Entered a terminal (fully accepting) state of product in 55 steps with 3 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-02 finished in 9486 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(!p0)))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 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 38 transition count 70
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 33 transition count 70
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 33 transition count 69
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 32 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 29 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 29 transition count 57
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 27 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 24 place count 26 transition count 55
Applied a total of 24 rules in 45 ms. Remains 26 /38 variables (removed 12) and now considering 55/75 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1274564055735641615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-83751520728967436.kers'
[2026-05-22 18:30:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1274564055735641615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-83751520728967436.kers]
Normalized transition count is 54 out of 55 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 54 rows 25 cols 280 entries
Finished phase 1 with 21 SingleSign rule and 0 generalized
[2026-05-22 18:30:22] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-83751520728967436.kers
Total runtime 1 ms.
[2026-05-22 18:30:22] [INFO ] Implicit Places using invariants in 72 ms returned []
[2026-05-22 18:30:22] [INFO ] Invariant cache hit.
[2026-05-22 18:30:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2026-05-22 18:30:23] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2026-05-22 18:30:23] [INFO ] Redundant transitions in 24 ms returned []
Running 54 sub problems to find dead transitions.
[2026-05-22 18:30:23] [INFO ] Invariant cache hit.
[2026-05-22 18:30:23] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (OVERLAPS) 54/80 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 31/62 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (OVERLAPS) 1/81 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 0/81 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 64 constraints, problems are : Problem set: 0 solved, 54 unsolved in 3210 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 54 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 1 (OVERLAPS) 1/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 4 (OVERLAPS) 54/80 variables, 26/32 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 31/63 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 2/119 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 54 unsolved
At refinement iteration 11 (OVERLAPS) 0/81 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 54 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 120 constraints, problems are : Problem set: 0 solved, 54 unsolved in 5663 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 54/54 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8908ms problems are : Problem set: 0 solved, 54 unsolved
Search for dead transitions found 0 dead transitions in 8909ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 55/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9161 ms. Remains : 26/38 places, 55/75 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(p0)))'
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-03
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-03 finished in 9298 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((G((p0 U p1))&&F(p2)&&(p2||X(p1)))))'
Support contains 7 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 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 4 place count 38 transition count 71
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 34 transition count 71
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 34 transition count 70
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 10 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 31 transition count 62
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 31 transition count 62
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 2 with 2 rules applied. Total rules applied 16 place count 30 transition count 61
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 18 place count 29 transition count 61
Applied a total of 18 rules in 20 ms. Remains 29 /38 variables (removed 9) and now considering 61/75 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10641964017317423886.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7679187164470965968.kers'
[2026-05-22 18:30:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10641964017317423886.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7679187164470965968.kers]
Normalized transition count is 60 out of 61 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 60 rows 28 cols 304 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 18:30:32] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7679187164470965968.kers
Total runtime 1 ms.
[2026-05-22 18:30:32] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-22 18:30:32] [INFO ] Invariant cache hit.
[2026-05-22 18:30:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-22 18:30:32] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2026-05-22 18:30:32] [INFO ] Redundant transitions in 19 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-22 18:30:32] [INFO ] Invariant cache hit.
[2026-05-22 18:30:32] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 1/90 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 0/90 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 69 constraints, problems are : Problem set: 0 solved, 60 unsolved in 2858 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 60/128 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (OVERLAPS) 1/90 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/90 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (OVERLAPS) 0/90 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 131 constraints, problems are : Problem set: 0 solved, 60 unsolved in 6685 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 9594ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 9595ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/38 places, 61/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9792 ms. Remains : 29/38 places, 61/75 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((G((p0 U p1))&&F(p2)&&(p2||X(p1)))))'
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-04
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-04 finished in 10044 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))'
Support contains 4 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 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 38 transition count 70
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 33 transition count 70
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 33 transition count 69
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 32 transition count 69
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 14 place count 30 transition count 61
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 30 transition count 61
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 2 with 2 rules applied. Total rules applied 18 place count 29 transition count 60
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 20 place count 28 transition count 60
Applied a total of 20 rules in 13 ms. Remains 28 /38 variables (removed 10) and now considering 60/75 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9999988671172086311.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6054571947057738479.kers'
[2026-05-22 18:30:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9999988671172086311.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6054571947057738479.kers]
Normalized transition count is 59 out of 60 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 59 rows 27 cols 302 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-22 18:30:42] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6054571947057738479.kers
Total runtime 0 ms.
[2026-05-22 18:30:42] [INFO ] Implicit Places using invariants in 71 ms returned []
[2026-05-22 18:30:42] [INFO ] Invariant cache hit.
[2026-05-22 18:30:42] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-22 18:30:42] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2026-05-22 18:30:42] [INFO ] Redundant transitions in 22 ms returned []
Running 59 sub problems to find dead transitions.
[2026-05-22 18:30:42] [INFO ] Invariant cache hit.
[2026-05-22 18:30:42] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (OVERLAPS) 1/88 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/88 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 0/88 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/88 variables, and 68 constraints, problems are : Problem set: 0 solved, 59 unsolved in 2973 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 59 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 1 (OVERLAPS) 1/28 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 3 (OVERLAPS) 59/87 variables, 28/33 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/87 variables, 34/67 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/87 variables, 59/126 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 2/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/87 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 8 (OVERLAPS) 1/88 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/88 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
At refinement iteration 10 (OVERLAPS) 0/88 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 59 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/88 variables, and 129 constraints, problems are : Problem set: 0 solved, 59 unsolved in 5398 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 28/28 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 59/59 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8406ms problems are : Problem set: 0 solved, 59 unsolved
Search for dead transitions found 0 dead transitions in 8407ms
Starting structural reductions in SI_LTL mode, iteration 1 : 28/38 places, 60/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8643 ms. Remains : 28/38 places, 60/75 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))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-05
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-05 finished in 8729 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&&X(X(F(p1))))) U X(p2)))'
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 2 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9350873279868383500.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18392220424647867020.kers'
[2026-05-22 18:30:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9350873279868383500.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18392220424647867020.kers]
Normalized transition count is 62 out of 63 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 34 cols 291 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 18:30:50] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18392220424647867020.kers
Total runtime 1 ms.
[2026-05-22 18:30:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2026-05-22 18:30:50] [INFO ] Invariant cache hit.
[2026-05-22 18:30:50] [INFO ] State equation strengthened by 30 read => feed constraints.
[2026-05-22 18:30:51] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
Running 62 sub problems to find dead transitions.
[2026-05-22 18:30:51] [INFO ] Invariant cache hit.
[2026-05-22 18:30:51] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (OVERLAPS) 62/97 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 29/69 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 3/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 0/98 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 73 constraints, problems are : Problem set: 0 solved, 62 unsolved in 3706 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (OVERLAPS) 1/35 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 62/97 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 29/72 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/136 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 137 constraints, problems are : Problem set: 0 solved, 62 unsolved in 5214 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 35/35 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8939ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 8940ms
Starting structural reductions in LTL mode, iteration 1 : 35/38 places, 63/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9071 ms. Remains : 35/38 places, 63/75 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&&X(X(F(p1))))) U X(p2)))'
Stuttering acceptance computed with spot in 372 ms :[(NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-06
Stuttering criterion allowed to conclude after 30 steps with 3 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-06 finished in 9490 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 2 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 2 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
[2026-05-22 18:31:00] [INFO ] Invariant cache hit.
[2026-05-22 18:31:00] [INFO ] Implicit Places using invariants in 102 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 104 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 34/38 places, 63/75 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 155 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-07
Stuttering criterion allowed to conclude after 15 steps with 1 reset in 1 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-07 finished in 301 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(G(p0)) U (F(p2)||p1)))'
Support contains 9 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 38 transition count 73
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 36 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 35 transition count 72
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 6 place count 35 transition count 70
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 10 place count 33 transition count 70
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 12 place count 31 transition count 62
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 31 transition count 62
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 3 with 2 rules applied. Total rules applied 16 place count 30 transition count 61
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 3 with 2 rules applied. Total rules applied 18 place count 29 transition count 61
Applied a total of 18 rules in 39 ms. Remains 29 /38 variables (removed 9) and now considering 61/75 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1417746547249675038.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13127210919926906286.kers'
[2026-05-22 18:31:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1417746547249675038.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13127210919926906286.kers]
Normalized transition count is 60 out of 61 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 60 rows 28 cols 305 entries
Finished phase 1 with 24 SingleSign rule and 0 generalized
[2026-05-22 18:31:00] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13127210919926906286.kers
Total runtime 2 ms.
[2026-05-22 18:31:00] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-22 18:31:00] [INFO ] Invariant cache hit.
[2026-05-22 18:31:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2026-05-22 18:31:00] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2026-05-22 18:31:00] [INFO ] Redundant transitions in 20 ms returned []
Running 60 sub problems to find dead transitions.
[2026-05-22 18:31:00] [INFO ] Invariant cache hit.
[2026-05-22 18:31:00] [INFO ] State equation strengthened by 35 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 60/89 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 34/68 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 1/90 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/90 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 0/90 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 90/90 variables, and 71 constraints, problems are : Problem set: 0 solved, 60 unsolved in 3654 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 1/29 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (OVERLAPS) 60/89 variables, 29/36 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 34/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 2/132 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 9 (OVERLAPS) 1/90 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/90 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 11 (OVERLAPS) 0/90 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 90/90 variables, and 133 constraints, problems are : Problem set: 0 solved, 60 unsolved in 5162 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 29/29 constraints, ReadFeed: 35/35 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 8848ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 8849ms
Starting structural reductions in SI_LTL mode, iteration 1 : 29/38 places, 61/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9083 ms. Remains : 29/38 places, 61/75 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(G(p0)) U (F(p2)||p1)))'
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-08
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-08 finished in 9234 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(G(!p0)))'
Support contains 1 out of 38 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 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 5 rules applied. Total rules applied 5 place count 36 transition count 70
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 32 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 32 transition count 69
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 11 place count 31 transition count 69
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 14 place count 28 transition count 57
Iterating global reduction 2 with 3 rules applied. Total rules applied 17 place count 28 transition count 57
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 2 with 2 rules applied. Total rules applied 19 place count 27 transition count 56
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 21 place count 26 transition count 56
Applied a total of 21 rules in 17 ms. Remains 26 /38 variables (removed 12) and now considering 56/75 (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-12401158703486779246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14324014163539430069.kers'
[2026-05-22 18:31:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12401158703486779246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14324014163539430069.kers]
Normalized transition count is 55 out of 56 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 55 rows 26 cols 277 entries
Finished phase 1 with 22 SingleSign rule and 0 generalized
[2026-05-22 18:31:09] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14324014163539430069.kers
Total runtime 0 ms.
[2026-05-22 18:31:09] [INFO ] Implicit Places using invariants in 63 ms returned []
[2026-05-22 18:31:10] [INFO ] Invariant cache hit.
[2026-05-22 18:31:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:31:10] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2026-05-22 18:31:10] [INFO ] Redundant transitions in 19 ms returned []
Running 55 sub problems to find dead transitions.
[2026-05-22 18:31:10] [INFO ] Invariant cache hit.
[2026-05-22 18:31:10] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (OVERLAPS) 55/81 variables, 26/30 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/81 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (OVERLAPS) 1/82 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 34 constraints, problems are : Problem set: 0 solved, 55 unsolved in 2403 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 55 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 3 (OVERLAPS) 55/81 variables, 26/31 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/81 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 55/87 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 10 (OVERLAPS) 1/82 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 55 unsolved
At refinement iteration 12 (OVERLAPS) 0/82 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 55 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 92 constraints, problems are : Problem set: 0 solved, 55 unsolved in 5935 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 26/26 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 55/55 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 8364ms problems are : Problem set: 0 solved, 55 unsolved
Search for dead transitions found 0 dead transitions in 8365ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/38 places, 56/75 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8576 ms. Remains : 26/38 places, 56/75 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(G(p0)))'
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-10
Product exploration explored 100000 steps with 1 reset in 85 ms.
Product exploration explored 100000 steps with 6 reset in 197 ms.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 29 steps (1 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 204 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 1 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 56/56 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2026-05-22 18:31:19] [INFO ] Invariant cache hit.
[2026-05-22 18:31:19] [INFO ] Implicit Places using invariants in 64 ms returned []
[2026-05-22 18:31:19] [INFO ] Invariant cache hit.
[2026-05-22 18:31:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-22 18:31:19] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
[2026-05-22 18:31:19] [INFO ] Redundant transitions in 22 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 190 ms. Remains : 26/26 places, 56/56 transitions.
Computed a total of 3 stabilizing places and 5 stable transitions
Computed a total of 3 stabilizing places and 5 stable transitions
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Knowledge-based reduction took 207 ms.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 39 steps with 1 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-10 finished in 9718 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)&&F((G(F(!p1))||(F(!p1)&&G(p2))))) U X(p3))))'
Support contains 12 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6376501859183447238.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5533364048115986181.kers'
[2026-05-22 18:31:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6376501859183447238.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5533364048115986181.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 35 cols 311 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 18:31:19] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-5533364048115986181.kers
Total runtime 0 ms.
[2026-05-22 18:31:19] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-22 18:31:19] [INFO ] Invariant cache hit.
[2026-05-22 18:31:19] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-22 18:31:19] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Running 66 sub problems to find dead transitions.
[2026-05-22 18:31:19] [INFO ] Invariant cache hit.
[2026-05-22 18:31:19] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (OVERLAPS) 66/102 variables, 36/41 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 32/73 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 1/103 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 0/103 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 77 constraints, problems are : Problem set: 0 solved, 66 unsolved in 4234 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (OVERLAPS) 1/36 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/36 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 66/102 variables, 36/44 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 32/76 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 66/142 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 2/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/144 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 9 (OVERLAPS) 1/103 variables, 1/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/103 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 11 (OVERLAPS) 0/103 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 145 constraints, problems are : Problem set: 0 solved, 66 unsolved in 7137 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 36/36 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 11391ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 11392ms
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11505 ms. Remains : 36/38 places, 67/75 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)&&F((G(F(!p1))||(F(!p1)&&G(p2))))) U X(p3))))'
Stuttering acceptance computed with spot in 588 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p2) (NOT p3) p1), (AND p2 p1 (NOT p3)), (NOT p0), p1, (AND (NOT p2) p1), p1]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-11
Product exploration explored 100000 steps with 5 reset in 109 ms.
Product exploration explored 100000 steps with 15 reset in 127 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 15 factoid took 258 ms. Reduced automaton from 11 states, 27 edges and 4 AP (stutter sensitive) to 11 states, 24 edges and 4 AP (stutter sensitive).
RANDOM walk for 40000 steps (2273 resets) in 383 ms. (104 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40002 steps (574 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (582 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
[2026-05-22 18:31:32] [INFO ] Invariant cache hit.
[2026-05-22 18:31:32] [INFO ] State equation strengthened by 33 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, 2 unsolved
Problem apf4 is UNSAT
Problem apf10 is UNSAT
After SMT solving in domain Real declared 21/103 variables, and 4 constraints, problems are : Problem set: 2 solved, 0 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 4/5 constraints, State Equation: 0/36 constraints, ReadFeed: 0/33 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 17 factoid took 380 ms. Reduced automaton from 11 states, 24 edges and 4 AP (stutter sensitive) to 11 states, 22 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 553 ms :[(NOT p3), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p3)), (AND p1 (NOT p3)), (AND (NOT p3) (NOT p2) p1), (AND p1 (NOT p3)), (NOT p0), p1, (AND (NOT p2) p1), p1]
[2026-05-22 18:31:33] [INFO ] Invariant cache hit.
Proved EG (NOT p3) asserting that LTL formula F !(NOT p3) is false.
Negative knowledge disproves property using: (F p3)
Knowledge-based reduction took 1626 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-11 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property AutonomousCar-PT-03a-LTLFireability-11 finished in 14100 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((X(X((p0||X(X(p1))))) U G(p2))))'
Support contains 7 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 36 transition count 67
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 36 transition count 67
Applied a total of 4 rules in 2 ms. Remains 36 /38 variables (removed 2) and now considering 67/75 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16874486016815883263.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4832215307500177462.kers'
[2026-05-22 18:31:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16874486016815883263.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4832215307500177462.kers]
Normalized transition count is 66 out of 67 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 66 rows 35 cols 311 entries
Finished phase 1 with 31 SingleSign rule and 0 generalized
[2026-05-22 18:31:33] [INFO ] Computed 5 invariants in 1 ms
Computed 5 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4832215307500177462.kers
Total runtime 2 ms.
[2026-05-22 18:31:33] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-22 18:31:33] [INFO ] Invariant cache hit.
[2026-05-22 18:31:33] [INFO ] State equation strengthened by 33 read => feed constraints.
[2026-05-22 18:31:33] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 36/38 places, 67/75 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 180 ms. Remains : 36/38 places, 67/75 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((X(X((X(X(p0))||p1))) U G(p2))))'
Stuttering acceptance computed with spot in 560 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-12
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-12 finished in 809 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)&&F(p1))))'
Support contains 5 out of 38 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 38/38 places, 75/75 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 35 transition count 63
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 35 transition count 63
Applied a total of 6 rules in 2 ms. Remains 35 /38 variables (removed 3) and now considering 63/75 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12847803123570797615.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17572293407800896567.kers'
[2026-05-22 18:31:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12847803123570797615.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17572293407800896567.kers]
Normalized transition count is 62 out of 63 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 62 rows 34 cols 291 entries
Finished phase 1 with 30 SingleSign rule and 0 generalized
[2026-05-22 18:31:34] [INFO ] Computed 5 invariants in 0 ms
Computed 5 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17572293407800896567.kers
Total runtime 1 ms.
[2026-05-22 18:31:34] [INFO ] Implicit Places using invariants in 104 ms returned [1]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 34/38 places, 63/75 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 34/38 places, 63/75 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)&&F(p1))))'
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : AutonomousCar-PT-03a-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA AutonomousCar-PT-03a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property AutonomousCar-PT-03a-LTLFireability-14 finished in 265 ms.
All properties solved by simple procedures.
Total runtime 114907 ms.

BK_STOP 1779474694872

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

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