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.r395-smll-171683824300253.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 SmartHome-PT-09, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r395-smll-171683824300253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 03:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 12 03:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Apr 12 03:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 64K May 18 16:43 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 SmartHome-PT-09-LTLFireability-00
FORMULA_NAME SmartHome-PT-09-LTLFireability-01
FORMULA_NAME SmartHome-PT-09-LTLFireability-02
FORMULA_NAME SmartHome-PT-09-LTLFireability-03
FORMULA_NAME SmartHome-PT-09-LTLFireability-04
FORMULA_NAME SmartHome-PT-09-LTLFireability-05
FORMULA_NAME SmartHome-PT-09-LTLFireability-06
FORMULA_NAME SmartHome-PT-09-LTLFireability-07
FORMULA_NAME SmartHome-PT-09-LTLFireability-08
FORMULA_NAME SmartHome-PT-09-LTLFireability-09
FORMULA_NAME SmartHome-PT-09-LTLFireability-10
FORMULA_NAME SmartHome-PT-09-LTLFireability-11
FORMULA_NAME SmartHome-PT-09-LTLFireability-12
FORMULA_NAME SmartHome-PT-09-LTLFireability-13
FORMULA_NAME SmartHome-PT-09-LTLFireability-14
FORMULA_NAME SmartHome-PT-09-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716978714276

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=SmartHome-PT-09
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 10:31:57] [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-29 10:31:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 10:31:57] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-29 10:31:57] [INFO ] Transformed 253 places.
[2024-05-29 10:31:57] [INFO ] Transformed 293 transitions.
[2024-05-29 10:31:57] [INFO ] Found NUPN structural information;
[2024-05-29 10:31:57] [INFO ] Parsed PT model containing 253 places and 293 transitions and 664 arcs in 284 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 29 places in 7 ms
Reduce places removed 29 places and 30 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA SmartHome-PT-09-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmartHome-PT-09-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 224 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 263/263 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 217 transition count 263
Discarding 52 places :
Symmetric choice reduction at 1 with 52 rule applications. Total rules 59 place count 165 transition count 211
Iterating global reduction 1 with 52 rules applied. Total rules applied 111 place count 165 transition count 211
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 116 place count 165 transition count 206
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 128 place count 153 transition count 194
Iterating global reduction 2 with 12 rules applied. Total rules applied 140 place count 153 transition count 194
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 151 place count 142 transition count 183
Iterating global reduction 2 with 11 rules applied. Total rules applied 162 place count 142 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 163 place count 142 transition count 182
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 167 place count 138 transition count 178
Iterating global reduction 3 with 4 rules applied. Total rules applied 171 place count 138 transition count 178
Applied a total of 171 rules in 120 ms. Remains 138 /224 variables (removed 86) and now considering 178/263 (removed 85) transitions.
// Phase 1: matrix 178 rows 138 cols
[2024-05-29 10:31:58] [INFO ] Computed 3 invariants in 9 ms
[2024-05-29 10:31:58] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 10:31:58] [INFO ] Invariant cache hit.
[2024-05-29 10:31:58] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2024-05-29 10:31:58] [INFO ] Invariant cache hit.
[2024-05-29 10:31:59] [INFO ] Dead Transitions using invariants and state equation in 218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/224 places, 178/263 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 959 ms. Remains : 138/224 places, 178/263 transitions.
Support contains 24 out of 138 places after structural reductions.
[2024-05-29 10:31:59] [INFO ] Flatten gal took : 76 ms
[2024-05-29 10:31:59] [INFO ] Flatten gal took : 31 ms
[2024-05-29 10:31:59] [INFO ] Input system was already deterministic with 178 transitions.
Incomplete random walk after 10000 steps, including 64 resets, run finished after 568 ms. (steps per millisecond=17 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 10:32:00] [INFO ] Invariant cache hit.
[2024-05-29 10:32:00] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-29 10:32:00] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-29 10:32:00] [INFO ] After 220ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 10:32:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-29 10:32:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-29 10:32:00] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 10:32:00] [INFO ] After 130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 26 ms.
[2024-05-29 10:32:00] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 178/178 transitions.
Graph (trivial) has 135 edges and 138 vertex of which 67 / 138 are part of one of the 6 SCC in 3 ms
Free SCC test removed 61 places
Drop transitions removed 91 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 93 transitions.
Graph (complete) has 122 edges and 77 vertex of which 70 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 70 transition count 59
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 22 rules applied. Total rules applied 45 place count 50 transition count 57
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 47 place count 49 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 48 place count 48 transition count 56
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 48 place count 48 transition count 51
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 58 place count 43 transition count 51
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 62 place count 39 transition count 47
Iterating global reduction 4 with 4 rules applied. Total rules applied 66 place count 39 transition count 47
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 39 transition count 46
Performed 19 Post agglomeration using F-continuation condition with reduction of 3 identical transitions.
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 105 place count 20 transition count 24
Drop transitions removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 30 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Iterating post reduction 5 with 11 rules applied. Total rules applied 116 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 116 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 118 place count 15 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 119 place count 14 transition count 11
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 6 rules applied. Total rules applied 125 place count 11 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 127 place count 9 transition count 8
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 3 Pre rules applied. Total rules applied 127 place count 9 transition count 5
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 8 with 7 rules applied. Total rules applied 134 place count 5 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 134 place count 5 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 136 place count 4 transition count 4
Applied a total of 136 rules in 34 ms. Remains 4 /138 variables (removed 134) and now considering 4/178 (removed 174) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 4/138 places, 4/178 transitions.
Finished random walk after 3 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 33 stabilizing places and 33 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' '!((!p0 U (G(!p0)||(!p0&&((X(p1)&&F(p2))||X(G(p1)))))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 168
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 22 place count 126 transition count 165
Iterating global reduction 1 with 3 rules applied. Total rules applied 25 place count 126 transition count 165
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 27 place count 124 transition count 163
Iterating global reduction 1 with 2 rules applied. Total rules applied 29 place count 124 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 123 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 123 transition count 162
Applied a total of 31 rules in 13 ms. Remains 123 /138 variables (removed 15) and now considering 162/178 (removed 16) transitions.
// Phase 1: matrix 162 rows 123 cols
[2024-05-29 10:32:01] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:32:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-29 10:32:01] [INFO ] Invariant cache hit.
[2024-05-29 10:32:01] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-29 10:32:01] [INFO ] Invariant cache hit.
[2024-05-29 10:32:01] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 123/138 places, 162/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 123/138 places, 162/178 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 404 ms :[p0, true, (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s27 1) (EQ s74 1)), p2:(EQ s27 1), p1:(NEQ s46 1)], 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][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 590 steps with 6 reset in 24 ms.
FORMULA SmartHome-PT-09-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-03 finished in 947 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(((!p0 U (G(!p0)||(!p0&&G(p1))))||(X(X(G(!p1)))&&p2))))'
Support contains 5 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 168
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 123 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 122 transition count 161
Applied a total of 33 rules in 14 ms. Remains 122 /138 variables (removed 16) and now considering 161/178 (removed 17) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-29 10:32:01] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:32:02] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 10:32:02] [INFO ] Invariant cache hit.
[2024-05-29 10:32:02] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
[2024-05-29 10:32:02] [INFO ] Invariant cache hit.
[2024-05-29 10:32:02] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/138 places, 161/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 301 ms. Remains : 122/138 places, 161/178 transitions.
Stuttering acceptance computed with spot in 339 ms :[(OR (AND p0 (NOT p2)) (AND p0 p1)), (OR p1 (AND p0 (NOT p2))), true, p0, (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR (AND p0 (NOT p2)) (AND p0 p1)), (OR p1 p0), (OR p1 (AND p0 (NOT p2)))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 6}, { cond=p2, acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 p0), acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p2) p0) (AND p1 p0)), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=5 dest: 7}], [{ cond=(OR p1 p0), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 6}], [{ cond=(OR (AND (NOT p2) p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (EQ s22 1) (EQ s100 1)), p0:(AND (EQ s2 1) (EQ s46 1)), p1:(NEQ s84 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 32 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-05 finished in 669 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 U X(p1)))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 130 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 130 transition count 169
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 128 transition count 167
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 128 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 127 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 127 transition count 166
Applied a total of 23 rules in 16 ms. Remains 127 /138 variables (removed 11) and now considering 166/178 (removed 12) transitions.
// Phase 1: matrix 166 rows 127 cols
[2024-05-29 10:32:02] [INFO ] Computed 3 invariants in 5 ms
[2024-05-29 10:32:02] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-29 10:32:02] [INFO ] Invariant cache hit.
[2024-05-29 10:32:03] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 409 ms to find 0 implicit places.
[2024-05-29 10:32:03] [INFO ] Invariant cache hit.
[2024-05-29 10:32:03] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/138 places, 166/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 605 ms. Remains : 127/138 places, 166/178 transitions.
Stuttering acceptance computed with spot in 318 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s117 1), p1:(OR (EQ s106 1) (NEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33515 reset in 493 ms.
Product exploration explored 100000 steps with 33540 reset in 445 ms.
Computed a total of 29 stabilizing places and 29 stable transitions
Computed a total of 29 stabilizing places and 29 stable transitions
Detected a total of 29/127 stabilizing places and 29/166 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 233 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3069 steps, including 22 resets, run visited all 5 properties in 89 ms. (steps per millisecond=34 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F p0), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 10 factoid took 570 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 127 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 127/127 places, 166/166 transitions.
Graph (trivial) has 124 edges and 127 vertex of which 63 / 127 are part of one of the 6 SCC in 1 ms
Free SCC test removed 57 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 69 transition count 67
Reduce places removed 19 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 50 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 48 transition count 64
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 44 place count 48 transition count 59
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 54 place count 43 transition count 59
Performed 15 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 84 place count 28 transition count 43
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 93 place count 28 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 27 transition count 34
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 95 place count 27 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 97 place count 25 transition count 32
Applied a total of 97 rules in 34 ms. Remains 25 /127 variables (removed 102) and now considering 32/166 (removed 134) transitions.
[2024-05-29 10:32:05] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
// Phase 1: matrix 27 rows 25 cols
[2024-05-29 10:32:05] [INFO ] Computed 2 invariants in 2 ms
[2024-05-29 10:32:05] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 10:32:05] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-29 10:32:05] [INFO ] Invariant cache hit.
[2024-05-29 10:32:06] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2024-05-29 10:32:06] [INFO ] Redundant transitions in 37 ms returned []
[2024-05-29 10:32:06] [INFO ] Flow matrix only has 27 transitions (discarded 5 similar events)
[2024-05-29 10:32:06] [INFO ] Invariant cache hit.
[2024-05-29 10:32:06] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/127 places, 32/166 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 239 ms. Remains : 25/127 places, 32/166 transitions.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Detected a total of 20/25 stabilizing places and 20/32 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 9 factoid took 472 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 3195 steps, including 257 resets, run visited all 5 properties in 30 ms. (steps per millisecond=106 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (OR p1 p0)), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p0 (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 9 factoid took 639 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering criterion allowed to conclude after 26 steps with 6 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-06 finished in 5358 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' '!(((p0||(p1&&X(p2))) U X(G(!p0))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 130 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 130 transition count 170
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 17 place count 130 transition count 169
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 20 place count 127 transition count 166
Iterating global reduction 1 with 3 rules applied. Total rules applied 23 place count 127 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 125 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 124 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 124 transition count 163
Applied a total of 29 rules in 21 ms. Remains 124 /138 variables (removed 14) and now considering 163/178 (removed 15) transitions.
// Phase 1: matrix 163 rows 124 cols
[2024-05-29 10:32:07] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:32:08] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-29 10:32:08] [INFO ] Invariant cache hit.
[2024-05-29 10:32:08] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-29 10:32:08] [INFO ] Invariant cache hit.
[2024-05-29 10:32:08] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/138 places, 163/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 433 ms. Remains : 124/138 places, 163/178 transitions.
Stuttering acceptance computed with spot in 183 ms :[p0, (AND p0 (NOT p2)), p0, true]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(EQ s43 1), p1:(EQ s94 1), p2:(EQ s71 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 185 steps with 1 reset in 2 ms.
FORMULA SmartHome-PT-09-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-07 finished in 646 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 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 168
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 168
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 128 transition count 167
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 24 place count 125 transition count 164
Iterating global reduction 1 with 3 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 123 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 123 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 122 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 122 transition count 161
Applied a total of 33 rules in 22 ms. Remains 122 /138 variables (removed 16) and now considering 161/178 (removed 17) transitions.
// Phase 1: matrix 161 rows 122 cols
[2024-05-29 10:32:08] [INFO ] Computed 3 invariants in 2 ms
[2024-05-29 10:32:08] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-29 10:32:08] [INFO ] Invariant cache hit.
[2024-05-29 10:32:08] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-29 10:32:08] [INFO ] Invariant cache hit.
[2024-05-29 10:32:09] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 122/138 places, 161/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 517 ms. Remains : 122/138 places, 161/178 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT 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:(EQ s20 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]]
Stuttering criterion allowed to conclude after 277 steps with 2 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-10 finished in 687 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(p0)||X((F(p1)&&G(F(p0))))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 130 transition count 170
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 130 transition count 170
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 128 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 128 transition count 168
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 126 transition count 166
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 126 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 165
Applied a total of 26 rules in 32 ms. Remains 125 /138 variables (removed 13) and now considering 165/178 (removed 13) transitions.
// Phase 1: matrix 165 rows 125 cols
[2024-05-29 10:32:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 10:32:09] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-29 10:32:09] [INFO ] Invariant cache hit.
[2024-05-29 10:32:09] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-29 10:32:09] [INFO ] Invariant cache hit.
[2024-05-29 10:32:09] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/138 places, 165/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 125/138 places, 165/178 transitions.
Stuttering acceptance computed with spot in 360 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}, { cond=true, acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s4 1), p1:(EQ s50 1)], 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][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 198 steps with 1 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-11 finished in 693 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((p0||G(F(p1)))))'
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 127 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 127 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 25 place count 125 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 27 place count 125 transition count 164
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 124 transition count 163
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 124 transition count 163
Applied a total of 29 rules in 10 ms. Remains 124 /138 variables (removed 14) and now considering 163/178 (removed 15) transitions.
// Phase 1: matrix 163 rows 124 cols
[2024-05-29 10:32:09] [INFO ] Computed 3 invariants in 3 ms
[2024-05-29 10:32:10] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 10:32:10] [INFO ] Invariant cache hit.
[2024-05-29 10:32:10] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2024-05-29 10:32:10] [INFO ] Invariant cache hit.
[2024-05-29 10:32:10] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/138 places, 163/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 124/138 places, 163/178 transitions.
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s78 0), p1:(EQ s50 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 140 ms.
Product exploration explored 100000 steps with 50000 reset in 148 ms.
Computed a total of 28 stabilizing places and 28 stable transitions
Computed a total of 28 stabilizing places and 28 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 20 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SmartHome-PT-09-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SmartHome-PT-09-LTLFireability-13 finished in 810 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)) U p1) U p2))'
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Graph (trivial) has 130 edges and 138 vertex of which 57 / 138 are part of one of the 5 SCC in 0 ms
Free SCC test removed 52 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 25 place count 85 transition count 85
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 26 rules applied. Total rules applied 51 place count 61 transition count 83
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 53 place count 60 transition count 82
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 54 place count 59 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 54 place count 59 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 66 place count 53 transition count 76
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 70 place count 49 transition count 72
Iterating global reduction 4 with 4 rules applied. Total rules applied 74 place count 49 transition count 72
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 75 place count 49 transition count 71
Performed 21 Post agglomeration using F-continuation condition with reduction of 6 identical transitions.
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 5 with 42 rules applied. Total rules applied 117 place count 28 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 118 place count 28 transition count 43
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 6 with 10 rules applied. Total rules applied 128 place count 28 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 130 place count 26 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 130 place count 26 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 132 place count 25 transition count 32
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 133 place count 25 transition count 32
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 134 place count 24 transition count 31
Applied a total of 134 rules in 24 ms. Remains 24 /138 variables (removed 114) and now considering 31/178 (removed 147) transitions.
[2024-05-29 10:32:10] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
// Phase 1: matrix 27 rows 24 cols
[2024-05-29 10:32:10] [INFO ] Computed 1 invariants in 0 ms
[2024-05-29 10:32:10] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-29 10:32:10] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-29 10:32:10] [INFO ] Invariant cache hit.
[2024-05-29 10:32:10] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2024-05-29 10:32:10] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-29 10:32:10] [INFO ] Flow matrix only has 27 transitions (discarded 4 similar events)
[2024-05-29 10:32:10] [INFO ] Invariant cache hit.
[2024-05-29 10:32:10] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/138 places, 31/178 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 177 ms. Remains : 24/138 places, 31/178 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s15 1), p1:(AND (EQ s5 1) (EQ s12 1)), p0:(AND (EQ s15 1) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA SmartHome-PT-09-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-14 finished in 345 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(F((X(G(p1))&&p0))))'
Support contains 3 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 178/178 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 129 transition count 169
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 129 transition count 169
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 129 transition count 168
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 127 transition count 166
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 127 transition count 166
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 126 transition count 165
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 126 transition count 165
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 125 transition count 164
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 125 transition count 164
Applied a total of 27 rules in 8 ms. Remains 125 /138 variables (removed 13) and now considering 164/178 (removed 14) transitions.
// Phase 1: matrix 164 rows 125 cols
[2024-05-29 10:32:11] [INFO ] Computed 3 invariants in 1 ms
[2024-05-29 10:32:11] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-29 10:32:11] [INFO ] Invariant cache hit.
[2024-05-29 10:32:11] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-29 10:32:11] [INFO ] Invariant cache hit.
[2024-05-29 10:32:11] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/138 places, 164/178 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 298 ms. Remains : 125/138 places, 164/178 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SmartHome-PT-09-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s85 0) (EQ s86 1)), p1:(EQ s54 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]]
Stuttering criterion allowed to conclude after 196 steps with 0 reset in 1 ms.
FORMULA SmartHome-PT-09-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SmartHome-PT-09-LTLFireability-15 finished in 431 ms.
All properties solved by simple procedures.
Total runtime 14182 ms.

BK_STOP 1716978732460

--------------------
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="SmartHome-PT-09"
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 SmartHome-PT-09, 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 r395-smll-171683824300253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmartHome-PT-09.tgz
mv SmartHome-PT-09 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 ;