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.r043-smll-171620180400263.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 gold2023
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 r043-smll-171620180400263
=====================================================================

--------------------
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 1716337354713

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-COL-040
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-22 00:22:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 00:22:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:22:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-22 00:22:38] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 00:22:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1105 ms
[2024-05-22 00:22:39] [INFO ] Detected 3 constant HL places corresponding to 10373 PT places.
[2024-05-22 00:22:39] [INFO ] Imported 4 HL places and 7 HL transitions for a total of 20213 PT places and 5.628918048E10 transition bindings in 93 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-22 00:22:39] [INFO ] Built PT skeleton of HLPN with 4 places and 7 transitions 26 arcs in 8 ms.
[2024-05-22 00:22:39] [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-05-22 00:22:39] [INFO ] Unfolded HLPN to a Petri net with 10619 places and 323 transitions 601 arcs in 399 ms.
[2024-05-22 00:22:39] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
[2024-05-22 00:22:39] [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 20 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 00:22:40] [INFO ] Computed 1 invariants in 21 ms
[2024-05-22 00:22:40] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 00:22:40] [INFO ] Invariant cache hit.
[2024-05-22 00:22:40] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-22 00:22:40] [INFO ] Invariant cache hit.
[2024-05-22 00:22:40] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 132/132 places, 202/202 transitions.
Support contains 132 out of 132 places after structural reductions.
[2024-05-22 00:22:41] [INFO ] Flatten gal took : 59 ms
[2024-05-22 00:22:41] [INFO ] Flatten gal took : 50 ms
[2024-05-22 00:22:41] [INFO ] Input system was already deterministic with 202 transitions.
Finished random walk after 247 steps, including 0 resets, run visited all 7 properties in 14 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 1 ms.
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.202304061127/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 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 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 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 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 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 26 ms. Remains 19 /132 variables (removed 113) and now considering 28/202 (removed 174) transitions.
// Phase 1: matrix 28 rows 19 cols
[2024-05-22 00:22:41] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 00:22:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 00:22:41] [INFO ] Invariant cache hit.
[2024-05-22 00:22:41] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-05-22 00:22:41] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:22:41] [INFO ] Invariant cache hit.
[2024-05-22 00:22:41] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
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 152 ms. Remains : 19/132 places, 28/202 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 265 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s2 1) (LT s17 1) (LT s16 1) (LT s15 1) (LT s14 1) (LT s7 1) (LT s8 1) (LT s9 1) (LT s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 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 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 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 40 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-05-22 00:22:42] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 00:22:42] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-22 00:22:42] [INFO ] Invariant cache hit.
[2024-05-22 00:22:42] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-22 00:22:42] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 00:22:42] [INFO ] Invariant cache hit.
[2024-05-22 00:22:42] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
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 336 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s79 1) (LT s38 1) (LT s83 1) (LT s42 1) (LT s87 1) (LT s46 1) (LT s50 1) (LT s54 1) (LT s58 1) (LT s3 1) (LT s62 1) (LT s7 1) (LT s11 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
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 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 22 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-05-22 00:22:42] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:22:42] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 00:22:42] [INFO ] Invariant cache hit.
[2024-05-22 00:22:42] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-22 00:22:42] [INFO ] Invariant cache hit.
[2024-05-22 00:22:42] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s42 1) (LT s88 1) (LT s87 1) (LT s86 1) (LT s85 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 85 steps with 0 reset in 4 ms.
FORMULA BART-COL-040-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-02 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 2 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 00:22:43] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:22:43] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-22 00:22:43] [INFO ] Invariant cache hit.
[2024-05-22 00:22:43] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2024-05-22 00:22:43] [INFO ] Invariant cache hit.
[2024-05-22 00:22:43] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 409 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 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}], [{ cond=(OR p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 1}]], initial=4, aps=[p0:(AND (LT s42 1) (LT s111 1) (LT s110 1) (LT s109 1) (LT s108 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1)), p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
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 821 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 31 ms. Remains 109 /132 variables (removed 23) and now considering 179/202 (removed 23) transitions.
// Phase 1: matrix 179 rows 109 cols
[2024-05-22 00:22:43] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:22:44] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-22 00:22:44] [INFO ] Invariant cache hit.
[2024-05-22 00:22:44] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2024-05-22 00:22:44] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-22 00:22:44] [INFO ] Invariant cache hit.
[2024-05-22 00:22:44] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
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 569 ms. Remains : 109/132 places, 179/202 transitions.
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : BART-COL-040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 (NOT p1))), acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s1 1), p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s91 1) (GEQ s12 1) (GEQ s89 1) (GEQ s14 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 653 reset in 1005 ms.
Product exploration explored 100000 steps with 662 reset in 720 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 (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (OR (AND (NOT p2) p1) (NOT p0))))]
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))))]
Knowledge based reduction with 9 factoid took 331 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 119 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 206 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1))))), (X (OR (AND (NOT p2) p1) (NOT p0))), (X (AND (NOT p2) p1)), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (OR (AND p2 p0) (AND p0 (NOT p1)))))), (X (X (OR (AND (NOT p2) p1) (NOT p0))))]
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)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (OR (AND (NOT p1) p0) (AND p2 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0))))]
Knowledge based reduction with 9 factoid took 490 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 103 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-05-22 00:22:47] [INFO ] Invariant cache hit.
[2024-05-22 00:22:48] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:22:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:48] [INFO ] [Real]Absence check using state equation in 103 ms returned sat
[2024-05-22 00:22:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:22:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:49] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-05-22 00:22:49] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 36 ms.
[2024-05-22 00:22:50] [INFO ] Added : 143 causal constraints over 29 iterations in 1051 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
[2024-05-22 00:22:50] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:22:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:50] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-22 00:22:50] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 18 ms.
[2024-05-22 00:22:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:22:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:50] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-22 00:22:50] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-22 00:22:50] [INFO ] Added : 103 causal constraints over 21 iterations in 310 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 4 ms. Remains 109 /109 variables (removed 0) and now considering 179/179 (removed 0) transitions.
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
[2024-05-22 00:22:50] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
[2024-05-22 00:22:50] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2024-05-22 00:22:50] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-22 00:22:50] [INFO ] Invariant cache hit.
[2024-05-22 00:22:51] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 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 (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (AND p1 (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 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 9 factoid took 314 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 114 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Finished random walk after 288 steps, including 0 resets, run visited all 5 properties in 6 ms. (steps per millisecond=48 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND (NOT p1) p0) (AND p2 p0)))), (X (OR (AND p1 (NOT p2)) (NOT p0))), (X (AND p1 (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 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (OR (AND (NOT p1) p0) (AND p2 p0))), (F (AND (NOT p1) (NOT p2) p0)), (F (NOT (OR (AND p1 (NOT p2)) (NOT p0))))]
Knowledge based reduction with 9 factoid took 717 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 99 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
[2024-05-22 00:22:52] [INFO ] Invariant cache hit.
[2024-05-22 00:22:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-22 00:22:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:52] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2024-05-22 00:22:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:22:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:52] [INFO ] [Nat]Absence check using state equation in 83 ms returned sat
[2024-05-22 00:22:52] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-22 00:22:53] [INFO ] Added : 143 causal constraints over 29 iterations in 429 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-22 00:22:53] [INFO ] Invariant cache hit.
[2024-05-22 00:22:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 00:22:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:53] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-22 00:22:53] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-22 00:22:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:22:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:22:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:22:53] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-22 00:22:53] [INFO ] Computed and/alt/rep : 143/247/143 causal constraints (skipped 0 transitions) in 24 ms.
[2024-05-22 00:22:54] [INFO ] Added : 103 causal constraints over 21 iterations in 377 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 633 reset in 722 ms.
Product exploration explored 100000 steps with 662 reset in 450 ms.
Built C files in :
/tmp/ltsmin4456915054200260311
[2024-05-22 00:22:55] [INFO ] Computing symmetric may disable matrix : 179 transitions.
[2024-05-22 00:22:55] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:22:55] [INFO ] Computing symmetric may enable matrix : 179 transitions.
[2024-05-22 00:22:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:22:55] [INFO ] Computing Do-Not-Accords matrix : 179 transitions.
[2024-05-22 00:22:55] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:22:55] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4456915054200260311
Running compilation step : cd /tmp/ltsmin4456915054200260311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 617 ms.
Running link step : cd /tmp/ltsmin4456915054200260311;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin4456915054200260311;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased561300113545865347.hoa' '--buchi-type=spotba'
LTSmin run took 887 ms.
FORMULA BART-COL-040-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-05 finished in 13159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 8 ms. Remains 126 /132 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 126 cols
[2024-05-22 00:22:57] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:22:57] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 00:22:57] [INFO ] Invariant cache hit.
[2024-05-22 00:22:57] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-22 00:22:57] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 00:22:57] [INFO ] Invariant cache hit.
[2024-05-22 00:22:57] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
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 296 ms. Remains : 126/132 places, 196/202 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s95 1) (GEQ s48 1) (GEQ s99 1) (GEQ s52 1) (GEQ s103 1) (GEQ s56 1) (GEQ s60 1) (GEQ s64 1) (GEQ s68 1) (GEQ s7 1) (GEQ s72 1) (GEQ s11 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 218 reset in 560 ms.
Product exploration explored 100000 steps with 230 reset in 588 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 308 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 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 287 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=143 )
Parikh walk visited 0 properties in 0 ms.
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 189 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 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 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 5 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-22 00:22:59] [INFO ] Invariant cache hit.
[2024-05-22 00:22:59] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-22 00:22:59] [INFO ] Invariant cache hit.
[2024-05-22 00:22:59] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-22 00:22:59] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-22 00:22:59] [INFO ] Invariant cache hit.
[2024-05-22 00:22:59] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 375 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 195 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 101 ms :[(NOT p0), (NOT p0)]
Finished random walk after 205 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
Parikh walk visited 0 properties in 0 ms.
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 273 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 92 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 212 reset in 582 ms.
Product exploration explored 100000 steps with 237 reset in 461 ms.
Built C files in :
/tmp/ltsmin11813597409897013161
[2024-05-22 00:23:01] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2024-05-22 00:23:01] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:01] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2024-05-22 00:23:01] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:01] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2024-05-22 00:23:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:01] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11813597409897013161
Running compilation step : cd /tmp/ltsmin11813597409897013161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 616 ms.
Running link step : cd /tmp/ltsmin11813597409897013161;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11813597409897013161;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased869804084979176292.hoa' '--buchi-type=spotba'
LTSmin run took 1169 ms.
FORMULA BART-COL-040-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-06 finished in 6522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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-05-22 00:23:03] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:23:03] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 00:23:03] [INFO ] Invariant cache hit.
[2024-05-22 00:23:03] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-05-22 00:23:03] [INFO ] Invariant cache hit.
[2024-05-22 00:23:03] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR p2 p0), p2, p2]
Running random walk in product with property : BART-COL-040-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (LT s42 1) (LT s111 1) (LT s110 1) (LT s109 1) (LT s108 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1)), p1:(OR (NOT (OR (GEQ s98 1) (GEQ s49 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1395 ms.
Product exploration explored 100000 steps with 0 reset in 1241 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge based reduction with 14 factoid took 1467 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(OR p2 p0), p2, p2]
Incomplete random walk after 10034 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=139 ) properties (out of 12) seen :10
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 209 ms. (steps per millisecond=47 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 00:23:08] [INFO ] Invariant cache hit.
[2024-05-22 00:23:08] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))), (F (NOT (AND p0 p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 2849 ms. Reduced automaton from 3 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR p2 p0), p2, p2]
Stuttering acceptance computed with spot in 189 ms :[(OR p2 p0), p2, p2]
[2024-05-22 00:23:12] [INFO ] Invariant cache hit.
[2024-05-22 00:23:12] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-22 00:23:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:23:12] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-05-22 00:23:12] [INFO ] Solution in real domain found non-integer solution.
Proved EG p2
[2024-05-22 00:23:12] [INFO ] Invariant cache hit.
[2024-05-22 00:23:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-22 00:23:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:23:13] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-05-22 00:23:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:23:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:23:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:23:13] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2024-05-22 00:23:13] [INFO ] Computed and/alt/rep : 166/270/166 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-22 00:23:13] [INFO ] Added : 126 causal constraints over 26 iterations in 557 ms. Result :sat
Could not prove EG p0
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2))), (G (NOT (AND (NOT p1) (NOT p0) p2)))]
False Knowledge obtained : [(X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))), (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (AND p0 p2)), (X (NOT (AND p0 p2))), (X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2)))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p0) p2)), (F (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2)))), (F (NOT (AND p0 p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (NOT (AND p1 p2))), (F (AND p1 (NOT p2))), (G p2)]
Property proved to be false thanks to negative knowledge :(G p2)
Knowledge based reduction with 16 factoid took 2515 ms. Reduced automaton from 3 states, 13 edges and 3 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-COL-040-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-COL-040-LTLFireability-07 finished in 12833 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions 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 44 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-05-22 00:23:16] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:23:16] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-22 00:23:16] [INFO ] Invariant cache hit.
[2024-05-22 00:23:16] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-22 00:23:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:16] [INFO ] Invariant cache hit.
[2024-05-22 00:23:16] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
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 485 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s79 1) (LT s38 1) (LT s83 1) (LT s42 1) (LT s87 1) (LT s46 1) (LT s50 1) (LT s54 1) (LT s58 1) (LT s3 1) (LT s62 1) (LT s7 1) (LT s11 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
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 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 1 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 00:23:16] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 00:23:17] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 00:23:17] [INFO ] Invariant cache hit.
[2024-05-22 00:23:17] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-22 00:23:17] [INFO ] Invariant cache hit.
[2024-05-22 00:23:17] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 267 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 308 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 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}, { cond=(AND p0 p1), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1) (GEQ s4 1) (GEQ s6 1) (GEQ s8 1) (GEQ s10 1) (GEQ s114 1) (GEQ s12 1) (GEQ s112 1) (GEQ s14 1) (GEQ s118 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 27959 reset in 444 ms.
Entered a terminal (fully accepting) state of product in 73991 steps with 20983 reset in 369 ms.
FORMULA BART-COL-040-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-COL-040-LTLFireability-10 finished in 1417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 0 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 9 ms. Remains 126 /132 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 126 cols
[2024-05-22 00:23:18] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:23:18] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-22 00:23:18] [INFO ] Invariant cache hit.
[2024-05-22 00:23:18] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2024-05-22 00:23:18] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:23:18] [INFO ] Invariant cache hit.
[2024-05-22 00:23:18] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
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 291 ms. Remains : 126/132 places, 196/202 transitions.
Stuttering acceptance computed with spot in 75 ms :[false, false]
Running random walk in product with property : BART-COL-040-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={1} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s44 1) (GEQ s42 1) (GEQ s1 1) (GEQ s3 1) (GEQ s5 1) (GEQ s7 1) (GEQ s9 1) (GEQ s108 1) (GEQ s11 1) (GEQ s106 1) (GEQ s13 1) (GEQ s112 1) (GEQ ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 197 ms.
Product exploration explored 100000 steps with 0 reset in 408 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))))]
False Knowledge obtained : [(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)))))]
Knowledge based reduction with 3 factoid took 200 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 74 ms :[false, false]
Finished random walk after 82 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(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))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 248 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 73 ms :[false, false]
Stuttering acceptance computed with spot in 85 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 3 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-22 00:23:20] [INFO ] Invariant cache hit.
[2024-05-22 00:23:20] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-22 00:23:20] [INFO ] Invariant cache hit.
[2024-05-22 00:23:20] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-22 00:23:20] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 00:23:20] [INFO ] Invariant cache hit.
[2024-05-22 00:23:20] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 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 p0) p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 185 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 74 ms :[false, false]
Finished random walk after 82 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=82 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 253 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 79 ms :[false, false]
Stuttering acceptance computed with spot in 78 ms :[false, false]
Stuttering acceptance computed with spot in 73 ms :[false, false]
Product exploration explored 100000 steps with 1 reset in 188 ms.
Product exploration explored 100000 steps with 1 reset in 387 ms.
Built C files in :
/tmp/ltsmin6678251607257255643
[2024-05-22 00:23:21] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2024-05-22 00:23:21] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:21] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2024-05-22 00:23:21] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:21] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2024-05-22 00:23:21] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6678251607257255643
Running compilation step : cd /tmp/ltsmin6678251607257255643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 521 ms.
Running link step : cd /tmp/ltsmin6678251607257255643;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6678251607257255643;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11595763781085322551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
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 5 ms. Remains 126 /126 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-22 00:23:36] [INFO ] Invariant cache hit.
[2024-05-22 00:23:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-22 00:23:36] [INFO ] Invariant cache hit.
[2024-05-22 00:23:37] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-22 00:23:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:23:37] [INFO ] Invariant cache hit.
[2024-05-22 00:23:37] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 126/126 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin4091986813401461635
[2024-05-22 00:23:37] [INFO ] Computing symmetric may disable matrix : 196 transitions.
[2024-05-22 00:23:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:37] [INFO ] Computing symmetric may enable matrix : 196 transitions.
[2024-05-22 00:23:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:37] [INFO ] Computing Do-Not-Accords matrix : 196 transitions.
[2024-05-22 00:23:37] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:23:37] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4091986813401461635
Running compilation step : cd /tmp/ltsmin4091986813401461635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 536 ms.
Running link step : cd /tmp/ltsmin4091986813401461635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4091986813401461635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11176364239796414799.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 00:23:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:23:52] [INFO ] Flatten gal took : 13 ms
[2024-05-22 00:23:52] [INFO ] Time to serialize gal into /tmp/LTL17825071900271208635.gal : 4 ms
[2024-05-22 00:23:52] [INFO ] Time to serialize properties into /tmp/LTL14637736766887628504.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17825071900271208635.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10445683070828949041.hoa' '-atoms' '/tmp/LTL14637736766887628504.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14637736766887628504.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10445683070828949041.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 00:24:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 00:24:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 00:24:07] [INFO ] Time to serialize gal into /tmp/LTL14288773983983750509.gal : 2 ms
[2024-05-22 00:24:07] [INFO ] Time to serialize properties into /tmp/LTL11986932036749190486.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14288773983983750509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11986932036749190486.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_4...5443
Formula 0 simplified : G(F!"((((((((TrainState_151<1)&&(TrainState_94<1))&&((TrainState_155<1)&&(TrainState_98<1)))&&(((TrainState_159<1)&&(TrainState_102<...5432
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 00:24:22] [INFO ] Flatten gal took : 14 ms
[2024-05-22 00:24:22] [INFO ] Applying decomposition
[2024-05-22 00:24:22] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17961285091362746552.txt' '-o' '/tmp/graph17961285091362746552.bin' '-w' '/tmp/graph17961285091362746552.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17961285091362746552.bin' '-l' '-1' '-v' '-w' '/tmp/graph17961285091362746552.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:24:22] [INFO ] Decomposing Gal with order
[2024-05-22 00:24:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:24:22] [INFO ] Removed a total of 54 redundant transitions.
[2024-05-22 00:24:22] [INFO ] Flatten gal took : 49 ms
[2024-05-22 00:24:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 15 ms.
[2024-05-22 00:24:23] [INFO ] Time to serialize gal into /tmp/LTL14037550354413295351.gal : 10 ms
[2024-05-22 00:24:23] [INFO ] Time to serialize properties into /tmp/LTL3921806520600569799.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14037550354413295351.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3921806520600569799.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((i2.i0.u3.TrainState_90>=1)||(i2.i0.u3.TrainState_88>=1))||((i2.i0.u0.TrainState_43>=1)||(i2.i0.u1.TrainState_45>=1)))|...7810
Formula 0 simplified : G(F!"((((((((i7.i2.u37.TrainState_151<1)&&(i6.i1.u15.TrainState_94<1))&&((i8.i1.u40.TrainState_155<1)&&(i0.i0.u30.TrainState_98<1)))...7799
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16788436532803778698
[2024-05-22 00:24:38] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16788436532803778698
Running compilation step : cd /tmp/ltsmin16788436532803778698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 397 ms.
Running link step : cd /tmp/ltsmin16788436532803778698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin16788436532803778698;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||[](!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property BART-COL-040-LTLFireability-11 finished in 94852 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 3 ms. Remains 132 /132 variables (removed 0) and now considering 202/202 (removed 0) transitions.
// Phase 1: matrix 202 rows 132 cols
[2024-05-22 00:24:53] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 00:24:53] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 00:24:53] [INFO ] Invariant cache hit.
[2024-05-22 00:24:53] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-22 00:24:53] [INFO ] Invariant cache hit.
[2024-05-22 00:24:53] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 132/132 places, 202/202 transitions.
Stuttering acceptance computed with spot in 243 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 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(AND (LT s42 1) (LT s111 1) (LT s110 1) (LT s109 1) (LT s108 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1)), p1:(OR (GEQ s45 1) (GEQ s43 1) (GEQ s2 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 81 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 620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 20 ms. Remains 90 /132 variables (removed 42) and now considering 160/202 (removed 42) transitions.
// Phase 1: matrix 160 rows 90 cols
[2024-05-22 00:24:53] [INFO ] Computed 1 invariants in 2 ms
[2024-05-22 00:24:53] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-22 00:24:53] [INFO ] Invariant cache hit.
[2024-05-22 00:24:54] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-22 00:24:54] [INFO ] Invariant cache hit.
[2024-05-22 00:24:54] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/132 places, 160/202 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 357 ms. Remains : 90/132 places, 160/202 transitions.
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0]
Running random walk in product with property : BART-COL-040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (LT s42 1) (LT s88 1) (LT s87 1) (LT s86 1) (LT s85 1) (LT s77 1) (LT s78 1) (LT s79 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1742 reset in 343 ms.
Product exploration explored 100000 steps with 1718 reset in 364 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 161 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 150 ms :[p0, p0, p0]
Finished random walk after 247 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=123 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 183 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 145 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0]
[2024-05-22 00:24:55] [INFO ] Invariant cache hit.
[2024-05-22 00:24:55] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:24:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:56] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2024-05-22 00:24:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:24:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:24:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:56] [INFO ] [Nat]Absence check using state equation in 76 ms returned sat
[2024-05-22 00:24:56] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 13 ms.
[2024-05-22 00:24:56] [INFO ] Added : 92 causal constraints over 19 iterations in 396 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 5 ms. Remains 90 /90 variables (removed 0) and now considering 160/160 (removed 0) transitions.
[2024-05-22 00:24:56] [INFO ] Invariant cache hit.
[2024-05-22 00:24:56] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-22 00:24:56] [INFO ] Invariant cache hit.
[2024-05-22 00:24:56] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-22 00:24:56] [INFO ] Invariant cache hit.
[2024-05-22 00:24:57] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 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 149 ms :[p0, p0, p0]
Finished random walk after 165 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=165 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 145 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 123 ms :[p0, p0, p0]
Stuttering acceptance computed with spot in 210 ms :[p0, p0, p0]
[2024-05-22 00:24:57] [INFO ] Invariant cache hit.
[2024-05-22 00:24:57] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:58] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2024-05-22 00:24:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 00:24:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-22 00:24:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 00:24:58] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-22 00:24:58] [INFO ] Computed and/alt/rep : 124/228/124 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-22 00:24:58] [INFO ] Added : 92 causal constraints over 19 iterations in 355 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0]
Product exploration explored 100000 steps with 1801 reset in 342 ms.
Product exploration explored 100000 steps with 1807 reset in 359 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 159 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 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 12 ms. Remains 32 /90 variables (removed 58) and now considering 41/160 (removed 119) transitions.
[2024-05-22 00:24:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 41 rows 32 cols
[2024-05-22 00:24:59] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 00:24:59] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 32/90 places, 41/160 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 32/90 places, 41/160 transitions.
Built C files in :
/tmp/ltsmin1219155889256706651
[2024-05-22 00:24:59] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1219155889256706651
Running compilation step : cd /tmp/ltsmin1219155889256706651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 346 ms.
Running link step : cd /tmp/ltsmin1219155889256706651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin1219155889256706651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2641131624072609151.hoa' '--buchi-type=spotba'
LTSmin run took 1124 ms.
FORMULA BART-COL-040-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BART-COL-040-LTLFireability-14 finished in 7610 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/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 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 14 ms. Remains 89 /132 variables (removed 43) and now considering 158/202 (removed 44) transitions.
// Phase 1: matrix 158 rows 89 cols
[2024-05-22 00:25:01] [INFO ] Computed 1 invariants in 1 ms
[2024-05-22 00:25:01] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 00:25:01] [INFO ] Invariant cache hit.
[2024-05-22 00:25:01] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2024-05-22 00:25:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-22 00:25:01] [INFO ] Invariant cache hit.
[2024-05-22 00:25:01] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
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 303 ms. Remains : 89/132 places, 158/202 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0)]
Running random walk in product with property : BART-COL-040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s79 1) (LT s38 1) (LT s83 1) (LT s42 1) (LT s87 1) (LT s46 1) (LT s50 1) (LT s54 1) (LT s58 1) (LT s3 1) (LT s62 1) (LT s7 1) (LT s11 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
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 406 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||G(!p1)||p0))))'
[2024-05-22 00:25:02] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
[2024-05-22 00:25:02] [INFO ] Applying decomposition
[2024-05-22 00:25:02] [INFO ] Flatten gal took : 11 ms
Built C files in :
/tmp/ltsmin11336177966648306968
[2024-05-22 00:25:02] [INFO ] Computing symmetric may disable matrix : 202 transitions.
[2024-05-22 00:25:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:25:02] [INFO ] Computing symmetric may enable matrix : 202 transitions.
[2024-05-22 00:25:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:25:02] [INFO ] Computing Do-Not-Accords matrix : 202 transitions.
[2024-05-22 00:25:02] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:25:02] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11336177966648306968
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2958768914533918210.txt' '-o' '/tmp/graph2958768914533918210.bin' '-w' '/tmp/graph2958768914533918210.weights'
Running compilation step : cd /tmp/ltsmin11336177966648306968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2958768914533918210.bin' '-l' '-1' '-v' '-w' '/tmp/graph2958768914533918210.weights' '-q' '0' '-e' '0.001'
[2024-05-22 00:25:02] [INFO ] Decomposing Gal with order
[2024-05-22 00:25:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:25:02] [INFO ] Removed a total of 46 redundant transitions.
[2024-05-22 00:25:02] [INFO ] Flatten gal took : 28 ms
[2024-05-22 00:25:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 4 ms.
[2024-05-22 00:25:02] [INFO ] Time to serialize gal into /tmp/LTLFireability5465787412686033494.gal : 4 ms
[2024-05-22 00:25:02] [INFO ] Time to serialize properties into /tmp/LTLFireability9828607967057526855.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5465787412686033494.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9828607967057526855.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((i0.i1.u8.TrainState_90>=1)||(i0.i1.u8.TrainState_88>=1))||((i0.i0.u0.TrainState_43>=1)||(i0.i0.u1.TrainState_45>=1)))|...7362
Formula 0 simplified : G(F!"((((((((i3.i1.u25.TrainState_151<1)&&(i5.i0.u12.TrainState_94<1))&&((i9.i1.u27.TrainState_155<1)&&(i1.i2.u35.TrainState_98<1)))...7347
Compilation finished in 873 ms.
Running link step : cd /tmp/ltsmin11336177966648306968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11336177966648306968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||[](!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.007: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.030: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.030: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.036: Initializing POR dependencies: labels 204, guards 202
pins2lts-mc-linux64( 7/ 8), 0.040: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.040: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.160: LTL layer: formula: [](<>(([]((LTLAPp1==true))||[](!(LTLAPp1==true))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.160: "[](<>(([]((LTLAPp1==true))||[](!(LTLAPp1==true))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.160: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.529: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.548: There are 205 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.548: State length is 133, there are 210 groups
pins2lts-mc-linux64( 0/ 8), 0.548: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.548: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.548: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.548: Visible groups: 0 / 210, labels: 2 / 205
pins2lts-mc-linux64( 0/ 8), 0.548: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.548: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.936: [Blue] ~120 levels ~960 states ~18272 transitions
pins2lts-mc-linux64( 7/ 8), 1.060: [Blue] ~240 levels ~1920 states ~25560 transitions
pins2lts-mc-linux64( 3/ 8), 1.187: [Blue] ~479 levels ~3840 states ~41720 transitions
pins2lts-mc-linux64( 3/ 8), 1.397: [Blue] ~959 levels ~7680 states ~58608 transitions
pins2lts-mc-linux64( 3/ 8), 1.774: [Blue] ~1919 levels ~15360 states ~92016 transitions
pins2lts-mc-linux64( 3/ 8), 2.343: [Blue] ~3839 levels ~30720 states ~167224 transitions
pins2lts-mc-linux64( 3/ 8), 3.380: [Blue] ~7679 levels ~61440 states ~351272 transitions
pins2lts-mc-linux64( 3/ 8), 5.516: [Blue] ~15359 levels ~122880 states ~767160 transitions
pins2lts-mc-linux64( 3/ 8), 8.529: [Blue] ~30684 levels ~245760 states ~1648456 transitions
pins2lts-mc-linux64( 4/ 8), 13.340: [Blue] ~61403 levels ~491520 states ~3514752 transitions
pins2lts-mc-linux64( 4/ 8), 23.077: [Blue] ~122768 levels ~983040 states ~7025016 transitions
pins2lts-mc-linux64( 4/ 8), 42.745: [Blue] ~245528 levels ~1966080 states ~14191160 transitions
pins2lts-mc-linux64( 4/ 8), 84.234: [Blue] ~490977 levels ~3932160 states ~28863560 transitions
pins2lts-mc-linux64( 2/ 8), 168.413: [Blue] ~982684 levels ~7864320 states ~52002696 transitions
pins2lts-mc-linux64( 2/ 8), 340.728: [Blue] ~1965385 levels ~15728640 states ~105062288 transitions
pins2lts-mc-linux64( 4/ 8), 371.509: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 371.929:
pins2lts-mc-linux64( 0/ 8), 371.929: Explored 14686413 states 108213010 transitions, fanout: 7.368
pins2lts-mc-linux64( 0/ 8), 371.929: Total exploration time 371.340 sec (370.970 sec minimum, 371.099 sec on average)
pins2lts-mc-linux64( 0/ 8), 371.929: States per second: 39550, Transitions per second: 291412
pins2lts-mc-linux64( 0/ 8), 371.929:
pins2lts-mc-linux64( 0/ 8), 371.929: State space has 78814576 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 371.929: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 371.929: blue states: 14686413 (18.63%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 371.929: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 371.929: all-red states: 2033106 (2.58%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 371.929:
pins2lts-mc-linux64( 0/ 8), 371.929: Total memory used for local state coloring: 192.4MB
pins2lts-mc-linux64( 0/ 8), 371.929:
pins2lts-mc-linux64( 0/ 8), 371.929: Queue width: 8B, total height: 12611696, memory: 96.22MB
pins2lts-mc-linux64( 0/ 8), 371.929: Tree memory: 857.3MB, 11.4 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 371.929: Tree fill ratio (roots/leafs): 58.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 371.929: Stored 204 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 371.929: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 371.929: Est. total memory use: 953.5MB (~1120.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11336177966648306968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||[](!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin11336177966648306968;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(([]((LTLAPp1==true))||[](!(LTLAPp1==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-22 00:45:50] [INFO ] Applying decomposition
[2024-05-22 00:45:50] [INFO ] Flatten gal took : 10 ms
[2024-05-22 00:45:50] [INFO ] Decomposing Gal with order
[2024-05-22 00:45:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 00:45:50] [INFO ] Removed a total of 140 redundant transitions.
[2024-05-22 00:45:50] [INFO ] Flatten gal took : 30 ms
[2024-05-22 00:45:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-22 00:45:50] [INFO ] Time to serialize gal into /tmp/LTLFireability8454422730665429725.gal : 4 ms
[2024-05-22 00:45:50] [INFO ] Time to serialize properties into /tmp/LTLFireability4988210122615717941.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8454422730665429725.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4988210122615717941.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("(((((((trainidspeeddistance90.TrainState_90>=1)||(trainidspeeddistance88.TrainState_88>=1))||((trainidspeeddistance43.TrainSt...11085
Formula 0 simplified : G(F!"((((((((trainidspeeddistance151.TrainState_151<1)&&(trainidspeeddistance94.TrainState_94<1))&&((trainidspeeddistance155.TrainSt...11070
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-22 01:06:38] [INFO ] Flatten gal took : 9 ms
[2024-05-22 01:06:38] [INFO ] Input system was already deterministic with 202 transitions.
[2024-05-22 01:06:38] [INFO ] Transformed 132 places.
[2024-05-22 01:06:38] [INFO ] Transformed 202 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-22 01:06:38] [INFO ] Time to serialize gal into /tmp/LTLFireability4816572402609573406.gal : 4 ms
[2024-05-22 01:06:38] [INFO ] Time to serialize properties into /tmp/LTLFireability8646766766376282525.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4816572402609573406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8646766766376282525.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("(((((((TrainState_90>=1)||(TrainState_88>=1))||((TrainState_43>=1)||(TrainState_45>=1)))||(((TrainState_47>=1)||(TrainState_4...5358
Formula 0 simplified : G(F!"((((((((TrainState_151<1)&&(TrainState_94<1))&&((TrainState_155<1)&&(TrainState_98<1)))&&(((TrainState_159<1)&&(TrainState_102<...5343
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
34043 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,340.468,2435652,1,0,288,1.64799e+07,25,56,3404,1.18626e+07,613
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-COL-040-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Total runtime 2988700 ms.

BK_STOP 1716340347762

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BART-COL-040"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
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 r043-smll-171620180400263"
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 ;