Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730000804.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BART-COL-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730000804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 207K May 29 14:32 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-040-LTLFireability-00
FORMULA_NAME BART-COL-040-LTLFireability-01
FORMULA_NAME BART-COL-040-LTLFireability-02
FORMULA_NAME BART-COL-040-LTLFireability-03
FORMULA_NAME BART-COL-040-LTLFireability-04
FORMULA_NAME BART-COL-040-LTLFireability-05
FORMULA_NAME BART-COL-040-LTLFireability-06
FORMULA_NAME BART-COL-040-LTLFireability-07
FORMULA_NAME BART-COL-040-LTLFireability-08
FORMULA_NAME BART-COL-040-LTLFireability-09
FORMULA_NAME BART-COL-040-LTLFireability-10
FORMULA_NAME BART-COL-040-LTLFireability-11
FORMULA_NAME BART-COL-040-LTLFireability-12
FORMULA_NAME BART-COL-040-LTLFireability-13
FORMULA_NAME BART-COL-040-LTLFireability-14
FORMULA_NAME BART-COL-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748670355006

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-040
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-05-31 05:45:56] [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]
[2025-05-31 05:45:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 05:45:56] [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.
[2025-05-31 05:45:56] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-31 05:45:56] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2025-05-31 05:45:56] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2025-05-31 05:45:56] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 20213 PT places and 5.628918048E10 transition bindings in 64 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 05:45:57] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 6 ms.
[2025-05-31 05:45:57] [INFO ] Skeletonized 0 HLPN properties in 0 ms. Removed 16 properties that had guard overlaps.
Domain [distance(41), speed(6), distance(41)] of place NewDistTable breaks symmetries in sort distance
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 40
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2025-05-31 05:45:57] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 234 ms.
[2025-05-31 05:45:57] [INFO ] Unfolded 16 HLPN properties in 3 ms.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 05:45:57] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
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 5 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2025-05-31 05:45:57] [INFO ] Computed 1 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:45:57] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-05-31 05:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:45:57] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:45:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6943 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5735 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 12717ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12731ms
Finished structural reductions in LTL mode , in 1 iterations and 13032 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2025-05-31 05:46:10] [INFO ] Flatten gal took : 34 ms
[2025-05-31 05:46:10] [INFO ] Flatten gal took : 27 ms
[2025-05-31 05:46:10] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 12 to 9
RANDOM walk for 27519 steps (5 resets) in 57 ms. (474 steps per ms) remains 0/9 properties
FORMULA BART-COL-040-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-COL-040-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA BART-COL-040-LTLFireability-00 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.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(!p0)||X(!p1))) U (!p1&&X((G(!p0)||X(!p1)))))))'
Support contains 77 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 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2025-05-31 05:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:11] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 05:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:11] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:46:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6404 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5693 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 12110ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12111ms
Finished structural reductions in LTL mode , in 1 iterations and 12220 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 397 ms :[p1, p1, (AND p1 p0), p1, (AND p0 p1), true, p0]
Running random walk in product with property : BART-COL-040-LTLFireability-01
Entered a terminal (fully accepting) state of product in 400 steps with 99 reset in 7 ms.
FORMULA BART-COL-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-01 finished in 12683 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p1)&&p0)))))'
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.
[2025-05-31 05:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:23] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 05:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:23] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:46:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6401 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5672 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 12084ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12085ms
Finished structural reductions in LTL mode , in 1 iterations and 12177 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : BART-COL-040-LTLFireability-02
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA BART-COL-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-02 finished in 12395 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 68 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 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
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 70 place count 97 transition count 167
Applied a total of 70 rules in 36 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2025-05-31 05:46:36] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:36] [INFO ] Implicit Places using invariants in 24 ms returned []
[2025-05-31 05:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:36] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:46:36] [INFO ] Redundant transitions in 4 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 05:46:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3849 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3453 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 7317ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 7322ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7451 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 293 ms.
Stack based approach found an accepted trace after 1559 steps with 0 reset with depth 1560 and stack size 1560 in 4 ms.
FORMULA BART-COL-040-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-03 finished in 7838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X((!p1 U X(p1)))||p0)) U (p2&&G((X((!p1 U X(p1)))||p3))))))'
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 15 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2025-05-31 05:46:44] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:44] [INFO ] Implicit Places using invariants in 22 ms returned []
[2025-05-31 05:46:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:44] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 05:46:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3442 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3147 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 6596ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6597ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6690 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 911 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3))]
Running random walk in product with property : BART-COL-040-LTLFireability-04
Product exploration explored 100000 steps with 1715 reset in 380 ms.
Product exploration explored 100000 steps with 1744 reset in 355 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p2)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p3 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND p0 (NOT p1)))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p1)) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p3) p0))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 17 factoid took 727 ms. Reduced automaton from 19 states, 57 edges and 4 AP (stutter sensitive) to 19 states, 57 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 780 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p0 (NOT p3)), (AND (NOT p1) p0 (NOT p3))]
Reduction of identical properties reduced properties to check from 29 to 13
RANDOM walk for 40075 steps (8 resets) in 110 ms. (361 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
[2025-05-31 05:46:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf3 is UNSAT
Problem apf5 is UNSAT
Problem apf6 is UNSAT
Problem apf9 is UNSAT
Problem apf10 is UNSAT
Problem apf20 is UNSAT
After SMT solving in domain Real declared 10/250 variables, and 0 constraints, problems are : Problem set: 6 solved, 0 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/90 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 35ms problems are : Problem set: 6 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 15 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p3) (NOT p1)), (X (NOT p3)), (X (NOT (AND p2 (NOT p3) p0))), (X (NOT p2)), (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))), (X (NOT (AND p2 p3 (NOT p0)))), (X (NOT p0)), (X (X (NOT p2))), (X (X (NOT (AND p2 p3 p0 (NOT p1))))), (X (X (NOT (AND p2 p3 (NOT p0))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (AND p3 (NOT p1))))), (X (X (NOT (AND p2 (NOT p3) p0)))), (X (X (NOT (OR (AND p2 (NOT p3) p0) (AND p0 (NOT p1)))))), (X (X (NOT (AND p3 (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p1)) (AND p2 (NOT p3) p0))))), (X (X (NOT (AND (NOT p3) p0)))), (G (OR p0 (NOT p2) (NOT p3) p1)), (G (OR (NOT p0) (NOT p2) p3)), (G (AND (OR (NOT p0) p2 p1) (OR (NOT p0) p3 p1))), (G (OR (NOT p3) p1)), (G (OR (NOT p0) p1)), (G (AND (OR (NOT p0) (NOT p2) p3) (OR (NOT p0) p1))), (G (OR (NOT p0) (NOT p2) p3 p1)), (G (OR (NOT p0) p3)), (G (OR p0 (NOT p2) (NOT p3))), (G (OR p0 (NOT p3))), (G (OR p0 (NOT p3) p1)), (G (OR (NOT p0) (NOT p3) p1)), (G (OR (NOT p0) (NOT p2) (NOT p3) p1)), (G (OR (NOT p0) p3 p1)), (G (AND (OR (NOT p0) p2 p1) (OR (NOT p0) (NOT p2) p3)))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))))), (F (NOT (AND (NOT p0) (NOT p3)))), (F p3), (F (NOT (OR (NOT p2) p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p3) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p1)))))]
Knowledge based reduction with 32 factoid took 1124 ms. Reduced automaton from 19 states, 57 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true]
[2025-05-31 05:46:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:46:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 05:46:56] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 05:46:56] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 05:46:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:46:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 05:46:56] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-31 05:46:56] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:46:56] [INFO ] Added : 90 causal constraints over 18 iterations in 197 ms. Result :sat
Could not prove EG (NOT p2)
[2025-05-31 05:46:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:46:56] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 05:46:56] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2025-05-31 05:46:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:46:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 05:46:56] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2025-05-31 05:46:56] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 05:46:57] [INFO ] Added : 124 causal constraints over 25 iterations in 271 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
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 4 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-05-31 05:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:57] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 05:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:46:57] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 05:46:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3411 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3166 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 6585ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6585ms
Finished structural reductions in LTL mode , in 1 iterations and 6667 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 obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 190 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true]
Reduction of identical properties reduced properties to check from 3 to 2
RANDOM walk for 1398 steps (0 resets) in 10 ms. (127 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1)), (X (NOT p2)), (X (NOT p3)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X p1)), (X (X (NOT p1))), (F p2), (F p1), (F p3)]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true]
[2025-05-31 05:47:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:47:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 05:47:05] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 05:47:05] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 6 ms.
[2025-05-31 05:47:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:47:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 05:47:05] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-05-31 05:47:05] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 7 ms.
[2025-05-31 05:47:05] [INFO ] Added : 90 causal constraints over 18 iterations in 183 ms. Result :sat
Could not prove EG (NOT p2)
[2025-05-31 05:47:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:47:05] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 05:47:05] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-31 05:47:05] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:47:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2025-05-31 05:47:05] [INFO ] [Nat]Absence check using state equation in 75 ms returned sat
[2025-05-31 05:47:05] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 05:47:05] [INFO ] Added : 124 causal constraints over 25 iterations in 261 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p2) (AND (NOT p1) (NOT p3))), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p1), (NOT p1), true]
Entered a terminal (fully accepting) state of product in 30328 steps with 479 reset in 88 ms.
FORMULA BART-COL-040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-04 finished in 22244 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 68 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 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 15 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2025-05-31 05:47:06] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:06] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-31 05:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:06] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:47:06] [INFO ] Redundant transitions in 5 ms returned []
Running 131 sub problems to find dead transitions.
[2025-05-31 05:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3907 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3481 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 7396ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 7397ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7504 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 35 ms :[p0]
Running random walk in product with property : BART-COL-040-LTLFireability-05
Product exploration explored 100000 steps with 50000 reset in 239 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-040-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-040-LTLFireability-05 finished in 8112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 9 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 178 edges and 132 vertex of which 41 / 132 are part of one of the 1 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 92 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 36 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 32 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 157 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 162 place count 19 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 19 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 19 transition count 28
Applied a total of 173 rules in 15 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2025-05-31 05:47:14] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:14] [INFO ] Implicit Places using invariants in 14 ms returned []
[2025-05-31 05:47:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:14] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:47:14] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2025-05-31 05:47:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 20 constraints, problems are : Problem set: 0 solved, 18 unsolved in 159 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 38 constraints, problems are : Problem set: 0 solved, 18 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/132 places, 28/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : BART-COL-040-LTLFireability-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-06 finished in 409 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p0 U X(p1))&&(F(!p2) U !p3))))'
Support contains 131 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.
// Phase 1: matrix 202 rows 132 cols
[2025-05-31 05:47:14] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:14] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 05:47:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:14] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:47:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6406 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5632 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 12048ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12048ms
Finished structural reductions in LTL mode , in 1 iterations and 12146 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1) p3), (OR (NOT p0) (NOT p1) p3), true, p2, p3, (NOT p1), (NOT p1)]
Running random walk in product with property : BART-COL-040-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1841 steps with 33 reset in 13 ms.
FORMULA BART-COL-040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-07 finished in 12425 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X((!p0&&X(F((p1&&F(!p1))))))))'
Support contains 121 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.
[2025-05-31 05:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:27] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 05:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:27] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:47:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6478 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5724 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 12212ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12213ms
Finished structural reductions in LTL mode , in 1 iterations and 12311 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, true, true, true, true, p1]
Running random walk in product with property : BART-COL-040-LTLFireability-09
Product exploration explored 100000 steps with 242 reset in 327 ms.
Product exploration explored 100000 steps with 249 reset in 310 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p1, true, true, true]
RANDOM walk for 4 steps (0 resets) in 10 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 2 factoid took 196 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p1, true, true, true]
Stuttering acceptance computed with spot in 171 ms :[p1, true, true, true]
[2025-05-31 05:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG true
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1), true]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[p1, true, true, true]
Support contains 88 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
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.
[2025-05-31 05:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-31 05:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:47:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:47:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6426 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5716 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 12150ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12151ms
Finished structural reductions in LTL mode , in 1 iterations and 12254 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 obtained : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[p1, true, true, true]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1)]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[p1, true, true, true]
Stuttering acceptance computed with spot in 161 ms :[p1, true, true, true]
[2025-05-31 05:47:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG true
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), true]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p1, true, true, true]
Stuttering acceptance computed with spot in 137 ms :[p1, true, true, true]
Product exploration explored 100000 steps with 251 reset in 289 ms.
Product exploration explored 100000 steps with 258 reset in 313 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 153 ms :[p1, true, true, true]
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 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 127 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 11 place count 127 transition count 197
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 127 transition count 197
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 20 place count 120 transition count 190
Deduced a syphon composed of 10 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 27 place count 120 transition count 190
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 116 transition count 186
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 116 transition count 186
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 39 place count 112 transition count 182
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 43 place count 112 transition count 182
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 109 transition count 179
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 109 transition count 179
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 107 transition count 177
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 107 transition count 177
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 105 transition count 175
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 105 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 104 transition count 174
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 104 transition count 174
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 103 transition count 173
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 103 transition count 173
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 103 transition count 173
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 69 place count 103 transition count 172
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 82 place count 90 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 2 with 13 rules applied. Total rules applied 95 place count 90 transition count 159
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 95 rules in 27 ms. Remains 90 /132 variables (removed 42) and now considering 159/202 (removed 43) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:47:56] [INFO ] Redundant transitions in 4 ms returned []
Running 123 sub problems to find dead transitions.
// Phase 1: matrix 159 rows 90 cols
[2025-05-31 05:47:56] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
Problem TDEAD34 is UNSAT
At refinement iteration 3 (OVERLAPS) 158/248 variables, 90/91 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/248 variables, 0/91 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 248/249 variables, and 91 constraints, problems are : Problem set: 1 solved, 122 unsolved in 3366 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 122 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 2/90 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 158/248 variables, 90/91 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/248 variables, 122/213 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/248 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/248 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 248/249 variables, and 213 constraints, problems are : Problem set: 1 solved, 122 unsolved in 3074 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 122/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6448ms problems are : Problem set: 1 solved, 122 unsolved
Search for dead transitions found 1 dead transitions in 6448ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 90/132 places, 158/202 transitions.
Graph (complete) has 158 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 89 /90 variables (removed 1) and now considering 158/158 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6492 ms. Remains : 89/132 places, 158/202 transitions.
Built C files in :
/tmp/ltsmin11157188743085562915
[2025-05-31 05:48:02] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11157188743085562915
Running compilation step : cd /tmp/ltsmin11157188743085562915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 357 ms.
Running link step : cd /tmp/ltsmin11157188743085562915;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin11157188743085562915;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2468419707425009203.hoa' '--buchi-type=spotba'
LTSmin run took 1145 ms.
FORMULA BART-COL-040-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-09 finished in 37056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p0||X(X(p1))))||(G(!p2) U p1)))))'
Support contains 10 out of 132 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 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 9 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2025-05-31 05:48:04] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 05:48:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:04] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:48:04] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2025-05-31 05:48:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4578 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4234 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8825ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 8825ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8934 ms. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-040-LTLFireability-10
Product exploration explored 100000 steps with 1984 reset in 308 ms.
Product exploration explored 100000 steps with 1995 reset in 321 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1521 steps (0 resets) in 5 ms. (253 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 2 factoid took 228 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 05:48:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:48:14] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-31 05:48:15] [INFO ] [Real]Absence check using state equation in 208 ms returned sat
[2025-05-31 05:48:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:48:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-31 05:48:15] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-05-31 05:48:15] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:48:15] [INFO ] Added : 122 causal constraints over 25 iterations in 267 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 10 out of 109 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 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2025-05-31 05:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:15] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-05-31 05:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:15] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:48:15] [INFO ] Redundant transitions in 1 ms returned []
Running 143 sub problems to find dead transitions.
[2025-05-31 05:48:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4684 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 4215 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8906ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 8907ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8998 ms. Remains : 109/109 places, 179/179 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 7 factoid took 217 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1357 steps (0 resets) in 5 ms. (226 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p1), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0)]
Knowledge based reduction with 7 factoid took 312 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 05:48:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:48:25] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-31 05:48:25] [INFO ] [Real]Absence check using state equation in 207 ms returned sat
[2025-05-31 05:48:25] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:48:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-05-31 05:48:25] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-31 05:48:25] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:48:26] [INFO ] Added : 122 causal constraints over 25 iterations in 267 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1943 reset in 297 ms.
Product exploration explored 100000 steps with 1991 reset in 306 ms.
Built C files in :
/tmp/ltsmin8926794846779451666
[2025-05-31 05:48:26] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2025-05-31 05:48:26] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:48:26] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2025-05-31 05:48:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:48:26] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2025-05-31 05:48:26] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:48:26] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8926794846779451666
Running compilation step : cd /tmp/ltsmin8926794846779451666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 291 ms.
Running link step : cd /tmp/ltsmin8926794846779451666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8926794846779451666;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5824255764513779343.hoa' '--buchi-type=spotba'
LTSmin run took 331 ms.
FORMULA BART-COL-040-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-10 finished in 23174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(p0)) U p0))||(F(!p1) U X(X(!p0)))))'
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 8 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2025-05-31 05:48:27] [INFO ] Computed 1 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-31 05:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:27] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-05-31 05:48:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6188 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5265 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 11461ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11461ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11571 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 272 ms :[false, false, false, false, false, false, (AND p1 (NOT p0))]
Running random walk in product with property : BART-COL-040-LTLFireability-11
Product exploration explored 100000 steps with 2759 reset in 319 ms.
Product exploration explored 100000 steps with 2795 reset in 328 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 187 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
RANDOM walk for 656 steps (0 resets) in 6 ms. (93 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 262 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 212 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 5 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2025-05-31 05:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:41] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-31 05:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:48:41] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-05-31 05:48:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6172 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5288 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 11470ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11470ms
Finished structural reductions in LTL mode , in 1 iterations and 11572 ms. Remains : 129/129 places, 199/199 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
RANDOM walk for 574 steps (0 resets) in 6 ms. (82 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 281 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 236 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 237 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 1442 reset in 316 ms.
Product exploration explored 100000 steps with 1450 reset in 329 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 233 ms :[false, false, false, false, false, (AND (NOT p0) p1)]
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 129 transition count 199
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 129 transition count 199
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 38 place count 122 transition count 192
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 45 place count 122 transition count 192
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 45 rules in 16 ms. Remains 122 /129 variables (removed 7) and now considering 192/199 (removed 7) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:48:55] [INFO ] Redundant transitions in 1 ms returned []
Running 156 sub problems to find dead transitions.
// Phase 1: matrix 192 rows 122 cols
[2025-05-31 05:48:55] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 1 (OVERLAPS) 1/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 156 unsolved
Problem TDEAD65 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD190 is UNSAT
At refinement iteration 3 (OVERLAPS) 192/314 variables, 122/123 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 0/314 variables, 0/123 constraints. Problems are: Problem set: 24 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 123 constraints, problems are : Problem set: 24 solved, 132 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 156/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 24 solved, 132 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 25/122 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 192/314 variables, 122/123 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/314 variables, 132/255 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/314 variables, 0/255 constraints. Problems are: Problem set: 24 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/314 variables, 0/255 constraints. Problems are: Problem set: 24 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 314/314 variables, and 255 constraints, problems are : Problem set: 24 solved, 132 unsolved in 3893 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 122/122 constraints, PredecessorRefiner: 132/156 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8926ms problems are : Problem set: 24 solved, 132 unsolved
Search for dead transitions found 24 dead transitions in 8926ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 122/129 places, 168/199 transitions.
Graph (complete) has 168 edges and 122 vertex of which 98 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 98 /122 variables (removed 24) and now considering 168/168 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/129 places, 168/199 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8956 ms. Remains : 98/129 places, 168/199 transitions.
Built C files in :
/tmp/ltsmin9963522773177767427
[2025-05-31 05:49:04] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9963522773177767427
Running compilation step : cd /tmp/ltsmin9963522773177767427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 267 ms.
Running link step : cd /tmp/ltsmin9963522773177767427;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin9963522773177767427;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased526643668199743033.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 69 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 199/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 129 /129 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 129 cols
[2025-05-31 05:49:19] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:49:19] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-31 05:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:49:19] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-05-31 05:49:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6235 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5268 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 11512ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11512ms
Finished structural reductions in LTL mode , in 1 iterations and 11619 ms. Remains : 129/129 places, 199/199 transitions.
Built C files in :
/tmp/ltsmin8814482104057662792
[2025-05-31 05:49:30] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8814482104057662792
Running compilation step : cd /tmp/ltsmin8814482104057662792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 251 ms.
Running link step : cd /tmp/ltsmin8814482104057662792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin8814482104057662792;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12554147667688534886.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:49:46] [INFO ] Flatten gal took : 9 ms
[2025-05-31 05:49:46] [INFO ] Flatten gal took : 7 ms
[2025-05-31 05:49:46] [INFO ] Time to serialize gal into /tmp/LTL13025304828076636874.gal : 2 ms
[2025-05-31 05:49:46] [INFO ] Time to serialize properties into /tmp/LTL16827244672758228671.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13025304828076636874.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1801949797063991442.hoa' '-atoms' '/tmp/LTL16827244672758228671.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16827244672758228671.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1801949797063991442.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:50:01] [INFO ] Flatten gal took : 7 ms
[2025-05-31 05:50:01] [INFO ] Flatten gal took : 7 ms
[2025-05-31 05:50:01] [INFO ] Time to serialize gal into /tmp/LTL564155741146215273.gal : 3 ms
[2025-05-31 05:50:01] [INFO ] Time to serialize properties into /tmp/LTL2982447814430738497.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL564155741146215273.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2982447814430738497.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((G((F(G("(TrainState_0>=1)")))U("(TrainState_0>=1)")))||((F(!("((((((((TrainState_90<1)&&(TrainState_88<1))&&((TrainState_43<1)&&(T...1570
Formula 0 simplified : F(GF!"(TrainState_0>=1)" R !"(TrainState_0>=1)") & (G"((((((((TrainState_90<1)&&(TrainState_88<1))&&((TrainState_43<1)&&(TrainState_...1552
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:50:16] [INFO ] Flatten gal took : 11 ms
[2025-05-31 05:50:16] [INFO ] Applying decomposition
[2025-05-31 05:50:16] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2479058098669461374.txt' '-o' '/tmp/graph2479058098669461374.bin' '-w' '/tmp/graph2479058098669461374.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2479058098669461374.bin' '-l' '-1' '-v' '-w' '/tmp/graph2479058098669461374.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:50:16] [INFO ] Decomposing Gal with order
[2025-05-31 05:50:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:50:16] [INFO ] Removed a total of 54 redundant transitions.
[2025-05-31 05:50:16] [INFO ] Flatten gal took : 29 ms
[2025-05-31 05:50:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 6 ms.
[2025-05-31 05:50:16] [INFO ] Time to serialize gal into /tmp/LTL15913739484385258514.gal : 3 ms
[2025-05-31 05:50:16] [INFO ] Time to serialize properties into /tmp/LTL15170589443081920788.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15913739484385258514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15170589443081920788.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G((F(G("(i1.u1.TrainState_0>=1)")))U("(i1.u1.TrainState_0>=1)")))||((F(!("((((((((i5.u2.TrainState_90<1)&&(i5.u2.TrainState_88<1))...2101
Formula 0 simplified : F(GF!"(i1.u1.TrainState_0>=1)" R !"(i1.u1.TrainState_0>=1)") & (G"((((((((i5.u2.TrainState_90<1)&&(i5.u2.TrainState_88<1))&&((i1.u0....2083
Detected timeout of ITS tools.
Treatment of property BART-COL-040-LTLFireability-11 finished in 124000 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(G(p0)))) U 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 7 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2025-05-31 05:50:31] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:31] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-31 05:50:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:31] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-31 05:50:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 4000 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 3684 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 7691ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 7691ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7794 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-COL-040-LTLFireability-12
Entered a terminal (fully accepting) state of product in 274 steps with 0 reset in 3 ms.
FORMULA BART-COL-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-12 finished in 8095 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)&&X(G(!p2))))'
Support contains 70 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 2 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2025-05-31 05:50:39] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:39] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 05:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:39] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-05-31 05:50:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 6252 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
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
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 5286 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 11545ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11546ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11642 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (NOT p1) p2), (NOT p0), (NOT p1), p2, true]
Running random walk in product with property : BART-COL-040-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2860 steps with 1 reset in 11 ms.
FORMULA BART-COL-040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-14 finished in 11864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
Support contains 89 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 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 11 rules applied. Total rules applied 13 place count 130 transition count 191
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 22 place count 121 transition count 191
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 121 transition count 186
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 116 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 38 place count 110 transition count 180
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 110 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 110 transition count 179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 48 place count 107 transition count 176
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 107 transition count 176
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 104 transition count 173
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 104 transition count 173
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 101 transition count 170
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 101 transition count 170
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 99 transition count 168
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 99 transition count 168
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 97 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 97 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 96 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 96 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 85 place count 90 transition count 159
Applied a total of 85 rules in 15 ms. Remains 90 /132 variables (removed 42) and now considering 159/202 (removed 43) transitions.
// Phase 1: matrix 159 rows 90 cols
[2025-05-31 05:50:51] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:51] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 05:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:51] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:50:51] [INFO ] Redundant transitions in 0 ms returned []
Running 123 sub problems to find dead transitions.
[2025-05-31 05:50:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3469 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6681ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6681ms
Starting structural reductions in SI_LTL mode, iteration 1 : 90/132 places, 159/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6785 ms. Remains : 90/132 places, 159/202 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : BART-COL-040-LTLFireability-15
Product exploration explored 100000 steps with 961 reset in 316 ms.
Product exploration explored 100000 steps with 961 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 208 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 574 steps (0 resets) in 4 ms. (114 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 88 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 89 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 159/159 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2025-05-31 05:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:59] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 05:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:50:59] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:50:59] [INFO ] Redundant transitions in 0 ms returned []
Running 123 sub problems to find dead transitions.
[2025-05-31 05:50:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3460 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6601ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6602ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6702 ms. Remains : 90/90 places, 159/159 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 204 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
RANDOM walk for 656 steps (0 resets) in 4 ms. (131 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR (NOT p1) p0))), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 86 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 92 ms :[(AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 967 reset in 312 ms.
Product exploration explored 100000 steps with 947 reset in 323 ms.
Built C files in :
/tmp/ltsmin5960211214046498692
[2025-05-31 05:51:08] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2025-05-31 05:51:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:08] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2025-05-31 05:51:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:08] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2025-05-31 05:51:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:08] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5960211214046498692
Running compilation step : cd /tmp/ltsmin5960211214046498692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 271 ms.
Running link step : cd /tmp/ltsmin5960211214046498692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5960211214046498692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12607817265216358719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 89 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 159/159 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2025-05-31 05:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:51:23] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-05-31 05:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:51:23] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:51:23] [INFO ] Redundant transitions in 0 ms returned []
Running 123 sub problems to find dead transitions.
[2025-05-31 05:51:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3433 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6597ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 6597ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6704 ms. Remains : 90/90 places, 159/159 transitions.
Built C files in :
/tmp/ltsmin13003559841865031239
[2025-05-31 05:51:29] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2025-05-31 05:51:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:29] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2025-05-31 05:51:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:29] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2025-05-31 05:51:29] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:51:29] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13003559841865031239
Running compilation step : cd /tmp/ltsmin13003559841865031239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 265 ms.
Running link step : cd /tmp/ltsmin13003559841865031239;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13003559841865031239;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased658373501344013775.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:51:45] [INFO ] Flatten gal took : 5 ms
[2025-05-31 05:51:45] [INFO ] Flatten gal took : 4 ms
[2025-05-31 05:51:45] [INFO ] Time to serialize gal into /tmp/LTL5201632911590443232.gal : 1 ms
[2025-05-31 05:51:45] [INFO ] Time to serialize properties into /tmp/LTL10442086001307731179.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5201632911590443232.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15275127489025084884.hoa' '-atoms' '/tmp/LTL10442086001307731179.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10442086001307731179.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15275127489025084884.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:52:00] [INFO ] Flatten gal took : 4 ms
[2025-05-31 05:52:00] [INFO ] Flatten gal took : 5 ms
[2025-05-31 05:52:00] [INFO ] Time to serialize gal into /tmp/LTL16599383187480831450.gal : 1 ms
[2025-05-31 05:52:00] [INFO ] Time to serialize properties into /tmp/LTL11938664054949648303.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16599383187480831450.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11938664054949648303.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(TrainState_0>=1)")||(G("((((((((TrainState_151<1)&&(TrainState_94<1))&&((TrainState_155<1)&&(TrainState_98<1)))&&(((TrainSta...1951
Formula 0 simplified : G(F!"((((((((TrainState_151<1)&&(TrainState_94<1))&&((TrainState_155<1)&&(TrainState_98<1)))&&(((TrainState_159<1)&&(TrainState_102<...1944
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:52:15] [INFO ] Flatten gal took : 4 ms
[2025-05-31 05:52:15] [INFO ] Applying decomposition
[2025-05-31 05:52:15] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10295597924775732847.txt' '-o' '/tmp/graph10295597924775732847.bin' '-w' '/tmp/graph10295597924775732847.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10295597924775732847.bin' '-l' '-1' '-v' '-w' '/tmp/graph10295597924775732847.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:52:15] [INFO ] Decomposing Gal with order
[2025-05-31 05:52:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:52:15] [INFO ] Removed a total of 95 redundant transitions.
[2025-05-31 05:52:15] [INFO ] Flatten gal took : 11 ms
[2025-05-31 05:52:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 3 ms.
[2025-05-31 05:52:15] [INFO ] Time to serialize gal into /tmp/LTL18389720641876296710.gal : 1 ms
[2025-05-31 05:52:15] [INFO ] Time to serialize properties into /tmp/LTL3684583416979825156.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18389720641876296710.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3684583416979825156.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(i0.i0.u0.TrainState_0>=1)")||(G("((((((((i4.u35.TrainState_151<1)&&(i0.i0.u11.TrainState_94<1))&&((i2.u36.TrainState_155<1)&...2678
Formula 0 simplified : G(F!"((((((((i4.u35.TrainState_151<1)&&(i0.i0.u11.TrainState_94<1))&&((i2.u36.TrainState_155<1)&&(i0.i1.u4.TrainState_98<1)))&&(((i6...2671
Detected timeout of ITS tools.
Treatment of property BART-COL-040-LTLFireability-15 finished in 98776 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(G(p0)) U p0))||(F(!p1) U X(X(!p0)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(!p1)))))'
[2025-05-31 05:52:30] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16421160958488673019
[2025-05-31 05:52:30] [INFO ] Applying decomposition
[2025-05-31 05:52:30] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2025-05-31 05:52:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:52:30] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2025-05-31 05:52:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:52:30] [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.202505121319/bin/convert-linux64' '-i' '/tmp/graph13937588346006309537.txt' '-o' '/tmp/graph13937588346006309537.bin' '-w' '/tmp/graph13937588346006309537.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13937588346006309537.bin' '-l' '-1' '-v' '-w' '/tmp/graph13937588346006309537.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:52:30] [INFO ] Decomposing Gal with order
[2025-05-31 05:52:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:52:30] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2025-05-31 05:52:30] [INFO ] Removed a total of 51 redundant transitions.
[2025-05-31 05:52:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:52:30] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16421160958488673019
Running compilation step : cd /tmp/ltsmin16421160958488673019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-05-31 05:52:30] [INFO ] Flatten gal took : 12 ms
[2025-05-31 05:52:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 3 ms.
[2025-05-31 05:52:30] [INFO ] Time to serialize gal into /tmp/LTLFireability8740117747388441385.gal : 2 ms
[2025-05-31 05:52:30] [INFO ] Time to serialize properties into /tmp/LTLFireability8414112768365444565.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8740117747388441385.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8414112768365444565.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G((F(G("(i3.u2.TrainState_0>=1)")))U("(i3.u2.TrainState_0>=1)")))||((F(!("((((((((i5.u9.TrainState_90<1)&&(i5.u9.TrainState_88<1))...2088
Formula 0 simplified : F(GF!"(i3.u2.TrainState_0>=1)" R !"(i3.u2.TrainState_0>=1)") & (G"((((((((i5.u9.TrainState_90<1)&&(i5.u9.TrainState_88<1))&&((i5.u0....2070
Compilation finished in 343 ms.
Running link step : cd /tmp/ltsmin16421160958488673019;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16421160958488673019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>([]((LTLAPp0==true))) U (LTLAPp0==true)))||(<>(!(LTLAPp1==true)) U X(X(!(LTLAPp0==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: LTL layer: formula: ([]((<>([]((LTLAPp0==true))) U (LTLAPp0==true)))||(<>(!(LTLAPp1==true)) U X(X(!(LTLAPp0==true)))))
pins2lts-mc-linux64( 6/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: "([]((<>([]((LTLAPp0==true))) U (LTLAPp0==true)))||(<>(!(LTLAPp1==true)) U X(X(!(LTLAPp0==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.006: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.049: There are 206 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.049: State length is 133, there are 215 groups
pins2lts-mc-linux64( 0/ 8), 0.049: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.049: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.049: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.049: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.195: [Blue] ~88 levels ~960 states ~28816 transitions
pins2lts-mc-linux64( 0/ 8), 0.204: [Blue] ~98 levels ~1920 states ~32512 transitions
pins2lts-mc-linux64( 0/ 8), 0.216: [Blue] ~112 levels ~3840 states ~36896 transitions
pins2lts-mc-linux64( 0/ 8), 0.263: [Blue] ~156 levels ~7680 states ~51912 transitions
pins2lts-mc-linux64( 0/ 8), 0.361: [Blue] ~217 levels ~15360 states ~72336 transitions
pins2lts-mc-linux64( 0/ 8), 0.584: [Blue] ~362 levels ~30720 states ~120688 transitions
pins2lts-mc-linux64( 0/ 8), 0.979: [Blue] ~699 levels ~61440 states ~230320 transitions
pins2lts-mc-linux64( 0/ 8), 1.543: [Blue] ~1410 levels ~122880 states ~461856 transitions
pins2lts-mc-linux64( 1/ 8), 2.342: [Blue] ~3191 levels ~245760 states ~1035176 transitions
pins2lts-mc-linux64( 5/ 8), 3.455: [Blue] ~3514 levels ~491520 states ~1473168 transitions
pins2lts-mc-linux64( 0/ 8), 5.550: [Blue] ~11701 levels ~983040 states ~3886096 transitions
pins2lts-mc-linux64( 2/ 8), 10.082: [Blue] ~20761 levels ~1966080 states ~7874984 transitions
pins2lts-mc-linux64( 2/ 8), 19.184: [Blue] ~38717 levels ~3932160 states ~14962752 transitions
pins2lts-mc-linux64( 2/ 8), 36.541: [Blue] ~78258 levels ~7864320 states ~30270824 transitions
pins2lts-mc-linux64( 0/ 8), 58.113: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 58.917:
pins2lts-mc-linux64( 0/ 8), 58.917: Explored 10716637 states 62942668 transitions, fanout: 5.873
pins2lts-mc-linux64( 0/ 8), 58.917: Total exploration time 58.870 sec (58.280 sec minimum, 58.611 sec on average)
pins2lts-mc-linux64( 0/ 8), 58.917: States per second: 182039, Transitions per second: 1069181
pins2lts-mc-linux64( 0/ 8), 58.917:
pins2lts-mc-linux64( 0/ 8), 58.917: State space has 47430587 states, 29747 are accepting
pins2lts-mc-linux64( 0/ 8), 58.917: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 58.917: blue states: 10716637 (22.59%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 58.917: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 58.917: all-red states: 9273082 (19.55%), bogus 4 (0.00%)
pins2lts-mc-linux64( 0/ 8), 58.917:
pins2lts-mc-linux64( 0/ 8), 58.917: Total memory used for local state coloring: 22.0MB
pins2lts-mc-linux64( 0/ 8), 58.917:
pins2lts-mc-linux64( 0/ 8), 58.917: Queue width: 8B, total height: 1439863, memory: 10.99MB
pins2lts-mc-linux64( 0/ 8), 58.917: Tree memory: 617.9MB, 13.7 B/state, compr.: 2.6%
pins2lts-mc-linux64( 0/ 8), 58.917: Tree fill ratio (roots/leafs): 35.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 58.917: Stored 202 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 58.917: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 58.917: Est. total memory use: 628.9MB (~1035.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16421160958488673019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>([]((LTLAPp0==true))) U (LTLAPp0==true)))||(<>(!(LTLAPp1==true)) U X(X(!(LTLAPp0==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16421160958488673019;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((<>([]((LTLAPp0==true))) U (LTLAPp0==true)))||(<>(!(LTLAPp1==true)) U X(X(!(LTLAPp0==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-05-31 06:14:41] [INFO ] Applying decomposition
[2025-05-31 06:14:41] [INFO ] Flatten gal took : 5 ms
[2025-05-31 06:14:41] [INFO ] Decomposing Gal with order
[2025-05-31 06:14:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 06:14:41] [INFO ] Removed a total of 140 redundant transitions.
[2025-05-31 06:14:41] [INFO ] Flatten gal took : 12 ms
[2025-05-31 06:14:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-31 06:14:41] [INFO ] Time to serialize gal into /tmp/LTLFireability3787419680183324183.gal : 2 ms
[2025-05-31 06:14:41] [INFO ] Time to serialize properties into /tmp/LTLFireability9140316177472904718.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability3787419680183324183.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9140316177472904718.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !(((G((F(G("(trainidspeeddistance0.TrainState_0>=1)")))U("(trainidspeeddistance0.TrainState_0>=1)")))||((F(!("((((((((trainidspeeddist...3225
Formula 0 simplified : F(GF!"(trainidspeeddistance0.TrainState_0>=1)" R !"(trainidspeeddistance0.TrainState_0>=1)") & (G"((((((((trainidspeeddistance90.Tra...3207
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
0 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
61449 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,614.521,4026148,1,0,6.52503e+06,47137,1577,1.32255e+06,56,106898,13416552
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-040-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(F(("(trainidspeeddistance0.TrainState_0>=1)")||(G(!("((((((((trainidspeeddistance151.TrainState_151>=1)||(trainidspeeddistance94....4133
Formula 1 simplified : G(F"((((((((trainidspeeddistance151.TrainState_151>=1)||(trainidspeeddistance94.TrainState_94>=1))||((trainidspeeddistance155.TrainS...4122
Detected timeout of ITS tools.
[2025-05-31 06:36:53] [INFO ] Flatten gal took : 5 ms
[2025-05-31 06:36:53] [INFO ] Input system was already deterministic with 202 transitions.
[2025-05-31 06:36:53] [INFO ] Transformed 132 places.
[2025-05-31 06:36:53] [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
[2025-05-31 06:36:53] [INFO ] Time to serialize gal into /tmp/LTLFireability13036779599328378860.gal : 1 ms
[2025-05-31 06:36:53] [INFO ] Time to serialize properties into /tmp/LTLFireability14945142680309191978.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.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13036779599328378860.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14945142680309191978.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.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(TrainState_0>=1)")||(G(!("((((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))||(((Tr...2042
Formula 0 simplified : G(F"((((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))||(((TrainState_159>=1)||(TrainState_...2031
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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-040"
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-5832"
echo " Executing tool itstools"
echo " Input is BART-COL-040, 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 r002-tall-174853730000804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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