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.r338-smll-178021499100103.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 ErlangenMainframeV1-PT-bP07C07, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499100103
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.1M
-rw-r--r-- 1 mcc users 8.0K May 27 08:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 27 08:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 08:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 27 08:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 27 10:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 27 10:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 27 10:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 27 10:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 9.5K May 27 08:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 27 08:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 27 08:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K May 27 08:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 27 10:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 27 10:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 8 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 5.7M May 26 18:17 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 ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-00
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-01
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-02
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-03
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-04
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-05
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-06
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-07
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-08
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-09
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-10
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-11
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-12
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-13
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-14
FORMULA_NAME ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1780275598497

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ErlangenMainframeV1-PT-bP07C07
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-06-01 01:00:00] [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-06-01 01:00:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-01 01:00:02] [INFO ] Load time of PNML (sax parser for PT used): 1487 ms
[2026-06-01 01:00:02] [INFO ] Transformed 293 places.
[2026-06-01 01:00:02] [INFO ] Transformed 6879 transitions.
[2026-06-01 01:00:02] [INFO ] Found NUPN structural information;
[2026-06-01 01:00:02] [INFO ] Parsed PT model containing 293 places and 6879 transitions and 114566 arcs in 1833 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 50 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (8 resets) in 9379 ms. (4 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 455 ms. (8 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 616 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 105 ms. (37 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 433 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 318 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 202 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 420 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
[2026-06-01 01:00:07] [INFO ] Flatten gal took : 2411 ms
[2026-06-01 01:00:08] [INFO ] Flatten gal took : 1182 ms
[2026-06-01 01:00:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4163669470347958844.gal : 365 ms
[2026-06-01 01:00:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15078553137872804675.prop : 19 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/ReachabilityCardinality4163669470347958844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15078553137872804675.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 ...329
Loading property file /tmp/ReachabilityCardinality15078553137872804675.prop.
Interrupted probabilistic random walk after 307451 steps, run timeout after 9001 ms. (steps per millisecond=34 ) properties seen :0 out of 16
Probabilistic random walk after 307451 steps, saw 46348 distinct states, run finished after 9008 ms. (steps per millisecond=34 ) 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-9494408692809222175.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9736202128468813768.kers'
[2026-06-01 01:00:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9494408692809222175.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9736202128468813768.kers]
Culled 0 columns in 34 ms.
// Phase 1: matrix 6879 rows 293 cols 114566 entries
Finished phase 1 with 270 SingleSign rule and 3 generalized
[2026-06-01 01:00:16] [INFO ] Computed 20 invariants in 105 ms
Computed 20 P flows in 134 ms.
Exported basis to /tmp/petrispot-output-9736202128468813768.kers
Total runtime 152 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-03 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-10 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 151/212 variables, 13/74 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 151/225 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 81/293 variables, 7/232 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 81/313 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 2 solved, 14 unsolved
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 5
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 7172/7172 variables, and 606 constraints, problems are : Problem set: 2 solved, 14 unsolved in 5130 ms.
Refiners :[Domain max(s): 293/293 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 293/293 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 14 unsolved
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :5 after 11
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 2 solved, 14 unsolved
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :11 after 195
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-00 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-06 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-11 is UNSAT
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 151/212 variables, 13/74 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/212 variables, 151/225 constraints. Problems are: Problem set: 5 solved, 11 unsolved
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :195 after 3137
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :3137 after 3237
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :3237 after 3489
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :3489 after 3725
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 0/225 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 81/293 variables, 7/232 constraints. Problems are: Problem set: 5 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 81/313 constraints. Problems are: Problem set: 5 solved, 11 unsolved
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :3725 after 53588
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 0/313 constraints. Problems are: Problem set: 5 solved, 11 unsolved
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :53588 after 304058
SMT process timed out in 11138ms, After SMT, problems are : Problem set: 5 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 60 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 6879/6879 transitions.
Graph (trivial) has 199 edges and 293 vertex of which 6 / 293 are part of one of the 3 SCC in 11 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 96 transitions
Trivial Post-agglo rules discarded 96 transitions
Performed 96 trivial Post agglomeration. Transition count delta: 96
Iterating post reduction 0 with 96 rules applied. Total rules applied 97 place count 290 transition count 6777
Reduce places removed 96 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 1 with 103 rules applied. Total rules applied 200 place count 194 transition count 6770
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 4 rules applied. Total rules applied 204 place count 193 transition count 6767
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 207 place count 190 transition count 6767
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 207 place count 190 transition count 6755
Deduced a syphon composed of 12 places in 13 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 231 place count 178 transition count 6755
Discarding 36 places :
Symmetric choice reduction at 4 with 36 rule applications. Total rules 267 place count 142 transition count 6719
Iterating global reduction 4 with 36 rules applied. Total rules applied 303 place count 142 transition count 6719
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 308 place count 142 transition count 6714
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 310 place count 140 transition count 6714
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 310 place count 140 transition count 6712
Deduced a syphon composed of 2 places in 13 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 314 place count 138 transition count 6712
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 316 place count 136 transition count 6697
Iterating global reduction 6 with 2 rules applied. Total rules applied 318 place count 136 transition count 6697
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 4 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 6 with 42 rules applied. Total rules applied 360 place count 115 transition count 6676
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 361 place count 115 transition count 6675
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 5 places in 5 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 7 with 10 rules applied. Total rules applied 371 place count 110 transition count 6682
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 372 place count 110 transition count 6681
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 374 place count 110 transition count 6679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 376 place count 108 transition count 6679
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :304058 after 4.1706e+06
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 9 with 1 rules applied. Total rules applied 377 place count 108 transition count 6683
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 378 place count 107 transition count 6683
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 10 with 3 rules applied. Total rules applied 381 place count 107 transition count 6683
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 10 with 6 rules applied. Total rules applied 387 place count 107 transition count 6683
Applied a total of 387 rules in 8298 ms. Remains 107 /293 variables (removed 186) and now considering 6683/6879 (removed 196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8312 ms. Remains : 107/293 places, 6683/6879 transitions.
RANDOM walk for 40000 steps (8 resets) in 6392 ms. (6 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 3294 ms. (12 steps per ms) remains 11/11 properties
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :4.1706e+06 after 8.64171e+07
BEST_FIRST walk for 40003 steps (8 resets) in 2225 ms. (17 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1054 ms. (37 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2922 ms. (13 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2733 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1127 ms. (35 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1625 ms. (24 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (8 resets) in 2675 ms. (14 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (8 resets) in 2140 ms. (18 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1555 ms. (25 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 1873 ms. (21 steps per ms) remains 11/11 properties
SDD proceeding with computation,16 properties remain. new max is 32768
SDD size :8.64171e+07 after 1.95421e+09
Interrupted probabilistic random walk after 975490 steps, run timeout after 27001 ms. (steps per millisecond=36 ) properties seen :0 out of 11
Probabilistic random walk after 975490 steps, saw 248392 distinct states, run finished after 27001 ms. (steps per millisecond=36 ) properties seen :0
[2026-06-01 01:01:12] [INFO ] Flow matrix only has 6676 transitions (discarded 7 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4750465118291098532.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9213354698065191133.kers'
[2026-06-01 01:01:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4750465118291098532.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9213354698065191133.kers]
Culled 0 columns in 20 ms.
// Phase 1: matrix 6676 rows 107 cols 114174 entries
Finished phase 1 with 84 SingleSign rule and 3 generalized
[2026-06-01 01:01:12] [INFO ] Computed 20 invariants in 75 ms
Computed 20 P flows in 76 ms.
Exported basis to /tmp/petrispot-output-9213354698065191133.kers
Total runtime 94 ms.
[2026-06-01 01:01:12] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 28/88 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 19/107 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6676/6783 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6783 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6783 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/6783 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6783/6783 variables, and 130 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7849 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 28/88 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/88 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 19/107 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/107 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 6676/6783 variables, 107/127 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6783 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/6783 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/6783 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6783/6783 variables, and 130 constraints, problems are : Problem set: 0 solved, 11 unsolved in 16768 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 107/107 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 11/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 24931ms problems are : Problem set: 0 solved, 11 unsolved
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-05 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-09 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-14 TRUE TECHNIQUES PARIKH_WALK
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-15 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 10 properties in 2672 ms.
Support contains 44 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 6683/6683 transitions.
Graph (trivial) has 38 edges and 107 vertex of which 2 / 107 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 106 transition count 6679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 104 transition count 6679
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 5 place count 104 transition count 6677
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 9 place count 102 transition count 6677
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 11 place count 100 transition count 6667
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 100 transition count 6667
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 100 transition count 6666
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 99 transition count 6663
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 99 transition count 6663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 17 place count 99 transition count 6662
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 18 place count 98 transition count 6660
Iterating global reduction 4 with 1 rules applied. Total rules applied 19 place count 98 transition count 6660
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 20 place count 98 transition count 6659
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 32 place count 92 transition count 6653
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 34 place count 90 transition count 6648
Iterating global reduction 5 with 2 rules applied. Total rules applied 36 place count 90 transition count 6648
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 38 place count 90 transition count 6646
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 5 places in 2 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 48 place count 85 transition count 6654
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 49 place count 85 transition count 6653
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 53 place count 85 transition count 6649
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 58 place count 81 transition count 6648
Drop transitions (Redundant composition of simpler transitions.) removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 76 place count 81 transition count 6630
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 77 place count 81 transition count 6630
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 78 place count 81 transition count 6629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 79 place count 80 transition count 6628
Applied a total of 79 rules in 9274 ms. Remains 80 /107 variables (removed 27) and now considering 6628/6683 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9275 ms. Remains : 80/107 places, 6628/6683 transitions.
RANDOM walk for 40000 steps (8 resets) in 3983 ms. (10 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1201 ms. (33 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 93386 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 1
Probabilistic random walk after 93386 steps, saw 23736 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2026-06-01 01:01:54] [INFO ] Flow matrix only has 6627 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14801321138032383148.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14877647811815028199.kers'
[2026-06-01 01:01:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14801321138032383148.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14877647811815028199.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 19 ms.
// Phase 1: matrix 6627 rows 77 cols 113925 entries
Finished phase 1 with 57 SingleSign rule and 3 generalized
[2026-06-01 01:01:54] [INFO ] Computed 20 invariants in 75 ms
Computed 20 P flows in 76 ms.
Exported basis to /tmp/petrispot-output-14877647811815028199.kers
Total runtime 97 ms.
[2026-06-01 01:01:54] [INFO ] State equation strengthened by 25 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) 9/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/73 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/76 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6624/6700 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6700 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6700 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/6707 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6707 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6707 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/6707 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/6707 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6707/6707 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3225 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 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) 9/53 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 20/73 variables, 7/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/73 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/76 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 6624/6700 variables, 76/94 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/6700 variables, 24/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/6700 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/6707 variables, 4/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/6707 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/6707 variables, 1/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/6707 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/6707 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6707/6707 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4352 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 80/80 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7777ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 1179 steps, including 58 resets, run visited all 1 properties in 67 ms. (steps per millisecond=17 )
FORMULA ErlangenMainframeV1-PT-bP07C07-ReachabilityFireability-2024-04 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 94 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 121468 ms.

BK_STOP 1780275722320

--------------------
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="ErlangenMainframeV1-PT-bP07C07"
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 ErlangenMainframeV1-PT-bP07C07, 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 r338-smll-178021499100103"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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