Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730000796.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-030, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730000796
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.4K 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 8.6K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 201K 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-030-LTLFireability-00
FORMULA_NAME BART-COL-030-LTLFireability-01
FORMULA_NAME BART-COL-030-LTLFireability-02
FORMULA_NAME BART-COL-030-LTLFireability-03
FORMULA_NAME BART-COL-030-LTLFireability-04
FORMULA_NAME BART-COL-030-LTLFireability-05
FORMULA_NAME BART-COL-030-LTLFireability-06
FORMULA_NAME BART-COL-030-LTLFireability-07
FORMULA_NAME BART-COL-030-LTLFireability-08
FORMULA_NAME BART-COL-030-LTLFireability-09
FORMULA_NAME BART-COL-030-LTLFireability-10
FORMULA_NAME BART-COL-030-LTLFireability-11
FORMULA_NAME BART-COL-030-LTLFireability-12
FORMULA_NAME BART-COL-030-LTLFireability-13
FORMULA_NAME BART-COL-030-LTLFireability-14
FORMULA_NAME BART-COL-030-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748667521744

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-030
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202505121319
[2025-05-31 04:58:42] [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 04:58:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 04:58:43] [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 04:58:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-05-31 04:58:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 879 ms
[2025-05-31 04:58:44] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2025-05-31 04:58:44] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 17753 PT places and 4.221688536E10 transition bindings in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2025-05-31 04:58:44] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 5 ms.
[2025-05-31 04:58:44] [INFO ] Skeletonized 3 HLPN properties in 1 ms. Removed 13 properties that had guard overlaps.
Computed a total of 4 stabilizing places and 2 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
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 30
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2025-05-31 04:58:45] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 1120 ms.
[2025-05-31 04:58:45] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
[2025-05-31 04:58:45] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 2 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-030-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-030-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 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 04:58:45] [INFO ] Computed 1 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:58:45] [INFO ] Implicit Places using invariants in 163 ms returned []
[2025-05-31 04:58:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:58:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 04:58:45] [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 6913 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 5927 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 12888ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12902ms
Finished structural reductions in LTL mode , in 1 iterations and 13252 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2025-05-31 04:58:58] [INFO ] Flatten gal took : 37 ms
[2025-05-31 04:58:58] [INFO ] Flatten gal took : 30 ms
[2025-05-31 04:58:58] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 1027 steps (0 resets) in 13 ms. (73 steps per ms) remains 0/7 properties
FORMULA BART-COL-030-LTLFireability-06 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(F((X(p0)||(p0&&G(p1))))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 14 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 04:58:59] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:58:59] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 04:58:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:58:59] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-31 04:58: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/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 4156 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 3832 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 8002ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8003ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8119 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 315 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-030-LTLFireability-00
Product exploration explored 100000 steps with 33262 reset in 375 ms.
Product exploration explored 100000 steps with 33264 reset in 301 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) p1), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 4 factoid took 318 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
RANDOM walk for 1182 steps (0 resets) in 11 ms. (98 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 4 factoid took 463 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2025-05-31 04:59:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 04:59:09] [INFO ] [Real]Absence check using 1 positive place invariants in 22 ms returned sat
[2025-05-31 04:59:10] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2025-05-31 04:59:10] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X p0), (X (NOT p0)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 4 factoid took 502 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-030-LTLFireability-00 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-030-LTLFireability-00 finished in 11966 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 U p1))))'
Support contains 10 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 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 132 transition count 145
Reduce places removed 57 places and 0 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 75 transition count 145
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 119 place count 70 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 124 place count 70 transition count 140
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 154 place count 55 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 155 place count 55 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 157 place count 54 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 158 place count 54 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 53 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 161 place count 53 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 163 place count 52 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 52 transition count 118
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 166 place count 51 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 168 place count 51 transition count 115
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 170 place count 50 transition count 114
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 172 place count 50 transition count 112
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 174 place count 49 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 176 place count 49 transition count 109
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 178 place count 48 transition count 108
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 180 place count 48 transition count 106
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 182 place count 47 transition count 105
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 184 place count 47 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 186 place count 46 transition count 102
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 188 place count 46 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 190 place count 45 transition count 99
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 2 rules applied. Total rules applied 192 place count 45 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 194 place count 44 transition count 96
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 196 place count 44 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 198 place count 43 transition count 93
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 14 with 2 rules applied. Total rules applied 200 place count 43 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 202 place count 42 transition count 90
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 204 place count 42 transition count 88
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 16 with 2 rules applied. Total rules applied 206 place count 41 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 16 with 2 rules applied. Total rules applied 208 place count 41 transition count 85
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 210 place count 40 transition count 84
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 17 with 2 rules applied. Total rules applied 212 place count 40 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 18 with 2 rules applied. Total rules applied 214 place count 39 transition count 81
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 216 place count 39 transition count 79
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 19 with 2 rules applied. Total rules applied 218 place count 38 transition count 78
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 19 with 2 rules applied. Total rules applied 220 place count 38 transition count 76
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 20 with 2 rules applied. Total rules applied 222 place count 37 transition count 75
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 224 place count 37 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 226 place count 36 transition count 72
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 21 with 2 rules applied. Total rules applied 228 place count 36 transition count 70
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 22 with 2 rules applied. Total rules applied 230 place count 35 transition count 69
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 232 place count 35 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 23 with 2 rules applied. Total rules applied 234 place count 34 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 23 with 2 rules applied. Total rules applied 236 place count 34 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 24 with 2 rules applied. Total rules applied 238 place count 33 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 24 with 2 rules applied. Total rules applied 240 place count 33 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 25 with 2 rules applied. Total rules applied 242 place count 32 transition count 60
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 25 with 1 rules applied. Total rules applied 243 place count 32 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 26 with 2 rules applied. Total rules applied 245 place count 31 transition count 58
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 246 place count 31 transition count 57
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 248 place count 30 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 27 with 1 rules applied. Total rules applied 249 place count 30 transition count 55
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 28 with 2 rules applied. Total rules applied 251 place count 29 transition count 54
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 28 with 2 rules applied. Total rules applied 253 place count 29 transition count 52
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 29 with 2 rules applied. Total rules applied 255 place count 28 transition count 51
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 29 with 2 rules applied. Total rules applied 257 place count 28 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 30 with 2 rules applied. Total rules applied 259 place count 27 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 30 with 2 rules applied. Total rules applied 261 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 31 with 2 rules applied. Total rules applied 263 place count 26 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 31 with 2 rules applied. Total rules applied 265 place count 26 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 267 place count 25 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 32 with 1 rules applied. Total rules applied 268 place count 25 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 33 with 2 rules applied. Total rules applied 270 place count 24 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 33 with 1 rules applied. Total rules applied 271 place count 24 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 34 with 2 rules applied. Total rules applied 273 place count 23 transition count 38
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 34 with 2 rules applied. Total rules applied 275 place count 23 transition count 36
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 35 with 2 rules applied. Total rules applied 277 place count 22 transition count 35
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 35 with 2 rules applied. Total rules applied 279 place count 22 transition count 33
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 280 place count 22 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 36 with 1 rules applied. Total rules applied 281 place count 22 transition count 32
Discarding 1 places :
Symmetric choice reduction at 36 with 1 rule applications. Total rules 282 place count 21 transition count 31
Iterating global reduction 36 with 1 rules applied. Total rules applied 283 place count 21 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 36 with 1 rules applied. Total rules applied 284 place count 21 transition count 30
Applied a total of 284 rules in 69 ms. Remains 21 /132 variables (removed 111) and now considering 30/202 (removed 172) transitions.
// Phase 1: matrix 30 rows 21 cols
[2025-05-31 04:59:11] [INFO ] Computed 1 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:11] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-05-31 04:59:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:11] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 04:59:11] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2025-05-31 04:59: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/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 30/51 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 0/51 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 22 constraints, problems are : Problem set: 0 solved, 20 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 1/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 30/51 variables, 21/22 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 0/51 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 42 constraints, problems are : Problem set: 0 solved, 20 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 400ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Starting structural reductions in SI_LTL mode, iteration 1 : 21/132 places, 30/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 21/132 places, 30/202 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BART-COL-030-LTLFireability-01
Product exploration explored 100000 steps with 200 reset in 294 ms.
Stack based approach found an accepted trace after 688 steps with 26 reset with depth 495 and stack size 492 in 1 ms.
FORMULA BART-COL-030-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-030-LTLFireability-01 finished in 918 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 p1)&&(G(p1)||G(p0)||X(F((!p2&&F(p0)))))))'
Support contains 11 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 109 transition count 179
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 65 place count 90 transition count 160
Iterating global reduction 0 with 19 rules applied. Total rules applied 84 place count 90 transition count 160
Applied a total of 84 rules in 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 04:59:12] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:12] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-05-31 04:59:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:12] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 04:59:12] [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 3671 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 3283 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 6967ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6967ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7071 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 388 ms :[(NOT p1), true, (NOT p1), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), (AND (NOT p0) (NOT p1)), (OR (NOT p0) p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-030-LTLFireability-03
Entered a terminal (fully accepting) state of product in 49 steps with 0 reset in 1 ms.
FORMULA BART-COL-030-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-03 finished in 7487 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(p0)||((!p1 U (p2||G(!p1))) U ((p0&&(!p1 U (p2||G(!p1))))||G((!p1 U (p2||G(!p1)))))))))))'
Support contains 98 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.
// Phase 1: matrix 202 rows 132 cols
[2025-05-31 04:59:19] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-05-31 04:59:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:19] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 04:59: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/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 6783 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 5725 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 12526ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12527ms
Finished structural reductions in LTL mode , in 1 iterations and 12666 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 383 ms :[true, (NOT p0), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0)), (AND p1 (NOT p2))]
Running random walk in product with property : BART-COL-030-LTLFireability-05
Entered a terminal (fully accepting) state of product in 19 steps with 0 reset in 0 ms.
FORMULA BART-COL-030-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-05 finished in 13076 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)&&(p0 U (X((X(p2) U (p2&&X(p2))))||p1))))'
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 11 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 04:59:32] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:32] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-05-31 04:59:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:32] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 04:59:32] [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 3659 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 3289 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 6957ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6958ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7063 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BART-COL-030-LTLFireability-08
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 1 ms.
FORMULA BART-COL-030-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-08 finished in 7391 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((F(!p0)||X(X(X((X(p2)||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 13 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 04:59:40] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:40] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 04:59:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:40] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-31 04:59:40] [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 4224 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 3678 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 7936ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 7937ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8074 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 263 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Running random walk in product with property : BART-COL-030-LTLFireability-09
Product exploration explored 100000 steps with 16658 reset in 145 ms.
Product exploration explored 100000 steps with 16635 reset in 149 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) (NOT p2)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 321 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 965 steps (0 resets) in 6 ms. (137 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 330 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
[2025-05-31 04:59:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 04:59:50] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2025-05-31 04:59:50] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2025-05-31 04:59:50] [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 04:59:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 04:59:50] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2025-05-31 04:59:50] [INFO ] Computed and/alt/rep : 134/238/134 causal constraints (skipped 0 transitions) in 8 ms.
[2025-05-31 04:59:51] [INFO ] Added : 134 causal constraints over 27 iterations in 378 ms. Result :sat
Could not prove EG (AND p0 (NOT p1) (NOT p2))
Support contains 89 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 170/170 transitions.
Applied a total of 0 rules in 0 ms. Remains 100 /100 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2025-05-31 04:59:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-05-31 04:59:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 04:59:51] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-31 04:59: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/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 4287 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 3885 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 8183ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8185ms
Finished structural reductions in LTL mode , in 1 iterations and 8285 ms. Remains : 100/100 places, 170/170 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 (NOT p1) (NOT p2)), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 298 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 1244 steps (0 resets) in 9 ms. (124 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 322 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
[2025-05-31 05:00:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:00:01] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2025-05-31 05:00:01] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2025-05-31 05:00:01] [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:00:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2025-05-31 05:00:01] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2025-05-31 05:00:01] [INFO ] Computed and/alt/rep : 134/238/134 causal constraints (skipped 0 transitions) in 9 ms.
[2025-05-31 05:00:02] [INFO ] Added : 134 causal constraints over 27 iterations in 375 ms. Result :sat
Could not prove EG (AND p0 (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 314 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Product exploration explored 100000 steps with 16681 reset in 144 ms.
Product exploration explored 100000 steps with 16642 reset in 148 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 317 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 89 out of 100 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 170/170 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 100 transition count 170
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 100 transition count 170
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 170
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 99 transition count 169
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 99 transition count 169
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 11 place count 99 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 99 transition count 168
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 18 place count 93 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 93 transition count 162
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 24 rules in 13 ms. Remains 93 /100 variables (removed 7) and now considering 162/170 (removed 8) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:00:03] [INFO ] Redundant transitions in 4 ms returned []
Running 126 sub problems to find dead transitions.
// Phase 1: matrix 162 rows 93 cols
[2025-05-31 05:00:03] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/92 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 1 (OVERLAPS) 1/93 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 126 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
At refinement iteration 3 (OVERLAPS) 162/255 variables, 93/94 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/255 variables, 0/94 constraints. Problems are: Problem set: 2 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 94 constraints, problems are : Problem set: 2 solved, 124 unsolved in 3716 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 126/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 124 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 3/93 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/93 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 162/255 variables, 93/94 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/255 variables, 124/218 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/255 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/255 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 218 constraints, problems are : Problem set: 2 solved, 124 unsolved in 3319 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 124/126 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7044ms problems are : Problem set: 2 solved, 124 unsolved
Search for dead transitions found 2 dead transitions in 7045ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 93/100 places, 160/170 transitions.
Graph (complete) has 160 edges and 93 vertex of which 91 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 91 /93 variables (removed 2) and now considering 160/160 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 91/100 places, 160/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7076 ms. Remains : 91/100 places, 160/170 transitions.
Built C files in :
/tmp/ltsmin17751644318688622786
[2025-05-31 05:00:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17751644318688622786
Running compilation step : cd /tmp/ltsmin17751644318688622786;'/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 376 ms.
Running link step : cd /tmp/ltsmin17751644318688622786;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17751644318688622786;'/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/stateBased2756324145878625504.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 89 out of 100 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 170/170 transitions.
Applied a total of 0 rules in 9 ms. Remains 100 /100 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 100 cols
[2025-05-31 05:00:25] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:00:25] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-05-31 05:00:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:00:25] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-31 05:00:25] [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 4351 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 3831 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 8198ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8198ms
Finished structural reductions in LTL mode , in 1 iterations and 8309 ms. Remains : 100/100 places, 170/170 transitions.
Built C files in :
/tmp/ltsmin9035164421226235144
[2025-05-31 05:00:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9035164421226235144
Running compilation step : cd /tmp/ltsmin9035164421226235144;'/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 263 ms.
Running link step : cd /tmp/ltsmin9035164421226235144;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9035164421226235144;'/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/stateBased7850465521138944116.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:00:49] [INFO ] Flatten gal took : 8 ms
[2025-05-31 05:00:49] [INFO ] Flatten gal took : 6 ms
[2025-05-31 05:00:49] [INFO ] Time to serialize gal into /tmp/LTL5054940292042594908.gal : 2 ms
[2025-05-31 05:00:49] [INFO ] Time to serialize properties into /tmp/LTL12998428527386788334.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5054940292042594908.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10986527709424974253.hoa' '-atoms' '/tmp/LTL12998428527386788334.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/LTL12998428527386788334.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10986527709424974253.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:01:04] [INFO ] Flatten gal took : 7 ms
[2025-05-31 05:01:04] [INFO ] Flatten gal took : 6 ms
[2025-05-31 05:01:04] [INFO ] Time to serialize gal into /tmp/LTL14623694036081964902.gal : 2 ms
[2025-05-31 05:01:04] [INFO ] Time to serialize properties into /tmp/LTL14752377523230689949.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14623694036081964902.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14752377523230689949.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 : !((X(G((F("(TrainState_42>=1)"))||(X(X(X(("(((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))|...4045
Formula 0 simplified : XF(G!"(TrainState_42>=1)" & XXX(!"(((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))||(((Tra...4025
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:01:19] [INFO ] Flatten gal took : 7 ms
[2025-05-31 05:01:19] [INFO ] Applying decomposition
[2025-05-31 05:01:19] [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/graph13139143864927908912.txt' '-o' '/tmp/graph13139143864927908912.bin' '-w' '/tmp/graph13139143864927908912.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13139143864927908912.bin' '-l' '-1' '-v' '-w' '/tmp/graph13139143864927908912.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:01:19] [INFO ] Decomposing Gal with order
[2025-05-31 05:01:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:01:19] [INFO ] Removed a total of 74 redundant transitions.
[2025-05-31 05:01:19] [INFO ] Flatten gal took : 27 ms
[2025-05-31 05:01:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 29 labels/synchronizations in 5 ms.
[2025-05-31 05:01:19] [INFO ] Time to serialize gal into /tmp/LTL5367213716977983829.gal : 2 ms
[2025-05-31 05:01:19] [INFO ] Time to serialize properties into /tmp/LTL17911305188436312006.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/LTL5367213716977983829.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17911305188436312006.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 : !((X(G((F("(i0.u0.TrainState_42>=1)"))||(X(X(X(("(((((((i3.i0.u19.TrainState_151>=1)||(i0.u2.TrainState_94>=1))||((i5.i1.u33.TrainStat...5487
Formula 0 simplified : XF(G!"(i0.u0.TrainState_42>=1)" & XXX(!"(((((((i3.i0.u19.TrainState_151>=1)||(i0.u2.TrainState_94>=1))||((i5.i1.u33.TrainState_155>=...5467
Detected timeout of ITS tools.
Treatment of property BART-COL-030-LTLFireability-09 finished in 114294 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((F(p0)&&F(p1))))'
Support contains 97 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:01:34] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:34] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-31 05:01:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:34] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:01:34] [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 6832 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 6025 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 12868ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12868ms
Finished structural reductions in LTL mode , in 1 iterations and 12984 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-030-LTLFireability-10
Product exploration explored 100000 steps with 1947 reset in 293 ms.
Product exploration explored 100000 steps with 1961 reset in 298 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) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 461 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
RANDOM walk for 2735 steps (0 resets) in 10 ms. (248 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p0), (F p1), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 3 factoid took 612 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 7 states, 19 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
[2025-05-31 05:01:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2025-05-31 05:01:50] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2025-05-31 05:01:50] [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:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-31 05:01:50] [INFO ] [Nat]Absence check using state equation in 257 ms returned sat
[2025-05-31 05:01:50] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 11 ms.
[2025-05-31 05:01:51] [INFO ] Added : 166 causal constraints over 34 iterations in 492 ms. Result :sat
Could not prove EG (NOT p0)
[2025-05-31 05:01:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:01:51] [INFO ] [Real]Absence check using 1 positive place invariants in 36 ms returned sat
[2025-05-31 05:01:53] [INFO ] [Real]Absence check using state equation in 1504 ms returned sat
[2025-05-31 05:01:53] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0))), (F p0), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 3 factoid took 705 ms. Reduced automaton from 7 states, 19 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-030-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-030-LTLFireability-10 finished in 19499 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((p0 U !p1)))'
Support contains 2 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 128 place count 68 transition count 134
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 136 place count 64 transition count 134
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 142 place count 58 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 148 place count 58 transition count 128
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 149 place count 58 transition count 127
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 153 place count 54 transition count 123
Iterating global reduction 3 with 4 rules applied. Total rules applied 157 place count 54 transition count 123
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 160 place count 51 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 163 place count 51 transition count 120
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 166 place count 48 transition count 117
Iterating global reduction 3 with 3 rules applied. Total rules applied 169 place count 48 transition count 117
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 171 place count 46 transition count 115
Iterating global reduction 3 with 2 rules applied. Total rules applied 173 place count 46 transition count 115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 175 place count 44 transition count 113
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 44 transition count 113
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 178 place count 43 transition count 112
Iterating global reduction 3 with 1 rules applied. Total rules applied 179 place count 43 transition count 112
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 193 place count 36 transition count 105
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 36 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 201 place count 34 transition count 99
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 205 place count 34 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 32 transition count 93
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 213 place count 32 transition count 89
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 217 place count 30 transition count 87
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 221 place count 30 transition count 83
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 225 place count 28 transition count 81
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 229 place count 28 transition count 77
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 233 place count 26 transition count 75
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 237 place count 26 transition count 71
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 241 place count 24 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 245 place count 24 transition count 65
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 249 place count 22 transition count 63
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 253 place count 22 transition count 59
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 257 place count 20 transition count 57
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 261 place count 20 transition count 53
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 265 place count 18 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 269 place count 18 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 273 place count 16 transition count 45
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 277 place count 16 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 281 place count 14 transition count 39
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 285 place count 14 transition count 35
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 289 place count 12 transition count 33
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 293 place count 12 transition count 29
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 297 place count 10 transition count 27
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 301 place count 10 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 305 place count 8 transition count 21
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 309 place count 8 transition count 17
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 313 place count 6 transition count 15
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 317 place count 6 transition count 11
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 321 place count 4 transition count 9
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 326 place count 4 transition count 4
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 328 place count 3 transition count 3
Applied a total of 328 rules in 30 ms. Remains 3 /132 variables (removed 129) and now considering 3/202 (removed 199) transitions.
// Phase 1: matrix 3 rows 3 cols
[2025-05-31 05:01:54] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:54] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-05-31 05:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:54] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:01:54] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-05-31 05:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/6 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/132 places, 3/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 133 ms. Remains : 3/132 places, 3/202 transitions.
Stuttering acceptance computed with spot in 70 ms :[p1, true, p1]
Running random walk in product with property : BART-COL-030-LTLFireability-11
Product exploration explored 100000 steps with 14066 reset in 52 ms.
Product exploration explored 100000 steps with 13865 reset in 57 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 (AND p1 p0)), (X (OR (NOT p1) p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (OR (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 205 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[p1, true, p1]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 128 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p1 p0), (X (AND p1 p0)), (X (OR (NOT p1) p0)), (X p0), (X (NOT (AND p1 (NOT p0)))), (X p1), (X (X (OR (NOT p1) p0))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 (NOT p1))))
Knowledge based reduction with 9 factoid took 299 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-030-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-030-LTLFireability-11 finished in 955 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(((!p0&&(p0 U !p1)) U X(X((!p0&&G(!p2)))))))'
Support contains 98 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 2 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:01:54] [INFO ] Computed 1 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:54] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-05-31 05:01:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:01:55] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2025-05-31 05:01:55] [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 6743 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 5885 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 12638ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12639ms
Finished structural reductions in LTL mode , in 1 iterations and 12758 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR p0 p2), (OR p0 p2), (OR p0 p2), (OR p0 p2), true, p2, (OR p0 p2), (OR p2 p0), p2, p2]
Running random walk in product with property : BART-COL-030-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA BART-COL-030-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-030-LTLFireability-12 finished in 13224 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((F(p1) U X(X(!p2))))||p0)))'
Support contains 78 out of 132 places. Attempting structural reductions.
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 8 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:02:08] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:02:08] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-05-31 05:02:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:02:08] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:02:08] [INFO ] Redundant transitions in 5 ms returned []
Running 143 sub problems to find dead transitions.
[2025-05-31 05:02:08] [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 4820 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 4224 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 9051ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 9052ms
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 9179 ms. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), false]
Running random walk in product with property : BART-COL-030-LTLFireability-13
Product exploration explored 100000 steps with 3308 reset in 343 ms.
Product exploration explored 100000 steps with 3203 reset in 351 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) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 454 ms. Reduced automaton from 7 states, 15 edges and 3 AP (stutter insensitive) to 6 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), false, false]
RANDOM walk for 1071 steps (0 resets) in 8 ms. (119 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (X p2))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 p1 p2))), (F (NOT (AND (NOT p0) p2))), (F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT p2)), (F p0), (F (NOT (AND (NOT p0) (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 653 ms. Reduced automaton from 6 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 16 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), false]
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) p2), false]
[2025-05-31 05:02:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:02:20] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2025-05-31 05:02:20] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-31 05:02:20] [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:02:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2025-05-31 05:02:20] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2025-05-31 05:02:20] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 12 ms.
[2025-05-31 05:02:21] [INFO ] Added : 143 causal constraints over 29 iterations in 359 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 2 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2025-05-31 05:02:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:02:21] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-05-31 05:02:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:02:21] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:02:21] [INFO ] Redundant transitions in 5 ms returned []
Running 143 sub problems to find dead transitions.
[2025-05-31 05:02:21] [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 4728 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 4332 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 9069ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 9069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9181 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) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p2), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 5 states, 16 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2), false]
RANDOM walk for 1492 steps (0 resets) in 9 ms. (149 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p2), (X (NOT p0)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (NOT (OR p2 p0 p1))), (F (NOT p2)), (F (NOT (AND p2 (NOT p0)))), (F p0)]
Knowledge based reduction with 9 factoid took 626 ms. Reduced automaton from 5 states, 15 edges and 3 AP (stutter insensitive) to 5 states, 15 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2), false]
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2), false]
[2025-05-31 05:02:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:02:32] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-05-31 05:02:32] [INFO ] [Real]Absence check using state equation in 212 ms returned sat
[2025-05-31 05:02:32] [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:02:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2025-05-31 05:02:32] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2025-05-31 05:02:32] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 10 ms.
[2025-05-31 05:02:33] [INFO ] Added : 143 causal constraints over 29 iterations in 347 ms. Result :sat
Could not prove EG (AND (NOT p0) p2)
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2), false]
Product exploration explored 100000 steps with 4318 reset in 416 ms.
Product exploration explored 100000 steps with 4298 reset in 430 ms.
Built C files in :
/tmp/ltsmin9194137291409028085
[2025-05-31 05:02:34] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2025-05-31 05:02:34] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:02:34] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2025-05-31 05:02:34] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:02:34] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2025-05-31 05:02:34] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:02:34] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9194137291409028085
Running compilation step : cd /tmp/ltsmin9194137291409028085;'/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 314 ms.
Running link step : cd /tmp/ltsmin9194137291409028085;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin9194137291409028085;'/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/stateBased103891604428743520.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2025-05-31 05:02:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:02:49] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-05-31 05:02:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:02:49] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:02:49] [INFO ] Redundant transitions in 2 ms returned []
Running 143 sub problems to find dead transitions.
[2025-05-31 05:02:49] [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 4806 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 4369 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 9187ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 9187ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 9315 ms. Remains : 109/109 places, 179/179 transitions.
Built C files in :
/tmp/ltsmin1914548385802531387
[2025-05-31 05:02:58] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2025-05-31 05:02:58] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:02:58] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2025-05-31 05:02:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:02:58] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2025-05-31 05:02:58] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:02:58] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1914548385802531387
Running compilation step : cd /tmp/ltsmin1914548385802531387;'/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 313 ms.
Running link step : cd /tmp/ltsmin1914548385802531387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin1914548385802531387;'/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/stateBased1244854269744388227.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:03:13] [INFO ] Flatten gal took : 7 ms
[2025-05-31 05:03:13] [INFO ] Flatten gal took : 8 ms
[2025-05-31 05:03:13] [INFO ] Time to serialize gal into /tmp/LTL13875315917460965425.gal : 3 ms
[2025-05-31 05:03:13] [INFO ] Time to serialize properties into /tmp/LTL12710786832500196838.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/LTL13875315917460965425.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15712696001513311434.hoa' '-atoms' '/tmp/LTL12710786832500196838.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...320
Loading property file /tmp/LTL12710786832500196838.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15712696001513311434.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:03:28] [INFO ] Flatten gal took : 6 ms
[2025-05-31 05:03:28] [INFO ] Flatten gal took : 6 ms
[2025-05-31 05:03:28] [INFO ] Time to serialize gal into /tmp/LTL8516356938775843435.gal : 1 ms
[2025-05-31 05:03:28] [INFO ] Time to serialize properties into /tmp/LTL2793666098613479235.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/LTL8516356938775843435.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2793666098613479235.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...275
Read 1 LTL properties
Checking formula 0 : !((F(("((((TrainState_87>=1)||(TrainState_178>=1))||((TrainState_177>=1)||(TrainState_176>=1)))||(((TrainState_175>=1)||(TrainState_13...1798
Formula 0 simplified : G(!"((((TrainState_87>=1)||(TrainState_178>=1))||((TrainState_177>=1)||(TrainState_176>=1)))||(((TrainState_175>=1)||(TrainState_130...1785
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:03:43] [INFO ] Flatten gal took : 8 ms
[2025-05-31 05:03:43] [INFO ] Applying decomposition
[2025-05-31 05:03:43] [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/graph8483484701195453237.txt' '-o' '/tmp/graph8483484701195453237.bin' '-w' '/tmp/graph8483484701195453237.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8483484701195453237.bin' '-l' '-1' '-v' '-w' '/tmp/graph8483484701195453237.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:03:43] [INFO ] Decomposing Gal with order
[2025-05-31 05:03:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:03:43] [INFO ] Removed a total of 50 redundant transitions.
[2025-05-31 05:03:43] [INFO ] Flatten gal took : 13 ms
[2025-05-31 05:03:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 4 ms.
[2025-05-31 05:03:43] [INFO ] Time to serialize gal into /tmp/LTL16292543635288382471.gal : 2 ms
[2025-05-31 05:03:43] [INFO ] Time to serialize properties into /tmp/LTL11817951774559200201.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/LTL16292543635288382471.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11817951774559200201.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 : !((F(("((((i2.i0.u1.TrainState_87>=1)||(i4.i0.u32.TrainState_178>=1))||((i4.i1.u20.TrainState_177>=1)||(i3.u19.TrainState_176>=1)))||(...2484
Formula 0 simplified : G(!"((((i2.i0.u1.TrainState_87>=1)||(i4.i0.u32.TrainState_178>=1))||((i4.i1.u20.TrainState_177>=1)||(i3.u19.TrainState_176>=1)))||((...2471
Detected timeout of ITS tools.
Treatment of property BART-COL-030-LTLFireability-13 finished in 110841 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(F((p0&&X(G(p1)))))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 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:03:59] [INFO ] Computed 1 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:03:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-05-31 05:03:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:03:59] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2025-05-31 05:03: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/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 4113 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 3705 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 7839ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 7840ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7974 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-COL-030-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 354 ms.
Stack based approach found an accepted trace after 575 steps with 0 reset with depth 576 and stack size 576 in 2 ms.
FORMULA BART-COL-030-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-030-LTLFireability-14 finished in 8508 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((F(!p0)||X(X(X((X(p2)||p1))))))))'
Found a Lengthening insensitive property : BART-COL-030-LTLFireability-09
Stuttering acceptance computed with spot in 303 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_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 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 22 place count 121 transition count 187
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 30 place count 117 transition count 187
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 36 place count 111 transition count 181
Iterating global reduction 3 with 6 rules applied. Total rules applied 42 place count 111 transition count 181
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 43 place count 111 transition count 180
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 46 place count 108 transition count 177
Iterating global reduction 4 with 3 rules applied. Total rules applied 49 place count 108 transition count 177
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 52 place count 105 transition count 174
Iterating global reduction 4 with 3 rules applied. Total rules applied 55 place count 105 transition count 174
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 58 place count 102 transition count 171
Iterating global reduction 4 with 3 rules applied. Total rules applied 61 place count 102 transition count 171
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 63 place count 100 transition count 169
Iterating global reduction 4 with 2 rules applied. Total rules applied 65 place count 100 transition count 169
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 67 place count 98 transition count 167
Iterating global reduction 4 with 2 rules applied. Total rules applied 69 place count 98 transition count 167
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 70 place count 97 transition count 166
Iterating global reduction 4 with 1 rules applied. Total rules applied 71 place count 97 transition count 166
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 83 place count 91 transition count 160
Applied a total of 83 rules in 20 ms. Remains 91 /132 variables (removed 41) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 91 cols
[2025-05-31 05:04:07] [INFO ] Computed 1 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 05:04:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:08] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 05:04:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 92 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3661 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 216 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3485 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7152ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7154ms
Starting structural reductions in LI_LTL mode, iteration 1 : 91/132 places, 160/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 7272 ms. Remains : 91/132 places, 160/202 transitions.
Running random walk in product with property : BART-COL-030-LTLFireability-09
Product exploration explored 100000 steps with 16473 reset in 148 ms.
Product exploration explored 100000 steps with 15834 reset in 177 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) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 357 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 407 steps (0 resets) in 5 ms. (67 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 291 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 293 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 336 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
[2025-05-31 05:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:04:17] [INFO ] [Real]Absence check using 1 positive place invariants in 10 ms returned sat
[2025-05-31 05:04:17] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2025-05-31 05:04:17] [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:04:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 05:04:17] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2025-05-31 05:04:17] [INFO ] Computed and/alt/rep : 123/190/123 causal constraints (skipped 1 transitions) in 14 ms.
[2025-05-31 05:04:17] [INFO ] Added : 19 causal constraints over 7 iterations in 70 ms. Result :sat
Could not prove EG (AND p0 (NOT p1) (NOT p2))
Support contains 89 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 160/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-05-31 05:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:17] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-05-31 05:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:17] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 05:04:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 92 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 216 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3263 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6842ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6843ms
Finished structural reductions in LTL mode , in 1 iterations and 6940 ms. Remains : 91/91 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 p0 (NOT p1) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 302 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 531 steps (0 resets) in 6 ms. (75 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F p2), (F (NOT (AND (NOT p1) p0))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 2 factoid took 315 ms. Reduced automaton from 7 states, 8 edges and 3 AP (stutter sensitive) to 7 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 337 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Stuttering acceptance computed with spot in 347 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
[2025-05-31 05:04:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 05:04:26] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2025-05-31 05:04:26] [INFO ] [Real]Absence check using state equation in 318 ms returned sat
[2025-05-31 05:04:26] [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:04:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-05-31 05:04:27] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2025-05-31 05:04:27] [INFO ] Computed and/alt/rep : 123/190/123 causal constraints (skipped 1 transitions) in 7 ms.
[2025-05-31 05:04:27] [INFO ] Added : 19 causal constraints over 7 iterations in 59 ms. Result :sat
Could not prove EG (AND p0 (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 313 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Product exploration explored 100000 steps with 16420 reset in 144 ms.
Product exploration explored 100000 steps with 15921 reset in 151 ms.
Applying partial POR strategy [false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 304 ms :[(AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), p0]
Support contains 89 out of 91 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 91/91 places, 160/160 transitions.
Applied a total of 0 rules in 7 ms. Remains 91 /91 variables (removed 0) and now considering 160/160 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 05:04:28] [INFO ] Redundant transitions in 3 ms returned []
Running 124 sub problems to find dead transitions.
[2025-05-31 05:04:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 92 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3705 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 216 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3370 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7085ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 7085ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7102 ms. Remains : 91/91 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin3102427523603401725
[2025-05-31 05:04:35] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3102427523603401725
Running compilation step : cd /tmp/ltsmin3102427523603401725;'/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 252 ms.
Running link step : cd /tmp/ltsmin3102427523603401725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3102427523603401725;'/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/stateBased11157164119177930490.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 89 out of 91 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 91/91 places, 160/160 transitions.
Applied a total of 0 rules in 1 ms. Remains 91 /91 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2025-05-31 05:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:50] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-05-31 05:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 05:04:50] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2025-05-31 05:04:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/251 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 251/251 variables, and 92 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3631 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 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/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/251 variables, 91/92 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 124/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/251 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 251/251 variables, and 216 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3300 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 91/91 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6938ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6938ms
Finished structural reductions in LTL mode , in 1 iterations and 7042 ms. Remains : 91/91 places, 160/160 transitions.
Built C files in :
/tmp/ltsmin14194703643724619004
[2025-05-31 05:04:57] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14194703643724619004
Running compilation step : cd /tmp/ltsmin14194703643724619004;'/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 246 ms.
Running link step : cd /tmp/ltsmin14194703643724619004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14194703643724619004;'/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/stateBased512399469489375783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-31 05:05:12] [INFO ] Flatten gal took : 4 ms
[2025-05-31 05:05:12] [INFO ] Flatten gal took : 4 ms
[2025-05-31 05:05:12] [INFO ] Time to serialize gal into /tmp/LTL11144857940413174857.gal : 1 ms
[2025-05-31 05:05:12] [INFO ] Time to serialize properties into /tmp/LTL13780091240992475301.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/LTL11144857940413174857.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5581909378665805030.hoa' '-atoms' '/tmp/LTL13780091240992475301.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/LTL13780091240992475301.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5581909378665805030.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:05:27] [INFO ] Flatten gal took : 5 ms
[2025-05-31 05:05:27] [INFO ] Flatten gal took : 3 ms
[2025-05-31 05:05:27] [INFO ] Time to serialize gal into /tmp/LTL17799581619764483977.gal : 1 ms
[2025-05-31 05:05:27] [INFO ] Time to serialize properties into /tmp/LTL17571068676914071014.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/LTL17799581619764483977.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17571068676914071014.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 : !((X(G((F("(TrainState_42>=1)"))||(X(X(X(("(((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))|...4045
Formula 0 simplified : XF(G!"(TrainState_42>=1)" & XXX(!"(((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))||(((Tra...4025
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:05:42] [INFO ] Flatten gal took : 4 ms
[2025-05-31 05:05:42] [INFO ] Applying decomposition
[2025-05-31 05:05:42] [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/graph9403348241825184057.txt' '-o' '/tmp/graph9403348241825184057.bin' '-w' '/tmp/graph9403348241825184057.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9403348241825184057.bin' '-l' '-1' '-v' '-w' '/tmp/graph9403348241825184057.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:05:42] [INFO ] Decomposing Gal with order
[2025-05-31 05:05:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:05:42] [INFO ] Removed a total of 70 redundant transitions.
[2025-05-31 05:05:42] [INFO ] Flatten gal took : 9 ms
[2025-05-31 05:05:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 49 labels/synchronizations in 2 ms.
[2025-05-31 05:05:42] [INFO ] Time to serialize gal into /tmp/LTL11910276367781190462.gal : 2 ms
[2025-05-31 05:05:42] [INFO ] Time to serialize properties into /tmp/LTL10954643195745465183.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/LTL11910276367781190462.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10954643195745465183.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 : !((X(G((F("(i0.u0.TrainState_42>=1)"))||(X(X(X(("(((((((i3.u19.TrainState_151>=1)||(i1.i0.u2.TrainState_94>=1))||((i4.i1.u21.TrainStat...5225
Formula 0 simplified : XF(G!"(i0.u0.TrainState_42>=1)" & XXX(!"(((((((i3.u19.TrainState_151>=1)||(i1.i0.u2.TrainState_94>=1))||((i4.i1.u21.TrainState_155>=...5205
Detected timeout of ITS tools.
Treatment of property BART-COL-030-LTLFireability-09 finished in 110247 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((F(p1) U X(X(!p2))))||p0)))'
[2025-05-31 05:05:57] [INFO ] Flatten gal took : 9 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin17004549169287041968
[2025-05-31 05:05:57] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2025-05-31 05:05:57] [INFO ] Applying decomposition
[2025-05-31 05:05:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:05:57] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2025-05-31 05:05:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:05:57] [INFO ] Flatten gal took : 11 ms
[2025-05-31 05:05:57] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2025-05-31 05:05:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-31 05:05:57] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17004549169287041968
Running compilation step : cd /tmp/ltsmin17004549169287041968;'/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'
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/graph6954362177314918040.txt' '-o' '/tmp/graph6954362177314918040.bin' '-w' '/tmp/graph6954362177314918040.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6954362177314918040.bin' '-l' '-1' '-v' '-w' '/tmp/graph6954362177314918040.weights' '-q' '0' '-e' '0.001'
[2025-05-31 05:05:57] [INFO ] Decomposing Gal with order
[2025-05-31 05:05:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:05:57] [INFO ] Removed a total of 51 redundant transitions.
[2025-05-31 05:05:57] [INFO ] Flatten gal took : 11 ms
[2025-05-31 05:05:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 21 labels/synchronizations in 2 ms.
[2025-05-31 05:05:57] [INFO ] Time to serialize gal into /tmp/LTLFireability16851067014434650210.gal : 2 ms
[2025-05-31 05:05:57] [INFO ] Time to serialize properties into /tmp/LTLFireability13077700441771088841.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/LTLFireability16851067014434650210.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13077700441771088841.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...278
Read 2 LTL properties
Checking formula 0 : !((X(G((F("(i2.i0.u0.TrainState_42>=1)"))||(X(X(X(("(((((((i4.i1.u24.TrainState_151>=1)||(i2.i1.u12.TrainState_94>=1))||((i4.i1.u27.Tr...5518
Formula 0 simplified : XF(G!"(i2.i0.u0.TrainState_42>=1)" & XXX(!"(((((((i4.i1.u24.TrainState_151>=1)||(i2.i1.u12.TrainState_94>=1))||((i4.i1.u27.TrainStat...5498
Compilation finished in 389 ms.
Running link step : cd /tmp/ltsmin17004549169287041968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17004549169287041968;'/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' 'X([]((<>(!(LTLAPp0==true))||X(X(X((X((LTLAPp2==true))||(LTLAPp1==true))))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: LTL layer: formula: X([]((<>(!(LTLAPp0==true))||X(X(X((X((LTLAPp2==true))||(LTLAPp1==true))))))))
pins2lts-mc-linux64( 2/ 8), 0.004: "X([]((<>(!(LTLAPp0==true))||X(X(X((X((LTLAPp2==true))||(LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.009: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.008: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.023: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.084: DFS-FIFO for weak LTL, using special progress label 208
pins2lts-mc-linux64( 0/ 8), 0.084: There are 209 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.084: State length is 133, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.084: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.084: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.084: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.084: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.367: ~1 levels ~960 states ~57608 transitions
pins2lts-mc-linux64( 2/ 8), 0.503: ~1 levels ~1920 states ~115216 transitions
pins2lts-mc-linux64( 7/ 8), 0.740: ~1 levels ~3840 states ~227968 transitions
pins2lts-mc-linux64( 4/ 8), 0.977: ~1 levels ~7680 states ~237688 transitions
pins2lts-mc-linux64( 4/ 8), 1.002: ~1 levels ~15360 states ~237984 transitions
pins2lts-mc-linux64( 4/ 8), 1.817: ~1 levels ~30720 states ~655632 transitions
pins2lts-mc-linux64( 4/ 8), 2.743: ~1 levels ~61440 states ~1415752 transitions
pins2lts-mc-linux64( 4/ 8), 4.752: ~1 levels ~122880 states ~4106064 transitions
pins2lts-mc-linux64( 4/ 8), 8.778: ~1 levels ~245760 states ~9844216 transitions
pins2lts-mc-linux64( 6/ 8), 15.832: ~1 levels ~491520 states ~20779488 transitions
pins2lts-mc-linux64( 1/ 8), 23.461: ~280 levels ~983040 states ~31917064 transitions
pins2lts-mc-linux64( 1/ 8), 27.316: ~280 levels ~1966080 states ~35270280 transitions
pins2lts-mc-linux64( 1/ 8), 35.441: ~280 levels ~3932160 states ~42463144 transitions
pins2lts-mc-linux64( 1/ 8), 52.655: ~280 levels ~7864320 states ~57594496 transitions
pins2lts-mc-linux64( 1/ 8), 89.027: ~280 levels ~15728640 states ~89654800 transitions
pins2lts-mc-linux64( 1/ 8), 159.365: ~280 levels ~31457280 states ~154318056 transitions
pins2lts-mc-linux64( 2/ 8), 298.942: ~277 levels ~62914560 states ~280926600 transitions
pins2lts-mc-linux64( 0/ 8), 355.657: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 355.830:
pins2lts-mc-linux64( 0/ 8), 355.830: mean standard work distribution: 47.3% (states) 15.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 355.830:
pins2lts-mc-linux64( 0/ 8), 355.830: Explored 57223235 states 373254316 transitions, fanout: 6.523
pins2lts-mc-linux64( 0/ 8), 355.830: Total exploration time 355.740 sec (355.570 sec minimum, 355.594 sec on average)
pins2lts-mc-linux64( 0/ 8), 355.830: States per second: 160857, Transitions per second: 1049234
pins2lts-mc-linux64( 0/ 8), 355.830:
pins2lts-mc-linux64( 0/ 8), 355.830: Progress states detected: 40693905
pins2lts-mc-linux64( 0/ 8), 355.830: Redundant explorations: -39.5327
pins2lts-mc-linux64( 0/ 8), 355.830:
pins2lts-mc-linux64( 0/ 8), 355.830: Queue width: 8B, total height: 44216346, memory: 337.34MB
pins2lts-mc-linux64( 0/ 8), 355.830: Tree memory: 978.0MB, 10.8 B/state, compr.: 2.0%
pins2lts-mc-linux64( 0/ 8), 355.830: Tree fill ratio (roots/leafs): 70.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 355.830: Stored 203 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 355.830: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 355.830: Est. total memory use: 1315.4MB (~1361.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17004549169287041968;'/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' 'X([]((<>(!(LTLAPp0==true))||X(X(X((X((LTLAPp2==true))||(LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin17004549169287041968;'/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' 'X([]((<>(!(LTLAPp0==true))||X(X(X((X((LTLAPp2==true))||(LTLAPp1==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)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:28:22] [INFO ] Applying decomposition
[2025-05-31 05:28:22] [INFO ] Flatten gal took : 5 ms
[2025-05-31 05:28:22] [INFO ] Decomposing Gal with order
[2025-05-31 05:28:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 05:28:22] [INFO ] Removed a total of 140 redundant transitions.
[2025-05-31 05:28:22] [INFO ] Flatten gal took : 13 ms
[2025-05-31 05:28:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-05-31 05:28:22] [INFO ] Time to serialize gal into /tmp/LTLFireability13300477870751563432.gal : 2 ms
[2025-05-31 05:28:22] [INFO ] Time to serialize properties into /tmp/LTLFireability9752265240516152818.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/LTLFireability13300477870751563432.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9752265240516152818.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...277
Read 2 LTL properties
Checking formula 0 : !((X(G((F("(trainidspeeddistance42.TrainState_42>=1)"))||(X(X(X(("(((((((trainidspeeddistance151.TrainState_151>=1)||(trainidspeeddist...8206
Formula 0 simplified : XF(G!"(trainidspeeddistance42.TrainState_42>=1)" & XXX(!"(((((((trainidspeeddistance151.TrainState_151>=1)||(trainidspeeddistance94....8186
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-05-31 05:50:46] [INFO ] Flatten gal took : 9 ms
[2025-05-31 05:50:46] [INFO ] Input system was already deterministic with 202 transitions.
[2025-05-31 05:50:46] [INFO ] Transformed 132 places.
[2025-05-31 05:50:46] [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 05:50:46] [INFO ] Time to serialize gal into /tmp/LTLFireability1718975233359596279.gal : 1 ms
[2025-05-31 05:50:46] [INFO ] Time to serialize properties into /tmp/LTLFireability4742763856992487116.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/LTLFireability1718975233359596279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4742763856992487116.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...342
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G((F("(TrainState_42>=1)"))||(X(X(X(("(((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))|...4045
Formula 0 simplified : XF(G!"(TrainState_42>=1)" & XXX(!"(((((((TrainState_151>=1)||(TrainState_94>=1))||((TrainState_155>=1)||(TrainState_98>=1)))||(((Tra...4025
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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-030"
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-030, 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-174853730000796"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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