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.r468-smll-171620167600404.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 ltsminxred
Input is BART-COL-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167600404
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 716K
-rw-r--r-- 1 mcc users 6.8K Apr 12 23:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 23:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 12 23:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 23:06 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 3.7K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 02:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 13 02:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 13 00:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Apr 13 00:46 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 195K 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-020-LTLFireability-00
FORMULA_NAME BART-COL-020-LTLFireability-01
FORMULA_NAME BART-COL-020-LTLFireability-02
FORMULA_NAME BART-COL-020-LTLFireability-03
FORMULA_NAME BART-COL-020-LTLFireability-04
FORMULA_NAME BART-COL-020-LTLFireability-05
FORMULA_NAME BART-COL-020-LTLFireability-06
FORMULA_NAME BART-COL-020-LTLFireability-07
FORMULA_NAME BART-COL-020-LTLFireability-08
FORMULA_NAME BART-COL-020-LTLFireability-09
FORMULA_NAME BART-COL-020-LTLFireability-10
FORMULA_NAME BART-COL-020-LTLFireability-11
FORMULA_NAME BART-COL-020-LTLFireability-12
FORMULA_NAME BART-COL-020-LTLFireability-13
FORMULA_NAME BART-COL-020-LTLFireability-14
FORMULA_NAME BART-COL-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717231175782

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:39:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:39:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:39:37] [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-06-01 08:39:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 08:39:38] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1062 ms
[2024-06-01 08:39:39] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-06-01 08:39:39] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 15293 PT places and 2.814459024E10 transition bindings in 109 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 08:39:39] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 106 ms.
[2024-06-01 08:39:39] [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
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 20
Arc [0:1*[$db, (MOD (ADD $tsp 1) 6), $da2]] contains successor/predecessor on variables of sort speed
[2024-06-01 08:39:40] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 1319 ms.
[2024-06-01 08:39:40] [INFO ] Unfolded 16 HLPN properties in 5 ms.
Initial state reduction rules removed 4 formulas.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
[2024-06-01 08:39:40] [INFO ] Reduced 35 identical enabling conditions.
Deduced a syphon composed of 10215 places in 3 ms
Reduce places removed 10487 places and 121 transitions.
FORMULA BART-COL-020-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-020-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 132 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 10 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-06-01 08:39:40] [INFO ] Computed 1 invariants in 24 ms
[2024-06-01 08:39:41] [INFO ] Implicit Places using invariants in 301 ms returned []
[2024-06-01 08:39:41] [INFO ] Invariant cache hit.
[2024-06-01 08:39:41] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:39:41] [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 4906 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 4019 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 9002ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 9036ms
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2024-06-01 08:39:50] [INFO ] Flatten gal took : 112 ms
[2024-06-01 08:39:50] [INFO ] Flatten gal took : 34 ms
[2024-06-01 08:39:50] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 2902 steps (0 resets) in 37 ms. (76 steps per ms) remains 0/9 properties
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' '!(G(F(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 3 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 41 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2024-06-01 08:39:51] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:39:51] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 08:39:51] [INFO ] Invariant cache hit.
[2024-06-01 08:39:51] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-06-01 08:39:51] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 08:39:51] [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 296 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 191 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 493ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 494ms
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 619 ms. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 259 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-00
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 2 ms.
FORMULA BART-COL-020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-00 finished in 1022 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 68 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 132 transition count 199
Reduce places removed 3 places and 0 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Iterating post reduction 1 with 30 rules applied. Total rules applied 33 place count 129 transition count 172
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 60 place count 102 transition count 172
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 101 transition count 171
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 101 transition count 171
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 70 place count 97 transition count 167
Applied a total of 70 rules in 24 ms. Remains 97 /132 variables (removed 35) and now considering 167/202 (removed 35) transitions.
// Phase 1: matrix 167 rows 97 cols
[2024-06-01 08:39:52] [INFO ] Computed 1 invariants in 19 ms
[2024-06-01 08:39:52] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 08:39:52] [INFO ] Invariant cache hit.
[2024-06-01 08:39:52] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 190 ms to find 0 implicit places.
[2024-06-01 08:39:52] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-01 08:39:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 98 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2860 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 131/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 229 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2339 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 5250ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 5269ms
Starting structural reductions in SI_LTL mode, iteration 1 : 97/132 places, 167/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5505 ms. Remains : 97/132 places, 167/202 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 887 ms.
Product exploration explored 100000 steps with 0 reset in 676 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 p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 207 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
[2024-06-01 08:40:00] [INFO ] Invariant cache hit.
[2024-06-01 08:40:00] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 08:40:00] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-01 08:40:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:40:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:40:01] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-01 08:40:01] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 08:40:01] [INFO ] Added : 131 causal constraints over 27 iterations in 516 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 4 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-06-01 08:40:01] [INFO ] Invariant cache hit.
[2024-06-01 08:40:01] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 08:40:01] [INFO ] Invariant cache hit.
[2024-06-01 08:40:01] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
[2024-06-01 08:40:01] [INFO ] Redundant transitions in 6 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-01 08:40:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 98 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 131/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 229 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2276 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 5371ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 5377ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5638 ms. Remains : 97/97 places, 167/167 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-06-01 08:40:07] [INFO ] Invariant cache hit.
[2024-06-01 08:40:07] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:40:08] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2024-06-01 08:40:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:40:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:40:08] [INFO ] [Nat]Absence check using state equation in 101 ms returned sat
[2024-06-01 08:40:08] [INFO ] Computed and/alt/rep : 131/235/131 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 08:40:08] [INFO ] Added : 131 causal constraints over 27 iterations in 485 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 297 ms.
Product exploration explored 100000 steps with 0 reset in 346 ms.
Support contains 68 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 167/167 transitions.
Applied a total of 0 rules in 5 ms. Remains 97 /97 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-06-01 08:40:09] [INFO ] Invariant cache hit.
[2024-06-01 08:40:09] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 08:40:09] [INFO ] Invariant cache hit.
[2024-06-01 08:40:09] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-06-01 08:40:09] [INFO ] Redundant transitions in 13 ms returned []
Running 131 sub problems to find dead transitions.
[2024-06-01 08:40:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 0/264 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 98 constraints, problems are : Problem set: 0 solved, 131 unsolved in 3269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (OVERLAPS) 1/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (OVERLAPS) 167/264 variables, 97/98 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 131/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 0/264 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 264/264 variables, and 229 constraints, problems are : Problem set: 0 solved, 131 unsolved in 2211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 97/97 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 0/0 constraints]
After SMT, in 5519ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 5521ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5728 ms. Remains : 97/97 places, 167/167 transitions.
Treatment of property BART-COL-020-LTLFireability-01 finished in 22810 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)) U G(p1)) U X(X(p2))))'
Support contains 122 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-06-01 08:40:15] [INFO ] Computed 1 invariants in 24 ms
[2024-06-01 08:40:15] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 08:40:15] [INFO ] Invariant cache hit.
[2024-06-01 08:40:15] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:40:15] [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 4454 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 3426 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 7904ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7906ms
Finished structural reductions in LTL mode , in 1 iterations and 8109 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), (NOT p2), p0, (AND p0 p1), (NOT p1)]
Running random walk in product with property : BART-COL-020-LTLFireability-02
Product exploration explored 100000 steps with 33491 reset in 539 ms.
Product exploration explored 100000 steps with 33494 reset in 470 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) p2), (X (X p2)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 15 ms. Reduced automaton from 8 states, 18 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-020-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-020-LTLFireability-02 finished in 9548 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 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 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 1 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.
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 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
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 328 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 53 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 08:40:25] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:40:25] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:40:25] [INFO ] Invariant cache hit.
[2024-06-01 08:40:25] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 08:40:25] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:40:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 56ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 57ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 161 ms. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 58 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA BART-COL-020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-03 finished in 270 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 U (G(!p0)||(!p0&&F(!p1)))))))'
Support contains 97 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 26 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 127 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 119 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 107 transition count 177
Applied a total of 41 rules in 8 ms. Remains 107 /132 variables (removed 25) and now considering 177/202 (removed 25) transitions.
// Phase 1: matrix 177 rows 107 cols
[2024-06-01 08:40:25] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:40:25] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 08:40:25] [INFO ] Invariant cache hit.
[2024-06-01 08:40:25] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-06-01 08:40:25] [INFO ] Redundant transitions in 1 ms returned []
Running 141 sub problems to find dead transitions.
[2024-06-01 08:40:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 0/283 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/284 variables, and 108 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3320 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 141/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/284 variables, and 249 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2667 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 6006ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 6008ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/132 places, 177/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6156 ms. Remains : 107/132 places, 177/202 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, p0, (AND p0 p1)]
Running random walk in product with property : BART-COL-020-LTLFireability-04
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 0 ms.
FORMULA BART-COL-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-04 finished in 6295 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 9 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 12 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-06-01 08:40:31] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:40:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-06-01 08:40:31] [INFO ] Invariant cache hit.
[2024-06-01 08:40:31] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-01 08:40:31] [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 2505 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 1971 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 4521ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 4523ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4658 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-05
Entered a terminal (fully accepting) state of product in 62 steps with 0 reset in 0 ms.
FORMULA BART-COL-020-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-05 finished in 4768 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||G(p1)||F((!p0&&F(p2))))))'
Support contains 78 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-06-01 08:40:36] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:40:36] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 08:40:36] [INFO ] Invariant cache hit.
[2024-06-01 08:40:36] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 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 4400 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 3325 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 7756ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7758ms
Finished structural reductions in LTL mode , in 1 iterations and 7912 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : BART-COL-020-LTLFireability-08
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 234 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT p0)), (X p1)]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-020-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-020-LTLFireability-08 finished in 8578 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(((!p1 U (G(!p1)||(G(p3)&&p2)))&&p0)))'
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-06-01 08:40:44] [INFO ] Invariant cache hit.
[2024-06-01 08:40:44] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-06-01 08:40:44] [INFO ] Invariant cache hit.
[2024-06-01 08:40:45] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-06-01 08:40:45] [INFO ] Redundant transitions in 2 ms returned []
Running 166 sub problems to find dead transitions.
[2024-06-01 08:40:45] [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 4471 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 3321 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 7842ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7845ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8046 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p0) (AND p1 (NOT p2)) (AND p1 (NOT p3))), (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p3)), (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : BART-COL-020-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 1002 ms.
Stack based approach found an accepted trace after 2278 steps with 0 reset with depth 2279 and stack size 2279 in 24 ms.
FORMULA BART-COL-020-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-09 finished in 9341 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((X(!p1) U (!p0&&X(!p1))))))&&(G(!p0)||(F(p2) U !p3))))'
Support contains 131 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-06-01 08:40:54] [INFO ] Invariant cache hit.
[2024-06-01 08:40:54] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:40:54] [INFO ] Invariant cache hit.
[2024-06-01 08:40:54] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:40:54] [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 4872 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 3337 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 8233ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 8236ms
Finished structural reductions in LTL mode , in 1 iterations and 8413 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 405 ms :[p0, (NOT p2), p3, (AND p0 p3), p0, (AND (NOT p2) p0), (OR p1 p0), p1, true]
Running random walk in product with property : BART-COL-020-LTLFireability-12
Product exploration explored 100000 steps with 6876 reset in 421 ms.
Product exploration explored 100000 steps with 6929 reset in 445 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X p3), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p3)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p3 (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 877 ms. Reduced automaton from 9 states, 19 edges and 4 AP (stutter sensitive) to 11 states, 33 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 611 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 24851 steps (5 resets) in 169 ms. (146 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) (NOT p1)), (X p3), (X (NOT (AND p0 (NOT p2)))), (X (AND (NOT p0) p3)), (X (NOT (AND p0 p3))), (X (NOT (AND p0 p3 (NOT p2)))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p3 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND p3 (NOT p2))), (X (NOT (AND p3 (NOT p2)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) p3 (NOT p2))), (X (NOT (AND (NOT p0) p3 (NOT p2)))), (X (X p3)), (X (X (NOT p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND p3 (NOT p2)))), (X (X (NOT (AND p3 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) p3 (NOT p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p2))))), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT (AND (NOT p0) (NOT p2) p3))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 (NOT p2) (NOT p3)))), (F (NOT (AND (NOT p0) p3))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p3)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR (NOT p0) p2 p3))), (F (NOT (OR p0 p2 p3))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F p0), (F (NOT (OR (NOT p0) (NOT p2) (NOT p3)))), (F (NOT (OR (NOT p0) p2 (NOT p3)))), (F (NOT p3)), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR (NOT p0) (NOT p3))))]
Knowledge based reduction with 11 factoid took 1229 ms. Reduced automaton from 11 states, 33 edges and 3 AP (stutter insensitive) to 11 states, 33 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 423 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 427 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Support contains 98 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 5 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
[2024-06-01 08:41:07] [INFO ] Invariant cache hit.
[2024-06-01 08:41:07] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 08:41:07] [INFO ] Invariant cache hit.
[2024-06-01 08:41:07] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2024-06-01 08:41:07] [INFO ] Redundant transitions in 4 ms returned []
Running 166 sub problems to find dead transitions.
[2024-06-01 08:41:07] [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 4431 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 3379 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 7845ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7847ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8149 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 p2) p3), (X p3), (X (NOT (AND p0 p2 p3))), (X (AND (NOT p0) p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT p0)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p0) p2 p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 p3))), (X (X (NOT (AND (NOT p0) p2 p3))))]
Knowledge based reduction with 20 factoid took 1021 ms. Reduced automaton from 11 states, 33 edges and 3 AP (stutter insensitive) to 11 states, 33 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 429 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Reduction of identical properties reduced properties to check from 18 to 16
RANDOM walk for 16494 steps (3 resets) in 31 ms. (515 steps per ms) remains 0/16 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3), (X p3), (X (NOT (AND p0 p2 p3))), (X (AND (NOT p0) p3)), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND p0 p3))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (NOT (AND p0 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p2) p3))), (X (NOT p0)), (X (X (NOT (AND p0 p2 p3)))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND p0 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p2) p3)), (X (NOT (AND (NOT p0) (NOT p2) p3))), (X (NOT p2)), (X p2), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (AND (NOT p0) p2 p3)), (X (NOT (AND (NOT p0) p2 p3))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p0) p3))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2) p3))), (X (X (NOT (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND (NOT p0) p2 p3))), (X (X (NOT (AND (NOT p0) p2 p3)))), (F (NOT (OR (NOT p0) p3 (NOT p2)))), (F (NOT (OR (NOT p0) p3 p2))), (F (NOT (OR (NOT p0) p2))), (F (NOT (OR p0 p3 (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p0) p3))), (F (NOT (OR (NOT p0) (NOT p3) p2))), (F (NOT (AND (NOT p0) p3 (NOT p2)))), (F (NOT (AND p3 (NOT p2)))), (F (NOT (OR p0 (NOT p3) (NOT p2)))), (F p2), (F (NOT (OR p0 p3 p2))), (F (NOT (OR (NOT p0) (NOT p3)))), (F p0), (F (NOT p3)), (F (NOT (OR (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p3))))]
Knowledge based reduction with 20 factoid took 1716 ms. Reduced automaton from 11 states, 33 edges and 3 AP (stutter insensitive) to 11 states, 33 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 475 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 524 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 433 ms :[(OR (AND p0 (NOT p2)) (AND p0 p3)), (NOT p2), p3, (AND p0 p3), (AND (NOT p2) p0), false, false, false, false, false, false]
Product exploration explored 100000 steps with 4676 reset in 476 ms.
Product exploration explored 100000 steps with 4709 reset in 464 ms.
Support contains 98 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 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 1 place count 132 transition count 201
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 10 place count 131 transition count 193
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 18 place count 123 transition count 193
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 18 place count 123 transition count 192
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 20 place count 122 transition count 192
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 48 place count 108 transition count 178
Applied a total of 48 rules in 14 ms. Remains 108 /132 variables (removed 24) and now considering 178/202 (removed 24) transitions.
// Phase 1: matrix 178 rows 108 cols
[2024-06-01 08:41:21] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:41:21] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-01 08:41:21] [INFO ] Invariant cache hit.
[2024-06-01 08:41:21] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-06-01 08:41:21] [INFO ] Redundant transitions in 1 ms returned []
Running 142 sub problems to find dead transitions.
[2024-06-01 08:41:21] [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 3492 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 2552 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 6076ms problems are : Problem set: 0 solved, 142 unsolved
Search for dead transitions found 0 dead transitions in 6078ms
Starting structural reductions in SI_LTL mode, iteration 1 : 108/132 places, 178/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6337 ms. Remains : 108/132 places, 178/202 transitions.
Treatment of property BART-COL-020-LTLFireability-12 finished in 33576 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 97 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-06-01 08:41:27] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:41:27] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 08:41:27] [INFO ] Invariant cache hit.
[2024-06-01 08:41:28] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:41: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 4561 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 3360 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 7944ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7952ms
Finished structural reductions in LTL mode , in 1 iterations and 8281 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-13
Product exploration explored 100000 steps with 2397 reset in 351 ms.
Product exploration explored 100000 steps with 2441 reset in 376 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 (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2475 steps (0 resets) in 7 ms. (309 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 141 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 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:41:37] [INFO ] Invariant cache hit.
[2024-06-01 08:41:37] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:41:37] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2024-06-01 08:41:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:41:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:41:38] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2024-06-01 08:41:38] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 18 ms.
[2024-06-01 08:41:38] [INFO ] Added : 166 causal constraints over 34 iterations in 634 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 97 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 26 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 127 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 119 transition count 189
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 41 place count 107 transition count 177
Applied a total of 41 rules in 7 ms. Remains 107 /132 variables (removed 25) and now considering 177/202 (removed 25) transitions.
// Phase 1: matrix 177 rows 107 cols
[2024-06-01 08:41:38] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:41:39] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 08:41:39] [INFO ] Invariant cache hit.
[2024-06-01 08:41:39] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-06-01 08:41:39] [INFO ] Redundant transitions in 0 ms returned []
Running 141 sub problems to find dead transitions.
[2024-06-01 08:41:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (OVERLAPS) 0/283 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Real declared 283/284 variables, and 108 constraints, problems are : Problem set: 0 solved, 141 unsolved in 3862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 141 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 1 (OVERLAPS) 1/107 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/107 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 3 (OVERLAPS) 176/283 variables, 107/108 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 141/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/283 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
At refinement iteration 6 (OVERLAPS) 0/283 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 141 unsolved
No progress, stopping.
After SMT solving in domain Int declared 283/284 variables, and 249 constraints, problems are : Problem set: 0 solved, 141 unsolved in 2474 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 107/107 constraints, PredecessorRefiner: 141/141 constraints, Known Traps: 0/0 constraints]
After SMT, in 6350ms problems are : Problem set: 0 solved, 141 unsolved
Search for dead transitions found 0 dead transitions in 6353ms
Starting structural reductions in SI_LTL mode, iteration 1 : 107/132 places, 177/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6630 ms. Remains : 107/132 places, 177/202 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2169 steps (0 resets) in 7 ms. (271 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 98 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
[2024-06-01 08:41:46] [INFO ] Invariant cache hit.
[2024-06-01 08:41:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:41:46] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-06-01 08:41:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:41:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:41:46] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 08:41:46] [INFO ] Computed and/alt/rep : 141/242/141 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 08:41:47] [INFO ] Added : 123 causal constraints over 25 iterations in 357 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-COL-020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-020-LTLFireability-13 finished in 19407 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' '!(((p0&&X((p1&&X(F(!p2))))) U X(p2)))'
Support contains 70 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 129 transition count 199
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 129 transition count 199
Applied a total of 6 rules in 9 ms. Remains 129 /132 variables (removed 3) and now considering 199/202 (removed 3) transitions.
// Phase 1: matrix 199 rows 129 cols
[2024-06-01 08:41:47] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:41:47] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-06-01 08:41:47] [INFO ] Invariant cache hit.
[2024-06-01 08:41:47] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2024-06-01 08:41:47] [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 4214 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 3259 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 7516ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 7518ms
Starting structural reductions in LTL mode, iteration 1 : 129/132 places, 199/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7696 ms. Remains : 129/132 places, 199/202 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p2), (NOT p2), (NOT p2), true, p2]
Running random walk in product with property : BART-COL-020-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 212 ms.
Product exploration explored 100000 steps with 50000 reset in 187 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 p2) p1), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X p1), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 15 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-020-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-020-LTLFireability-14 finished in 8298 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)))'
Support contains 1 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 132 transition count 138
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 68 transition count 138
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 128 place count 68 transition count 133
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 138 place count 63 transition count 133
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 144 place count 57 transition count 127
Iterating global reduction 2 with 6 rules applied. Total rules applied 150 place count 57 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 151 place count 57 transition count 126
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 155 place count 53 transition count 122
Iterating global reduction 3 with 4 rules applied. Total rules applied 159 place count 53 transition count 122
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 162 place count 50 transition count 119
Iterating global reduction 3 with 3 rules applied. Total rules applied 165 place count 50 transition count 119
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 168 place count 47 transition count 116
Iterating global reduction 3 with 3 rules applied. Total rules applied 171 place count 47 transition count 116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 173 place count 45 transition count 114
Iterating global reduction 3 with 2 rules applied. Total rules applied 175 place count 45 transition count 114
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 177 place count 43 transition count 112
Iterating global reduction 3 with 2 rules applied. Total rules applied 179 place count 43 transition count 112
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 180 place count 42 transition count 111
Iterating global reduction 3 with 1 rules applied. Total rules applied 181 place count 42 transition count 111
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 195 place count 35 transition count 104
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 199 place count 35 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 33 transition count 98
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 207 place count 33 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 211 place count 31 transition count 92
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 215 place count 31 transition count 88
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 219 place count 29 transition count 86
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 223 place count 29 transition count 82
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 227 place count 27 transition count 80
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 231 place count 27 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 235 place count 25 transition count 74
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 239 place count 25 transition count 70
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 243 place count 23 transition count 68
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 247 place count 23 transition count 64
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 10 with 4 rules applied. Total rules applied 251 place count 21 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 255 place count 21 transition count 58
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 259 place count 19 transition count 56
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 263 place count 19 transition count 52
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 267 place count 17 transition count 50
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 271 place count 17 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 13 with 4 rules applied. Total rules applied 275 place count 15 transition count 44
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 279 place count 15 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 283 place count 13 transition count 38
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 287 place count 13 transition count 34
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 15 with 4 rules applied. Total rules applied 291 place count 11 transition count 32
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 295 place count 11 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 16 with 4 rules applied. Total rules applied 299 place count 9 transition count 26
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 303 place count 9 transition count 22
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 17 with 4 rules applied. Total rules applied 307 place count 7 transition count 20
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 311 place count 7 transition count 16
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 4 rules applied. Total rules applied 315 place count 5 transition count 14
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 319 place count 5 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 19 with 4 rules applied. Total rules applied 323 place count 3 transition count 8
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 19 with 5 rules applied. Total rules applied 328 place count 3 transition count 3
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 2 rules applied. Total rules applied 330 place count 2 transition count 2
Applied a total of 330 rules in 26 ms. Remains 2 /132 variables (removed 130) and now considering 2/202 (removed 200) transitions.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 08:41:55] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:41:55] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 08:41:55] [INFO ] Invariant cache hit.
[2024-06-01 08:41:55] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-06-01 08:41:55] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:41:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/4 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/4 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/132 places, 2/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 2/132 places, 2/202 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-020-LTLFireability-15
Product exploration explored 100000 steps with 253 reset in 57 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BART-COL-020-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-020-LTLFireability-15 finished in 496 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)))'
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((X(!p1) U (!p0&&X(!p1))))))&&(G(!p0)||(F(p2) U !p3))))'
[2024-06-01 08:41:56] [INFO ] Flatten gal took : 30 ms
[2024-06-01 08:41:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2024-06-01 08:41:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 20 ms.
Total runtime 138997 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BART-COL-020-LTLFireability-01
Could not compute solution for formula : BART-COL-020-LTLFireability-12

BK_STOP 1717231318733

--------------------
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
mcc2024
ltl formula name BART-COL-020-LTLFireability-01
ltl formula formula --ltl=/tmp/1807/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1807/ltl_0_
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name BART-COL-020-LTLFireability-12
ltl formula formula --ltl=/tmp/1807/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 132 places, 202 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.000 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1807/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1807/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1807/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1807/ltl_1_
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
corrupted size vs. prev_size in fastbins

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-020"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BART-COL-020, 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 r468-smll-171620167600404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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