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-171620167700420.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-040, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167700420
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 7.3K Apr 12 23:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 12 23:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 21:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 21:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Apr 13 01:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 13 01:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 13 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 207K 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-040-LTLFireability-00
FORMULA_NAME BART-COL-040-LTLFireability-01
FORMULA_NAME BART-COL-040-LTLFireability-02
FORMULA_NAME BART-COL-040-LTLFireability-03
FORMULA_NAME BART-COL-040-LTLFireability-04
FORMULA_NAME BART-COL-040-LTLFireability-05
FORMULA_NAME BART-COL-040-LTLFireability-06
FORMULA_NAME BART-COL-040-LTLFireability-07
FORMULA_NAME BART-COL-040-LTLFireability-08
FORMULA_NAME BART-COL-040-LTLFireability-09
FORMULA_NAME BART-COL-040-LTLFireability-10
FORMULA_NAME BART-COL-040-LTLFireability-11
FORMULA_NAME BART-COL-040-LTLFireability-12
FORMULA_NAME BART-COL-040-LTLFireability-13
FORMULA_NAME BART-COL-040-LTLFireability-14
FORMULA_NAME BART-COL-040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717231727228

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-040
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:48:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:48:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:48:49] [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:48:50] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 08:48:50] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1170 ms
[2024-06-01 08:48:50] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-06-01 08:48:51] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 20213 PT places and 5.628918048E10 transition bindings in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 08:48:51] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 7 ms.
[2024-06-01 08:48:51] [INFO ] Skeletonized 1 HLPN properties in 2 ms. Removed 15 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 40
Arc [2:1*[(MOD (ADD $tsp 1) 6), $ds2]] contains successor/predecessor on variables of sort speed
[2024-06-01 08:48:52] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 926 ms.
[2024-06-01 08:48:52] [INFO ] Unfolded 16 HLPN properties in 5 ms.
Initial state reduction rules removed 3 formulas.
[2024-06-01 08:48:52] [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-040-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-040-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BART-COL-040-LTLFireability-13 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:48:52] [INFO ] Computed 1 invariants in 25 ms
[2024-06-01 08:48:52] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-06-01 08:48:52] [INFO ] Invariant cache hit.
[2024-06-01 08:48:52] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:48:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4854 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 3680 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 8619ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 8640ms
Finished structural reductions in LTL mode , in 1 iterations and 9203 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2024-06-01 08:49:01] [INFO ] Flatten gal took : 59 ms
[2024-06-01 08:49:01] [INFO ] Flatten gal took : 37 ms
[2024-06-01 08:49:02] [INFO ] Input system was already deterministic with 202 transitions.
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 1234 steps (0 resets) in 12 ms. (94 steps per ms) remains 0/6 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 4 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 81 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:49:02] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:49:02] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-01 08:49:02] [INFO ] Invariant cache hit.
[2024-06-01 08:49:02] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-06-01 08:49:02] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2024-06-01 08:49:02] [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 241 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 224 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 471ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 472ms
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 679 ms. Remains : 19/132 places, 28/202 transitions.
Stuttering acceptance computed with spot in 247 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-00
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA BART-COL-040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-00 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 54 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-06-01 08:49:03] [INFO ] Computed 1 invariants in 7 ms
[2024-06-01 08:49:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-01 08:49:03] [INFO ] Invariant cache hit.
[2024-06-01 08:49:04] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-01 08:49:04] [INFO ] Redundant transitions in 9 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 08:49:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 90 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2778 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 122/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 1954 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 4774ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 4778ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5160 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-01 finished in 5219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(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 21 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:49:08] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:49:08] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-01 08:49:08] [INFO ] Invariant cache hit.
[2024-06-01 08:49:09] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-01 08:49:09] [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 2502 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 1960 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 4500ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 4503ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4673 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-02
Entered a terminal (fully accepting) state of product in 74 steps with 0 reset in 2 ms.
FORMULA BART-COL-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-02 finished in 4829 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!p0&&G(p1)&&X((G(p2)&&(!p2 U !p0)))))))'
Support contains 130 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 6 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:49:13] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:49:13] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 08:49:13] [INFO ] Invariant cache hit.
[2024-06-01 08:49:13] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:49:13] [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 4611 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 3310 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 7995ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 8010ms
Finished structural reductions in LTL mode , in 1 iterations and 8213 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 381 ms :[true, (OR (NOT p1) (NOT p2) p0), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1) p0), (OR (NOT p1) (NOT p2) p0), (OR (NOT p1) (NOT p2) p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-03
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-03 finished in 8634 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&&(!p1 U p2)))))'
Support contains 78 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 132 transition count 179
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 46 place count 109 transition count 179
Applied a total of 46 rules in 11 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2024-06-01 08:49:22] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:49:22] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 08:49:22] [INFO ] Invariant cache hit.
[2024-06-01 08:49:22] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-06-01 08:49:22] [INFO ] Redundant transitions in 6 ms returned []
Running 143 sub problems to find dead transitions.
[2024-06-01 08:49:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3430 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 2516 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 5971ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 5974ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/132 places, 179/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6173 ms. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : BART-COL-040-LTLFireability-05
Product exploration explored 100000 steps with 652 reset in 808 ms.
Product exploration explored 100000 steps with 617 reset in 661 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1) (NOT p0)))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 562 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 1193 steps (0 resets) in 23 ms. (49 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X p0), (X p1), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (X (NOT p2))), (X (X (OR (AND (NOT p2) p1) (NOT p0)))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1)))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0))))), (F p0), (F (NOT (OR p1 p2))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 1127 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-06-01 08:49:32] [INFO ] Invariant cache hit.
[2024-06-01 08:49:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:49:32] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-06-01 08:49:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:49:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:49:33] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-01 08:49:33] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 31 ms.
[2024-06-01 08:49:33] [INFO ] Added : 143 causal constraints over 29 iterations in 745 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 08:49:33] [INFO ] Invariant cache hit.
[2024-06-01 08:49:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:49:34] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 08:49:34] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 13 ms.
[2024-06-01 08:49:34] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:49:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:49:34] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-06-01 08:49:34] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 08:49:34] [INFO ] Added : 141 causal constraints over 29 iterations in 453 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 5 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-01 08:49:34] [INFO ] Invariant cache hit.
[2024-06-01 08:49:34] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 08:49:34] [INFO ] Invariant cache hit.
[2024-06-01 08:49:35] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-06-01 08:49:35] [INFO ] Redundant transitions in 7 ms returned []
Running 143 sub problems to find dead transitions.
[2024-06-01 08:49:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 2558 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 6156ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 6170ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6421 ms. Remains : 109/109 places, 179/179 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0))))]
False Knowledge obtained : [(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 p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 13 factoid took 513 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 86 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 988 steps (0 resets) in 11 ms. (82 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 (NOT p2))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0))))), (X (X (OR (AND p1 (NOT p2)) (NOT p0))))]
False Knowledge obtained : [(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 p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0)))), (F (NOT (AND (OR p1 (NOT p0)) (OR (NOT p2) (NOT p0))))), (F p0), (F (NOT (OR p1 p2))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (OR p1 p2 (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 13 factoid took 877 ms. Reduced automaton from 2 states, 5 edges and 3 AP (stutter insensitive) to 2 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-06-01 08:49:42] [INFO ] Invariant cache hit.
[2024-06-01 08:49:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:49:43] [INFO ] [Real]Absence check using state equation in 97 ms returned sat
[2024-06-01 08:49:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:49:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:49:43] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 08:49:43] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 08:49:43] [INFO ] Added : 143 causal constraints over 29 iterations in 455 ms. Result :sat
Could not prove EG (NOT p0)
[2024-06-01 08:49:43] [INFO ] Invariant cache hit.
[2024-06-01 08:49:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:49:44] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-06-01 08:49:44] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 08:49:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:49:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:49:44] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-06-01 08:49:44] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 08:49:44] [INFO ] Added : 141 causal constraints over 29 iterations in 426 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 79 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 648 reset in 458 ms.
Product exploration explored 100000 steps with 676 reset in 459 ms.
Support contains 78 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 179/179 transitions.
Applied a total of 0 rules in 4 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-06-01 08:49:45] [INFO ] Invariant cache hit.
[2024-06-01 08:49:45] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 08:49:45] [INFO ] Invariant cache hit.
[2024-06-01 08:49:45] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
[2024-06-01 08:49:45] [INFO ] Redundant transitions in 2 ms returned []
Running 143 sub problems to find dead transitions.
[2024-06-01 08:49:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (OVERLAPS) 0/288 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 110 constraints, problems are : Problem set: 0 solved, 143 unsolved in 3397 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 143 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 1 (OVERLAPS) 1/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 3 (OVERLAPS) 179/288 variables, 109/110 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/288 variables, 143/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
At refinement iteration 6 (OVERLAPS) 0/288 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 143 unsolved
No progress, stopping.
After SMT solving in domain Int declared 288/288 variables, and 253 constraints, problems are : Problem set: 0 solved, 143 unsolved in 2642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 109/109 constraints, PredecessorRefiner: 143/143 constraints, Known Traps: 0/0 constraints]
After SMT, in 6072ms problems are : Problem set: 0 solved, 143 unsolved
Search for dead transitions found 0 dead transitions in 6074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6246 ms. Remains : 109/109 places, 179/179 transitions.
Treatment of property BART-COL-040-LTLFireability-05 finished in 29742 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 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 126 transition count 196
Applied a total of 12 rules in 10 ms. Remains 126 /132 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 126 cols
[2024-06-01 08:49:52] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:49:52] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 08:49:52] [INFO ] Invariant cache hit.
[2024-06-01 08:49:52] [INFO ] Implicit Places using invariants and state equation in 307 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-06-01 08:49:52] [INFO ] Redundant transitions in 2 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 08:49:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4206 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3063 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7308ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7310ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 196/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7728 ms. Remains : 126/132 places, 196/202 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-06
Product exploration explored 100000 steps with 231 reset in 362 ms.
Product exploration explored 100000 steps with 233 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 226 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 820 steps (0 resets) in 7 ms. (102 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 244 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 7 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-06-01 08:50:01] [INFO ] Invariant cache hit.
[2024-06-01 08:50:01] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 08:50:01] [INFO ] Invariant cache hit.
[2024-06-01 08:50:01] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-06-01 08:50:01] [INFO ] Redundant transitions in 1 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 08:50:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4288 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7458ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7460ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7671 ms. Remains : 126/126 places, 196/196 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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 256 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 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 741 steps (0 resets) in 5 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 201 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 223 reset in 348 ms.
Product exploration explored 100000 steps with 224 reset in 377 ms.
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-06-01 08:50:10] [INFO ] Invariant cache hit.
[2024-06-01 08:50:10] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-01 08:50:10] [INFO ] Invariant cache hit.
[2024-06-01 08:50:10] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-06-01 08:50:10] [INFO ] Redundant transitions in 0 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 08:50:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4257 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3054 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7337ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7340ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7499 ms. Remains : 126/126 places, 196/196 transitions.
Treatment of property BART-COL-040-LTLFireability-06 finished in 26046 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&(p1 U X(G(!p2))))))'
Support contains 98 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-06-01 08:50:18] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:50:18] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-06-01 08:50:18] [INFO ] Invariant cache hit.
[2024-06-01 08:50:18] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:50:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (OVERLAPS) 1/132 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (OVERLAPS) 202/334 variables, 132/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 5 (OVERLAPS) 0/334 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 166 unsolved
No progress, stopping.
After SMT solving in domain Real declared 334/334 variables, and 133 constraints, problems are : Problem set: 0 solved, 166 unsolved in 4350 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 3313 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 7699ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7702ms
Finished structural reductions in LTL mode , in 1 iterations and 7889 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR p2 p0), p2, p2]
Running random walk in product with property : BART-COL-040-LTLFireability-07
Product exploration explored 100000 steps with 0 reset in 1230 ms.
Stack based approach found an accepted trace after 42753 steps with 0 reset with depth 42754 and stack size 20048 in 558 ms.
FORMULA BART-COL-040-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-COL-040-LTLFireability-07 finished in 9835 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 29 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-06-01 08:50:28] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:50:28] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 08:50:28] [INFO ] Invariant cache hit.
[2024-06-01 08:50:28] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-06-01 08:50:28] [INFO ] Redundant transitions in 0 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 08:50:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 90 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2478 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 122/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 1963 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 4478ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 4479ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4755 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-08
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-08 finished in 4806 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G((G(p0)||X(!p1)))))))'
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 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:50:32] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:50:32] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-01 08:50:32] [INFO ] Invariant cache hit.
[2024-06-01 08:50:33] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:50:33] [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 4497 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 3329 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 7844ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7847ms
Finished structural reductions in LTL mode , in 1 iterations and 8113 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p0)), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), true, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-COL-040-LTLFireability-10
Entered a terminal (fully accepting) state of product in 26864 steps with 7578 reset in 88 ms.
FORMULA BART-COL-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-10 finished in 8516 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((G(p1)||G(!p1)||p0))))'
Support contains 121 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 200
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 200
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 126 transition count 196
Applied a total of 12 rules in 8 ms. Remains 126 /132 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 126 cols
[2024-06-01 08:50:41] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:50:41] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 08:50:41] [INFO ] Invariant cache hit.
[2024-06-01 08:50:41] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-06-01 08:50:41] [INFO ] Redundant transitions in 0 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 08:50:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4076 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7231ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7233ms
Starting structural reductions in SI_LTL mode, iteration 1 : 126/132 places, 196/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7441 ms. Remains : 126/132 places, 196/202 transitions.
Stuttering acceptance computed with spot in 87 ms :[false, false]
Running random walk in product with property : BART-COL-040-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 283 ms.
Product exploration explored 100000 steps with 0 reset in 404 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 422 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[false, false]
RANDOM walk for 1394 steps (0 resets) in 6 ms. (199 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 399 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[false, false]
Stuttering acceptance computed with spot in 66 ms :[false, false]
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-06-01 08:50:50] [INFO ] Invariant cache hit.
[2024-06-01 08:50:50] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 08:50:50] [INFO ] Invariant cache hit.
[2024-06-01 08:50:50] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 141 ms to find 0 implicit places.
[2024-06-01 08:50:50] [INFO ] Redundant transitions in 0 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 08:50:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4165 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3178 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7365ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7367ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7521 ms. Remains : 126/126 places, 196/196 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 316 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[false, false]
RANDOM walk for 369 steps (0 resets) in 5 ms. (61 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F p0), (F (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 4 factoid took 406 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[false, false]
Stuttering acceptance computed with spot in 72 ms :[false, false]
Stuttering acceptance computed with spot in 67 ms :[false, false]
Product exploration explored 100000 steps with 0 reset in 191 ms.
Product exploration explored 100000 steps with 1 reset in 479 ms.
Support contains 121 out of 126 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 126/126 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-06-01 08:50:59] [INFO ] Invariant cache hit.
[2024-06-01 08:50:59] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-01 08:50:59] [INFO ] Invariant cache hit.
[2024-06-01 08:51:00] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-06-01 08:51:00] [INFO ] Redundant transitions in 1 ms returned []
Running 160 sub problems to find dead transitions.
[2024-06-01 08:51:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (OVERLAPS) 0/322 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Real declared 322/322 variables, and 127 constraints, problems are : Problem set: 0 solved, 160 unsolved in 4306 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 160 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 1 (OVERLAPS) 1/126 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 3 (OVERLAPS) 196/322 variables, 126/127 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/322 variables, 160/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
At refinement iteration 6 (OVERLAPS) 0/322 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 160 unsolved
No progress, stopping.
After SMT solving in domain Int declared 322/322 variables, and 287 constraints, problems are : Problem set: 0 solved, 160 unsolved in 3119 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 126/126 constraints, PredecessorRefiner: 160/160 constraints, Known Traps: 0/0 constraints]
After SMT, in 7446ms problems are : Problem set: 0 solved, 160 unsolved
Search for dead transitions found 0 dead transitions in 7449ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 7666 ms. Remains : 126/126 places, 196/196 transitions.
Treatment of property BART-COL-040-LTLFireability-11 finished in 26268 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)||(F(!p1)&&G(!p0)))))'
Support contains 77 out of 132 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Applied a total of 0 rules in 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-06-01 08:51:07] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:51:07] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 08:51:07] [INFO ] Invariant cache hit.
[2024-06-01 08:51:07] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
Running 166 sub problems to find dead transitions.
[2024-06-01 08:51: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 4607 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 3293 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 7919ms problems are : Problem set: 0 solved, 166 unsolved
Search for dead transitions found 0 dead transitions in 7921ms
Finished structural reductions in LTL mode , in 1 iterations and 8092 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) p1), (OR p1 p0), p0, (NOT p0), true, (AND (NOT p0) p1)]
Running random walk in product with property : BART-COL-040-LTLFireability-12
Entered a terminal (fully accepting) state of product in 78 steps with 0 reset in 0 ms.
FORMULA BART-COL-040-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-12 finished in 8311 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!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:51:15] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:51:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-06-01 08:51:15] [INFO ] Invariant cache hit.
[2024-06-01 08:51:16] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-01 08:51:16] [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 2566 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 2037 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 4629ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 4630ms
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4779 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 107 ms :[p0, p0, p0]
Running random walk in product with property : BART-COL-040-LTLFireability-14
Product exploration explored 100000 steps with 1794 reset in 547 ms.
Product exploration explored 100000 steps with 1771 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 232 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[p0, p0, p0]
RANDOM walk for 742 steps (0 resets) in 5 ms. (123 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 101 ms :[p0, p0, p0]
[2024-06-01 08:51:22] [INFO ] Invariant cache hit.
[2024-06-01 08:51:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:51:22] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-06-01 08:51:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:51:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 08:51:22] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-06-01 08:51:22] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 08:51:23] [INFO ] Added : 124 causal constraints over 25 iterations in 322 ms. Result :sat
Could not prove EG p0
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-06-01 08:51:23] [INFO ] Invariant cache hit.
[2024-06-01 08:51:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 08:51:23] [INFO ] Invariant cache hit.
[2024-06-01 08:51:23] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-01 08:51:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 1 (OVERLAPS) 1/90 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 3 (OVERLAPS) 160/250 variables, 90/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
At refinement iteration 5 (OVERLAPS) 0/250 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 124 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 91 constraints, problems are : Problem set: 0 solved, 124 unsolved in 2588 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 2201 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 4809ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 4812ms
Finished structural reductions in LTL mode , in 1 iterations and 4939 ms. Remains : 90/90 places, 160/160 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0]
RANDOM walk for 578 steps (0 resets) in 5 ms. (96 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0]
[2024-06-01 08:51:28] [INFO ] Invariant cache hit.
[2024-06-01 08:51:28] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:51:29] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2024-06-01 08:51:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 08:51:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 08:51:29] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-06-01 08:51:29] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 08:51:29] [INFO ] Added : 124 causal constraints over 25 iterations in 500 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 146 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 1780 reset in 615 ms.
Product exploration explored 100000 steps with 1762 reset in 474 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0]
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Graph (trivial) has 141 edges and 90 vertex of which 41 / 90 are part of one of the 1 SCC in 0 ms
Free SCC test removed 40 places
Ensure Unique test removed 75 transitions
Reduce isomorphic transitions removed 75 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 50 transition count 85
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 20 place count 50 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 20 place count 50 transition count 76
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 50 transition count 76
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 49 transition count 75
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 49 transition count 75
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 43 place count 49 transition count 75
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 59 place count 49 transition count 59
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 76 place count 32 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 3 with 17 rules applied. Total rules applied 93 place count 32 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 94 place count 32 transition count 41
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 94 rules in 22 ms. Remains 32 /90 variables (removed 58) and now considering 41/160 (removed 119) transitions.
[2024-06-01 08:51:31] [INFO ] Redundant transitions in 0 ms returned []
Running 31 sub problems to find dead transitions.
// Phase 1: matrix 41 rows 32 cols
[2024-06-01 08:51:31] [INFO ] Computed 1 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 1/32 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 31 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD34 is UNSAT
At refinement iteration 3 (OVERLAPS) 40/72 variables, 32/33 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/72 variables, 0/33 constraints. Problems are: Problem set: 13 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/73 variables, and 33 constraints, problems are : Problem set: 13 solved, 18 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 31/31 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 14/32 variables, 1/1 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 40/72 variables, 32/33 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 18/51 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/72 variables, 0/51 constraints. Problems are: Problem set: 13 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/72 variables, 0/51 constraints. Problems are: Problem set: 13 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/73 variables, and 51 constraints, problems are : Problem set: 13 solved, 18 unsolved in 327 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 32/32 constraints, PredecessorRefiner: 18/31 constraints, Known Traps: 0/0 constraints]
After SMT, in 818ms problems are : Problem set: 13 solved, 18 unsolved
Search for dead transitions found 13 dead transitions in 819ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 32/90 places, 28/160 transitions.
Graph (complete) has 28 edges and 32 vertex of which 19 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.2 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 19 /32 variables (removed 13) and now considering 28/28 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/90 places, 28/160 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 857 ms. Remains : 19/90 places, 28/160 transitions.
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 160/160 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-06-01 08:51:32] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 08:51:32] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-01 08:51:32] [INFO ] Invariant cache hit.
[2024-06-01 08:51:32] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Running 124 sub problems to find dead transitions.
[2024-06-01 08:51:32] [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 3953 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 2618 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 6593ms problems are : Problem set: 0 solved, 124 unsolved
Search for dead transitions found 0 dead transitions in 6596ms
Finished structural reductions in LTL mode , in 1 iterations and 6771 ms. Remains : 90/90 places, 160/160 transitions.
Treatment of property BART-COL-040-LTLFireability-14 finished in 23279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&F(p0))))'
Support contains 88 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 202/202 transitions.
Graph (trivial) has 44 edges and 132 vertex of which 6 / 132 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 127 transition count 196
Reduce places removed 1 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 10 rules applied. Total rules applied 12 place count 126 transition count 187
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 21 place count 117 transition count 187
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 21 place count 117 transition count 185
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 25 place count 115 transition count 185
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 30 place count 110 transition count 180
Iterating global reduction 3 with 5 rules applied. Total rules applied 35 place count 110 transition count 180
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 38 place count 107 transition count 177
Iterating global reduction 3 with 3 rules applied. Total rules applied 41 place count 107 transition count 177
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 44 place count 104 transition count 174
Iterating global reduction 3 with 3 rules applied. Total rules applied 47 place count 104 transition count 174
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 50 place count 101 transition count 171
Iterating global reduction 3 with 3 rules applied. Total rules applied 53 place count 101 transition count 171
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 55 place count 99 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 57 place count 99 transition count 169
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 59 place count 97 transition count 167
Iterating global reduction 3 with 2 rules applied. Total rules applied 61 place count 97 transition count 167
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 62 place count 96 transition count 166
Iterating global reduction 3 with 1 rules applied. Total rules applied 63 place count 96 transition count 166
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 89 transition count 159
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 89 transition count 158
Applied a total of 78 rules in 31 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-06-01 08:51:39] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:51:39] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 08:51:39] [INFO ] Invariant cache hit.
[2024-06-01 08:51:39] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-06-01 08:51:39] [INFO ] Redundant transitions in 1 ms returned []
Running 122 sub problems to find dead transitions.
[2024-06-01 08:51:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (OVERLAPS) 0/246 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/247 variables, and 90 constraints, problems are : Problem set: 0 solved, 122 unsolved in 3876 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 122 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 1 (OVERLAPS) 1/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 3 (OVERLAPS) 157/246 variables, 89/90 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/246 variables, 122/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
At refinement iteration 6 (OVERLAPS) 0/246 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 122 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/247 variables, and 212 constraints, problems are : Problem set: 0 solved, 122 unsolved in 2976 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 89/89 constraints, PredecessorRefiner: 122/122 constraints, Known Traps: 0/0 constraints]
After SMT, in 6882ms problems are : Problem set: 0 solved, 122 unsolved
Search for dead transitions found 0 dead transitions in 6885ms
Starting structural reductions in SI_LTL mode, iteration 1 : 89/132 places, 158/202 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7107 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BART-COL-040-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-15 finished in 7221 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&&(!p1 U p2)))))'
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)))'
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((G(p1)||G(!p1)||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(X(F(!p0))))'
Found a Shortening insensitive property : BART-COL-040-LTLFireability-14
Stuttering acceptance computed with spot in 141 ms :[p0, p0, p0]
Support contains 9 out of 132 places. Attempting structural reductions.
Starting structural reductions in LI_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 1 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
Applied a total of 172 rules in 12 ms. Remains 19 /132 variables (removed 113) and now considering 29/202 (removed 173) transitions.
// Phase 1: matrix 29 rows 19 cols
[2024-06-01 08:51:47] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 08:51:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-06-01 08:51:47] [INFO ] Invariant cache hit.
[2024-06-01 08:51:47] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
Running 18 sub problems to find dead transitions.
[2024-06-01 08:51:47] [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) 28/47 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 0/47 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/48 variables, and 20 constraints, problems are : Problem set: 0 solved, 18 unsolved in 275 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) 28/47 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/47 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 0/47 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/48 variables, and 38 constraints, problems are : Problem set: 0 solved, 18 unsolved in 245 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 559ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 560ms
Starting structural reductions in LI_LTL mode, iteration 1 : 19/132 places, 29/202 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 672 ms. Remains : 19/132 places, 29/202 transitions.
Running random walk in product with property : BART-COL-040-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
Treatment of property BART-COL-040-LTLFireability-14 finished in 992 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-06-01 08:51:48] [INFO ] Flatten gal took : 38 ms
[2024-06-01 08:51:48] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 15 ms.
[2024-06-01 08:51:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 132 places, 202 transitions and 404 arcs took 14 ms.
Total runtime 178833 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : BART-COL-040-LTLFireability-05
Could not compute solution for formula : BART-COL-040-LTLFireability-06
Could not compute solution for formula : BART-COL-040-LTLFireability-11
FORMULA BART-COL-040-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717231909440

--------------------
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-040-LTLFireability-05
ltl formula formula --ltl=/tmp/1771/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( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.020 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_0_
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
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:
*** 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(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
malloc_consolidate(): unaligned fastbin chunk detected
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:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BART-COL-040-LTLFireability-06
ltl formula formula --ltl=/tmp/1771/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
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( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_1_
pnml2lts-mc( 3/ 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:
malloc_consolidate(): invalid chunk size
*** 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
ltl formula name BART-COL-040-LTLFireability-11
ltl formula formula --ltl=/tmp/1771/ltl_2_
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
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
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_2_
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:
malloc_consolidate(): unaligned fastbin chunk detected
pnml2lts-mc( 2/ 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:
malloc_consolidate(): unaligned fastbin chunk detected
ltl formula name BART-COL-040-LTLFireability-14
ltl formula formula --ltl=/tmp/1771/ltl_3_
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
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
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1771/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1771/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1771/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1771/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 134 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 133, there are 205 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~131!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 142
pnml2lts-mc( 0/ 4): unique states count: 685
pnml2lts-mc( 0/ 4): unique transitions count: 7354
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 688
pnml2lts-mc( 0/ 4): - cum. max stack depth: 557
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 688 states 7466 transitions, fanout: 10.852
pnml2lts-mc( 0/ 4): Total exploration time 0.090 sec (0.090 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7644, Transitions per second: 82956
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.2MB, 27.1 B/state, compr.: 5.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 202 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.2MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-COL-040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="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-040, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r468-smll-171620167700420"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BART-COL-040.tgz
mv BART-COL-040 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.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 ;