Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r128-smll-174876524200278.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is MedleyA-PT-23, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-174876524200278
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 150K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-00
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-01
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-02
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-03
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-04
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-05
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-06
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-07
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-08
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-09
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-10
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-11
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-12
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-13
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-14
FORMULA_NAME MedleyA-PT-23-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748902877213

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-23
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 22:21:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 22:21:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 22:21:19] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2025-06-02 22:21:19] [INFO ] Transformed 378 places.
[2025-06-02 22:21:19] [INFO ] Transformed 614 transitions.
[2025-06-02 22:21:19] [INFO ] Found NUPN structural information;
[2025-06-02 22:21:19] [INFO ] Parsed PT model containing 378 places and 614 transitions and 1969 arcs in 380 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (44 resets) in 3070 ms. (13 steps per ms) remains 8/15 properties
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 22:21:21] [INFO ] Flatten gal took : 267 ms
BEST_FIRST walk for 40001 steps (55 resets) in 735 ms. (54 steps per ms) remains 6/8 properties
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 22:21:21] [INFO ] Flatten gal took : 208 ms
BEST_FIRST walk for 40001 steps (21 resets) in 662 ms. (60 steps per ms) remains 5/6 properties
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 22:21:21] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15311676404179837386.gal : 96 ms
BEST_FIRST walk for 40001 steps (39 resets) in 785 ms. (50 steps per ms) remains 4/5 properties
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2025-06-02 22:21:21] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7628516496889151183.prop : 3 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15311676404179837386.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7628516496889151183.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (49 resets) in 140 ms. (283 steps per ms) remains 4/4 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (19 resets) in 299 ms. (133 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality7628516496889151183.prop.
BEST_FIRST walk for 40003 steps (30 resets) in 167 ms. (238 steps per ms) remains 4/4 properties
// Phase 1: matrix 614 rows 378 cols
[2025-06-02 22:21:22] [INFO ] Computed 11 invariants in 39 ms
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :5 after 6
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :7 after 36
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :36 after 42
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :42 after 63
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :63 after 97
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :97 after 143
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :143 after 2593
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :2593 after 5498
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 77/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/77 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MedleyA-PT-23-ReachabilityCardinality-2025-15 is UNSAT
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 209/286 variables, 7/84 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :5498 after 168242
At refinement iteration 3 (INCLUDED_ONLY) 0/286 variables, 209/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 0/293 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/297 variables, 2/295 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/297 variables, 11/306 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/297 variables, 0/306 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 81/378 variables, 2/308 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 81/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/992 variables, 0/767 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/992 variables, 0/767 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 992/992 variables, and 767 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2540 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 68/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 215/283 variables, 7/75 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/283 variables, 215/290 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/283 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/294 variables, 2/292 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 11/303 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 0/303 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 84/378 variables, 2/305 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/378 variables, 84/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/378 variables, 0/389 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 614/992 variables, 378/767 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/992 variables, 2/769 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:26] [INFO ] Deduced a trap composed of 46 places in 169 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:26] [INFO ] Deduced a trap composed of 62 places in 247 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:27] [INFO ] Deduced a trap composed of 65 places in 217 ms of which 9 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/992 variables, 3/772 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:27] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 40 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/992 variables, 1/773 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:28] [INFO ] Deduced a trap along path composed of 3 places in 47 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:28] [INFO ] Deduced a trap along path composed of 3 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:28] [INFO ] Deduced a trap along path composed of 3 places in 38 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/992 variables, 3/776 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/992 variables, 0/776 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 992/992 variables, and 776 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5017 ms.
Refiners :[Domain max(s): 378/378 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 378/378 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 7740ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 614/614 transitions.
Graph (trivial) has 243 edges and 378 vertex of which 27 / 378 are part of one of the 3 SCC in 9 ms
Free SCC test removed 24 places
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Graph (complete) has 1051 edges and 354 vertex of which 352 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 72 rules applied. Total rules applied 74 place count 352 transition count 510
Reduce places removed 70 places and 0 transitions.
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Iterating post reduction 1 with 93 rules applied. Total rules applied 167 place count 282 transition count 487
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 24 rules applied. Total rules applied 191 place count 259 transition count 486
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 191 place count 259 transition count 482
Deduced a syphon composed of 4 places in 9 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 199 place count 255 transition count 482
Discarding 47 places :
Symmetric choice reduction at 3 with 47 rule applications. Total rules 246 place count 208 transition count 435
Iterating global reduction 3 with 47 rules applied. Total rules applied 293 place count 208 transition count 435
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 294 place count 208 transition count 434
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 294 place count 208 transition count 428
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 306 place count 202 transition count 428
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 322 place count 186 transition count 380
Iterating global reduction 4 with 16 rules applied. Total rules applied 338 place count 186 transition count 380
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 341 place count 186 transition count 377
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 367 place count 173 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 368 place count 173 transition count 363
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 380 place count 167 transition count 371
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 393 place count 167 transition count 358
Free-agglomeration rule applied 32 times.
Iterating global reduction 6 with 32 rules applied. Total rules applied 425 place count 167 transition count 326
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 457 place count 135 transition count 326
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 458 place count 135 transition count 327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 459 place count 134 transition count 327
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 460 place count 133 transition count 326
Applied a total of 460 rules in 285 ms. Remains 133 /378 variables (removed 245) and now considering 326/614 (removed 288) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 133/378 places, 326/614 transitions.
RANDOM walk for 40000 steps (21 resets) in 686 ms. (58 steps per ms) remains 2/3 properties
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (11 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 104 ms. (380 steps per ms) remains 2/2 properties
[2025-06-02 22:21:30] [INFO ] Flow matrix only has 316 transitions (discarded 10 similar events)
// Phase 1: matrix 316 rows 133 cols
[2025-06-02 22:21:30] [INFO ] Computed 11 invariants in 4 ms
[2025-06-02 22:21:30] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/125 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 312/437 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/449 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/449 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 152 constraints, problems are : Problem set: 0 solved, 2 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 80/102 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/125 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 312/437 variables, 125/133 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 5/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/437 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/449 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/449 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/449 variables, 3/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/449 variables, 2/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:31] [INFO ] Deduced a trap composed of 21 places in 177 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/449 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/449 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 155 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 133/133 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1471ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-05 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 91 ms.
Support contains 15 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 326/326 transitions.
Graph (trivial) has 70 edges and 133 vertex of which 4 / 133 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 610 edges and 131 vertex of which 130 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 19 rules applied. Total rules applied 21 place count 130 transition count 303
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 112 transition count 300
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 44 place count 110 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 44 place count 110 transition count 299
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 46 place count 109 transition count 299
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 65 place count 90 transition count 276
Iterating global reduction 3 with 19 rules applied. Total rules applied 84 place count 90 transition count 276
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 87 place count 90 transition count 273
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 87 place count 90 transition count 272
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 89 place count 89 transition count 272
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 91 place count 87 transition count 266
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 87 transition count 266
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 103 place count 82 transition count 261
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 109 place count 82 transition count 255
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 111 place count 80 transition count 249
Iterating global reduction 5 with 2 rules applied. Total rules applied 113 place count 80 transition count 249
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 119 place count 77 transition count 254
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 128 place count 77 transition count 245
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 129 place count 76 transition count 242
Iterating global reduction 5 with 1 rules applied. Total rules applied 130 place count 76 transition count 242
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 131 place count 76 transition count 241
Free-agglomeration rule applied 7 times.
Iterating global reduction 6 with 7 rules applied. Total rules applied 138 place count 76 transition count 234
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 16 rules applied. Total rules applied 154 place count 69 transition count 225
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 160 place count 69 transition count 219
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 161 place count 68 transition count 218
Applied a total of 161 rules in 119 ms. Remains 68 /133 variables (removed 65) and now considering 218/326 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 68/133 places, 218/326 transitions.
RANDOM walk for 40000 steps (20 resets) in 270 ms. (147 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (9 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
Reachability property MedleyA-PT-23-ReachabilityCardinality-2025-03 is true.
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :393393 after 1.1007e+06
Interrupted probabilistic random walk after 1401524 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :0 out of 1
Probabilistic random walk after 1401524 steps, saw 704055 distinct states, run finished after 3011 ms. (steps per millisecond=465 ) properties seen :0
[2025-06-02 22:21:35] [INFO ] Flow matrix only has 208 transitions (discarded 10 similar events)
// Phase 1: matrix 208 rows 68 cols
[2025-06-02 22:21:35] [INFO ] Computed 11 invariants in 2 ms
[2025-06-02 22:21:35] [INFO ] State equation strengthened by 8 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/61 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/266 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/276 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/276 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 276/276 variables, and 87 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :1.1007e+06 after 1.30291e+06
At refinement iteration 1 (OVERLAPS) 32/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/61 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/61 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 205/266 variables, 61/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/266 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/276 variables, 7/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/276 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/276 variables, 3/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/276 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 22:21:35] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 10 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/276 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/276 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/276 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 276/276 variables, and 89 constraints, problems are : Problem set: 0 solved, 1 unsolved in 359 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 68/68 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 573ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 628 steps, including 54 resets, run visited all 1 properties in 3 ms. (steps per millisecond=209 )
FORMULA MedleyA-PT-23-ReachabilityCardinality-2025-10 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 11 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 16183 ms.

BK_STOP 1748902895776

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-23"
export BK_EXAMINATION="ReachabilityCardinality"
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-5832"
echo " Executing tool itstools"
echo " Input is MedleyA-PT-23, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r128-smll-174876524200278"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-23.tgz
mv MedleyA-PT-23 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;