Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r009-oct2-167813597400054.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ASLink-PT-03b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813597400054
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 6.5K Feb 26 13:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 13:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 13:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 13:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Feb 26 13:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 13:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 13:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 13:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 544K Mar 5 18:22 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-03b-ReachabilityCardinality-00
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-01
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-02
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-03
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-04
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-05
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-06
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-07
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-08
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-09
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-10
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-11
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-12
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-13
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-14
FORMULA_NAME ASLink-PT-03b-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678603860009

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-03b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 06:51:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 06:51:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 06:51:02] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-12 06:51:02] [INFO ] Transformed 1638 places.
[2023-03-12 06:51:02] [INFO ] Transformed 2094 transitions.
[2023-03-12 06:51:02] [INFO ] Found NUPN structural information;
[2023-03-12 06:51:02] [INFO ] Parsed PT model containing 1638 places and 2094 transitions and 6458 arcs in 338 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 29 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-03b-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-03b-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 33 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 11) seen :8
FORMULA ASLink-PT-03b-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-03b-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 2094 rows 1638 cols
[2023-03-12 06:51:03] [INFO ] Computed 160 place invariants in 74 ms
[2023-03-12 06:51:04] [INFO ] After 591ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 06:51:04] [INFO ] [Nat]Absence check using 37 positive place invariants in 22 ms returned sat
[2023-03-12 06:51:04] [INFO ] [Nat]Absence check using 37 positive and 123 generalized place invariants in 97 ms returned sat
[2023-03-12 06:51:28] [INFO ] After 23937ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 06:51:29] [INFO ] After 24364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-12 06:51:29] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 31 ms.
Support contains 31 out of 1638 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1638/1638 places, 2094/2094 transitions.
Drop transitions removed 357 transitions
Trivial Post-agglo rules discarded 357 transitions
Performed 357 trivial Post agglomeration. Transition count delta: 357
Iterating post reduction 0 with 357 rules applied. Total rules applied 357 place count 1638 transition count 1737
Reduce places removed 357 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 373 rules applied. Total rules applied 730 place count 1281 transition count 1721
Reduce places removed 4 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 2 with 11 rules applied. Total rules applied 741 place count 1277 transition count 1714
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 748 place count 1270 transition count 1714
Performed 363 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 363 Pre rules applied. Total rules applied 748 place count 1270 transition count 1351
Deduced a syphon composed of 363 places in 4 ms
Ensure Unique test removed 29 places
Reduce places removed 392 places and 0 transitions.
Iterating global reduction 4 with 755 rules applied. Total rules applied 1503 place count 878 transition count 1351
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 4 with 24 rules applied. Total rules applied 1527 place count 874 transition count 1331
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 5 with 22 rules applied. Total rules applied 1549 place count 854 transition count 1329
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 1551 place count 852 transition count 1329
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 9 Pre rules applied. Total rules applied 1551 place count 852 transition count 1320
Deduced a syphon composed of 9 places in 5 ms
Ensure Unique test removed 8 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 1577 place count 835 transition count 1320
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 8 Pre rules applied. Total rules applied 1577 place count 835 transition count 1312
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 7 with 16 rules applied. Total rules applied 1593 place count 827 transition count 1312
Discarding 49 places :
Symmetric choice reduction at 7 with 49 rule applications. Total rules 1642 place count 778 transition count 1263
Iterating global reduction 7 with 49 rules applied. Total rules applied 1691 place count 778 transition count 1263
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1692 place count 778 transition count 1262
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 17 Pre rules applied. Total rules applied 1692 place count 778 transition count 1245
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 8 with 35 rules applied. Total rules applied 1727 place count 760 transition count 1245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1727 place count 760 transition count 1244
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 1730 place count 758 transition count 1244
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1732 place count 756 transition count 1229
Iterating global reduction 8 with 2 rules applied. Total rules applied 1734 place count 756 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1735 place count 755 transition count 1221
Iterating global reduction 8 with 1 rules applied. Total rules applied 1736 place count 755 transition count 1221
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1737 place count 754 transition count 1213
Iterating global reduction 8 with 1 rules applied. Total rules applied 1738 place count 754 transition count 1213
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1739 place count 753 transition count 1205
Iterating global reduction 8 with 1 rules applied. Total rules applied 1740 place count 753 transition count 1205
Performed 95 Post agglomeration using F-continuation condition.Transition count delta: 95
Deduced a syphon composed of 95 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 8 with 191 rules applied. Total rules applied 1931 place count 657 transition count 1110
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 8 with 2 rules applied. Total rules applied 1933 place count 656 transition count 1119
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 1934 place count 656 transition count 1118
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 1936 place count 655 transition count 1117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 1937 place count 654 transition count 1117
Free-agglomeration rule applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 1942 place count 654 transition count 1112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 1947 place count 649 transition count 1112
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 11 with 2 rules applied. Total rules applied 1949 place count 649 transition count 1110
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 1951 place count 647 transition count 1110
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 12 with 1 rules applied. Total rules applied 1952 place count 647 transition count 1110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 1953 place count 646 transition count 1109
Reduce places removed 5 places and 0 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 12 with 7 rules applied. Total rules applied 1960 place count 641 transition count 1107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 1962 place count 639 transition count 1107
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 8 Pre rules applied. Total rules applied 1962 place count 639 transition count 1099
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 14 with 17 rules applied. Total rules applied 1979 place count 630 transition count 1099
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 14 with 3 rules applied. Total rules applied 1982 place count 627 transition count 1099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 1982 place count 627 transition count 1098
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 1984 place count 626 transition count 1098
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 15 with 12 rules applied. Total rules applied 1996 place count 620 transition count 1092
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 1998 place count 618 transition count 1090
Iterating global reduction 15 with 2 rules applied. Total rules applied 2000 place count 618 transition count 1090
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 2002 place count 616 transition count 1088
Iterating global reduction 15 with 2 rules applied. Total rules applied 2004 place count 616 transition count 1088
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 15 with 2 rules applied. Total rules applied 2006 place count 616 transition count 1086
Applied a total of 2006 rules in 750 ms. Remains 616 /1638 variables (removed 1022) and now considering 1086/2094 (removed 1008) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 751 ms. Remains : 616/1638 places, 1086/2094 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 377242 steps, run timeout after 3001 ms. (steps per millisecond=125 ) properties seen :{2=1}
Probabilistic random walk after 377242 steps, saw 74277 distinct states, run finished after 3001 ms. (steps per millisecond=125 ) properties seen :1
FORMULA ASLink-PT-03b-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 1086 rows 616 cols
[2023-03-12 06:51:33] [INFO ] Computed 106 place invariants in 26 ms
[2023-03-12 06:51:33] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:51:33] [INFO ] [Nat]Absence check using 26 positive place invariants in 9 ms returned sat
[2023-03-12 06:51:33] [INFO ] [Nat]Absence check using 26 positive and 80 generalized place invariants in 24 ms returned sat
[2023-03-12 06:51:38] [INFO ] After 5459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:51:39] [INFO ] Deduced a trap composed of 97 places in 564 ms of which 34 ms to minimize.
[2023-03-12 06:51:39] [INFO ] Deduced a trap composed of 24 places in 406 ms of which 1 ms to minimize.
[2023-03-12 06:51:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1108 ms
[2023-03-12 06:51:40] [INFO ] After 6699ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6840 ms.
[2023-03-12 06:51:46] [INFO ] After 13727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 42 ms.
Support contains 11 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 1086/1086 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 616 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 615 transition count 1085
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 2 place count 615 transition count 1070
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 34 place count 598 transition count 1070
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 34 place count 598 transition count 1069
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 2 with 3 rules applied. Total rules applied 37 place count 596 transition count 1069
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 39 place count 594 transition count 1055
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 594 transition count 1055
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 42 place count 593 transition count 1055
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 592 transition count 1047
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 592 transition count 1047
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 45 place count 591 transition count 1039
Iterating global reduction 3 with 1 rules applied. Total rules applied 46 place count 591 transition count 1039
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 47 place count 590 transition count 1031
Iterating global reduction 3 with 1 rules applied. Total rules applied 48 place count 590 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 49 place count 589 transition count 1023
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 589 transition count 1023
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 51 place count 588 transition count 1015
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 588 transition count 1015
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 13 rules applied. Total rules applied 65 place count 581 transition count 1009
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 66 place count 580 transition count 1008
Iterating global reduction 3 with 1 rules applied. Total rules applied 67 place count 580 transition count 1008
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 580 transition count 1007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 579 transition count 1007
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 70 place count 579 transition count 1006
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 71 place count 578 transition count 1006
Applied a total of 71 rules in 169 ms. Remains 578 /616 variables (removed 38) and now considering 1006/1086 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 578/616 places, 1006/1086 transitions.
Incomplete random walk after 10000 steps, including 121 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 34 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 391664 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :{}
Probabilistic random walk after 391664 steps, saw 88734 distinct states, run finished after 3002 ms. (steps per millisecond=130 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1006 rows 578 cols
[2023-03-12 06:51:50] [INFO ] Computed 101 place invariants in 12 ms
[2023-03-12 06:51:50] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:51:50] [INFO ] [Nat]Absence check using 28 positive place invariants in 16 ms returned sat
[2023-03-12 06:51:50] [INFO ] [Nat]Absence check using 28 positive and 73 generalized place invariants in 40 ms returned sat
[2023-03-12 06:51:53] [INFO ] After 2375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:51:59] [INFO ] Deduced a trap composed of 71 places in 485 ms of which 15 ms to minimize.
[2023-03-12 06:51:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 593 ms
[2023-03-12 06:51:59] [INFO ] After 8387ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-12 06:51:59] [INFO ] After 8770ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 314 ms.
Support contains 11 out of 578 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 1006/1006 transitions.
Applied a total of 0 rules in 18 ms. Remains 578 /578 variables (removed 0) and now considering 1006/1006 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 578/578 places, 1006/1006 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 578/578 places, 1006/1006 transitions.
Applied a total of 0 rules in 15 ms. Remains 578 /578 variables (removed 0) and now considering 1006/1006 (removed 0) transitions.
[2023-03-12 06:51:59] [INFO ] Invariant cache hit.
[2023-03-12 06:52:00] [INFO ] Implicit Places using invariants in 406 ms returned [1, 18, 19, 20, 36, 53, 71, 90, 142, 151, 152, 154, 171, 190, 261, 269, 273, 274, 285, 286, 287, 308, 326, 345, 395, 400, 401, 404, 415, 416, 417, 443, 445, 449, 467, 468, 469, 470, 482, 488, 494, 500, 506, 512, 518, 524, 530, 536, 542]
Discarding 49 places :
Implicit Place search using SMT only with invariants took 413 ms to find 49 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 529/578 places, 1006/1006 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 529 transition count 940
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 68 rules applied. Total rules applied 134 place count 463 transition count 938
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 135 place count 462 transition count 938
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 135 place count 462 transition count 917
Deduced a syphon composed of 21 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 43 rules applied. Total rules applied 178 place count 440 transition count 917
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 190 place count 436 transition count 909
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 198 place count 428 transition count 909
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 213 place count 413 transition count 894
Iterating global reduction 5 with 15 rules applied. Total rules applied 228 place count 413 transition count 894
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 231 place count 413 transition count 891
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 231 place count 413 transition count 890
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 233 place count 412 transition count 890
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 236 place count 409 transition count 884
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 409 transition count 884
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 240 place count 408 transition count 883
Iterating global reduction 6 with 1 rules applied. Total rules applied 241 place count 408 transition count 883
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 242 place count 407 transition count 881
Iterating global reduction 6 with 1 rules applied. Total rules applied 243 place count 407 transition count 881
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 297 place count 380 transition count 854
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 299 place count 378 transition count 851
Iterating global reduction 6 with 2 rules applied. Total rules applied 301 place count 378 transition count 851
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 302 place count 378 transition count 850
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 306 place count 376 transition count 851
Free-agglomeration rule applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 307 place count 376 transition count 850
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 308 place count 375 transition count 850
Free-agglomeration rule (complex) applied 14 times.
Iterating global reduction 8 with 14 rules applied. Total rules applied 322 place count 375 transition count 836
Ensure Unique test removed 1 places
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 8 with 15 rules applied. Total rules applied 337 place count 360 transition count 836
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 338 place count 360 transition count 835
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 347 place count 360 transition count 835
Applied a total of 347 rules in 208 ms. Remains 360 /529 variables (removed 169) and now considering 835/1006 (removed 171) transitions.
// Phase 1: matrix 835 rows 360 cols
[2023-03-12 06:52:00] [INFO ] Computed 46 place invariants in 15 ms
[2023-03-12 06:52:00] [INFO ] Implicit Places using invariants in 286 ms returned [89, 95, 98, 100, 103, 104, 157, 174, 180, 183, 197, 198, 274, 282, 285, 288]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 289 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 344/578 places, 835/1006 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 338 transition count 829
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 338 transition count 829
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 336 transition count 827
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 336 transition count 827
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 332 transition count 823
Free-agglomeration rule applied 8 times.
Iterating global reduction 0 with 8 rules applied. Total rules applied 32 place count 332 transition count 815
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 40 place count 324 transition count 815
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 324 transition count 814
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 323 transition count 814
Applied a total of 42 rules in 54 ms. Remains 323 /344 variables (removed 21) and now considering 814/835 (removed 21) transitions.
// Phase 1: matrix 814 rows 323 cols
[2023-03-12 06:52:00] [INFO ] Computed 30 place invariants in 10 ms
[2023-03-12 06:52:00] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-12 06:52:00] [INFO ] Invariant cache hit.
[2023-03-12 06:52:01] [INFO ] Implicit Places using invariants and state equation in 773 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 323/578 places, 814/1006 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1959 ms. Remains : 323/578 places, 814/1006 transitions.
Incomplete random walk after 10000 steps, including 193 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 285292 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 285292 steps, saw 196079 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 06:52:04] [INFO ] Invariant cache hit.
[2023-03-12 06:52:04] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:52:04] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-12 06:52:05] [INFO ] [Nat]Absence check using 9 positive and 21 generalized place invariants in 38 ms returned sat
[2023-03-12 06:52:12] [INFO ] After 7349ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:52:12] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-03-12 06:52:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 256 ms
[2023-03-12 06:52:12] [INFO ] After 7781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3321 ms.
[2023-03-12 06:52:16] [INFO ] After 11263ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 75 ms.
Support contains 11 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 814/814 transitions.
Applied a total of 0 rules in 26 ms. Remains 323 /323 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 323/323 places, 814/814 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 814/814 transitions.
Applied a total of 0 rules in 15 ms. Remains 323 /323 variables (removed 0) and now considering 814/814 (removed 0) transitions.
[2023-03-12 06:52:16] [INFO ] Invariant cache hit.
[2023-03-12 06:52:16] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-12 06:52:16] [INFO ] Invariant cache hit.
[2023-03-12 06:52:17] [INFO ] Implicit Places using invariants and state equation in 811 ms returned []
Implicit Place search using SMT with State Equation took 1127 ms to find 0 implicit places.
[2023-03-12 06:52:17] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-12 06:52:17] [INFO ] Invariant cache hit.
[2023-03-12 06:52:17] [INFO ] Dead Transitions using invariants and state equation in 423 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1634 ms. Remains : 323/323 places, 814/814 transitions.
Applied a total of 0 rules in 14 ms. Remains 323 /323 variables (removed 0) and now considering 814/814 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-12 06:52:17] [INFO ] Invariant cache hit.
[2023-03-12 06:52:18] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 06:52:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 15 ms returned sat
[2023-03-12 06:52:18] [INFO ] [Nat]Absence check using 9 positive and 21 generalized place invariants in 15 ms returned sat
[2023-03-12 06:52:25] [INFO ] After 7390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 06:52:25] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 1 ms to minimize.
[2023-03-12 06:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2023-03-12 06:52:25] [INFO ] After 7845ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3596 ms.
[2023-03-12 06:52:29] [INFO ] After 11584ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-12 06:52:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 6 ms.
[2023-03-12 06:52:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 323 places, 814 transitions and 3271 arcs took 8 ms.
[2023-03-12 06:52:29] [INFO ] Flatten gal took : 94 ms
Total runtime 87610 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --invariant=/tmp/553/inv_0_ --invariant=/tmp/553/inv_1_ --inv-par
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 12920312 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16097000 kB

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2023

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-03b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-03b, 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 r009-oct2-167813597400054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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