Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r018-smll-177946788000127.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is AutonomousCar-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-smll-177946788000127
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 964K
-rw-r--r-- 1 mcc users 6.2K Mar 5 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 5 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 15 07:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 5 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Mar 5 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Mar 5 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 517K Mar 3 18:30 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 AutonomousCar-PT-08b-ReachabilityFireability-2024-00
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-01
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-02
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-03
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-04
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-05
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-06
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-07
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-08
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-09
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-10
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-11
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-12
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-13
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-14
FORMULA_NAME AutonomousCar-PT-08b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779505777228

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-08b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-23 03:09:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 03:09:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 03:09:39] [INFO ] Load time of PNML (sax parser for PT used): 301 ms
[2026-05-23 03:09:39] [INFO ] Transformed 357 places.
[2026-05-23 03:09:39] [INFO ] Transformed 1128 transitions.
[2026-05-23 03:09:39] [INFO ] Found NUPN structural information;
[2026-05-23 03:09:39] [INFO ] Parsed PT model containing 357 places and 1128 transitions and 9454 arcs in 515 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (329 resets) in 3356 ms. (11 steps per ms) remains 6/16 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (68 resets) in 412 ms. (96 steps per ms) remains 5/6 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2026-05-23 03:09:41] [INFO ] Flatten gal took : 675 ms
BEST_FIRST walk for 40003 steps (47 resets) in 1905 ms. (20 steps per ms) remains 5/5 properties
[2026-05-23 03:09:41] [INFO ] Flatten gal took : 293 ms
BEST_FIRST walk for 40004 steps (54 resets) in 814 ms. (49 steps per ms) remains 5/5 properties
[2026-05-23 03:09:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10062460285052840522.gal : 229 ms
[2026-05-23 03:09:42] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15527422473801518421.prop : 14 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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10062460285052840522.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15527422473801518421.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.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 40004 steps (49 resets) in 1724 ms. (23 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (68 resets) in 386 ms. (103 steps per ms) remains 4/5 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Loading property file /tmp/ReachabilityCardinality15527422473801518421.prop.
BEST_FIRST walk for 40004 steps (87 resets) in 704 ms. (56 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11894566489446991357.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15679690572098785452.kers'
[2026-05-23 03:09:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11894566489446991357.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15679690572098785452.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1128 rows 357 cols 9454 entries
Finished phase 1 with 344 SingleSign rule and 0 generalized
[2026-05-23 03:09:42] [INFO ] Computed 13 invariants in 8 ms
Computed 13 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-15679690572098785452.kers
Total runtime 17 ms.
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,5 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,5 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,5 properties remain. new max is 16
SDD size :4 after 5
SDD proceeding with computation,5 properties remain. new max is 32
SDD size :5 after 6
SDD proceeding with computation,5 properties remain. new max is 64
SDD size :6 after 25
SDD proceeding with computation,5 properties remain. new max is 128
SDD size :25 after 53
SDD proceeding with computation,5 properties remain. new max is 256
SDD size :53 after 88
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-14 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 259/357 variables, 13/111 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 259/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 512
SDD size :88 after 177556
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1485 variables, 0/727 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1485/1485 variables, and 727 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1858 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
SDD proceeding with computation,5 properties remain. new max is 1024
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 94/94 constraints. Problems are: Problem set: 1 solved, 3 unsolved
SDD size :177556 after 1.42152e+06
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-06 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem AutonomousCar-PT-08b-ReachabilityFireability-2024-07 is UNSAT
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 263/357 variables, 13/107 constraints. Problems are: Problem set: 3 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 2048
SDD size :1.42152e+06 after 1.47697e+06
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 263/370 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/370 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1128/1485 variables, 357/727 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1485 variables, 1/728 constraints. Problems are: Problem set: 3 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 4096
SDD size :1.47697e+06 after 3.11974e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/1485 variables, 0/728 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1485 variables, 0/728 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1485/1485 variables, and 728 constraints, problems are : Problem set: 3 solved, 1 unsolved in 1493 ms.
Refiners :[Domain max(s): 357/357 constraints, Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 357/357 constraints, PredecessorRefiner: 3/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3642ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 44 out of 357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 357/357 places, 1128/1128 transitions.
Graph (trivial) has 251 edges and 357 vertex of which 4 / 357 are part of one of the 2 SCC in 23 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 1428 edges and 355 vertex of which 348 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.16 ms
Discarding 7 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 117 transitions
Trivial Post-agglo rules discarded 117 transitions
Performed 117 trivial Post agglomeration. Transition count delta: 117
Iterating post reduction 0 with 119 rules applied. Total rules applied 121 place count 348 transition count 1000
Reduce places removed 117 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 1 with 151 rules applied. Total rules applied 272 place count 231 transition count 966
Reduce places removed 19 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 26 rules applied. Total rules applied 298 place count 212 transition count 959
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 9 rules applied. Total rules applied 307 place count 205 transition count 957
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 308 place count 204 transition count 957
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 27 Pre rules applied. Total rules applied 308 place count 204 transition count 930
Deduced a syphon composed of 27 places in 3 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 362 place count 177 transition count 930
Discarding 32 places :
Symmetric choice reduction at 5 with 32 rule applications. Total rules 394 place count 145 transition count 898
Iterating global reduction 5 with 32 rules applied. Total rules applied 426 place count 145 transition count 898
Ensure Unique test removed 258 transitions
Reduce isomorphic transitions removed 258 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 259 rules applied. Total rules applied 685 place count 145 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 686 place count 144 transition count 639
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 691 place count 139 transition count 606
Iterating global reduction 7 with 5 rules applied. Total rules applied 696 place count 139 transition count 606
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 3 rules applied. Total rules applied 699 place count 139 transition count 603
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 701 place count 138 transition count 602
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 702 place count 137 transition count 602
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 10 with 50 rules applied. Total rules applied 752 place count 112 transition count 577
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 753 place count 111 transition count 568
Iterating global reduction 10 with 1 rules applied. Total rules applied 754 place count 111 transition count 568
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 755 place count 111 transition count 567
Free-agglomeration rule applied 17 times.
Iterating global reduction 10 with 17 rules applied. Total rules applied 772 place count 111 transition count 550
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 10 with 17 rules applied. Total rules applied 789 place count 94 transition count 550
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 11 with 3 rules applied. Total rules applied 792 place count 94 transition count 547
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 11 with 5 rules applied. Total rules applied 797 place count 94 transition count 547
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 798 place count 93 transition count 546
Applied a total of 798 rules in 503 ms. Remains 93 /357 variables (removed 264) and now considering 546/1128 (removed 582) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 514 ms. Remains : 93/357 places, 546/1128 transitions.
RANDOM walk for 40000 steps (1176 resets) in 453 ms. (88 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (120 resets) in 318 ms. (125 steps per ms) remains 1/1 properties
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :3.11974e+06 after 3.58057e+07
Interrupted probabilistic random walk after 723978 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 1
Probabilistic random walk after 723978 steps, saw 108711 distinct states, run finished after 3011 ms. (steps per millisecond=240 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3013349518335792727.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6261178661262789267.kers'
[2026-05-23 03:09:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3013349518335792727.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6261178661262789267.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 546 rows 91 cols 6286 entries
Finished phase 1 with 80 SingleSign rule and 0 generalized
[2026-05-23 03:09:50] [INFO ] Computed 13 invariants in 6 ms
Computed 13 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6261178661262789267.kers
Total runtime 8 ms.
[2026-05-23 03:09:50] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/88 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 543/631 variables, 88/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/631 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/639 variables, 5/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/639 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 639/639 variables, and 107 constraints, problems are : Problem set: 0 solved, 1 unsolved in 407 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 44/88 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :3.58057e+07 after 8.28962e+08
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 543/631 variables, 88/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/631 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/631 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 8/639 variables, 5/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/639 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/639 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/639 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 639/639 variables, and 109 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 93/93 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1488ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 44 out of 93 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 546/546 transitions.
Applied a total of 0 rules in 61 ms. Remains 93 /93 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 93/93 places, 546/546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 93/93 places, 546/546 transitions.
Applied a total of 0 rules in 29 ms. Remains 93 /93 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2026-05-23 03:09:51] [INFO ] Invariant cache hit.
[2026-05-23 03:09:51] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-23 03:09:51] [INFO ] Invariant cache hit.
[2026-05-23 03:09:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 03:09:52] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [88, 92]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 351 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 91/93 places, 545/546 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 90 transition count 544
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 90 transition count 543
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 89 transition count 543
Applied a total of 4 rules in 49 ms. Remains 89 /91 variables (removed 2) and now considering 543/545 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13013345674490938892.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13351709521489296031.kers'
[2026-05-23 03:09:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13013345674490938892.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13351709521489296031.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 543 rows 88 cols 6280 entries
Finished phase 1 with 78 SingleSign rule and 0 generalized
[2026-05-23 03:09:52] [INFO ] Computed 11 invariants in 4 ms
Computed 11 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13351709521489296031.kers
Total runtime 6 ms.
[2026-05-23 03:09:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2026-05-23 03:09:52] [INFO ] Invariant cache hit.
[2026-05-23 03:09:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 03:09:52] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 89/93 places, 543/546 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 750 ms. Remains : 89/93 places, 543/546 transitions.
RANDOM walk for 40000 steps (1106 resets) in 1055 ms. (37 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (116 resets) in 359 ms. (111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 841748 steps, run timeout after 3001 ms. (steps per millisecond=280 ) properties seen :0 out of 1
Probabilistic random walk after 841748 steps, saw 126276 distinct states, run finished after 3001 ms. (steps per millisecond=280 ) properties seen :0
[2026-05-23 03:09:55] [INFO ] Invariant cache hit.
[2026-05-23 03:09:55] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/87 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 543/630 variables, 87/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/630 variables, 2/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/632 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/632 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 632/632 variables, and 102 constraints, problems are : Problem set: 0 solved, 1 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 43/87 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 543/630 variables, 87/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/630 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/630 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/630 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/632 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/632 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 632/632 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1048 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1404ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 49 ms.
Support contains 44 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 543/543 transitions.
Applied a total of 0 rules in 19 ms. Remains 89 /89 variables (removed 0) and now considering 543/543 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 89/89 places, 543/543 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 543/543 transitions.
Applied a total of 0 rules in 19 ms. Remains 89 /89 variables (removed 0) and now considering 543/543 (removed 0) transitions.
[2026-05-23 03:09:57] [INFO ] Invariant cache hit.
[2026-05-23 03:09:57] [INFO ] Implicit Places using invariants in 66 ms returned []
[2026-05-23 03:09:57] [INFO ] Invariant cache hit.
[2026-05-23 03:09:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 03:09:57] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2026-05-23 03:09:57] [INFO ] Redundant transitions in 56 ms returned []
Running 540 sub problems to find dead transitions.
[2026-05-23 03:09:57] [INFO ] Invariant cache hit.
[2026-05-23 03:09:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 2 (OVERLAPS) 3/89 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 540 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 540 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :8.28962e+08 after 1.44907e+10
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 540 unsolved
Problem TDEAD542 is UNSAT
At refinement iteration 6 (OVERLAPS) 543/632 variables, 89/116 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 2/118 constraints. Problems are: Problem set: 1 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/632 variables, and 118 constraints, problems are : Problem set: 1 solved, 539 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 540/65 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 539 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/86 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 3 (OVERLAPS) 3/89 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 15/27 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 6 (OVERLAPS) 543/632 variables, 89/116 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/632 variables, 2/118 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/632 variables, 65/183 constraints. Problems are: Problem set: 1 solved, 539 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/632 variables, 1/184 constraints. Problems are: Problem set: 1 solved, 539 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/632 variables, and 184 constraints, problems are : Problem set: 1 solved, 539 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 89/89 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 539/65 constraints, Known Traps: 17/17 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61145ms problems are : Problem set: 1 solved, 539 unsolved
Search for dead transitions found 1 dead transitions in 61155ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 542/543 transitions.
Applied a total of 0 rules in 19 ms. Remains 89 /89 variables (removed 0) and now considering 542/542 (removed 0) transitions.
[2026-05-23 03:10:59] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61663 ms. Remains : 89/89 places, 542/543 transitions.
RANDOM walk for 37007 steps (944 resets) in 546 ms. (67 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
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 80209 ms.

BK_STOP 1779505859416

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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="AutonomousCar-PT-08b"
export BK_EXAMINATION="ReachabilityFireability"
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-5973"
echo " Executing tool itstools"
echo " Input is AutonomousCar-PT-08b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-smll-177946788000127"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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