Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r189-tall-171640617900463.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is HealthRecord-PT-06, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r189-tall-171640617900463
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 20:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 20:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 20:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 20:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1716474451165

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=HealthRecord-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
StableMarking PT
Running Version 202405141337
[2024-05-23 14:27:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2024-05-23 14:27:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 14:27:32] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-23 14:27:32] [INFO ] Transformed 154 places.
[2024-05-23 14:27:32] [INFO ] Transformed 319 transitions.
[2024-05-23 14:27:32] [INFO ] Found NUPN structural information;
[2024-05-23 14:27:32] [INFO ] Parsed PT model containing 154 places and 319 transitions and 835 arcs in 168 ms.
Graph (trivial) has 262 edges and 154 vertex of which 14 / 154 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Structural test allowed to assert that 34 places are NOT stable. Took 20 ms.
Ensure Unique test removed 32 transitions
Reduce redundant transitions removed 32 transitions.
[2024-05-23 14:27:32] [INFO ] Flatten gal took : 126 ms
[2024-05-23 14:27:33] [INFO ] Flatten gal took : 52 ms
[2024-05-23 14:27:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16773592671751325155.gal : 17 ms
[2024-05-23 14:27:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9855263909261315112.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16773592671751325155.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9855263909261315112.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (2876 resets) in 2044 ms. (19 steps per ms) remains 42/120 properties
Loading property file /tmp/ReachabilityCardinality9855263909261315112.prop.
BEST_FIRST walk for 4003 steps (32 resets) in 28 ms. (138 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 16 ms. (235 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (34 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (35 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
SDD proceeding with computation,120 properties remain. new max is 4
SDD size :1 after 3
BEST_FIRST walk for 4002 steps (34 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
SDD proceeding with computation,120 properties remain. new max is 8
SDD size :3 after 4
BEST_FIRST walk for 4004 steps (31 resets) in 19 ms. (200 steps per ms) remains 42/42 properties
SDD proceeding with computation,120 properties remain. new max is 16
SDD size :4 after 28
SDD proceeding with computation,120 properties remain. new max is 32
SDD size :28 after 1459
BEST_FIRST walk for 4002 steps (33 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (31 resets) in 15 ms. (250 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (32 resets) in 13 ms. (285 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 10 ms. (364 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (33 resets) in 10 ms. (363 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (32 resets) in 16 ms. (235 steps per ms) remains 39/41 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 19 ms. (200 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 23 ms. (166 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (31 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (30 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 24 ms. (160 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (34 resets) in 25 ms. (153 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (32 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (32 resets) in 16 ms. (235 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (33 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
Invariant property smplace_129 does not hold.
Invariant property smplace_125 does not hold.
Invariant property smplace_121 does not hold.
Invariant property smplace_117 does not hold.
Invariant property smplace_111 does not hold.
BEST_FIRST walk for 4004 steps (33 resets) in 10 ms. (364 steps per ms) remains 39/39 properties
Invariant property smplace_109 does not hold.
BEST_FIRST walk for 4004 steps (35 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 9 ms. (400 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 8 ms. (444 steps per ms) remains 39/39 properties
Invariant property smplace_107 does not hold.
BEST_FIRST walk for 4003 steps (35 resets) in 7 ms. (500 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (32 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (33 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
Invariant property smplace_13 does not hold.
BEST_FIRST walk for 4004 steps (30 resets) in 12 ms. (308 steps per ms) remains 39/39 properties
Invariant property smplace_12 does not hold.
Invariant property smplace_11 does not hold.
Invariant property smplace_10 does not hold.
Invariant property smplace_4 does not hold.
Invariant property smplace_3 does not hold.
Invariant property smplace_2 does not hold.
SDD proceeding with computation,106 properties remain. new max is 32
SDD size :1459 after 10207
[2024-05-23 14:27:33] [INFO ] Flow matrix only has 268 transitions (discarded 19 similar events)
// Phase 1: matrix 268 rows 147 cols
[2024-05-23 14:27:33] [INFO ] Computed 18 invariants in 11 ms
[2024-05-23 14:27:33] [INFO ] State equation strengthened by 1 read => feed constraints.
SDD proceeding with computation,106 properties remain. new max is 64
SDD size :10207 after 10936
SDD proceeding with computation,106 properties remain. new max is 128
SDD size :10936 after 12394
SDD proceeding with computation,106 properties remain. new max is 256
SDD size :12394 after 15310
SDD proceeding with computation,106 properties remain. new max is 512
SDD size :15310 after 19684
Invariant property smplace_133 does not hold.
Invariant property smplace_131 does not hold.
Invariant property smplace_120 does not hold.
Invariant property smplace_116 does not hold.
Invariant property smplace_90 does not hold.
Invariant property smplace_89 does not hold.
Invariant property smplace_56 does not hold.
Invariant property smplace_55 does not hold.
Invariant property smplace_54 does not hold.
Invariant property smplace_37 does not hold.
Invariant property smplace_36 does not hold.
Invariant property smplace_35 does not hold.
Invariant property smplace_15 does not hold.
SDD proceeding with computation,93 properties remain. new max is 512
SDD size :19684 after 65125
Invariant property smplace_128 does not hold.
Invariant property smplace_124 does not hold.
Invariant property smplace_92 does not hold.
Invariant property smplace_91 does not hold.
SDD proceeding with computation,89 properties remain. new max is 512
SDD size :65125 after 101089
Invariant property smplace_108 does not hold.
Invariant property smplace_106 does not hold.
Invariant property smplace_82 does not hold.
Invariant property smplace_81 does not hold.
SDD proceeding with computation,85 properties remain. new max is 512
SDD size :101089 after 134137
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Invariant property smplace_141 does not hold.
Invariant property smplace_140 does not hold.
Invariant property smplace_136 does not hold.
Invariant property smplace_135 does not hold.
Invariant property smplace_110 does not hold.
Invariant property smplace_96 does not hold.
Invariant property smplace_95 does not hold.
Invariant property smplace_83 does not hold.
Invariant property smplace_75 does not hold.
Invariant property smplace_74 does not hold.
SDD proceeding with computation,75 properties remain. new max is 512
SDD size :134137 after 186625
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Invariant property smplace_143 does not hold.
Invariant property smplace_130 does not hold.
Invariant property smplace_94 does not hold.
Invariant property smplace_76 does not hold.
Invariant property smplace_51 does not hold.
Invariant property smplace_50 does not hold.
Invariant property smplace_49 does not hold.
Invariant property smplace_48 does not hold.
Invariant property smplace_42 does not hold.
Invariant property smplace_41 does not hold.
Invariant property smplace_40 does not hold.
Invariant property smplace_32 does not hold.
Invariant property smplace_31 does not hold.
Invariant property smplace_30 does not hold.
Invariant property smplace_29 does not hold.
Invariant property smplace_23 does not hold.
Invariant property smplace_22 does not hold.
Invariant property smplace_21 does not hold.
SDD proceeding with computation,57 properties remain. new max is 512
SDD size :186625 after 452953
At refinement iteration 2 (OVERLAPS) 56/95 variables, 10/49 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Invariant property smplace_53 does not hold.
Invariant property smplace_34 does not hold.
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 56/105 constraints. Problems are: Problem set: 1 solved, 38 unsolved
SDD proceeding with computation,55 properties remain. new max is 512
SDD size :452953 after 543349
SDD proceeding with computation,55 properties remain. new max is 1024
SDD size :543349 after 672625
SDD proceeding with computation,55 properties remain. new max is 2048
SDD size :672625 after 885007
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 52/147 variables, 8/113 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 52/165 constraints. Problems are: Problem set: 1 solved, 38 unsolved
SDD proceeding with computation,55 properties remain. new max is 4096
SDD size :885007 after 1.59554e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 38 unsolved
SDD proceeding with computation,55 properties remain. new max is 8192
SDD size :1.59554e+06 after 2.50387e+06
At refinement iteration 8 (OVERLAPS) 267/414 variables, 147/312 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/414 variables, 0/312 constraints. Problems are: Problem set: 1 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 1/415 variables, 1/313 constraints. Problems are: Problem set: 1 solved, 38 unsolved
Invariant property smplace_119 does not hold.
Invariant property smplace_115 does not hold.
Invariant property smplace_113 does not hold.
At refinement iteration 11 (INCLUDED_ONLY) 0/415 variables, 0/313 constraints. Problems are: Problem set: 4 solved, 35 unsolved
Invariant property smplace_46 does not hold.
Invariant property smplace_45 does not hold.
Invariant property smplace_43 does not hold.
Invariant property smplace_27 does not hold.
Invariant property smplace_26 does not hold.
Invariant property smplace_24 does not hold.
Invariant property smplace_8 does not hold.
Invariant property smplace_7 does not hold.
Invariant property smplace_5 does not hold.
SDD proceeding with computation,43 properties remain. new max is 8192
SDD size :2.50387e+06 after 1.24465e+07
At refinement iteration 12 (OVERLAPS) 0/415 variables, 0/313 constraints. Problems are: Problem set: 13 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 415/415 variables, and 313 constraints, problems are : Problem set: 13 solved, 26 unsolved in 1520 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 59/85 variables, 10/36 constraints. Problems are: Problem set: 13 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/85 variables, 59/95 constraints. Problems are: Problem set: 13 solved, 26 unsolved
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 10 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
Invariant property smplace_127 does not hold.
Invariant property smplace_123 does not hold.
Invariant property smplace_112 does not hold.
Invariant property smplace_84 does not hold.
Invariant property smplace_47 does not hold.
Invariant property smplace_44 does not hold.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 40 places in 42 ms of which 1 ms to minimize.
Invariant property smplace_28 does not hold.
Invariant property smplace_25 does not hold.
Invariant property smplace_9 does not hold.
Invariant property smplace_6 does not hold.
SDD proceeding with computation,33 properties remain. new max is 8192
SDD size :1.24465e+07 after 2.37107e+07
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 2 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 3 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 40 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:27:35] [INFO ] Deduced a trap composed of 42 places in 60 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 17/112 constraints. Problems are: Problem set: 23 solved, 16 unsolved
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/113 constraints. Problems are: Problem set: 23 solved, 16 unsolved
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/114 constraints. Problems are: Problem set: 23 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/114 constraints. Problems are: Problem set: 23 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 62/147 variables, 8/122 constraints. Problems are: Problem set: 23 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/147 variables, 62/184 constraints. Problems are: Problem set: 23 solved, 16 unsolved
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 2 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 1 ms to minimize.
SDD proceeding with computation,33 properties remain. new max is 16384
SDD size :2.37107e+07 after 2.67268e+07
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 1 ms to minimize.
[2024-05-23 14:27:36] [INFO ] Deduced a trap composed of 38 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 40 places in 43 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 0 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/147 variables, 20/204 constraints. Problems are: Problem set: 23 solved, 16 unsolved
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 39 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 43 places in 56 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:27:37] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 4 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 49 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 43 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/147 variables, 14/218 constraints. Problems are: Problem set: 23 solved, 16 unsolved
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 2 ms to minimize.
Invariant property smplace_134 does not hold.
Invariant property smplace_114 does not hold.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
Invariant property smplace_85 does not hold.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 9 ms to minimize.
Invariant property smplace_52 does not hold.
Invariant property smplace_33 does not hold.
Invariant property smplace_14 does not hold.
SDD proceeding with computation,27 properties remain. new max is 16384
SDD size :2.67268e+07 after 3.53943e+07
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 57 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 39 places in 40 ms of which 1 ms to minimize.
[2024-05-23 14:27:38] [INFO ] Deduced a trap composed of 41 places in 45 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 41 places in 65 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 39 places in 44 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/147 variables, 16/234 constraints. Problems are: Problem set: 29 solved, 10 unsolved
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 39 places in 47 ms of which 1 ms to minimize.
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/147 variables, 2/236 constraints. Problems are: Problem set: 29 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/147 variables, 0/236 constraints. Problems are: Problem set: 29 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 267/414 variables, 147/383 constraints. Problems are: Problem set: 29 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/414 variables, 10/393 constraints. Problems are: Problem set: 29 solved, 10 unsolved
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 40 places in 46 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/414 variables, 1/394 constraints. Problems are: Problem set: 29 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/414 variables, 0/394 constraints. Problems are: Problem set: 29 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 1/415 variables, 1/395 constraints. Problems are: Problem set: 29 solved, 10 unsolved
[2024-05-23 14:27:39] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/415 variables, 1/396 constraints. Problems are: Problem set: 29 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/415 variables, 0/396 constraints. Problems are: Problem set: 29 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 415/415 variables, and 396 constraints, problems are : Problem set: 29 solved, 10 unsolved in 5017 ms.
Refiners :[Domain max(s): 147/147 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 147/147 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 10/39 constraints, Known Traps: 73/73 constraints]
After SMT, in 6616ms problems are : Problem set: 29 solved, 10 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 287/287 transitions.
Graph (complete) has 636 edges and 147 vertex of which 138 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 (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 138 transition count 261
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 14 rules applied. Total rules applied 32 place count 132 transition count 253
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 130 transition count 252
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 35 place count 130 transition count 248
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 46 place count 123 transition count 248
Discarding 68 places :
Symmetric choice reduction at 3 with 68 rule applications. Total rules 114 place count 55 transition count 112
Iterating global reduction 3 with 68 rules applied. Total rules applied 182 place count 55 transition count 112
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 189 place count 48 transition count 98
Iterating global reduction 3 with 7 rules applied. Total rules applied 196 place count 48 transition count 98
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 205 place count 48 transition count 89
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 213 place count 44 transition count 122
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 44 transition count 120
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 219 place count 44 transition count 116
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 223 place count 40 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 226 place count 40 transition count 113
Partial Free-agglomeration rule applied 17 times.
Drop transitions (Partial Free agglomeration) removed 17 transitions
Iterating global reduction 5 with 17 rules applied. Total rules applied 243 place count 40 transition count 113
Partial Free-agglomeration rule applied 16 times.
Drop transitions (Partial Free agglomeration) removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 259 place count 40 transition count 113
Applied a total of 259 rules in 57 ms. Remains 40 /147 variables (removed 107) and now considering 113/287 (removed 174) transitions.
Running 97 sub problems to find dead transitions.
[2024-05-23 14:27:40] [INFO ] Flow matrix only has 102 transitions (discarded 11 similar events)
// Phase 1: matrix 102 rows 40 cols
[2024-05-23 14:27:40] [INFO ] Computed 6 invariants in 1 ms
[2024-05-23 14:27:40] [INFO ] State equation strengthened by 27 read => feed constraints.
SDD proceeding with computation,27 properties remain. new max is 32768
SDD size :3.53943e+07 after 4.13757e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 1 (OVERLAPS) 2/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 97 unsolved
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
At refinement iteration 4 (OVERLAPS) 102/142 variables, 40/46 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 27/73 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/73 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/142 variables, 0/73 constraints. Problems are: Problem set: 17 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 142/142 variables, and 73 constraints, problems are : Problem set: 17 solved, 80 unsolved in 989 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 97/97 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 2/39 variables, 1/1 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 5/6 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/6 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 102/142 variables, 40/46 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 27/73 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 80/153 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/153 constraints. Problems are: Problem set: 17 solved, 80 unsolved
At refinement iteration 9 (OVERLAPS) 0/142 variables, 0/153 constraints. Problems are: Problem set: 17 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 142/142 variables, and 153 constraints, problems are : Problem set: 17 solved, 80 unsolved in 1626 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 40/40 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 80/97 constraints, Known Traps: 0/0 constraints]
After SMT, in 2753ms problems are : Problem set: 17 solved, 80 unsolved
Search for dead transitions found 17 dead transitions in 2757ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 17 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 40/147 places, 96/287 transitions.
Graph (complete) has 149 edges and 40 vertex of which 39 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 96
Applied a total of 2 rules in 6 ms. Remains 39 /40 variables (removed 1) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2839 ms. Remains : 39/147 places, 96/287 transitions.
Invariant property smplace_118 does not hold.
Invariant property smplace_86 does not hold.
SDD proceeding with computation,25 properties remain. new max is 32768
SDD size :4.13757e+07 after 4.72591e+07
Invariant property smplace_139 does not hold.
Invariant property smplace_138 does not hold.
Invariant property smplace_122 does not hold.
Invariant property smplace_87 does not hold.
Invariant property smplace_80 does not hold.
Invariant property smplace_73 does not hold.
Invariant property smplace_69 does not hold.
Invariant property smplace_65 does not hold.
Invariant property smplace_61 does not hold.
Invariant property smplace_57 does not hold.
Invariant property smplace_39 does not hold.
Invariant property smplace_20 does not hold.
Invariant property smplace_1 does not hold.
SDD proceeding with computation,12 properties remain. new max is 32768
SDD size :4.72591e+07 after 6.69406e+07
RANDOM walk for 3135784 steps (900899 resets) in 17528 ms. (178 steps per ms) remains 0/10 properties
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query StableMarking after proving 122 properties.
FORMULA StableMarking FALSE TECHNIQUES RANDOM_WALK MARKED_SUFFIX_TEST DECISION_DIAGRAMS TRIVIAL_UNMARKED_SCC_TEST COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL
Total runtime 17568 ms.

BK_STOP 1716474469877

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="HealthRecord-PT-06"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is HealthRecord-PT-06, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r189-tall-171640617900463"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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