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.r417-tall-171690556100257.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 Sudoku-COL-AN01, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556100257
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.6K Apr 12 10:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Apr 12 10:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 12 10:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 12 10:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 08:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 08:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Apr 12 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 10:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 10:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 08:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 6.5K 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 Sudoku-COL-AN01-LTLCardinality-00
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-01
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-02
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-03
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-04
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-05
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-06
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-07
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-08
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-09
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-10
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-11
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-12
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-13
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-14
FORMULA_NAME Sudoku-COL-AN01-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717132152058

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Sudoku-COL-AN01
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-31 05:09:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 05:09:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 05:09:13] [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-31 05:09:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-31 05:09:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 601 ms
[2024-05-31 05:09:14] [INFO ] Imported 4 HL places and 1 HL transitions for a total of 4 PT places and 1.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
[2024-05-31 05:09:14] [INFO ] Built PT skeleton of HLPN with 4 places and 1 transitions 4 arcs in 6 ms.
[2024-05-31 05:09:14] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Sudoku-COL-AN01-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 20) seen :7
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 1 rows 4 cols
[2024-05-31 05:09:17] [INFO ] Computed 3 invariants in 5 ms
[2024-05-31 05:09:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:09:17] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:10
[2024-05-31 05:09:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 05:09:17] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :0
Fused 13 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 13 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-COL-AN01-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 05:09:17] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-05-31 05:09:17] [INFO ] Flatten gal took : 11 ms
FORMULA Sudoku-COL-AN01-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-COL-AN01-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 05:09:17] [INFO ] Flatten gal took : 0 ms
[2024-05-31 05:09:17] [INFO ] Unfolded HLPN to a Petri net with 4 places and 1 transitions 4 arcs in 3 ms.
[2024-05-31 05:09:17] [INFO ] Unfolded 3 HLPN properties in 1 ms.
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 3 transition count 1
Applied a total of 1 rules in 5 ms. Remains 3 /4 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 3 cols
[2024-05-31 05:09:17] [INFO ] Computed 2 invariants in 0 ms
[2024-05-31 05:09:17] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 05:09:17] [INFO ] Invariant cache hit.
[2024-05-31 05:09:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-31 05:09:17] [INFO ] Invariant cache hit.
[2024-05-31 05:09:17] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 3/4 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60 ms. Remains : 3/4 places, 1/1 transitions.
Support contains 3 out of 3 places after structural reductions.
[2024-05-31 05:09:17] [INFO ] Flatten gal took : 1 ms
[2024-05-31 05:09:17] [INFO ] Flatten gal took : 1 ms
[2024-05-31 05:09:17] [INFO ] Input system was already deterministic with 1 transitions.
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:09:17] [INFO ] Invariant cache hit.
[2024-05-31 05:09:17] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2024-05-31 05:09:17] [INFO ] After 124ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
Computed a total of 3 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 3 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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(X((p0 U X(X(G(p1))))))))'
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2 transition count 1
Applied a total of 1 rules in 0 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 2 cols
[2024-05-31 05:09:17] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 05:09:17] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-31 05:09:17] [INFO ] Invariant cache hit.
[2024-05-31 05:09:17] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-31 05:09:17] [INFO ] Invariant cache hit.
[2024-05-31 05:09:17] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/3 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 2/3 places, 1/1 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 341 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(LEQ s0 s1), p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 150 ms.
Product exploration explored 100000 steps with 50000 reset in 98 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 10 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 5000 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 5000 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-31 05:09:18] [INFO ] Invariant cache hit.
[2024-05-31 05:09:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 05:09:18] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-31 05:09:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 05:09:18] [INFO ] After 21ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), true, (F (G p1)), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 7 states, 10 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-31 05:09:19] [INFO ] Invariant cache hit.
[2024-05-31 05:09:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:09:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:09:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 05:09:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:19] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-31 05:09:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:09:19] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-31 05:09:19] [INFO ] Invariant cache hit.
[2024-05-31 05:09:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 05:09:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:19] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:09:19] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:09:19] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-31 05:09:19] [INFO ] Invariant cache hit.
[2024-05-31 05:09:19] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 05:09:19] [INFO ] Invariant cache hit.
[2024-05-31 05:09:19] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-31 05:09:19] [INFO ] Invariant cache hit.
[2024-05-31 05:09:19] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 2/2 places, 1/1 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 98 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), true, (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
[2024-05-31 05:09:20] [INFO ] Invariant cache hit.
[2024-05-31 05:09:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 05:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:09:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 05:09:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-31 05:09:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:20] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-31 05:09:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:09:20] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p1)
[2024-05-31 05:09:20] [INFO ] Invariant cache hit.
[2024-05-31 05:09:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-31 05:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:20] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:09:20] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:09:20] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Applying partial POR strategy [false, false, true, false, false, false, true]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Support contains 2 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 1/1 transitions.
Applied a total of 0 rules in 4 ms. Remains 2 /2 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-31 05:09:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:09:21] [INFO ] Invariant cache hit.
[2024-05-31 05:09:21] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 38 ms. Remains : 2/2 places, 1/1 transitions.
Built C files in :
/tmp/ltsmin7056723943896413514
[2024-05-31 05:09:21] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7056723943896413514
Running compilation step : cd /tmp/ltsmin7056723943896413514;'/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 133 ms.
Running link step : cd /tmp/ltsmin7056723943896413514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7056723943896413514;'/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/stateBased7075527624828693681.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA Sudoku-COL-AN01-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN01-LTLCardinality-01 finished in 4184 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)||G(p1))))'
Support contains 2 out of 3 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 4 ms. Remains 2 /3 variables (removed 1) and now considering 1/1 (removed 0) transitions.
[2024-05-31 05:09:21] [INFO ] Invariant cache hit.
[2024-05-31 05:09:21] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 05:09:21] [INFO ] Invariant cache hit.
[2024-05-31 05:09:21] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-31 05:09:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:09:21] [INFO ] Invariant cache hit.
[2024-05-31 05:09:21] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 72 ms. Remains : 2/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s1 s0), p1:(GT 1 s1)], nbAcceptance=2, 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 Sudoku-COL-AN01-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-COL-AN01-LTLCardinality-02 finished in 117 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)))'
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3/3 places, 1/1 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 1 transition count 1
Applied a total of 2 rules in 0 ms. Remains 1 /3 variables (removed 2) and now considering 1/1 (removed 0) transitions.
// Phase 1: matrix 1 rows 1 cols
[2024-05-31 05:09:22] [INFO ] Computed 0 invariants in 0 ms
[2024-05-31 05:09:22] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-31 05:09:22] [INFO ] Invariant cache hit.
[2024-05-31 05:09:22] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-05-31 05:09:22] [INFO ] Invariant cache hit.
[2024-05-31 05:09:22] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1/3 places, 1/1 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 1/3 places, 1/1 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Sudoku-COL-AN01-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s0)], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 70 ms.
Product exploration explored 100000 steps with 50000 reset in 72 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 91 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
[2024-05-31 05:09:22] [INFO ] Invariant cache hit.
[2024-05-31 05:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:22] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:09:22] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-31 05:09:22] [INFO ] Added : 0 causal constraints over 0 iterations in 1 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 0 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-31 05:09:22] [INFO ] Invariant cache hit.
[2024-05-31 05:09:22] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-31 05:09:22] [INFO ] Invariant cache hit.
[2024-05-31 05:09:22] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-31 05:09:22] [INFO ] Invariant cache hit.
[2024-05-31 05:09:22] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 1/1 places, 1/1 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1 transition count 1
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 89 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X p0), true, (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
[2024-05-31 05:09:23] [INFO ] Invariant cache hit.
[2024-05-31 05:09:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 05:09:23] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-31 05:09:23] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-31 05:09:23] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 32 ms.
Product exploration explored 100000 steps with 50000 reset in 38 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 1 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1/1 places, 1/1 transitions.
Applied a total of 0 rules in 1 ms. Remains 1 /1 variables (removed 0) and now considering 1/1 (removed 0) transitions.
[2024-05-31 05:09:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-31 05:09:23] [INFO ] Invariant cache hit.
[2024-05-31 05:09:23] [INFO ] Dead Transitions using invariants and state equation in 14 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 19 ms. Remains : 1/1 places, 1/1 transitions.
Built C files in :
/tmp/ltsmin12520556571439576842
[2024-05-31 05:09:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12520556571439576842
Running compilation step : cd /tmp/ltsmin12520556571439576842;'/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 50 ms.
Running link step : cd /tmp/ltsmin12520556571439576842;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 23 ms.
Running LTSmin : cd /tmp/ltsmin12520556571439576842;'/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/stateBased15755030953958944646.hoa' '--buchi-type=spotba'
LTSmin run took 172 ms.
FORMULA Sudoku-COL-AN01-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Sudoku-COL-AN01-LTLCardinality-10 finished in 1850 ms.
All properties solved by simple procedures.
Total runtime 10417 ms.

BK_STOP 1717132165384

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Sudoku-COL-AN01"
export BK_EXAMINATION="LTLCardinality"
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 Sudoku-COL-AN01, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r417-tall-171690556100257"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-COL-AN01.tgz
mv Sudoku-COL-AN01 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;