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

About the Execution of ITS-Tools for BART-COL-060

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6731.056 3600000.00 6928374.00 11575.70 F?FFFFFFFFTFTFF? normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000220.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 BART-COL-060, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 8.6K Mar 5 10:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 10:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Mar 5 10:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 80K Mar 5 10:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Mar 15 07:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 5 10:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 10:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Mar 5 10:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 67K Mar 5 10:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 equiv_pt
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 219K 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 BART-COL-060-LTLFireability-00
FORMULA_NAME BART-COL-060-LTLFireability-01
FORMULA_NAME BART-COL-060-LTLFireability-02
FORMULA_NAME BART-COL-060-LTLFireability-03
FORMULA_NAME BART-COL-060-LTLFireability-04
FORMULA_NAME BART-COL-060-LTLFireability-05
FORMULA_NAME BART-COL-060-LTLFireability-06
FORMULA_NAME BART-COL-060-LTLFireability-07
FORMULA_NAME BART-COL-060-LTLFireability-08
FORMULA_NAME BART-COL-060-LTLFireability-09
FORMULA_NAME BART-COL-060-LTLFireability-10
FORMULA_NAME BART-COL-060-LTLFireability-11
FORMULA_NAME BART-COL-060-LTLFireability-12
FORMULA_NAME BART-COL-060-LTLFireability-13
FORMULA_NAME BART-COL-060-LTLFireability-14
FORMULA_NAME BART-COL-060-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779546616409

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-060
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202604301425
[2026-05-23 14:30:18] [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-23 14:30:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 14:30:18] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2026-05-23 14:30:19] [WARNING] Using fallBack plugin, rng conformance not checked
[2026-05-23 14:30:19] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1117 ms
[2026-05-23 14:30:19] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2026-05-23 14:30:19] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 25133 PT places and 8.443377072E10 transition bindings in 108 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2026-05-23 14:30:20] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 11 ms.
[2026-05-23 14:30:20] [INFO ] Skeletonized 3 HLPN properties in 1 ms. Removed 13 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Symmetric sort wr.t. initial and guards and successors and join/free detected :trainid
Symmetric sort wr.t. initial detected :trainid
Symmetric sort wr.t. initial and guards detected :trainid
Applying symmetric unfolding of full symmetric sort :trainid domain size was 60
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
Arc [3:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2026-05-23 14:30:21] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 1535 ms.
[2026-05-23 14:30:21] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
[2026-05-23 14:30:21] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-060-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-060-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-14540823225365083599.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12410942640596787614.kers'
[2026-05-23 14:30:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14540823225365083599.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12410942640596787614.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 14:30:21] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12410942640596787614.kers
Total runtime 3 ms.
[2026-05-23 14:30:22] [INFO ] Implicit Places using invariants in 357 ms returned []
[2026-05-23 14:30:22] [INFO ] Invariant cache hit.
[2026-05-23 14:30:22] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 14:30:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11914 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23727ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 23749ms
Finished structural reductions in LTL mode , in 1 iterations and 24393 ms. Remains : 132/132 places, 202/202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 14:30:46] [INFO ] Invariant cache hit.
[2026-05-23 14:30:46] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 14:30:46] [INFO ] Invariant cache hit.
[2026-05-23 14:30:46] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2026-05-23 14:30:46] [INFO ] Flatten gal took : 68 ms
[2026-05-23 14:30:46] [INFO ] Flatten gal took : 40 ms
[2026-05-23 14:30:46] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 28580 steps (6 resets) in 71 ms. (396 steps per ms) remains 0/10 properties
FORMULA BART-COL-060-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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' '!(F(p0))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 69 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15256615572397547157.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8875224555077404151.kers'
[2026-05-23 14:30:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15256615572397547157.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8875224555077404151.kers]
Normalized transition count is 157 out of 158 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 157 rows 89 cols 314 entries
Finished phase 1 with 88 SingleSign rule and 0 generalized
[2026-05-23 14:30:47] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8875224555077404151.kers
Total runtime 3 ms.
[2026-05-23 14:30:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2026-05-23 14:30:47] [INFO ] Invariant cache hit.
[2026-05-23 14:30:47] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2026-05-23 14:30:47] [INFO ] Redundant transitions in 6 ms returned []
Running 122 sub problems to find dead transitions.
[2026-05-23 14:30:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 90 constraints, problems are : Problem set: 0 solved, 122 unsolved in 6479 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 122/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 5964 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12493ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 12495ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12766 ms. Remains : 89/132 places, 158/202 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 275 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA BART-COL-060-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-00 finished in 13210 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 27 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8101096544136940187.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5527158698847318579.kers'
[2026-05-23 14:31:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8101096544136940187.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5527158698847318579.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 98 cols 336 entries
Finished phase 1 with 97 SingleSign rule and 0 generalized
[2026-05-23 14:31:00] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5527158698847318579.kers
Total runtime 1 ms.
[2026-05-23 14:31:00] [INFO ] Implicit Places using invariants in 62 ms returned []
[2026-05-23 14:31:00] [INFO ] Invariant cache hit.
[2026-05-23 14:31:00] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2026-05-23 14:31:00] [INFO ] Redundant transitions in 10 ms returned []
Running 132 sub problems to find dead transitions.
[2026-05-23 14:31:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 168/266 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 0/266 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 99 constraints, problems are : Problem set: 0 solved, 132 unsolved in 7532 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 168/266 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 132/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 231 constraints, problems are : Problem set: 0 solved, 132 unsolved in 7507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15064ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 15065ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15310 ms. Remains : 98/132 places, 168/202 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-060-LTLFireability-01
Product exploration explored 100000 steps with 5 reset in 411 ms.
Product exploration explored 100000 steps with 8 reset in 477 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40052 steps (8 resets) in 105 ms. (377 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1441 ms. (27 steps per ms) remains 1/1 properties
[2026-05-23 14:31:17] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Problem apf3 is UNSAT
After SMT solving in domain Real declared 69/266 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/98 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 8 factoid took 155 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
[2026-05-23 14:31:17] [INFO ] Invariant cache hit.
[2026-05-23 14:31:18] [INFO ] [Real]Absence check using 1 positive place invariants in 23 ms returned sat
[2026-05-23 14:31:18] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2026-05-23 14:31:18] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:31:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2026-05-23 14:31:19] [INFO ] [Nat]Absence check using state equation in 471 ms returned sat
[2026-05-23 14:31:19] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 28 ms.
[2026-05-23 14:31:19] [INFO ] Added : 84 causal constraints over 17 iterations in 418 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2936 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 68 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2026-05-23 14:31:20] [INFO ] Invariant cache hit.
[2026-05-23 14:31:20] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 14:31:20] [INFO ] Invariant cache hit.
[2026-05-23 14:31:20] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2026-05-23 14:31:20] [INFO ] Redundant transitions in 10 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 325 ms. Remains : 98/98 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2026-05-23 14:31:20] [INFO ] Invariant cache hit.
[2026-05-23 14:31:20] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2026-05-23 14:31:21] [INFO ] [Real]Absence check using state equation in 479 ms returned sat
[2026-05-23 14:31:21] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:31:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 8 ms returned sat
[2026-05-23 14:31:21] [INFO ] [Nat]Absence check using state equation in 482 ms returned sat
[2026-05-23 14:31:22] [INFO ] Computed and/alt/rep : 132/236/132 causal constraints (skipped 0 transitions) in 21 ms.
[2026-05-23 14:31:22] [INFO ] Added : 84 causal constraints over 17 iterations in 410 ms. Result :sat
Could not prove EG (NOT p0)
Knowledge-based reduction took 2076 ms.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 192 ms.
Product exploration explored 100000 steps with 7 reset in 265 ms.
Built C files in :
/tmp/ltsmin1941137964910245297
[2026-05-23 14:31:23] [INFO ] Computing symmetric may disable matrix : 168 transitions.
[2026-05-23 14:31:23] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:31:23] [INFO ] Computing symmetric may enable matrix : 168 transitions.
[2026-05-23 14:31:23] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:31:23] [INFO ] Computing Do-Not-Accords matrix : 168 transitions.
[2026-05-23 14:31:23] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:31:23] [INFO ] Built C files in 83ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1941137964910245297
Running compilation step : cd /tmp/ltsmin1941137964910245297;'/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 1125 ms.
Running link step : cd /tmp/ltsmin1941137964910245297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 82 ms.
Running LTSmin : cd /tmp/ltsmin1941137964910245297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7644193544247079176.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 68 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 168/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 98 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 97 transition count 167
Applied a total of 2 rules in 9 ms. Remains 97 /98 variables (removed 1) and now considering 167/168 (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-2754149934529294705.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17711915915330161336.kers'
[2026-05-23 14:31:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2754149934529294705.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17711915915330161336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 167 rows 97 cols 334 entries
Finished phase 1 with 96 SingleSign rule and 0 generalized
[2026-05-23 14:31:38] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17711915915330161336.kers
Total runtime 1 ms.
[2026-05-23 14:31:38] [INFO ] Implicit Places using invariants in 44 ms returned []
[2026-05-23 14:31:38] [INFO ] Invariant cache hit.
[2026-05-23 14:31:38] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-23 14:31:38] [INFO ] Redundant transitions in 2 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-23 14:31:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 98 constraints, problems are : Problem set: 0 solved, 131 unsolved in 6757 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 131/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 229 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7428 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14197ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 14198ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/98 places, 167/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 14345 ms. Remains : 97/98 places, 167/168 transitions.
Built C files in :
/tmp/ltsmin7477772428996509217
[2026-05-23 14:31:52] [INFO ] Computing symmetric may disable matrix : 167 transitions.
[2026-05-23 14:31:52] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:31:52] [INFO ] Computing symmetric may enable matrix : 167 transitions.
[2026-05-23 14:31:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:31:52] [INFO ] Computing Do-Not-Accords matrix : 167 transitions.
[2026-05-23 14:31:52] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:31:52] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7477772428996509217
Running compilation step : cd /tmp/ltsmin7477772428996509217;'/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 652 ms.
Running link step : cd /tmp/ltsmin7477772428996509217;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7477772428996509217;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16512337783661316837.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 14:32:07] [INFO ] Flatten gal took : 10 ms
[2026-05-23 14:32:07] [INFO ] Flatten gal took : 9 ms
[2026-05-23 14:32:07] [INFO ] Time to serialize gal into /tmp/LTL13755990193481926186.gal : 4 ms
[2026-05-23 14:32:07] [INFO ] Time to serialize properties into /tmp/LTL7072638457077156621.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13755990193481926186.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17171766876604885133.hoa' '-atoms' '/tmp/LTL7072638457077156621.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL7072638457077156621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17171766876604885133.hoa
Detected timeout of ITS tools.
[2026-05-23 14:32:22] [INFO ] Flatten gal took : 18 ms
[2026-05-23 14:32:22] [INFO ] Flatten gal took : 19 ms
[2026-05-23 14:32:22] [INFO ] Time to serialize gal into /tmp/LTL11466286210851468203.gal : 4 ms
[2026-05-23 14:32:22] [INFO ] Time to serialize properties into /tmp/LTL14018169278052907448.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11466286210851468203.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14018169278052907448.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_4...3105
Formula 0 simplified : G(F!"((TrainState_42>=1)&&((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_4...3098
Detected timeout of ITS tools.
[2026-05-23 14:32:37] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:32:37] [INFO ] Applying decomposition
[2026-05-23 14:32:37] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4528017907213301111.txt' '-o' '/tmp/graph4528017907213301111.bin' '-w' '/tmp/graph4528017907213301111.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4528017907213301111.bin' '-l' '-1' '-v' '-w' '/tmp/graph4528017907213301111.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:32:37] [INFO ] Decomposing Gal with order
[2026-05-23 14:32:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:32:38] [INFO ] Removed a total of 61 redundant transitions.
[2026-05-23 14:32:38] [INFO ] Flatten gal took : 66 ms
[2026-05-23 14:32:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 36 labels/synchronizations in 14 ms.
[2026-05-23 14:32:38] [INFO ] Time to serialize gal into /tmp/LTL8984523144443461454.gal : 5 ms
[2026-05-23 14:32:38] [INFO ] Time to serialize properties into /tmp/LTL6891997449442854376.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8984523144443461454.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6891997449442854376.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((i1.i0.u3.TrainState_90>=1)||(i1.i0.u3.TrainState_88>=1))||((i1.i0.u0.TrainState_43>=1)||(i0.i0.u1.TrainState_45>=1)))|...4390
Formula 0 simplified : G(F!"((i1.i0.u0.TrainState_42>=1)&&((((((((i1.i0.u3.TrainState_90>=1)||(i1.i0.u3.TrainState_88>=1))||((i1.i0.u0.TrainState_43>=1)||(...4383
Detected timeout of ITS tools.
Treatment of property BART-COL-060-LTLFireability-01 finished in 112547 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(p0)) U (p0 U p1))) U (!p0&&(p0||(X(X(p0)) U (p0 U p1)))))))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 6 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16379614398057893244.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13634207426837893856.kers'
[2026-05-23 14:32:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16379614398057893244.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13634207426837893856.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 199 rows 129 cols 398 entries
Finished phase 1 with 128 SingleSign rule and 0 generalized
[2026-05-23 14:32:53] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13634207426837893856.kers
Total runtime 1 ms.
[2026-05-23 14:32:53] [INFO ] Implicit Places using invariants in 55 ms returned []
[2026-05-23 14:32:53] [INFO ] Invariant cache hit.
[2026-05-23 14:32:53] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2026-05-23 14:32:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 12305 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 11207 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23529ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 23530ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23731 ms. Remains : 129/132 places, 199/202 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(p0)) U (p0 U p1))) U (!p0&&(X(X(p0)) U (p0 U p1))))))'
Stuttering acceptance computed with spot in 422 ms :[(NOT p0), (NOT p1), (OR (NOT p1) p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-060-LTLFireability-03
Product exploration explored 100000 steps with 839 reset in 733 ms.
Product exploration explored 100000 steps with 837 reset in 445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
RANDOM walk for 854 steps (0 resets) in 7 ms. (106 steps per ms) remains 0/5 properties
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 8 states, 15 edges and 2 AP (stutter sensitive) to 8 states, 15 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 427 ms :[(NOT p1), (NOT p0), (OR (NOT p1) p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) p0), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
[2026-05-23 14:33:19] [INFO ] Invariant cache hit.
[2026-05-23 14:33:19] [INFO ] [Real]Absence check using 1 positive place invariants in 37 ms returned sat
[2026-05-23 14:33:20] [INFO ] [Real]Absence check using state equation in 1123 ms returned sat
[2026-05-23 14:33:20] [INFO ] Solution in real domain found non-integer solution.
[2026-05-23 14:33:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2026-05-23 14:33:21] [INFO ] [Nat]Absence check using state equation in 685 ms returned sat
[2026-05-23 14:33:21] [INFO ] Computed and/alt/rep : 163/267/163 causal constraints (skipped 0 transitions) in 16 ms.
[2026-05-23 14:33:22] [INFO ] Added : 163 causal constraints over 33 iterations in 884 ms. Result :sat
Could not prove EG (NOT p1)
[2026-05-23 14:33:22] [INFO ] Invariant cache hit.
[2026-05-23 14:33:22] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned unsat
Proved EG p0 asserting that LTL formula F !p0 is false.
Negative knowledge disproves property using: (F (NOT p0))
Knowledge-based reduction took 4381 ms.
FORMULA BART-COL-060-LTLFireability-03 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-03 finished in 29761 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' '!((!p0 U (G(!p0)||(!p0&&X(X(X(!p1)))&&F(p2)))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 27 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17808795285338359044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10943396282084363868.kers'
[2026-05-23 14:33:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17808795285338359044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10943396282084363868.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 90 cols 320 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 14:33:22] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10943396282084363868.kers
Total runtime 1 ms.
[2026-05-23 14:33:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2026-05-23 14:33:23] [INFO ] Invariant cache hit.
[2026-05-23 14:33:23] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-23 14:33:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 91 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7351 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 124/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 215 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6551 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13939ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 13940ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14216 ms. Remains : 90/132 places, 160/202 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' '!((!p0 U (G(!p0)||(!p0&&X(X(X(!p1)))&&F(p2)))))'
Stuttering acceptance computed with spot in 776 ms :[p0, true, (AND p0 p1), (AND (NOT p2) p0), p1, (AND p0 p1), (AND (NOT p2) p1 p0), p1, (NOT p2), (AND p0 p1), (AND (NOT p2) p1 p0), p1, (AND (NOT p2) p0 p1), (AND (NOT p2) p1)]
Running random walk in product with property : BART-COL-060-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6477 steps with 1618 reset in 24 ms.
FORMULA BART-COL-060-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-04 finished in 15081 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' '!((((!p0&&X(p1)) U X(X(p1))) U (F(!p1)&&X(!p0))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 19 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
[2026-05-23 14:33:38] [INFO ] Invariant cache hit.
[2026-05-23 14:33:38] [INFO ] Implicit Places using invariants in 50 ms returned []
[2026-05-23 14:33:38] [INFO ] Invariant cache hit.
[2026-05-23 14:33:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 90/132 places, 160/202 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' '!((((!p0&&X(p1)) U X(X(p1))) U (F(!p1)&&X(!p0))))'
Stuttering acceptance computed with spot in 384 ms :[(OR p1 p0), (AND (NOT p1) p0), p0, (AND p0 (NOT p1)), p1, (NOT p1), true, (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-060-LTLFireability-06
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-06 finished in 663 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 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 128 place count 68 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 57 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 57 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 57 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 53 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 53 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 50 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 50 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 47 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 47 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 45 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 45 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 43 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 43 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 42 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 42 transition count 111
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 195 place count 35 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 199 place count 35 transition count 100
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 4 with 4 rules applied. Total rules applied 203 place count 33 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 207 place count 33 transition count 94
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 5 with 4 rules applied. Total rules applied 211 place count 31 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 31 transition count 88
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 6 with 4 rules applied. Total rules applied 219 place count 29 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 223 place count 29 transition count 82
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 7 with 4 rules applied. Total rules applied 227 place count 27 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 231 place count 27 transition count 76
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 8 with 4 rules applied. Total rules applied 235 place count 25 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 239 place count 25 transition count 70
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 9 with 4 rules applied. Total rules applied 243 place count 23 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 247 place count 23 transition count 64
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 10 with 4 rules applied. Total rules applied 251 place count 21 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 255 place count 21 transition count 58
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 11 with 4 rules applied. Total rules applied 259 place count 19 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 263 place count 19 transition count 52
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 12 with 4 rules applied. Total rules applied 267 place count 17 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 271 place count 17 transition count 46
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 13 with 4 rules applied. Total rules applied 275 place count 15 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 279 place count 15 transition count 40
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 14 with 4 rules applied. Total rules applied 283 place count 13 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 287 place count 13 transition count 34
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 15 with 4 rules applied. Total rules applied 291 place count 11 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 295 place count 11 transition count 28
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 16 with 4 rules applied. Total rules applied 299 place count 9 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 303 place count 9 transition count 22
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 17 with 4 rules applied. Total rules applied 307 place count 7 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 311 place count 7 transition count 16
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 18 with 4 rules applied. Total rules applied 315 place count 5 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 319 place count 5 transition count 10
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 19 with 4 rules applied. Total rules applied 323 place count 3 transition count 8
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 328 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 100 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10335637706237254535.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2055903679894834786.kers'
[2026-05-23 14:33:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10335637706237254535.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2055903679894834786.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 2 rows 1 cols 2 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-05-23 14:33:38] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2055903679894834786.kers
Total runtime 1 ms.
[2026-05-23 14:33:38] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-05-23 14:33:38] [INFO ] Invariant cache hit.
[2026-05-23 14:33:38] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2026-05-23 14:33:38] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2026-05-23 14:33:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 77ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 2/132 places, 2/202 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 : BART-COL-060-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 173 ms.
Stack based approach found an accepted trace after 3718 steps with 0 reset with depth 3719 and stack size 61 in 8 ms.
FORMULA BART-COL-060-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-060-LTLFireability-07 finished in 504 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((G(!p0) U (F(p1) U (X(G(!p2))||(X(!p2)&&F(!p3)))))))'
Support contains 122 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (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-5404377960264996922.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8472652133694942886.kers'
[2026-05-23 14:33:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5404377960264996922.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8472652133694942886.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 202 rows 132 cols 404 entries
Finished phase 1 with 131 SingleSign rule and 0 generalized
[2026-05-23 14:33:39] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8472652133694942886.kers
Total runtime 2 ms.
[2026-05-23 14:33:39] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 14:33:39] [INFO ] Invariant cache hit.
[2026-05-23 14:33:39] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2026-05-23 14:33:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11635 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 11530 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23182ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 23188ms
Finished structural reductions in LTL mode , in 1 iterations and 23469 ms. Remains : 132/132 places, 202/202 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((G(!p0) U (F(p1) U (X(G(!p2))||(X(!p2)&&F(!p3)))))))'
Stuttering acceptance computed with spot in 768 ms :[p2, (AND (NOT p1) p0 p2), p2, (AND (NOT p1) p2), p2, (AND (NOT p1) p3 p0 p2), (AND p2 p3), (AND (NOT p1) p3 p2), (AND p2 p3), (NOT p1), (AND (NOT p1) p0), (AND (NOT p1) p3 p0 (NOT p2)), (AND (NOT p1) p3)]
Running random walk in product with property : BART-COL-060-LTLFireability-09
Product exploration explored 100000 steps with 524 reset in 795 ms.
Product exploration explored 100000 steps with 519 reset in 582 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 22 factoid took 1118 ms. Reduced automaton from 13 states, 36 edges and 4 AP (stutter sensitive) to 13 states, 36 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 26 to 21
RANDOM walk for 40092 steps (8 resets) in 96 ms. (413 steps per ms) remains 2/21 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1838 ms. (21 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 632 ms. (63 steps per ms) remains 2/2 properties
[2026-05-23 14:34:06] [INFO ] Invariant cache hit.
Problem apf6 is UNSAT
Problem apf8 is UNSAT
After SMT solving in domain Real declared 122/334 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/132 constraints, PredecessorRefiner: 0/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge based reduction with 24 factoid took 1554 ms. Reduced automaton from 13 states, 36 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 489 ms :[p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND p2 p3), (NOT p1), (AND (NOT p1) p3)]
Knowledge-based reduction took 4026 ms.
Stuttering acceptance computed with spot in 470 ms :[p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND p2 p3), (NOT p1), (AND (NOT p1) p3)]
Support contains 122 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2026-05-23 14:34:09] [INFO ] Invariant cache hit.
[2026-05-23 14:34:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-23 14:34:09] [INFO ] Invariant cache hit.
[2026-05-23 14:34:09] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 230 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 14 factoid took 938 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 28987 steps (6 resets) in 41 ms. (690 steps per ms) remains 0/15 properties
Knowledge based reduction with 14 factoid took 1088 ms. Reduced automaton from 9 states, 25 edges and 4 AP (stutter sensitive) to 9 states, 25 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 467 ms :[p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND p2 p3), (NOT p1), (AND (NOT p1) p3)]
Knowledge-based reduction took 2537 ms.
Stuttering acceptance computed with spot in 444 ms :[p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND p2 p3), (NOT p1), (AND (NOT p1) p3)]
Stuttering acceptance computed with spot in 414 ms :[p2, (AND (NOT p1) p2), p2, p2, (AND (NOT p1) p3 p2), (AND p2 p3), (AND p2 p3), (NOT p1), (AND (NOT p1) p3)]
Product exploration explored 100000 steps with 510 reset in 780 ms.
Product exploration explored 100000 steps with 526 reset in 546 ms.
Spot run failed in 113 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/ltsmin8023795491149131004
[2026-05-23 14:34:14] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8023795491149131004
Running compilation step : cd /tmp/ltsmin8023795491149131004;'/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 488 ms.
Running link step : cd /tmp/ltsmin8023795491149131004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin8023795491149131004;'/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/stateBased13349512277055179260.hoa' '--buchi-type=spotba'
LTSmin run took 68 ms.
FORMULA BART-COL-060-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-060-LTLFireability-09 finished in 36036 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(p0)||(X(F(!p2))&&p1))))'
Support contains 11 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 4 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11672259692110756035.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3726042791946076716.kers'
[2026-05-23 14:34:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11672259692110756035.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3726042791946076716.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 90 cols 320 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 14:34:15] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3726042791946076716.kers
Total runtime 1 ms.
[2026-05-23 14:34:15] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 14:34:15] [INFO ] Invariant cache hit.
[2026-05-23 14:34:15] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-23 14:34:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 91 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 124/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 215 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6582 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12744ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 12744ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12925 ms. Remains : 90/132 places, 160/202 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(p0)||(X(F(p2))&&p1))))'
Stuttering acceptance computed with spot in 278 ms :[(NOT p0), (NOT p2), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : BART-COL-060-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Product exploration explored 100000 steps with 33333 reset in 215 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 16 ms. Proved property starting from automaton with 6 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA BART-COL-060-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-10 finished in 13684 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||G(p1))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 9 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4764395793535447340.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5814033733179569626.kers'
[2026-05-23 14:34:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4764395793535447340.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5814033733179569626.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 170 rows 100 cols 340 entries
Finished phase 1 with 99 SingleSign rule and 0 generalized
[2026-05-23 14:34:28] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5814033733179569626.kers
Total runtime 1 ms.
[2026-05-23 14:34:28] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 14:34:28] [INFO ] Invariant cache hit.
[2026-05-23 14:34:29] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2026-05-23 14:34:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 8005 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 7745 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 15766ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 15767ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15997 ms. Remains : 100/132 places, 170/202 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||G(p1))))'
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-060-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 4 factoid took 18 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 22 ms.
FORMULA BART-COL-060-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-060-LTLFireability-12 finished in 16582 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(X(G(!p1)))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 11 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
[2026-05-23 14:34:45] [INFO ] Invariant cache hit.
[2026-05-23 14:34:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-23 14:34:45] [INFO ] Invariant cache hit.
[2026-05-23 14:34:45] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 100/132 places, 170/202 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U X(X(G(!p1)))))'
Stuttering acceptance computed with spot in 312 ms :[p1, (AND p0 p1), p1, true, (AND p0 p1), p1, (AND p0 (NOT p1))]
Running random walk in product with property : BART-COL-060-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-COL-060-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-060-LTLFireability-13 finished in 572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!p0||X(X(X(p1))))))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 100 transition count 170
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 100 transition count 170
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 91 place count 73 transition count 143
Iterating global reduction 0 with 27 rules applied. Total rules applied 118 place count 73 transition count 143
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 122 place count 69 transition count 139
Iterating global reduction 0 with 4 rules applied. Total rules applied 126 place count 69 transition count 139
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 66 transition count 136
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 66 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 135 place count 63 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 141 place count 60 transition count 130
Iterating global reduction 0 with 3 rules applied. Total rules applied 144 place count 60 transition count 130
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 147 place count 57 transition count 127
Iterating global reduction 0 with 3 rules applied. Total rules applied 150 place count 57 transition count 127
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 153 place count 54 transition count 124
Iterating global reduction 0 with 3 rules applied. Total rules applied 156 place count 54 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 158 place count 52 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 160 place count 52 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 162 place count 50 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 164 place count 50 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 165 place count 49 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 166 place count 49 transition count 119
Applied a total of 166 rules in 12 ms. Remains 49 /132 variables (removed 83) and now considering 119/202 (removed 83) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4107883882699809446.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9034024800177842809.kers'
[2026-05-23 14:34:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4107883882699809446.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9034024800177842809.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 119 rows 49 cols 238 entries
Finished phase 1 with 48 SingleSign rule and 0 generalized
[2026-05-23 14:34:46] [INFO ] Computed 1 invariants in 0 ms
Computed 1 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-9034024800177842809.kers
Total runtime 2 ms.
[2026-05-23 14:34:46] [INFO ] Implicit Places using invariants in 41 ms returned []
[2026-05-23 14:34:46] [INFO ] Invariant cache hit.
[2026-05-23 14:34:46] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
Running 83 sub problems to find dead transitions.
[2026-05-23 14:34:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (OVERLAPS) 0/168 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Real declared 168/168 variables, and 50 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3443 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 83 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 1 (OVERLAPS) 1/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 3 (OVERLAPS) 119/168 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/168 variables, 83/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/168 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
At refinement iteration 6 (OVERLAPS) 0/168 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 83 unsolved
No progress, stopping.
After SMT solving in domain Int declared 168/168 variables, and 133 constraints, problems are : Problem set: 0 solved, 83 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 83/83 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6524ms problems are : Problem set: 0 solved, 83 unsolved
Search for dead transitions found 0 dead transitions in 6524ms
Starting structural reductions in LTL mode, iteration 1 : 49/132 places, 119/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6680 ms. Remains : 49/132 places, 119/202 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(X(p1))))))'
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : BART-COL-060-LTLFireability-14
Product exploration explored 100000 steps with 19967 reset in 236 ms.
Product exploration explored 100000 steps with 19989 reset in 249 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 70 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 1773 steps (0 resets) in 5 ms. (295 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 377 ms.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 2 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 119/119 transitions.
Applied a total of 0 rules in 0 ms. Remains 49 /49 variables (removed 0) and now considering 119/119 (removed 0) transitions.
[2026-05-23 14:34:54] [INFO ] Invariant cache hit.
[2026-05-23 14:34:54] [INFO ] Implicit Places using invariants in 33 ms returned []
[2026-05-23 14:34:54] [INFO ] Invariant cache hit.
[2026-05-23 14:34:54] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 49/49 places, 119/119 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 2627 steps (0 resets) in 8 ms. (291 steps per ms) remains 0/2 properties
Knowledge based reduction with 1 factoid took 86 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 349 ms.
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 20017 reset in 232 ms.
Product exploration explored 100000 steps with 20049 reset in 252 ms.
Spot run failed in 83 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/ltsmin13902143694209859423
[2026-05-23 14:34:55] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13902143694209859423
Running compilation step : cd /tmp/ltsmin13902143694209859423;'/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 399 ms.
Running link step : cd /tmp/ltsmin13902143694209859423;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin13902143694209859423;'/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/stateBased17777819228814853203.hoa' '--buchi-type=spotba'
LTSmin run took 51 ms.
FORMULA BART-COL-060-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-060-LTLFireability-14 finished in 9963 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(F((G(F((G(F(p0))||(X(!p1)&&F(p0)))))||(F((G(F(p0))||(X(!p1)&&F(p0))))&&X(X(p0))))))))'
Support contains 10 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 3 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6622670849419952731.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5619488061052498803.kers'
[2026-05-23 14:34:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6622670849419952731.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5619488061052498803.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 160 rows 90 cols 320 entries
Finished phase 1 with 89 SingleSign rule and 0 generalized
[2026-05-23 14:34:56] [INFO ] Computed 1 invariants in 1 ms
Computed 1 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5619488061052498803.kers
Total runtime 2 ms.
[2026-05-23 14:34:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2026-05-23 14:34:56] [INFO ] Invariant cache hit.
[2026-05-23 14:34:56] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2026-05-23 14:34:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 91 constraints, problems are : Problem set: 0 solved, 124 unsolved in 7314 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 124/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 215 constraints, problems are : Problem set: 0 solved, 124 unsolved in 6523 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13857ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 13859ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14050 ms. Remains : 90/132 places, 160/202 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(F((G(F((G(F(p0))||(X(p1)&&F(p0)))))||(F((G(F(p0))||(X(p1)&&F(p0))))&&X(X(p0))))))))'
Stuttering acceptance computed with spot in 380 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-060-LTLFireability-15
Product exploration explored 100000 steps with 21462 reset in 263 ms.
Product exploration explored 100000 steps with 19941 reset in 456 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 2 factoid took 54 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
RANDOM walk for 14049 steps (2 resets) in 6 ms. (2007 steps per ms) remains 0/4 properties
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Knowledge-based reduction took 422 ms.
Stuttering acceptance computed with spot in 267 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2026-05-23 14:35:11] [INFO ] Invariant cache hit.
[2026-05-23 14:35:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-23 14:35:12] [INFO ] Invariant cache hit.
[2026-05-23 14:35:12] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 223 ms. Remains : 90/90 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
RANDOM walk for 18571 steps (3 resets) in 8 ms. (2063 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 121 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Knowledge-based reduction took 526 ms.
Stuttering acceptance computed with spot in 376 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 374 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21710 reset in 252 ms.
Product exploration explored 100000 steps with 21416 reset in 338 ms.
Spot run failed in 83 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/ltsmin5097863638731493549
[2026-05-23 14:35:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5097863638731493549
Running compilation step : cd /tmp/ltsmin5097863638731493549;'/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 484 ms.
Running link step : cd /tmp/ltsmin5097863638731493549;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5097863638731493549;'/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/stateBased10551266154112212226.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 10 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2026-05-23 14:35:29] [INFO ] Invariant cache hit.
[2026-05-23 14:35:29] [INFO ] Implicit Places using invariants in 29 ms returned []
[2026-05-23 14:35:29] [INFO ] Invariant cache hit.
[2026-05-23 14:35:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 123 ms. Remains : 90/90 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin16586890546348240477
[2026-05-23 14:35:29] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16586890546348240477
Running compilation step : cd /tmp/ltsmin16586890546348240477;'/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 310 ms.
Running link step : cd /tmp/ltsmin16586890546348240477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin16586890546348240477;'/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/stateBased11465083776455697161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-23 14:35:44] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:35:44] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:35:44] [INFO ] Time to serialize gal into /tmp/LTL5171042523545130311.gal : 3 ms
[2026-05-23 14:35:44] [INFO ] Time to serialize properties into /tmp/LTL16471497557455574976.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5171042523545130311.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16866869740083113521.hoa' '-atoms' '/tmp/LTL16471497557455574976.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16471497557455574976.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16866869740083113521.hoa
Detected timeout of ITS tools.
[2026-05-23 14:35:59] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:35:59] [INFO ] Flatten gal took : 24 ms
[2026-05-23 14:35:59] [INFO ] Time to serialize gal into /tmp/LTL9701448658650639298.gal : 2 ms
[2026-05-23 14:35:59] [INFO ] Time to serialize properties into /tmp/LTL6694671303197789602.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9701448658650639298.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6694671303197789602.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((G(F("(TrainState_42<1)")))||((F("(TrainState_42<1)"))&&(X("(((((TrainState_87<1)&&(TrainState_178<1))&&((TrainState_177...593
Formula 0 simplified : XXG(FG!"(TrainState_42<1)" & (G(FG!"(TrainState_42<1)" & (G!"(TrainState_42<1)" | X!"(((((TrainState_87<1)&&(TrainState_178<1))&&((T...330
Detected timeout of ITS tools.
[2026-05-23 14:36:14] [INFO ] Flatten gal took : 6 ms
[2026-05-23 14:36:14] [INFO ] Applying decomposition
[2026-05-23 14:36:14] [INFO ] Flatten gal took : 6 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9751645713618433480.txt' '-o' '/tmp/graph9751645713618433480.bin' '-w' '/tmp/graph9751645713618433480.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9751645713618433480.bin' '-l' '-1' '-v' '-w' '/tmp/graph9751645713618433480.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:36:14] [INFO ] Decomposing Gal with order
[2026-05-23 14:36:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:36:14] [INFO ] Removed a total of 55 redundant transitions.
[2026-05-23 14:36:14] [INFO ] Flatten gal took : 35 ms
[2026-05-23 14:36:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 27 labels/synchronizations in 16 ms.
[2026-05-23 14:36:14] [INFO ] Time to serialize gal into /tmp/LTL1601195867484707027.gal : 12 ms
[2026-05-23 14:36:14] [INFO ] Time to serialize properties into /tmp/LTL4431265217081329039.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1601195867484707027.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4431265217081329039.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G(F((G(F("(i4.i0.u0.TrainState_42<1)")))||((F("(i4.i0.u0.TrainState_42<1)"))&&(X("(((((i2.i0.u1.TrainState_87<1)&&(i4.i1.u33...800
Formula 0 simplified : XXG(FG!"(i4.i0.u0.TrainState_42<1)" & (G(FG!"(i4.i0.u0.TrainState_42<1)" & (G!"(i4.i0.u0.TrainState_42<1)" | X!"(((((i2.i0.u1.TrainS...447
Detected timeout of ITS tools.
Treatment of property BART-COL-060-LTLFireability-15 finished in 93706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Spot run failed in 54 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
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(F((G(F((G(F(p0))||(X(!p1)&&F(p0)))))||(F((G(F(p0))||(X(!p1)&&F(p0))))&&X(X(p0))))))))'
Spot run failed in 48 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-23 14:36:29] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin9925044921613676501
[2026-05-23 14:36:29] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2026-05-23 14:36:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:36:29] [INFO ] Applying decomposition
[2026-05-23 14:36:29] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2026-05-23 14:36:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 14:36:29] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:36:29] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2026-05-23 14:36:29] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph15567346331979825275.txt' '-o' '/tmp/graph15567346331979825275.bin' '-w' '/tmp/graph15567346331979825275.weights'
[2026-05-23 14:36:29] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9925044921613676501
Running compilation step : cd /tmp/ltsmin9925044921613676501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15567346331979825275.bin' '-l' '-1' '-v' '-w' '/tmp/graph15567346331979825275.weights' '-q' '0' '-e' '0.001'
[2026-05-23 14:36:29] [INFO ] Decomposing Gal with order
[2026-05-23 14:36:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:36:29] [INFO ] Removed a total of 45 redundant transitions.
[2026-05-23 14:36:29] [INFO ] Flatten gal took : 43 ms
[2026-05-23 14:36:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 5 ms.
[2026-05-23 14:36:30] [INFO ] Time to serialize gal into /tmp/LTLFireability1264580745290754896.gal : 9 ms
[2026-05-23 14:36:30] [INFO ] Time to serialize properties into /tmp/LTLFireability9550006065843936225.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1264580745290754896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9550006065843936225.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F(("(((((((i2.i0.u10.TrainState_90>=1)||(i2.i0.u10.TrainState_88>=1))||((i6.i0.u0.TrainState_43>=1)||(i1.i0.u2.TrainState_45>=1))...4282
Formula 0 simplified : G(F!"((i6.i0.u0.TrainState_42>=1)&&((((((((i2.i0.u10.TrainState_90>=1)||(i2.i0.u10.TrainState_88>=1))||((i6.i0.u0.TrainState_43>=1)|...4275
Compilation finished in 660 ms.
Running link step : cd /tmp/ltsmin9925044921613676501;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9925044921613676501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9925044921613676501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin9925044921613676501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(<>(([](<>(([](<>((LTLAPp2==true)))||(X(!(LTLAPp3==true))&&<>((LTLAPp2==true))))))||(<>(([](<>((LTLAPp2==true)))||(X(!(LTLAPp3==true))&&<>((LTLAPp2==true)))))&&X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 14:58:33] [INFO ] Applying decomposition
[2026-05-23 14:58:33] [INFO ] Flatten gal took : 8 ms
[2026-05-23 14:58:33] [INFO ] Decomposing Gal with order
[2026-05-23 14:58:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 14:58:33] [INFO ] Removed a total of 140 redundant transitions.
[2026-05-23 14:58:33] [INFO ] Flatten gal took : 49 ms
[2026-05-23 14:58:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2026-05-23 14:58:33] [INFO ] Time to serialize gal into /tmp/LTLFireability7206675722613514786.gal : 16 ms
[2026-05-23 14:58:33] [INFO ] Time to serialize properties into /tmp/LTLFireability5064866741604657669.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7206675722613514786.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5064866741604657669.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((G(F(("(((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainState_88>=1))||((trainidspeeddistance43.TrainSt...6306
Formula 0 simplified : G(F!"((trainidspeeddistance42.TrainState_42>=1)&&((((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainStat...6299
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin9925044921613676501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(<>(([](<>(([](<>((LTLAPp2==true)))||(X(!(LTLAPp3==true))&&<>((LTLAPp2==true))))))||(<>(([](<>((LTLAPp2==true)))||(X(!(LTLAPp3==true))&&<>((LTLAPp2==true)))))&&X(X((LTLAPp2==true))))))))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin9925044921613676501;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-23 15:20:36] [INFO ] Flatten gal took : 16 ms
[2026-05-23 15:20:36] [INFO ] Input system was already deterministic with 202 transitions.
[2026-05-23 15:20:36] [INFO ] Transformed 132 places.
[2026-05-23 15:20:36] [INFO ] Transformed 202 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-23 15:20:36] [INFO ] Time to serialize gal into /tmp/LTLFireability10554388208759519191.gal : 2 ms
[2026-05-23 15:20:36] [INFO ] Time to serialize properties into /tmp/LTLFireability5790904139802494556.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10554388208759519191.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5790904139802494556.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_4...3105
Formula 0 simplified : G(F!"((TrainState_42>=1)&&((((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_4...3098
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_TIME_CONFINEMENT_REACHED

--------------------
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="BART-COL-060"
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 BART-COL-060, 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-177946788000220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-060.tgz
mv BART-COL-060 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 ;