Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r004-smll-171620117600022.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is ASLink-PT-01b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r004-smll-171620117600022
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 18:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 171K Apr 11 18:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 11 18:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 11 18:04 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 293K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-01
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-01b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716216497974

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-20 14:48:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 14:48:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 14:48:20] [INFO ] Load time of PNML (sax parser for PT used): 293 ms
[2024-05-20 14:48:20] [INFO ] Transformed 846 places.
[2024-05-20 14:48:21] [INFO ] Transformed 1148 transitions.
[2024-05-20 14:48:21] [INFO ] Found NUPN structural information;
[2024-05-20 14:48:21] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 545 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 47 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (238 resets) in 4127 ms. (9 steps per ms) remains 6/12 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-20 14:48:22] [INFO ] Flatten gal took : 592 ms
BEST_FIRST walk for 40003 steps (62 resets) in 952 ms. (41 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (67 resets) in 238 ms. (167 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (71 resets) in 363 ms. (109 steps per ms) remains 5/5 properties
[2024-05-20 14:48:23] [INFO ] Flatten gal took : 484 ms
BEST_FIRST walk for 40002 steps (61 resets) in 331 ms. (120 steps per ms) remains 4/5 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (67 resets) in 343 ms. (116 steps per ms) remains 4/4 properties
[2024-05-20 14:48:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10676724748847755460.gal : 164 ms
BEST_FIRST walk for 40003 steps (68 resets) in 208 ms. (191 steps per ms) remains 3/4 properties
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-20 14:48:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5557577258617652373.prop : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10676724748847755460.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5557577258617652373.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
// Phase 1: matrix 1148 rows 846 cols
Loading property file /tmp/ReachabilityCardinality5557577258617652373.prop.
[2024-05-20 14:48:24] [INFO ] Computed 82 invariants in 179 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 196/259 variables, 16/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/259 variables, 196/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/259 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/295 variables, 3/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/295 variables, 36/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/295 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :13 after 46
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :46 after 178
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :178 after 571
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :571 after 689
Problem ASLink-PT-01b-ReachabilityCardinality-2024-11 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 549/844 variables, 62/376 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :689 after 10045
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :10045 after 28954
At refinement iteration 9 (INCLUDED_ONLY) 0/844 variables, 549/925 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 0/925 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2/846 variables, 1/926 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/846 variables, 2/928 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :28954 after 435646
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :435646 after 9.83056e+07
At refinement iteration 14 (OVERLAPS) 1148/1994 variables, 846/1774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :9.83056e+07 after 1.00295e+08
At refinement iteration 15 (INCLUDED_ONLY) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1994 variables, 0/1774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1994/1994 variables, and 1774 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2774 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 48/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 147/195 variables, 11/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/195 variables, 147/206 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-20 14:48:27] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 19 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 1/207 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/195 variables, 0/207 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 90/285 variables, 8/215 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/285 variables, 90/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/285 variables, 0/305 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Problem ASLink-PT-01b-ReachabilityCardinality-2024-06 is UNSAT
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 559/844 variables, 62/367 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/844 variables, 559/926 constraints. Problems are: Problem set: 2 solved, 1 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :1.00295e+08 after 1.16726e+08
At refinement iteration 11 (INCLUDED_ONLY) 0/844 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/846 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/846 variables, 2/929 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/846 variables, 0/929 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1148/1994 variables, 846/1775 constraints. Problems are: Problem set: 2 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1994/1994 variables, and 1776 constraints, problems are : Problem set: 2 solved, 1 unsolved in 2510 ms.
Refiners :[Domain max(s): 846/846 constraints, Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 846/846 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 5790ms problems are : Problem set: 2 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 846 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 173 transitions
Trivial Post-agglo rules discarded 173 transitions
Performed 173 trivial Post agglomeration. Transition count delta: 173
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 846 transition count 975
Reduce places removed 173 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 183 rules applied. Total rules applied 356 place count 673 transition count 965
Reduce places removed 3 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 10 rules applied. Total rules applied 366 place count 670 transition count 958
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 373 place count 663 transition count 958
Performed 185 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 185 Pre rules applied. Total rules applied 373 place count 663 transition count 773
Deduced a syphon composed of 185 places in 3 ms
Ensure Unique test removed 10 places
Reduce places removed 195 places and 0 transitions.
Iterating global reduction 4 with 380 rules applied. Total rules applied 753 place count 468 transition count 773
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 4 with 7 rules applied. Total rules applied 760 place count 467 transition count 767
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 5 with 9 rules applied. Total rules applied 769 place count 461 transition count 764
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 772 place count 458 transition count 764
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 772 place count 458 transition count 763
Deduced a syphon composed of 1 places in 4 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 3 rules applied. Total rules applied 775 place count 456 transition count 763
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 775 place count 456 transition count 762
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 777 place count 455 transition count 762
Discarding 24 places :
Symmetric choice reduction at 7 with 24 rule applications. Total rules 801 place count 431 transition count 738
Iterating global reduction 7 with 24 rules applied. Total rules applied 825 place count 431 transition count 738
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 826 place count 431 transition count 737
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 826 place count 431 transition count 728
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 8 with 19 rules applied. Total rules applied 845 place count 421 transition count 728
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 845 place count 421 transition count 727
Deduced a syphon composed of 1 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 848 place count 419 transition count 727
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 850 place count 417 transition count 712
Iterating global reduction 8 with 2 rules applied. Total rules applied 852 place count 417 transition count 712
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 852 place count 417 transition count 711
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 854 place count 416 transition count 711
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 855 place count 415 transition count 703
Iterating global reduction 8 with 1 rules applied. Total rules applied 856 place count 415 transition count 703
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 857 place count 414 transition count 695
Iterating global reduction 8 with 1 rules applied. Total rules applied 858 place count 414 transition count 695
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 859 place count 413 transition count 687
Iterating global reduction 8 with 1 rules applied. Total rules applied 860 place count 413 transition count 687
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 861 place count 412 transition count 679
Iterating global reduction 8 with 1 rules applied. Total rules applied 862 place count 412 transition count 679
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 863 place count 411 transition count 671
Iterating global reduction 8 with 1 rules applied. Total rules applied 864 place count 411 transition count 671
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 8 with 87 rules applied. Total rules applied 951 place count 367 transition count 628
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 952 place count 366 transition count 627
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 954 place count 365 transition count 627
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 955 place count 364 transition count 626
Iterating global reduction 8 with 1 rules applied. Total rules applied 956 place count 364 transition count 626
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 8 with 2 rules applied. Total rules applied 958 place count 364 transition count 624
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 959 place count 363 transition count 624
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 961 place count 362 transition count 633
Free-agglomeration rule applied 2 times.
Iterating global reduction 10 with 2 rules applied. Total rules applied 963 place count 362 transition count 631
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 965 place count 360 transition count 631
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 967 place count 360 transition count 629
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 969 place count 358 transition count 629
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 970 place count 357 transition count 628
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 971 place count 356 transition count 628
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 2 Pre rules applied. Total rules applied 971 place count 356 transition count 626
Deduced a syphon composed of 2 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 13 with 5 rules applied. Total rules applied 976 place count 353 transition count 626
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 13 with 1 rules applied. Total rules applied 977 place count 352 transition count 626
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 977 place count 352 transition count 625
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 979 place count 351 transition count 625
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 14 with 4 rules applied. Total rules applied 983 place count 349 transition count 623
Applied a total of 983 rules in 624 ms. Remains 349 /846 variables (removed 497) and now considering 623/1148 (removed 525) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 642 ms. Remains : 349/846 places, 623/1148 transitions.
RANDOM walk for 40000 steps (747 resets) in 483 ms. (82 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 32768
BEST_FIRST walk for 40002 steps (268 resets) in 254 ms. (156 steps per ms) remains 1/1 properties
SDD size :1.16726e+08 after 1.59208e+08
Interrupted probabilistic random walk after 540080 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :0 out of 1
Probabilistic random walk after 540080 steps, saw 157336 distinct states, run finished after 3009 ms. (steps per millisecond=179 ) properties seen :0
// Phase 1: matrix 623 rows 349 cols
[2024-05-20 14:48:33] [INFO ] Computed 63 invariants in 28 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/150 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/345 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2/347 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/347 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/349 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/349 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 623/972 variables, 349/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/972 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/972 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 972/972 variables, and 412 constraints, problems are : Problem set: 0 solved, 1 unsolved in 461 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 127/145 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/145 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/150 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 195/345 variables, 44/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 14:48:34] [INFO ] Deduced a trap composed of 91 places in 334 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/347 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/347 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/349 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/349 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 623/972 variables, 349/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/972 variables, 1/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/972 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/972 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 972/972 variables, and 414 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1458 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 46/46 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1994ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 81 ms.
Support contains 18 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 623/623 transitions.
Applied a total of 0 rules in 21 ms. Remains 349 /349 variables (removed 0) and now considering 623/623 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 349/349 places, 623/623 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 623/623 transitions.
Applied a total of 0 rules in 20 ms. Remains 349 /349 variables (removed 0) and now considering 623/623 (removed 0) transitions.
[2024-05-20 14:48:35] [INFO ] Invariant cache hit.
SDD proceeding with computation,3 properties remain. new max is 65536
[2024-05-20 14:48:35] [INFO ] Implicit Places using invariants in 388 ms returned [1, 19, 20, 33, 50, 69, 126, 127, 141, 142, 153, 160, 164, 165, 178, 179, 213, 218, 236, 237, 238, 239, 251, 259, 265, 271, 277, 283, 289, 295, 301, 307, 313]
[2024-05-20 14:48:35] [INFO ] Actually due to overlaps returned [33, 50, 218, 178, 236, 179, 213, 237, 1, 19, 69, 238, 283, 301, 313, 20, 164, 165, 239, 251, 259, 265, 271, 277, 289, 295, 307]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 397 ms to find 27 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 322/349 places, 623/623 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 320 transition count 596
Reduce places removed 27 places and 0 transitions.
SDD size :1.59208e+08 after 1.88343e+09
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 293 transition count 592
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 64 place count 289 transition count 592
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 64 place count 289 transition count 582
Deduced a syphon composed of 10 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 21 rules applied. Total rules applied 85 place count 278 transition count 582
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 3 with 4 rules applied. Total rules applied 89 place count 274 transition count 582
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 103 place count 260 transition count 568
Iterating global reduction 4 with 14 rules applied. Total rules applied 117 place count 260 transition count 568
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 123 place count 254 transition count 562
Iterating global reduction 4 with 6 rules applied. Total rules applied 129 place count 254 transition count 562
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 134 place count 249 transition count 555
Iterating global reduction 4 with 5 rules applied. Total rules applied 139 place count 249 transition count 555
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 142 place count 249 transition count 552
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 143 place count 248 transition count 551
Iterating global reduction 5 with 1 rules applied. Total rules applied 144 place count 248 transition count 551
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 145 place count 247 transition count 550
Iterating global reduction 5 with 1 rules applied. Total rules applied 146 place count 247 transition count 550
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 147 place count 246 transition count 548
Iterating global reduction 5 with 1 rules applied. Total rules applied 148 place count 246 transition count 548
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 176 place count 232 transition count 534
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 177 place count 231 transition count 533
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 231 transition count 533
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 179 place count 231 transition count 532
Free-agglomeration rule applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 181 place count 231 transition count 530
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 183 place count 229 transition count 530
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 188 place count 229 transition count 525
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 193 place count 224 transition count 525
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 196 place count 224 transition count 525
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 197 place count 224 transition count 525
Applied a total of 197 rules in 121 ms. Remains 224 /322 variables (removed 98) and now considering 525/623 (removed 98) transitions.
// Phase 1: matrix 525 rows 224 cols
[2024-05-20 14:48:36] [INFO ] Computed 29 invariants in 6 ms
[2024-05-20 14:48:36] [INFO ] Implicit Places using invariants in 227 ms returned [77, 101, 102, 113, 114, 117]
[2024-05-20 14:48:36] [INFO ] Actually due to overlaps returned [101, 113, 77, 117]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 229 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 220/349 places, 525/623 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 219 transition count 524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 219 transition count 523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 218 transition count 523
Applied a total of 4 rules in 45 ms. Remains 218 /220 variables (removed 2) and now considering 523/525 (removed 2) transitions.
// Phase 1: matrix 523 rows 218 cols
[2024-05-20 14:48:36] [INFO ] Computed 25 invariants in 6 ms
[2024-05-20 14:48:36] [INFO ] Implicit Places using invariants in 376 ms returned [98, 109]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 378 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 216/349 places, 523/623 transitions.
Applied a total of 0 rules in 10 ms. Remains 216 /216 variables (removed 0) and now considering 523/523 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 1202 ms. Remains : 216/349 places, 523/623 transitions.
RANDOM walk for 40000 steps (900 resets) in 230 ms. (173 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (382 resets) in 210 ms. (189 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 45399 steps, run visited all 1 properties in 213 ms. (steps per millisecond=213 )
Probabilistic random walk after 45399 steps, saw 15884 distinct states, run finished after 218 ms. (steps per millisecond=208 ) properties seen :1
FORMULA ASLink-PT-01b-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 16804 ms.

BK_STOP 1716216517477

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-01b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is ASLink-PT-01b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r004-smll-171620117600022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-01b.tgz
mv ASLink-PT-01b execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;