Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r135-smll-167819414200363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DiscoveryGPU-PT-11a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-smll-167819414200363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 9.0K Feb 25 13:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 25 13:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 13:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Feb 25 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 13:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 13:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 13:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 25 13:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:00 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 39K Mar 5 18:22 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 DiscoveryGPU-PT-11a-LTLCardinality-00
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-01
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-02
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-03
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-04
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-05
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-06
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-07
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-08
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-09
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-10
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-11
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-12
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-13
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-14
FORMULA_NAME DiscoveryGPU-PT-11a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678323380438

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=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-11a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 00:56:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 00:56:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 00:56:24] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-09 00:56:24] [INFO ] Transformed 113 places.
[2023-03-09 00:56:24] [INFO ] Transformed 155 transitions.
[2023-03-09 00:56:24] [INFO ] Found NUPN structural information;
[2023-03-09 00:56:24] [INFO ] Parsed PT model containing 113 places and 155 transitions and 498 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 8 formulas.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 155/155 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 104 transition count 146
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 104 transition count 146
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 97 transition count 139
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 97 transition count 139
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 91 transition count 127
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 91 transition count 127
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 49 place count 91 transition count 122
Applied a total of 49 rules in 62 ms. Remains 91 /113 variables (removed 22) and now considering 122/155 (removed 33) transitions.
// Phase 1: matrix 122 rows 91 cols
[2023-03-09 00:56:24] [INFO ] Computed 2 place invariants in 23 ms
[2023-03-09 00:56:24] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-09 00:56:24] [INFO ] Invariant cache hit.
[2023-03-09 00:56:24] [INFO ] State equation strengthened by 81 read => feed constraints.
[2023-03-09 00:56:25] [INFO ] Implicit Places using invariants and state equation in 331 ms returned [90]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 763 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/113 places, 122/155 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 831 ms. Remains : 90/113 places, 122/155 transitions.
Support contains 15 out of 90 places after structural reductions.
[2023-03-09 00:56:25] [INFO ] Flatten gal took : 87 ms
[2023-03-09 00:56:25] [INFO ] Flatten gal took : 29 ms
[2023-03-09 00:56:25] [INFO ] Input system was already deterministic with 122 transitions.
Support contains 14 out of 90 places (down from 15) after GAL structural reductions.
Finished random walk after 481 steps, including 3 resets, run visited all 8 properties in 80 ms. (steps per millisecond=6 )
Computed a total of 13 stabilizing places and 12 stable transitions
Graph (complete) has 237 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 237 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 88 transition count 117
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 85 transition count 117
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 10 place count 82 transition count 114
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 82 transition count 114
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 57 place count 60 transition count 92
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 66 place count 51 transition count 74
Iterating global reduction 2 with 9 rules applied. Total rules applied 75 place count 51 transition count 74
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 84 place count 42 transition count 56
Iterating global reduction 2 with 9 rules applied. Total rules applied 93 place count 42 transition count 56
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 102 place count 33 transition count 47
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 33 transition count 47
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 120 place count 24 transition count 29
Iterating global reduction 2 with 9 rules applied. Total rules applied 129 place count 24 transition count 29
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 137 place count 16 transition count 21
Iterating global reduction 2 with 8 rules applied. Total rules applied 145 place count 16 transition count 21
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 146 place count 16 transition count 21
Applied a total of 146 rules in 61 ms. Remains 16 /90 variables (removed 74) and now considering 21/122 (removed 101) transitions.
[2023-03-09 00:56:26] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
// Phase 1: matrix 18 rows 16 cols
[2023-03-09 00:56:26] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-09 00:56:26] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-09 00:56:26] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2023-03-09 00:56:26] [INFO ] Invariant cache hit.
[2023-03-09 00:56:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-09 00:56:26] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2023-03-09 00:56:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:56:26] [INFO ] Flow matrix only has 18 transitions (discarded 3 similar events)
[2023-03-09 00:56:26] [INFO ] Invariant cache hit.
[2023-03-09 00:56:26] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/90 places, 21/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 16/90 places, 21/122 transitions.
Stuttering acceptance computed with spot in 295 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s7 0) (NEQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-00 finished in 695 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(p0))))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 86 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 86 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 83 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 83 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 114
Applied a total of 16 rules in 24 ms. Remains 82 /90 variables (removed 8) and now considering 114/122 (removed 8) transitions.
// Phase 1: matrix 114 rows 82 cols
[2023-03-09 00:56:26] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-09 00:56:26] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-09 00:56:26] [INFO ] Invariant cache hit.
[2023-03-09 00:56:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-09 00:56:27] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2023-03-09 00:56:27] [INFO ] Invariant cache hit.
[2023-03-09 00:56:27] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/90 places, 114/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 82/90 places, 114/122 transitions.
Stuttering acceptance computed with spot in 181 ms :[(NOT p0), true, (NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s14 0) (NEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-05 finished in 847 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 237 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 104 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (trivial) has 83 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 4 ms
Free SCC test removed 21 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 56 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 45 place count 46 transition count 79
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 55 place count 36 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 65 place count 36 transition count 59
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 73 place count 28 transition count 43
Iterating global reduction 2 with 8 rules applied. Total rules applied 81 place count 28 transition count 43
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 89 place count 20 transition count 27
Iterating global reduction 2 with 8 rules applied. Total rules applied 97 place count 20 transition count 27
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 105 place count 12 transition count 19
Iterating global reduction 2 with 8 rules applied. Total rules applied 113 place count 12 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 115 place count 11 transition count 18
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 117 place count 11 transition count 16
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 120 place count 8 transition count 13
Applied a total of 120 rules in 41 ms. Remains 8 /90 variables (removed 82) and now considering 13/122 (removed 109) transitions.
[2023-03-09 00:56:27] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
// Phase 1: matrix 10 rows 8 cols
[2023-03-09 00:56:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 00:56:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-09 00:56:27] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-09 00:56:27] [INFO ] Invariant cache hit.
[2023-03-09 00:56:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-09 00:56:27] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:56:27] [INFO ] Flow matrix only has 10 transitions (discarded 3 similar events)
[2023-03-09 00:56:27] [INFO ] Invariant cache hit.
[2023-03-09 00:56:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/90 places, 13/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154 ms. Remains : 8/90 places, 13/122 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s3 0) (NEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-06 finished in 278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U p1))))'
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 237 edges and 90 vertex of which 89 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 105 edges and 87 vertex of which 80 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Graph (trivial) has 85 edges and 80 vertex of which 40 / 80 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 60 transition count 102
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 46 place count 49 transition count 82
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 53 place count 42 transition count 68
Iterating global reduction 2 with 7 rules applied. Total rules applied 60 place count 42 transition count 68
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 35 transition count 54
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 35 transition count 54
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 81 place count 28 transition count 40
Iterating global reduction 2 with 7 rules applied. Total rules applied 88 place count 28 transition count 40
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 95 place count 21 transition count 33
Iterating global reduction 2 with 7 rules applied. Total rules applied 102 place count 21 transition count 33
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 110 place count 17 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 111 place count 17 transition count 28
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 115 place count 13 transition count 24
Applied a total of 115 rules in 25 ms. Remains 13 /90 variables (removed 77) and now considering 24/122 (removed 98) transitions.
[2023-03-09 00:56:27] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 13 cols
[2023-03-09 00:56:27] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 00:56:27] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-09 00:56:27] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2023-03-09 00:56:27] [INFO ] Invariant cache hit.
[2023-03-09 00:56:27] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-09 00:56:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 00:56:27] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
[2023-03-09 00:56:27] [INFO ] Invariant cache hit.
[2023-03-09 00:56:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/90 places, 24/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 13/90 places, 24/122 transitions.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s7 0) (EQ s1 1)), p0:(OR (EQ s0 0) (EQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 75 steps with 2 reset in 4 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-07 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 237 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 104 edges and 86 vertex of which 77 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Graph (trivial) has 85 edges and 77 vertex of which 42 / 77 are part of one of the 21 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 56 transition count 100
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 46 place count 46 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 47 place count 45 transition count 78
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 57 place count 35 transition count 58
Iterating global reduction 3 with 10 rules applied. Total rules applied 67 place count 35 transition count 58
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 77 place count 25 transition count 38
Iterating global reduction 3 with 10 rules applied. Total rules applied 87 place count 25 transition count 38
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 96 place count 16 transition count 20
Iterating global reduction 3 with 9 rules applied. Total rules applied 105 place count 16 transition count 20
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 114 place count 7 transition count 11
Iterating global reduction 3 with 9 rules applied. Total rules applied 123 place count 7 transition count 11
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 6 transition count 11
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 127 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 129 place count 4 transition count 7
Applied a total of 129 rules in 29 ms. Remains 4 /90 variables (removed 86) and now considering 7/122 (removed 115) transitions.
[2023-03-09 00:56:28] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2023-03-09 00:56:28] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 00:56:28] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-09 00:56:28] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2023-03-09 00:56:28] [INFO ] Invariant cache hit.
[2023-03-09 00:56:28] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-09 00:56:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:56:28] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
[2023-03-09 00:56:28] [INFO ] Invariant cache hit.
[2023-03-09 00:56:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/90 places, 7/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 4/90 places, 7/122 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-08 finished in 197 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(F((p0&&F((!p0||G(p1))))))))))'
Support contains 1 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 122/122 transitions.
Graph (complete) has 237 edges and 90 vertex of which 88 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 104 edges and 86 vertex of which 81 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Graph (trivial) has 87 edges and 81 vertex of which 42 / 81 are part of one of the 21 SCC in 1 ms
Free SCC test removed 21 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 60 transition count 103
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 47 place count 49 transition count 82
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 55 place count 41 transition count 66
Iterating global reduction 2 with 8 rules applied. Total rules applied 63 place count 41 transition count 66
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 71 place count 33 transition count 50
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 33 transition count 50
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 87 place count 25 transition count 34
Iterating global reduction 2 with 8 rules applied. Total rules applied 95 place count 25 transition count 34
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 103 place count 17 transition count 26
Iterating global reduction 2 with 8 rules applied. Total rules applied 111 place count 17 transition count 26
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 117 place count 14 transition count 23
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 118 place count 14 transition count 22
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 11 transition count 19
Applied a total of 121 rules in 33 ms. Remains 11 /90 variables (removed 79) and now considering 19/122 (removed 103) transitions.
[2023-03-09 00:56:28] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
// Phase 1: matrix 15 rows 11 cols
[2023-03-09 00:56:28] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-09 00:56:28] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-09 00:56:28] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-09 00:56:28] [INFO ] Invariant cache hit.
[2023-03-09 00:56:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-09 00:56:28] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 00:56:28] [INFO ] Flow matrix only has 15 transitions (discarded 4 similar events)
[2023-03-09 00:56:28] [INFO ] Invariant cache hit.
[2023-03-09 00:56:28] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/90 places, 19/122 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 147 ms. Remains : 11/90 places, 19/122 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DiscoveryGPU-PT-11a-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DiscoveryGPU-PT-11a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DiscoveryGPU-PT-11a-LTLCardinality-12 finished in 330 ms.
All properties solved by simple procedures.
Total runtime 4832 ms.
ITS solved all properties within timeout

BK_STOP 1678323389772

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="DiscoveryGPU-PT-11a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DiscoveryGPU-PT-11a, 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 r135-smll-167819414200363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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