fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r096-smll-165260575700051
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for FlexibleBarrier-PT-10a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
271.203 15750.00 26485.00 243.10 FFTFTFTFFFTFFFTF normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 340K
-rw-r--r-- 1 mcc users 6.6K Apr 29 13:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 29 13:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 29 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 94K May 10 09:33 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 FlexibleBarrier-PT-10a-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652618307260

Running Version 202205111006
[2022-05-15 12:38:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-15 12:38:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 12:38:29] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2022-05-15 12:38:29] [INFO ] Transformed 123 places.
[2022-05-15 12:38:29] [INFO ] Transformed 334 transitions.
[2022-05-15 12:38:29] [INFO ] Found NUPN structural information;
[2022-05-15 12:38:29] [INFO ] Parsed PT model containing 123 places and 334 transitions in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 82 transitions
Reduce redundant transitions removed 82 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 252/252 transitions.
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 123 transition count 242
Applied a total of 10 rules in 29 ms. Remains 123 /123 variables (removed 0) and now considering 242/252 (removed 10) transitions.
// Phase 1: matrix 242 rows 123 cols
[2022-05-15 12:38:30] [INFO ] Computed 12 place invariants in 17 ms
[2022-05-15 12:38:30] [INFO ] Implicit Places using invariants in 486 ms returned [121, 122]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 533 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 121/123 places, 242/252 transitions.
Applied a total of 0 rules in 15 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 121/123 places, 242/252 transitions.
Support contains 28 out of 121 places after structural reductions.
[2022-05-15 12:38:30] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-15 12:38:30] [INFO ] Flatten gal took : 74 ms
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-15 12:38:30] [INFO ] Flatten gal took : 33 ms
[2022-05-15 12:38:30] [INFO ] Input system was already deterministic with 242 transitions.
Support contains 26 out of 121 places (down from 28) after GAL structural reductions.
Finished random walk after 378 steps, including 0 resets, run visited all 15 properties in 100 ms. (steps per millisecond=3 )
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(!X(p0))) U p1))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Applied a total of 0 rules in 10 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:31] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 12:38:31] [INFO ] Implicit Places using invariants in 170 ms returned []
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:31] [INFO ] Computed 10 place invariants in 5 ms
[2022-05-15 12:38:31] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 440 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:31] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 12:38:32] [INFO ] Dead Transitions using invariants and state equation in 323 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 242/242 transitions.
Stuttering acceptance computed with spot in 414 ms :[(NOT p1), (OR (NOT p1) p0), p0, true]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s86 1), p0:(OR (EQ s87 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-03 finished in 1303 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Graph (trivial) has 155 edges and 121 vertex of which 109 / 121 are part of one of the 11 SCC in 5 ms
Free SCC test removed 98 places
Ensure Unique test removed 160 transitions
Reduce isomorphic transitions removed 160 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 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 68 rules applied. Total rules applied 69 place count 14 transition count 21
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 73 place count 11 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 10 transition count 20
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 75 place count 9 transition count 18
Iterating global reduction 3 with 1 rules applied. Total rules applied 76 place count 9 transition count 18
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 3 rules applied. Total rules applied 79 place count 9 transition count 15
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 81 place count 7 transition count 15
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 5 with 2 rules applied. Total rules applied 83 place count 6 transition count 14
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 84 place count 6 transition count 13
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 90 place count 6 transition count 7
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 6 with 2 rules applied. Total rules applied 92 place count 6 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 94 place count 4 transition count 5
Applied a total of 94 rules in 44 ms. Remains 4 /121 variables (removed 117) and now considering 5/242 (removed 237) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:32] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-15 12:38:32] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:32] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2022-05-15 12:38:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:32] [INFO ] Computed 2 place invariants in 6 ms
[2022-05-15 12:38:32] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/121 places, 5/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/121 places, 5/242 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-09 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 s0 0) (NEQ s2 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 FlexibleBarrier-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-09 finished in 234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(p0)))))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Applied a total of 0 rules in 6 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:32] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 12:38:32] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:32] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 12:38:33] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:33] [INFO ] Computed 10 place invariants in 3 ms
[2022-05-15 12:38:33] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 242/242 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(OR (EQ s79 0) (EQ s2 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, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 20000 reset in 835 ms.
Product exploration explored 100000 steps with 20000 reset in 403 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=17 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 117 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Applied a total of 0 rules in 9 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:35] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 12:38:35] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:35] [INFO ] Computed 10 place invariants in 4 ms
[2022-05-15 12:38:36] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:36] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 12:38:36] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 242/242 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 262 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Finished random walk after 303 steps, including 0 resets, run visited all 1 properties in 9 ms. (steps per millisecond=33 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 6 states, 6 edges and 1 AP to 6 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 229 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Stuttering acceptance computed with spot in 238 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 581 ms.
Product exploration explored 100000 steps with 20000 reset in 504 ms.
Applying partial POR strategy [true, false, false, false, true, false]
Stuttering acceptance computed with spot in 234 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Graph (trivial) has 154 edges and 121 vertex of which 114 / 121 are part of one of the 10 SCC in 1 ms
Free SCC test removed 104 places
Ensure Unique test removed 176 transitions
Reduce isomorphic transitions removed 176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 17 transition count 66
Deduced a syphon composed of 2 places in 1 ms
Drop transitions removed 47 transitions
Redundant transition composition rules discarded 47 transitions
Iterating global reduction 1 with 47 rules applied. Total rules applied 50 place count 17 transition count 19
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 17 transition count 19
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 58 place count 10 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 65 place count 10 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 10 transition count 12
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 8 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 8 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 70 rules in 14 ms. Remains 8 /121 variables (removed 113) and now considering 10/242 (removed 232) transitions.
[2022-05-15 12:38:39] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 12:38:39] [INFO ] Flow matrix only has 8 transitions (discarded 2 similar events)
// Phase 1: matrix 8 rows 8 cols
[2022-05-15 12:38:39] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-15 12:38:39] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/121 places, 10/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 8/121 places, 10/242 transitions.
Product exploration explored 100000 steps with 20000 reset in 687 ms.
Product exploration explored 100000 steps with 20000 reset in 312 ms.
Built C files in :
/tmp/ltsmin4666048270918908781
[2022-05-15 12:38:40] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4666048270918908781
Running compilation step : cd /tmp/ltsmin4666048270918908781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 759 ms.
Running link step : cd /tmp/ltsmin4666048270918908781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4666048270918908781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1891481124907622591.hoa' '--buchi-type=spotba'
LTSmin run took 232 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-10 finished in 8576 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Graph (trivial) has 155 edges and 121 vertex of which 112 / 121 are part of one of the 14 SCC in 1 ms
Free SCC test removed 98 places
Ensure Unique test removed 166 transitions
Reduce isomorphic transitions removed 166 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 51 transitions
Reduce isomorphic transitions removed 51 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 14 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 64 place count 12 transition count 22
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 65 place count 11 transition count 20
Iterating global reduction 2 with 1 rules applied. Total rules applied 66 place count 11 transition count 20
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 11 transition count 18
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 70 place count 10 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 9 transition count 17
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 5 with 2 rules applied. Total rules applied 73 place count 8 transition count 16
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 79 place count 8 transition count 10
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 80 place count 8 transition count 9
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 82 place count 7 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 83 place count 6 transition count 8
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 84 place count 5 transition count 7
Iterating global reduction 8 with 1 rules applied. Total rules applied 85 place count 5 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 86 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 86 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 88 place count 4 transition count 5
Applied a total of 88 rules in 13 ms. Remains 4 /121 variables (removed 117) and now considering 5/242 (removed 237) transitions.
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:41] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:41] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2022-05-15 12:38:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 4 cols
[2022-05-15 12:38:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/121 places, 5/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/121 places, 5/242 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-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:(OR (EQ s2 0) (EQ s0 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 7 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-12 finished in 189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Graph (trivial) has 152 edges and 121 vertex of which 106 / 121 are part of one of the 12 SCC in 1 ms
Free SCC test removed 94 places
Ensure Unique test removed 154 transitions
Reduce isomorphic transitions removed 154 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 57 transitions
Reduce isomorphic transitions removed 57 transitions.
Graph (trivial) has 19 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
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 69 rules applied. Total rules applied 70 place count 17 transition count 27
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 14 transition count 26
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 76 place count 12 transition count 22
Iterating global reduction 2 with 2 rules applied. Total rules applied 78 place count 12 transition count 22
Ensure Unique test removed 2 transitions
Reduce isomorphic 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 2 with 5 rules applied. Total rules applied 83 place count 12 transition count 17
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 86 place count 9 transition count 17
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 4 with 2 rules applied. Total rules applied 88 place count 8 transition count 16
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 8 transition count 15
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 94 place count 8 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 2 rules applied. Total rules applied 96 place count 8 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 98 place count 6 transition count 8
Applied a total of 98 rules in 9 ms. Remains 6 /121 variables (removed 115) and now considering 8/242 (removed 234) transitions.
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 12:38:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:41] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 12:38:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:41] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2022-05-15 12:38:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 6 cols
[2022-05-15 12:38:41] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-15 12:38:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/121 places, 8/242 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/121 places, 8/242 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s4 1), p1:(OR (EQ s2 0) (EQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-13 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(!(G(F(p0))&&p1))) U G(p2))))'
Support contains 5 out of 121 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 121/121 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 121 /121 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 12:38:41] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-15 12:38:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
// Phase 1: matrix 242 rows 121 cols
[2022-05-15 12:38:42] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-15 12:38:42] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 121/121 places, 242/242 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p2), (NOT p2), (AND p1 p0)]
Running random walk in product with property : FlexibleBarrier-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s18 0) (EQ s101 1)), p1:(EQ s19 1), p0:(OR (EQ s22 0) (EQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 343 reset in 329 ms.
Stack based approach found an accepted trace after 8184 steps with 29 reset with depth 460 and stack size 454 in 32 ms.
FORMULA FlexibleBarrier-PT-10a-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-10a-LTLCardinality-15 finished in 1029 ms.
All properties solved by simple procedures.
Total runtime 13555 ms.

BK_STOP 1652618323010

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="FlexibleBarrier-PT-10a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is FlexibleBarrier-PT-10a, 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 r096-smll-165260575700051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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