Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r025-smll-171620166500388.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is BART-COL-005, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166500388
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.3K Apr 12 21:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 12 21:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 12 21:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 12 21:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 22:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Apr 12 22:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 21:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 12 21:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 186K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BART-COL-005-LTLFireability-00
FORMULA_NAME BART-COL-005-LTLFireability-01
FORMULA_NAME BART-COL-005-LTLFireability-02
FORMULA_NAME BART-COL-005-LTLFireability-03
FORMULA_NAME BART-COL-005-LTLFireability-04
FORMULA_NAME BART-COL-005-LTLFireability-05
FORMULA_NAME BART-COL-005-LTLFireability-06
FORMULA_NAME BART-COL-005-LTLFireability-07
FORMULA_NAME BART-COL-005-LTLFireability-08
FORMULA_NAME BART-COL-005-LTLFireability-09
FORMULA_NAME BART-COL-005-LTLFireability-10
FORMULA_NAME BART-COL-005-LTLFireability-11
FORMULA_NAME BART-COL-005-LTLFireability-12
FORMULA_NAME BART-COL-005-LTLFireability-13
FORMULA_NAME BART-COL-005-LTLFireability-14
FORMULA_NAME BART-COL-005-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716367126248

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-005
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 08:38:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 08:38:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 08:38:48] [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.
[2024-05-22 08:38:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 08:38:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1417 ms
[2024-05-22 08:38:50] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-05-22 08:38:50] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 11603 PT places and 7.03614756E9 transition bindings in 80 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 08:38:50] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 7 ms.
[2024-05-22 08:38:50] [INFO ] Skeletonized 2 HLPN properties in 1 ms. Removed 14 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
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
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 5
[2024-05-22 08:38:51] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 505 ms.
[2024-05-22 08:38:51] [INFO ] Unfolded 16 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
[2024-05-22 08:38:51] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:38:51] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:38:51] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:38:51] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:38:51] [INFO ] Reduced 35 identical enabling conditions.
[2024-05-22 08:38:51] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 4 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-005-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-005-LTLFireability-07 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 14 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:38:51] [INFO ] Computed 1 invariants in 26 ms
[2024-05-22 08:38:51] [INFO ] Implicit Places using invariants in 311 ms returned []
[2024-05-22 08:38:51] [INFO ] Invariant cache hit.
[2024-05-22 08:38:51] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:38:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7543 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4771 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12438ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12493ms
Finished structural reductions in LTL mode , in 1 iterations and 13148 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2024-05-22 08:39:04] [INFO ] Flatten gal took : 85 ms
[2024-05-22 08:39:04] [INFO ] Flatten gal took : 51 ms
[2024-05-22 08:39:05] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 11510 steps (2 resets) in 195 ms. (58 steps per ms) remains 0/7 properties
FORMULA BART-COL-005-LTLFireability-13 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U (p1&&F(p2)))))'
Support contains 130 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.
[2024-05-22 08:39:05] [INFO ] Invariant cache hit.
[2024-05-22 08:39:05] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 08:39:05] [INFO ] Invariant cache hit.
[2024-05-22 08:39:05] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:39:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6925 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4919 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 11904ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 11913ms
Finished structural reductions in LTL mode , in 1 iterations and 12158 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 557 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : BART-COL-005-LTLFireability-01
Product exploration explored 100000 steps with 49252 reset in 923 ms.
Product exploration explored 100000 steps with 49284 reset in 446 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) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 629 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p2), (NOT p2)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p2)]
Knowledge based reduction with 5 factoid took 836 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p2), (NOT p2)]
[2024-05-22 08:39:21] [INFO ] Invariant cache hit.
[2024-05-22 08:39:22] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-22 08:39:22] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-22 08:39:22] [INFO ] Solution in real domain found non-integer solution.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p2), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 5 factoid took 900 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-005-LTLFireability-01 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-01 finished in 17773 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Support contains 89 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 123 transition count 193
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 123 transition count 193
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 117 transition count 187
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 117 transition count 187
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 114 transition count 184
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 114 transition count 184
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 111 transition count 181
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 111 transition count 181
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 108 transition count 178
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 108 transition count 178
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 105 transition count 175
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 105 transition count 175
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 103 transition count 173
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 101 transition count 171
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 101 transition count 171
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 100 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 100 transition count 170
Applied a total of 64 rules in 35 ms. Remains 100 /132 variables (removed 32) and now considering 170/202 (removed 32) transitions.
// Phase 1: matrix 170 rows 100 cols
[2024-05-22 08:39:23] [INFO ] Computed 1 invariants in 4 ms
[2024-05-22 08:39:23] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 08:39:23] [INFO ] Invariant cache hit.
[2024-05-22 08:39:23] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 08:39:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3473 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 7858ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 7863ms
Starting structural reductions in LTL mode, iteration 1 : 100/132 places, 170/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8095 ms. Remains : 100/132 places, 170/202 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-005-LTLFireability-02
Product exploration explored 100000 steps with 49285 reset in 517 ms.
Product exploration explored 100000 steps with 49268 reset in 345 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 (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 219 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 96 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 514 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 179 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 2 ms. Remains 100 /100 variables (removed 0) and now considering 170/170 (removed 0) transitions.
[2024-05-22 08:39:33] [INFO ] Invariant cache hit.
[2024-05-22 08:39:33] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 08:39:33] [INFO ] Invariant cache hit.
[2024-05-22 08:39:34] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 08:39:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4621 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3400 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 8051ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8058ms
Finished structural reductions in LTL mode , in 1 iterations and 8227 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 (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 311 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 127 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 442 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49279 reset in 301 ms.
Product exploration explored 100000 steps with 49234 reset in 312 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 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 2 place count 100 transition count 170
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 100 transition count 170
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 98 transition count 168
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 98 transition count 168
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 14 place count 98 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 98 transition count 167
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 21 place count 92 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 27 place count 92 transition count 161
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 27 rules in 41 ms. Remains 92 /100 variables (removed 8) and now considering 161/170 (removed 9) transitions.
[2024-05-22 08:39:45] [INFO ] Redundant transitions in 9 ms returned []
Running 125 sub problems to find dead transitions.
// Phase 1: matrix 161 rows 92 cols
[2024-05-22 08:39:45] [INFO ] Computed 1 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 1 (OVERLAPS) 1/92 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 125 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 3 (OVERLAPS) 161/253 variables, 92/93 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/253 variables, 0/93 constraints. Problems are: Problem set: 2 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 253/253 variables, and 93 constraints, problems are : Problem set: 2 solved, 123 unsolved in 3733 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 125/125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 3/92 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 161/253 variables, 92/93 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/253 variables, 123/216 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/253 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/253 variables, 0/216 constraints. Problems are: Problem set: 2 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 253/253 variables, and 216 constraints, problems are : Problem set: 2 solved, 123 unsolved in 3131 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 92/92 constraints, PredecessorRefiner: 123/125 constraints, Known Traps: 0/0 constraints]
After SMT, in 6897ms problems are : Problem set: 2 solved, 123 unsolved
Search for dead transitions found 2 dead transitions in 6902ms
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 : 92/100 places, 159/170 transitions.
Graph (complete) has 159 edges and 92 vertex of which 90 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 90 /92 variables (removed 2) and now considering 159/159 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/100 places, 159/170 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6982 ms. Remains : 90/100 places, 159/170 transitions.
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 2 ms. Remains 100 /100 variables (removed 0) and now considering 170/170 (removed 0) transitions.
// Phase 1: matrix 170 rows 100 cols
[2024-05-22 08:39:52] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:39:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 08:39:52] [INFO ] Invariant cache hit.
[2024-05-22 08:39:52] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 211 ms to find 0 implicit places.
Running 134 sub problems to find dead transitions.
[2024-05-22 08:39:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (OVERLAPS) 0/270 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Real declared 270/270 variables, and 101 constraints, problems are : Problem set: 0 solved, 134 unsolved in 4791 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 134 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 1 (OVERLAPS) 1/100 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 3 (OVERLAPS) 170/270 variables, 100/101 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 134/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
At refinement iteration 6 (OVERLAPS) 0/270 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 134 unsolved
No progress, stopping.
After SMT solving in domain Int declared 270/270 variables, and 235 constraints, problems are : Problem set: 0 solved, 134 unsolved in 3639 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 134/134 constraints, Known Traps: 0/0 constraints]
After SMT, in 8457ms problems are : Problem set: 0 solved, 134 unsolved
Search for dead transitions found 0 dead transitions in 8460ms
Finished structural reductions in LTL mode , in 1 iterations and 8674 ms. Remains : 100/100 places, 170/170 transitions.
Treatment of property BART-COL-005-LTLFireability-02 finished in 37406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 10 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2024-05-22 08:40:00] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:40:00] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 08:40:00] [INFO ] Invariant cache hit.
[2024-05-22 08:40:01] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 230 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 08:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6121 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5099 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 11250ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11254ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11496 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Product exploration explored 100000 steps with 50000 reset in 294 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-005-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-03 finished in 12226 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 69 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 1 with 29 rules applied. Total rules applied 32 place count 129 transition count 173
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 58 place count 103 transition count 173
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 59 place count 102 transition count 172
Iterating global reduction 3 with 1 rules applied. Total rules applied 60 place count 102 transition count 172
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 68 place count 98 transition count 168
Applied a total of 68 rules in 29 ms. Remains 98 /132 variables (removed 34) and now considering 168/202 (removed 34) transitions.
// Phase 1: matrix 168 rows 98 cols
[2024-05-22 08:40:13] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:40:13] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 08:40:13] [INFO ] Invariant cache hit.
[2024-05-22 08:40:13] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-22 08:40:13] [INFO ] Redundant transitions in 10 ms returned []
Running 132 sub problems to find dead transitions.
[2024-05-22 08:40:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 168/266 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (OVERLAPS) 0/266 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 266/266 variables, and 99 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4548 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (OVERLAPS) 168/266 variables, 98/99 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 132/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/266 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/266 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 266/266 variables, and 231 constraints, problems are : Problem set: 0 solved, 132 unsolved in 3528 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 8099ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 8103ms
Starting structural reductions in SI_LTL mode, iteration 1 : 98/132 places, 168/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8340 ms. Remains : 98/132 places, 168/202 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 748 ms.
Stack based approach found an accepted trace after 452 steps with 0 reset with depth 453 and stack size 453 in 10 ms.
FORMULA BART-COL-005-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-04 finished in 9175 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X(X(!p1))||p0)))))'
Support contains 79 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:40:22] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:40:22] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 08:40:22] [INFO ] Invariant cache hit.
[2024-05-22 08:40:22] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:40:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5371 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12428ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12431ms
Finished structural reductions in LTL mode , in 1 iterations and 12660 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-05
Product exploration explored 100000 steps with 33333 reset in 326 ms.
Product exploration explored 100000 steps with 33333 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-005-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-05 finished in 13653 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G((p0 U p1))) U (G(p2)||F(G(p0)))))'
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 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-22 08:40:35] [INFO ] Invariant cache hit.
[2024-05-22 08:40:35] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-22 08:40:35] [INFO ] Invariant cache hit.
[2024-05-22 08:40:36] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:40:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 7067 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4785 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 11871ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 11873ms
Finished structural reductions in LTL mode , in 1 iterations and 12016 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-06
Product exploration explored 100000 steps with 1 reset in 215 ms.
Stack based approach found an accepted trace after 770 steps with 4 reset with depth 749 and stack size 749 in 4 ms.
FORMULA BART-COL-005-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-06 finished in 12507 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 42 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-05-22 08:40:48] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:40:48] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-22 08:40:48] [INFO ] Invariant cache hit.
[2024-05-22 08:40:48] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2024-05-22 08:40:48] [INFO ] Redundant transitions in 7 ms returned []
Running 122 sub problems to find dead transitions.
[2024-05-22 08:40:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 90 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2452 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 122/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 1884 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 4366ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 4368ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4583 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 33 ms :[p0]
Running random walk in product with property : BART-COL-005-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-08 finished in 4632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||X((G(p1) U (!p2&&G(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 13 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-05-22 08:40:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:40:53] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 08:40:53] [INFO ] Invariant cache hit.
[2024-05-22 08:40:53] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 113 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-05-22 08:40:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 91 constraints, problems are : Problem set: 0 solved, 124 unsolved in 3336 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 124 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 124/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 6 (OVERLAPS) 0/250 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 215 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2960 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 124/124 constraints, Known Traps: 0/0 constraints]
After SMT, in 6316ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6318ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6445 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 206 ms :[(NOT p1), (OR (AND p0 (NOT p1)) (AND p0 p2)), true, (OR (AND p0 (NOT p1)) (AND p0 p2)), (OR (NOT p1) p2)]
Running random walk in product with property : BART-COL-005-LTLFireability-09
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 329 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 (NOT p0) (NOT p2)), (X (NOT p0)), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 19 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-005-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-005-LTLFireability-09 finished in 7215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 9 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 178 edges and 132 vertex of which 41 / 132 are part of one of the 1 SCC in 2 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 92 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 68 rules applied. Total rules applied 125 place count 36 transition count 59
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 2 with 12 rules applied. Total rules applied 137 place count 32 transition count 51
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 149 place count 28 transition count 43
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 157 place count 24 transition count 39
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 162 place count 19 transition count 34
Iterating global reduction 5 with 5 rules applied. Total rules applied 167 place count 19 transition count 34
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 172 place count 19 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 173 place count 19 transition count 28
Applied a total of 173 rules in 18 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2024-05-22 08:41:00] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 08:41:00] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-22 08:41:00] [INFO ] Invariant cache hit.
[2024-05-22 08:41:00] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-22 08:41:00] [INFO ] Redundant transitions in 0 ms returned []
Running 18 sub problems to find dead transitions.
[2024-05-22 08:41:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/47 variables, and 20 constraints, problems are : Problem set: 0 solved, 18 unsolved in 278 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 1/19 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 27/46 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/47 variables, and 38 constraints, problems are : Problem set: 0 solved, 18 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 19/19 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints]
After SMT, in 548ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 19/132 places, 28/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 692 ms. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 45 ms :[p0]
Running random walk in product with property : BART-COL-005-LTLFireability-10
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-10 finished in 759 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:41:01] [INFO ] Computed 1 invariants in 5 ms
[2024-05-22 08:41:01] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 08:41:01] [INFO ] Invariant cache hit.
[2024-05-22 08:41:01] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:41:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6652 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5451 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12132ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12136ms
Finished structural reductions in LTL mode , in 1 iterations and 12379 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-005-LTLFireability-11
Product exploration explored 100000 steps with 5529 reset in 490 ms.
Product exploration explored 100000 steps with 5510 reset in 385 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 106 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 526 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 152 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 08:41:15] [INFO ] Invariant cache hit.
[2024-05-22 08:41:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:41:16] [INFO ] [Real]Absence check using state equation in 244 ms returned sat
[2024-05-22 08:41:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:41:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:41:16] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-22 08:41:16] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 29 ms.
[2024-05-22 08:41:17] [INFO ] Added : 166 causal constraints over 34 iterations in 953 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-22 08:41:17] [INFO ] Invariant cache hit.
[2024-05-22 08:41:17] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 08:41:17] [INFO ] Invariant cache hit.
[2024-05-22 08:41:18] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6649 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5512 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12193ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12197ms
Finished structural reductions in LTL mode , in 1 iterations and 12422 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 444 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 148 steps (0 resets) in 6 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 513 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 08:41:31] [INFO ] Invariant cache hit.
[2024-05-22 08:41:32] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-22 08:41:32] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2024-05-22 08:41:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:41:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 08:41:32] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2024-05-22 08:41:32] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-22 08:41:33] [INFO ] Added : 166 causal constraints over 34 iterations in 811 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5573 reset in 490 ms.
Product exploration explored 100000 steps with 5514 reset in 411 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 202
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 24 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-22 08:41:34] [INFO ] Redundant transitions in 2 ms returned []
Running 166 sub problems to find dead transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:41:34] [INFO ] Computed 1 invariants in 2 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
[2024-05-22 08:41:37] [INFO ] Deduced a trap composed of 108 places in 134 ms of which 28 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 134 constraints, problems are : Problem set: 24 solved, 142 unsolved in 7529 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 24 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 25/132 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 142/276 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/276 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/276 constraints. Problems are: Problem set: 24 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 276 constraints, problems are : Problem set: 24 solved, 142 unsolved in 5882 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 142/166 constraints, Known Traps: 1/1 constraints]
After SMT, in 13429ms problems are : Problem set: 24 solved, 142 unsolved
Search for dead transitions found 24 dead transitions in 13431ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 178/202 transitions.
Graph (complete) has 178 edges and 132 vertex of which 108 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.2 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 108 /132 variables (removed 24) and now considering 178/178 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/132 places, 178/202 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13457 ms. Remains : 108/132 places, 178/202 transitions.
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:41:48] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 08:41:48] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 08:41:48] [INFO ] Invariant cache hit.
[2024-05-22 08:41:48] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:41:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6921 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4726 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 11672ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 11675ms
Finished structural reductions in LTL mode , in 1 iterations and 11898 ms. Remains : 132/132 places, 202/202 transitions.
Treatment of property BART-COL-005-LTLFireability-11 finished in 59316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 3 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2024-05-22 08:42:00] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:42:00] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 08:42:00] [INFO ] Invariant cache hit.
[2024-05-22 08:42:00] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-05-22 08:42:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 0/328 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 328/328 variables, and 130 constraints, problems are : Problem set: 0 solved, 163 unsolved in 6563 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (OVERLAPS) 1/129 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (OVERLAPS) 199/328 variables, 129/130 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 163/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/328 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Int declared 328/328 variables, and 293 constraints, problems are : Problem set: 0 solved, 163 unsolved in 5044 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 129/129 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints]
After SMT, in 11640ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 11643ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11809 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, p0, p0]
Running random walk in product with property : BART-COL-005-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-005-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-005-LTLFireability-12 finished in 11954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(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 43 ms. Remains 3 /132 variables (removed 129) and now considering 3/202 (removed 199) transitions.
// Phase 1: matrix 3 rows 3 cols
[2024-05-22 08:42:12] [INFO ] Computed 1 invariants in 0 ms
[2024-05-22 08:42:12] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 08:42:12] [INFO ] Invariant cache hit.
[2024-05-22 08:42:12] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-05-22 08:42:12] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-22 08:42:12] [INFO ] Invariant cache hit.
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 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 91ms
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 199 ms. Remains : 3/132 places, 3/202 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BART-COL-005-LTLFireability-14
Product exploration explored 100000 steps with 0 reset in 100 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 8 in 1 ms.
FORMULA BART-COL-005-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-005-LTLFireability-14 finished in 494 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X(p1)))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:42:12] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:42:12] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-22 08:42:12] [INFO ] Invariant cache hit.
[2024-05-22 08:42:12] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:42:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6806 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4084 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 10916ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 10919ms
Finished structural reductions in LTL mode , in 1 iterations and 11123 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : BART-COL-005-LTLFireability-15
Product exploration explored 100000 steps with 1057 reset in 374 ms.
Product exploration explored 100000 steps with 1101 reset in 393 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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 2 factoid took 205 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 166 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 329 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-22 08:42:25] [INFO ] Invariant cache hit.
[2024-05-22 08:42:26] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-22 08:42:26] [INFO ] [Real]Absence check using state equation in 241 ms returned sat
[2024-05-22 08:42:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:42:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:42:27] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-22 08:42:27] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 23 ms.
[2024-05-22 08:42:27] [INFO ] Added : 166 causal constraints over 34 iterations in 901 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-22 08:42:27] [INFO ] Invariant cache hit.
[2024-05-22 08:42:27] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-22 08:42:27] [INFO ] Invariant cache hit.
[2024-05-22 08:42:28] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:42:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6900 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5360 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12290ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12293ms
Finished structural reductions in LTL mode , in 1 iterations and 12503 ms. Remains : 132/132 places, 202/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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 2 factoid took 308 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 184 steps (0 resets) in 4 ms. (36 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 393 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-22 08:42:41] [INFO ] Invariant cache hit.
[2024-05-22 08:42:42] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2024-05-22 08:42:42] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2024-05-22 08:42:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:42:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:42:42] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2024-05-22 08:42:42] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-22 08:42:43] [INFO ] Added : 166 causal constraints over 34 iterations in 874 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 999 reset in 377 ms.
Product exploration explored 100000 steps with 1051 reset in 401 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 202
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 24 rules in 12 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-05-22 08:42:45] [INFO ] Redundant transitions in 2 ms returned []
Running 166 sub problems to find dead transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:42:45] [INFO ] Computed 1 invariants in 2 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
[2024-05-22 08:42:46] [INFO ] Deduced a trap composed of 108 places in 95 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 134 constraints, problems are : Problem set: 24 solved, 142 unsolved in 7878 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 24 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 25/132 variables, 1/1 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 1/2 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/132 variables, 0/2 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 4 (OVERLAPS) 202/334 variables, 132/134 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 142/276 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/334 variables, 0/276 constraints. Problems are: Problem set: 24 solved, 142 unsolved
At refinement iteration 7 (OVERLAPS) 0/334 variables, 0/276 constraints. Problems are: Problem set: 24 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 276 constraints, problems are : Problem set: 24 solved, 142 unsolved in 5973 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 142/166 constraints, Known Traps: 1/1 constraints]
After SMT, in 13878ms problems are : Problem set: 24 solved, 142 unsolved
Search for dead transitions found 24 dead transitions in 13882ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 132/132 places, 178/202 transitions.
Graph (complete) has 178 edges and 132 vertex of which 108 are kept as prefixes of interest. Removing 24 places using SCC suffix rule.0 ms
Discarding 24 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 108 /132 variables (removed 24) and now considering 178/178 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 108/132 places, 178/202 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 13911 ms. Remains : 108/132 places, 178/202 transitions.
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 08:42:59] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:42:59] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 08:42:59] [INFO ] Invariant cache hit.
[2024-05-22 08:42:59] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-05-22 08:42:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 6979 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 166 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 166/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 6 (OVERLAPS) 0/334 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Int declared 334/334 variables, and 299 constraints, problems are : Problem set: 0 solved, 166 unsolved in 5348 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints]
After SMT, in 12352ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 12357ms
Finished structural reductions in LTL mode , in 1 iterations and 12574 ms. Remains : 132/132 places, 202/202 transitions.
Treatment of property BART-COL-005-LTLFireability-15 finished in 58876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(X(G(p1)))))'
Found a Lengthening insensitive property : BART-COL-005-LTLFireability-02
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
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 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 22 place count 121 transition count 186
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 32 place count 116 transition count 186
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 38 place count 110 transition count 180
Iterating global reduction 3 with 6 rules applied. Total rules applied 44 place count 110 transition count 180
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 45 place count 110 transition count 179
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 48 place count 107 transition count 176
Iterating global reduction 4 with 3 rules applied. Total rules applied 51 place count 107 transition count 176
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 104 transition count 173
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 104 transition count 173
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 60 place count 101 transition count 170
Iterating global reduction 4 with 3 rules applied. Total rules applied 63 place count 101 transition count 170
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 65 place count 99 transition count 168
Iterating global reduction 4 with 2 rules applied. Total rules applied 67 place count 99 transition count 168
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 69 place count 97 transition count 166
Iterating global reduction 4 with 2 rules applied. Total rules applied 71 place count 97 transition count 166
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 72 place count 96 transition count 165
Iterating global reduction 4 with 1 rules applied. Total rules applied 73 place count 96 transition count 165
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 85 place count 90 transition count 159
Applied a total of 85 rules in 24 ms. Remains 90 /132 variables (removed 42) and now considering 159/202 (removed 43) transitions.
// Phase 1: matrix 159 rows 90 cols
[2024-05-22 08:43:12] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 08:43:12] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 08:43:12] [INFO ] Invariant cache hit.
[2024-05-22 08:43:12] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 08:43:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 1914 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 5962ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 5966ms
Starting structural reductions in LI_LTL mode, iteration 1 : 90/132 places, 159/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6164 ms. Remains : 90/132 places, 159/202 transitions.
Running random walk in product with property : BART-COL-005-LTLFireability-02
Product exploration explored 100000 steps with 49274 reset in 325 ms.
Product exploration explored 100000 steps with 49275 reset in 327 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 283 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 108 steps (0 resets) in 6 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 295 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 89 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 159/159 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2024-05-22 08:43:19] [INFO ] Invariant cache hit.
[2024-05-22 08:43:19] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-22 08:43:19] [INFO ] Invariant cache hit.
[2024-05-22 08:43:19] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 08:43:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2702 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2101 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 4815ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 4816ms
Finished structural reductions in LTL mode , in 1 iterations and 4927 ms. Remains : 90/90 places, 159/159 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 102 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 344 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 49288 reset in 175 ms.
Product exploration explored 100000 steps with 49289 reset in 189 ms.
Applying partial POR strategy [true, false, true, false]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 89 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 159/159 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2024-05-22 08:43:26] [INFO ] Redundant transitions in 0 ms returned []
Running 123 sub problems to find dead transitions.
[2024-05-22 08:43:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2399 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 1944 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 4357ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 4359ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4366 ms. Remains : 90/90 places, 159/159 transitions.
Support contains 89 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 159/159 transitions.
Applied a total of 0 rules in 0 ms. Remains 90 /90 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2024-05-22 08:43:30] [INFO ] Invariant cache hit.
[2024-05-22 08:43:31] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 08:43:31] [INFO ] Invariant cache hit.
[2024-05-22 08:43:31] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Running 123 sub problems to find dead transitions.
[2024-05-22 08:43:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (OVERLAPS) 0/249 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Real declared 249/249 variables, and 91 constraints, problems are : Problem set: 0 solved, 123 unsolved in 2619 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 123 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 3 (OVERLAPS) 159/249 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/249 variables, 123/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
At refinement iteration 6 (OVERLAPS) 0/249 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 123 unsolved
No progress, stopping.
After SMT solving in domain Int declared 249/249 variables, and 214 constraints, problems are : Problem set: 0 solved, 123 unsolved in 3083 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 90/90 constraints, PredecessorRefiner: 123/123 constraints, Known Traps: 0/0 constraints]
After SMT, in 5717ms problems are : Problem set: 0 solved, 123 unsolved
Search for dead transitions found 0 dead transitions in 5721ms
Finished structural reductions in LTL mode , in 1 iterations and 5836 ms. Remains : 90/90 places, 159/159 transitions.
Treatment of property BART-COL-005-LTLFireability-02 finished in 25232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(G(p1))))'
Found a Lengthening insensitive property : BART-COL-005-LTLFireability-11
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 178
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 7 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2024-05-22 08:43:37] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 08:43:37] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-22 08:43:37] [INFO ] Invariant cache hit.
[2024-05-22 08:43:37] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 08:43:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4007 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 9301ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 9307ms
Starting structural reductions in LI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9515 ms. Remains : 108/132 places, 178/202 transitions.
Running random walk in product with property : BART-COL-005-LTLFireability-11
Product exploration explored 100000 steps with 6076 reset in 584 ms.
Product exploration explored 100000 steps with 6103 reset in 566 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 384 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 94 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 530 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 08:43:49] [INFO ] Invariant cache hit.
[2024-05-22 08:43:49] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:43:49] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2024-05-22 08:43:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:43:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 08:43:50] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-05-22 08:43:50] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-22 08:43:50] [INFO ] Added : 142 causal constraints over 29 iterations in 673 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-22 08:43:50] [INFO ] Invariant cache hit.
[2024-05-22 08:43:51] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 08:43:51] [INFO ] Invariant cache hit.
[2024-05-22 08:43:51] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 08:43:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3995 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 9282ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 9286ms
Finished structural reductions in LTL mode , in 1 iterations and 9474 ms. Remains : 108/108 places, 178/178 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 389 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 142 steps (0 resets) in 5 ms. (23 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 524 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-05-22 08:44:01] [INFO ] Invariant cache hit.
[2024-05-22 08:44:02] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-22 08:44:02] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2024-05-22 08:44:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:44:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:44:02] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-22 08:44:02] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-22 08:44:03] [INFO ] Added : 142 causal constraints over 29 iterations in 683 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6116 reset in 584 ms.
Product exploration explored 100000 steps with 6112 reset in 430 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-22 08:44:04] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 08:44:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4965 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4006 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 8985ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 8986ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8998 ms. Remains : 108/108 places, 178/178 transitions.
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-22 08:44:13] [INFO ] Invariant cache hit.
[2024-05-22 08:44:13] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 08:44:13] [INFO ] Invariant cache hit.
[2024-05-22 08:44:13] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 08:44:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5266 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3912 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 9202ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 9205ms
Finished structural reductions in LTL mode , in 1 iterations and 9401 ms. Remains : 108/108 places, 178/178 transitions.
Treatment of property BART-COL-005-LTLFireability-11 finished in 46327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||X(p1)))))'
Found a Lengthening insensitive property : BART-COL-005-LTLFireability-15
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 132 transition count 178
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 5 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
[2024-05-22 08:44:23] [INFO ] Invariant cache hit.
[2024-05-22 08:44:23] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 08:44:23] [INFO ] Invariant cache hit.
[2024-05-22 08:44:23] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 08:44:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 5920ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 5922ms
Starting structural reductions in LI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6069 ms. Remains : 108/132 places, 178/202 transitions.
Running random walk in product with property : BART-COL-005-LTLFireability-15
Product exploration explored 100000 steps with 470 reset in 366 ms.
Product exploration explored 100000 steps with 500 reset in 390 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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 2 factoid took 207 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 160 steps (0 resets) in 4 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-22 08:44:31] [INFO ] Invariant cache hit.
[2024-05-22 08:44:31] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-22 08:44:31] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2024-05-22 08:44:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:44:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 08:44:31] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-22 08:44:31] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-22 08:44:32] [INFO ] Added : 142 causal constraints over 29 iterations in 431 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 0 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-22 08:44:32] [INFO ] Invariant cache hit.
[2024-05-22 08:44:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 08:44:32] [INFO ] Invariant cache hit.
[2024-05-22 08:44:32] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 08:44:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3271 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 2600 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 5887ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 5889ms
Finished structural reductions in LTL mode , in 1 iterations and 6030 ms. Remains : 108/108 places, 178/178 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (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 2 factoid took 326 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 114 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 280 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
[2024-05-22 08:44:39] [INFO ] Invariant cache hit.
[2024-05-22 08:44:39] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 08:44:39] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-22 08:44:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 08:44:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 08:44:40] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2024-05-22 08:44:40] [INFO ] Computed and/alt/rep : 142/246/142 causal constraints (skipped 0 transitions) in 30 ms.
[2024-05-22 08:44:41] [INFO ] Added : 142 causal constraints over 29 iterations in 682 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 307 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 470 reset in 365 ms.
Product exploration explored 100000 steps with 473 reset in 370 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 3 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-22 08:44:42] [INFO ] Redundant transitions in 0 ms returned []
Running 142 sub problems to find dead transitions.
[2024-05-22 08:44:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5218 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 3326 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 8567ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 8570ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8584 ms. Remains : 108/108 places, 178/178 transitions.
Support contains 77 out of 108 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 108/108 places, 178/178 transitions.
Applied a total of 0 rules in 2 ms. Remains 108 /108 variables (removed 0) and now considering 178/178 (removed 0) transitions.
[2024-05-22 08:44:51] [INFO ] Invariant cache hit.
[2024-05-22 08:44:51] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-22 08:44:51] [INFO ] Invariant cache hit.
[2024-05-22 08:44:51] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
Running 142 sub problems to find dead transitions.
[2024-05-22 08:44:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (OVERLAPS) 0/286 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Real declared 286/286 variables, and 109 constraints, problems are : Problem set: 0 solved, 142 unsolved in 5269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 142 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/107 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 1 (OVERLAPS) 1/108 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 3 (OVERLAPS) 178/286 variables, 108/109 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 142/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
At refinement iteration 6 (OVERLAPS) 0/286 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 142 unsolved
No progress, stopping.
After SMT solving in domain Int declared 286/286 variables, and 251 constraints, problems are : Problem set: 0 solved, 142 unsolved in 4000 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 108/108 constraints, PredecessorRefiner: 142/142 constraints, Known Traps: 0/0 constraints]
After SMT, in 9292ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 9295ms
Finished structural reductions in LTL mode , in 1 iterations and 9481 ms. Remains : 108/108 places, 178/178 transitions.
Treatment of property BART-COL-005-LTLFireability-15 finished in 37366 ms.
[2024-05-22 08:45:00] [INFO ] Flatten gal took : 25 ms
[2024-05-22 08:45:00] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 8 ms.
[2024-05-22 08:45:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 8 ms.
Total runtime 371900 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BART-COL-005

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 132
TRANSITIONS: 202
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 2811
MODEL NAME: /home/mcc/execution/415/model
132 places, 202 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BART-COL-005-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BART-COL-005-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BART-COL-005-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716367503899

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-005"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is BART-COL-005, 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 r025-smll-171620166500388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-005.tgz
mv BART-COL-005 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;