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.r266-smll-167863540300014.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is NQueens-PT-05, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540300014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.2K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30K 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 NQueens-PT-05-ReachabilityCardinality-00
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-01
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-02
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-03
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-04
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-05
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-06
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-07
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-08
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-09
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-10
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-11
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-12
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-13
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-14
FORMULA_NAME NQueens-PT-05-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1678730504475

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:01:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:01:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:01:47] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-13 18:01:47] [INFO ] Transformed 55 places.
[2023-03-13 18:01:47] [INFO ] Transformed 25 transitions.
[2023-03-13 18:01:47] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 7 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 1874 resets, run finished after 533 ms. (steps per millisecond=18 ) properties (out of 8) seen :5
FORMULA NQueens-PT-05-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NQueens-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NQueens-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NQueens-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NQueens-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 213 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 25 rows 53 cols
[2023-03-13 18:01:48] [INFO ] Computed 28 place invariants in 6 ms
[2023-03-13 18:01:48] [INFO ] [Real]Absence check using 28 positive place invariants in 28 ms returned sat
[2023-03-13 18:01:48] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-13 18:01:48] [INFO ] [Nat]Absence check using 28 positive place invariants in 16 ms returned sat
[2023-03-13 18:01:48] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
FORMULA NQueens-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA NQueens-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA NQueens-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
All properties solved without resorting to model-checking.
Total runtime 1507 ms.
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: NQueens_PT_05
(NrP: 55 NrTr: 25 NrArc: 125)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 3.717sec


RS generation: 0m 0.013sec


-> reachability set: #nodes 2972 (3.0e+03) #states 462



starting MCC model checker
--------------------------

checking: EF [~ [cX_1<=1]]
normalized: E [true U ~ [cX_1<=1]]

abstracting: (cX_1<=1)
states: 462
-> the formula is FALSE

FORMULA NQueens-PT-05-ReachabilityCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [L_6<=0]
normalized: E [true U L_6<=0]

abstracting: (L_6<=0)
states: 161
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [1<=P_3_1]
normalized: E [true U 1<=P_3_1]

abstracting: (1<=P_3_1)
states: 47
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [P_0_0<=P_2_2]]
normalized: ~ [E [true U P_0_0<=P_2_2]]

abstracting: (P_0_0<=P_2_2)
states: 411
-> the formula is FALSE

FORMULA NQueens-PT-05-ReachabilityCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[cY_2<=0 & ~ [P_3_1<=0]]]
normalized: E [true U [~ [P_3_1<=0] & cY_2<=0]]

abstracting: (cY_2<=0)
states: 231
abstracting: (P_3_1<=0)
states: 415
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[P_2_3<=R_8 & cY_4<=cY_4]]
normalized: ~ [E [true U ~ [[P_2_3<=R_8 & cY_4<=cY_4]]]]

abstracting: (cY_4<=cY_4)
states: 462
abstracting: (P_2_3<=R_8)
states: 462
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[~ [[1<=P_0_3 | [[~ [L_3<=P_3_4] | cY_1<=0] | [L_6<=P_1_2 | ~ [P_3_4<=1]]]]] & P_3_1<=1]] & P_2_1<=1]]
normalized: E [true U [~ [[~ [[[[~ [P_3_4<=1] | L_6<=P_1_2] | [~ [L_3<=P_3_4] | cY_1<=0]] | 1<=P_0_3]] & P_3_1<=1]] & P_2_1<=1]]

abstracting: (P_2_1<=1)
states: 462
abstracting: (P_3_1<=1)
states: 462
abstracting: (1<=P_0_3)
states: 59
abstracting: (cY_1<=0)
states: 255
abstracting: (L_3<=P_3_4)
states: 204
abstracting: (L_6<=P_1_2)
states: 184
abstracting: (P_3_4<=1)
states: 462
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[R_7<=R_7 | ~ [[~ [[1<=L_5 | ~ [P_0_3<=1]]] & [[~ [L_0<=0] | ~ [[[[P_1_0<=P_4_1 & cX_1<=0] & [1<=P_3_0 | L_6<=L_3]] | cY_2<=0]]] & ~ [1<=P_1_2]]]]]]
normalized: E [true U [R_7<=R_7 | ~ [[[~ [1<=P_1_2] & [~ [[cY_2<=0 | [[1<=P_3_0 | L_6<=L_3] & [P_1_0<=P_4_1 & cX_1<=0]]]] | ~ [L_0<=0]]] & ~ [[1<=L_5 | ~ [P_0_3<=1]]]]]]]

abstracting: (P_0_3<=1)
states: 462
abstracting: (1<=L_5)
states: 258
abstracting: (L_0<=0)
states: 51
abstracting: (cX_1<=0)
states: 255
abstracting: (P_1_0<=P_4_1)
states: 419
abstracting: (L_6<=L_3)
states: 336
abstracting: (1<=P_3_0)
states: 59
abstracting: (cY_2<=0)
states: 231
abstracting: (1<=P_1_2)
states: 43
abstracting: (R_7<=R_7)
states: 462
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[P_3_0<=R_6 | [~ [P_1_3<=1] | ~ [[[~ [1<=P_3_2] & ~ [L_0<=1]] & [[1<=R_3 | 1<=R_4] | [~ [[~ [1<=P_3_1] & P_4_0<=L_2]] | [~ [[R_9<=0 & P_3_0<=0]] | [cY_0<=1 & [1<=R_3 & 1<=R_3]]]]]]]]]]
normalized: E [true U [P_3_0<=R_6 | [~ [[[[[[cY_0<=1 & [1<=R_3 & 1<=R_3]] | ~ [[R_9<=0 & P_3_0<=0]]] | ~ [[P_4_0<=L_2 & ~ [1<=P_3_1]]]] | [1<=R_3 | 1<=R_4]] & [~ [L_0<=1] & ~ [1<=P_3_2]]]] | ~ [P_1_3<=1]]]]

abstracting: (P_1_3<=1)
states: 462
abstracting: (1<=P_3_2)
states: 43
abstracting: (L_0<=1)
states: 462
abstracting: (1<=R_4)
states: 258
abstracting: (1<=R_3)
states: 301
abstracting: (1<=P_3_1)
states: 47
abstracting: (P_4_0<=L_2)
states: 440
abstracting: (P_3_0<=0)
states: 403
abstracting: (R_9<=0)
states: 51
abstracting: (1<=R_3)
states: 301
abstracting: (1<=R_3)
states: 301
abstracting: (cY_0<=1)
states: 462
abstracting: (P_3_0<=R_6)
states: 439
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [~ [[L_9<=0 | ~ [[~ [[P_1_0<=L_6 | P_0_0<=1]] | [[cX_2<=P_1_4 & [P_0_4<=P_1_1 | P_2_4<=P_2_1]] & [~ [P_3_0<=P_4_1] | [L_7<=P_1_4 | R_5<=P_1_4]]]]]]]]
normalized: ~ [E [true U [L_9<=0 | ~ [[[[[L_7<=P_1_4 | R_5<=P_1_4] | ~ [P_3_0<=P_4_1]] & [cX_2<=P_1_4 & [P_0_4<=P_1_1 | P_2_4<=P_2_1]]] | ~ [[P_1_0<=L_6 | P_0_0<=1]]]]]]]

abstracting: (P_0_0<=1)
states: 462
abstracting: (P_1_0<=L_6)
states: 443
abstracting: (P_2_4<=P_2_1)
states: 405
abstracting: (P_0_4<=P_1_1)
states: 422
abstracting: (cX_2<=P_1_4)
states: 265
abstracting: (P_3_0<=P_4_1)
states: 403
abstracting: (R_5<=P_1_4)
states: 262
abstracting: (L_7<=P_1_4)
states: 165
abstracting: (L_9<=0)
states: 0
-> the formula is FALSE

FORMULA NQueens-PT-05-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AG [[~ [cY_3<=1] & ~ [[1<=L_0 | ~ [[[[~ [1<=cX_2] & [P_1_4<=R_3 | 1<=P_3_2]] | [[cX_4<=0 & L_5<=P_4_4] & ~ [P_2_4<=P_0_2]]] | [[cY_2<=0 | ~ [cY_1<=0]] | [L_7<=P_3_2 | [P_2_3<=1 | cY_2<=1]]]]]]]]]
normalized: ~ [E [true U ~ [[~ [[1<=L_0 | ~ [[[[L_7<=P_3_2 | [P_2_3<=1 | cY_2<=1]] | [cY_2<=0 | ~ [cY_1<=0]]] | [[~ [P_2_4<=P_0_2] & [cX_4<=0 & L_5<=P_4_4]] | [[P_1_4<=R_3 | 1<=P_3_2] & ~ [1<=cX_2]]]]]]] & ~ [cY_3<=1]]]]]

abstracting: (cY_3<=1)
states: 462
abstracting: (1<=cX_2)
states: 231
abstracting: (1<=P_3_2)
states: 43
abstracting: (P_1_4<=R_3)
states: 443
abstracting: (L_5<=P_4_4)
states: 232
abstracting: (cX_4<=0)
states: 277
abstracting: (P_2_4<=P_0_2)
states: 405
abstracting: (cY_1<=0)
states: 255
abstracting: (cY_2<=0)
states: 231
abstracting: (cY_2<=1)
states: 462
abstracting: (P_2_3<=1)
states: 462
abstracting: (L_7<=P_3_2)
states: 161
abstracting: (1<=L_0)
states: 411
-> the formula is FALSE

FORMULA NQueens-PT-05-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: AG [~ [[[1<=L_4 & [[[~ [[1<=P_2_2 | P_2_1<=cX_2]] | ~ [P_3_3<=1]] | 1<=L_8] | P_0_4<=0]] | [~ [[[P_4_2<=0 | P_1_3<=0] | P_2_2<=1]] & [[cY_2<=0 & [[[1<=P_1_1 & 1<=P_0_0] | ~ [1<=P_0_4]] & ~ [P_3_4<=cX_2]]] & [~ [1<=P_2_3] & cX_4<=1]]]]]]
normalized: ~ [E [true U [[[[cX_4<=1 & ~ [1<=P_2_3]] & [cY_2<=0 & [~ [P_3_4<=cX_2] & [~ [1<=P_0_4] | [1<=P_1_1 & 1<=P_0_0]]]]] & ~ [[P_2_2<=1 | [P_4_2<=0 | P_1_3<=0]]]] | [1<=L_4 & [P_0_4<=0 | [1<=L_8 | [~ [P_3_3<=1] | ~ [[1<=P_2_2 | P_2_1<=cX_2]]]]]]]]]

abstracting: (P_2_1<=cX_2)
states: 419
abstracting: (1<=P_2_2)
states: 31
abstracting: (P_3_3<=1)
states: 462
abstracting: (1<=L_8)
states: 411
abstracting: (P_0_4<=0)
states: 411
abstracting: (1<=L_4)
states: 235
abstracting: (P_1_3<=0)
states: 415
abstracting: (P_4_2<=0)
states: 405
abstracting: (P_2_2<=1)
states: 462
abstracting: (1<=P_0_0)
states: 51
abstracting: (1<=P_1_1)
states: 47
abstracting: (1<=P_0_4)
states: 51
abstracting: (P_3_4<=cX_2)
states: 437
abstracting: (cY_2<=0)
states: 231
abstracting: (1<=P_2_3)
states: 43
abstracting: (cX_4<=1)
states: 462
-> the formula is FALSE

FORMULA NQueens-PT-05-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: AG [~ [[P_0_3<=P_0_4 & ~ [[[cX_3<=cY_3 | ~ [cX_4<=0]] | [[P_1_0<=0 & ~ [[P_1_3<=L_2 & 1<=P_4_3]]] | [[cX_2<=P_2_2 & [L_9<=1 & P_2_0<=1]] & [[P_0_1<=P_0_1 & 1<=P_2_1] | [P_2_3<=0 | P_4_4<=L_0]]]]]]]]]
normalized: ~ [E [true U [P_0_3<=P_0_4 & ~ [[[[[[P_2_3<=0 | P_4_4<=L_0] | [P_0_1<=P_0_1 & 1<=P_2_1]] & [cX_2<=P_2_2 & [L_9<=1 & P_2_0<=1]]] | [P_1_0<=0 & ~ [[P_1_3<=L_2 & 1<=P_4_3]]]] | [cX_3<=cY_3 | ~ [cX_4<=0]]]]]]]

abstracting: (cX_4<=0)
states: 277
abstracting: (cX_3<=cY_3)
states: 362
abstracting: (1<=P_4_3)
states: 59
abstracting: (P_1_3<=L_2)
states: 415
abstracting: (P_1_0<=0)
states: 403
abstracting: (P_2_0<=1)
states: 462
abstracting: (L_9<=1)
states: 462
abstracting: (cX_2<=P_2_2)
states: 231
abstracting: (1<=P_2_1)
states: 43
abstracting: (P_0_1<=P_0_1)
states: 462
abstracting: (P_4_4<=L_0)
states: 462
abstracting: (P_2_3<=0)
states: 419
abstracting: (P_0_3<=P_0_4)
states: 403
-> the formula is FALSE

FORMULA NQueens-PT-05-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[[[~ [[[P_4_1<=L_6 & ~ [R_3<=R_0]] & [[[P_0_0<=0 & 1<=L_5] & P_0_2<=cX_0] | [[P_4_4<=1 & P_1_3<=0] & 1<=cY_1]]]] | [1<=P_4_3 & ~ [[~ [[P_2_2<=1 | R_7<=R_0]] & [[R_5<=1 | ~ [L_3<=0]] & [[1<=cY_2 & 1<=P_3_0] | ~ [P_2_2<=0]]]]]]] | [[[P_1_2<=0 & 1<=P_2_3] | [[[1<=R_0 & P_4_1<=P_3_2] & 1<=P_0_3] & [[P_1_4<=R_2 & [[P_4_4<=1 | 1<=P_3_2] | 1<=P_1_0]] | [[~ [L_7<=0] & [L_2<=0 & P_4_3<=P_0_3]] | 1<=R_1]]]] & P_2_1<=0]] & P_3_2<=0]]
normalized: E [true U [P_3_2<=0 & [[P_2_1<=0 & [[[[1<=R_1 | [[L_2<=0 & P_4_3<=P_0_3] & ~ [L_7<=0]]] | [P_1_4<=R_2 & [1<=P_1_0 | [P_4_4<=1 | 1<=P_3_2]]]] & [1<=P_0_3 & [1<=R_0 & P_4_1<=P_3_2]]] | [P_1_2<=0 & 1<=P_2_3]]] | [[1<=P_4_3 & ~ [[[[~ [P_2_2<=0] | [1<=cY_2 & 1<=P_3_0]] & [R_5<=1 | ~ [L_3<=0]]] & ~ [[P_2_2<=1 | R_7<=R_0]]]]] | ~ [[[[1<=cY_1 & [P_4_4<=1 & P_1_3<=0]] | [P_0_2<=cX_0 & [P_0_0<=0 & 1<=L_5]]] & [P_4_1<=L_6 & ~ [R_3<=R_0]]]]]]]]

abstracting: (R_3<=R_0)
states: 462
abstracting: (P_4_1<=L_6)
states: 449
abstracting: (1<=L_5)
states: 258
abstracting: (P_0_0<=0)
states: 411
abstracting: (P_0_2<=cX_0)
states: 405
abstracting: (P_1_3<=0)
states: 415
abstracting: (P_4_4<=1)
states: 462
abstracting: (1<=cY_1)
states: 207
abstracting: (R_7<=R_0)
states: 462
abstracting: (P_2_2<=1)
states: 462
abstracting: (L_3<=0)
states: 204
abstracting: (R_5<=1)
states: 462
abstracting: (1<=P_3_0)
states: 59
abstracting: (1<=cY_2)
states: 231
abstracting: (P_2_2<=0)
states: 431
abstracting: (1<=P_4_3)
states: 59
abstracting: (1<=P_2_3)
states: 43
abstracting: (P_1_2<=0)
states: 419
abstracting: (P_4_1<=P_3_2)
states: 403
abstracting: (1<=R_0)
states: 462
abstracting: (1<=P_0_3)
states: 59
abstracting: (1<=P_3_2)
states: 43
abstracting: (P_4_4<=1)
states: 462
abstracting: (1<=P_1_0)
states: 59
abstracting: (P_1_4<=R_2)
states: 446
abstracting: (L_7<=0)
states: 118
abstracting: (P_4_3<=P_0_3)
states: 403
abstracting: (L_2<=0)
states: 161
abstracting: (1<=R_1)
states: 411
abstracting: (P_2_1<=0)
states: 419
abstracting: (P_3_2<=0)
states: 419
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[[[P_0_1<=P_0_0 & [[~ [[[P_4_2<=1 | ~ [1<=R_4]] & ~ [[L_7<=0 & L_6<=P_2_1]]]] | P_3_0<=1] & [[~ [cX_0<=0] & ~ [[~ [1<=P_0_0] & [P_1_3<=P_4_4 | P_4_2<=1]]]] & 1<=P_3_2]]] & 1<=P_1_0] | [[[[[[[[1<=cY_2 & P_3_0<=1] | [1<=P_4_3 | P_0_0<=P_0_1]] | [P_0_2<=0 & [1<=P_4_0 | 1<=cY_1]]] | [~ [[1<=R_2 & 1<=R_6]] & ~ [R_2<=P_3_1]]] | 1<=cX_1] & [[[~ [P_1_2<=R_2] | [~ [R_6<=0] | L_2<=R_4]] & [~ [[L_6<=1 | P_3_2<=P_0_4]] | [~ [R_6<=P_4_3] & [P_3_2<=cY_3 & 1<=P_1_4]]]] & [~ [1<=R_2] & 1<=R_8]]] & [P_4_3<=0 & [[[~ [[1<=P_0_4 | 1<=L_2]] & [P_0_4<=1 & ~ [1<=R_3]]] | [[P_4_0<=P_1_2 & [P_2_3<=1 & 1<=P_2_1]] & P_0_3<=1]] | [L_9<=0 | [[[1<=P_2_2 | 1<=L_2] | P_4_4<=0] & ~ [1<=P_4_0]]]]]] | [L_7<=1 | [[~ [[1<=cX_2 | P_2_1<=1]] | 1<=P_1_0] | [L_9<=1 & ~ [cY_2<=L_3]]]]]]]
normalized: ~ [E [true U ~ [[[[L_7<=1 | [[L_9<=1 & ~ [cY_2<=L_3]] | [1<=P_1_0 | ~ [[1<=cX_2 | P_2_1<=1]]]]] | [[P_4_3<=0 & [[L_9<=0 | [~ [1<=P_4_0] & [P_4_4<=0 | [1<=P_2_2 | 1<=L_2]]]] | [[P_0_3<=1 & [P_4_0<=P_1_2 & [P_2_3<=1 & 1<=P_2_1]]] | [[P_0_4<=1 & ~ [1<=R_3]] & ~ [[1<=P_0_4 | 1<=L_2]]]]]] & [[[1<=R_8 & ~ [1<=R_2]] & [[[[P_3_2<=cY_3 & 1<=P_1_4] & ~ [R_6<=P_4_3]] | ~ [[L_6<=1 | P_3_2<=P_0_4]]] & [[L_2<=R_4 | ~ [R_6<=0]] | ~ [P_1_2<=R_2]]]] & [1<=cX_1 | [[~ [R_2<=P_3_1] & ~ [[1<=R_2 & 1<=R_6]]] | [[P_0_2<=0 & [1<=P_4_0 | 1<=cY_1]] | [[1<=P_4_3 | P_0_0<=P_0_1] | [1<=cY_2 & P_3_0<=1]]]]]]]] | [1<=P_1_0 & [P_0_1<=P_0_0 & [[1<=P_3_2 & [~ [[[P_1_3<=P_4_4 | P_4_2<=1] & ~ [1<=P_0_0]]] & ~ [cX_0<=0]]] & [P_3_0<=1 | ~ [[~ [[L_7<=0 & L_6<=P_2_1]] & [P_4_2<=1 | ~ [1<=R_4]]]]]]]]]]]]

abstracting: (1<=R_4)
states: 258
abstracting: (P_4_2<=1)
states: 462
abstracting: (L_6<=P_2_1)
states: 193
abstracting: (L_7<=0)
states: 118
abstracting: (P_3_0<=1)
states: 462
abstracting: (cX_0<=0)
states: 277
abstracting: (1<=P_0_0)
states: 51
abstracting: (P_4_2<=1)
states: 462
abstracting: (P_1_3<=P_4_4)
states: 426
abstracting: (1<=P_3_2)
states: 43
abstracting: (P_0_1<=P_0_0)
states: 403
abstracting: (1<=P_1_0)
states: 59
abstracting: (P_3_0<=1)
states: 462
abstracting: (1<=cY_2)
states: 231
abstracting: (P_0_0<=P_0_1)
states: 411
abstracting: (1<=P_4_3)
states: 59
abstracting: (1<=cY_1)
states: 207
abstracting: (1<=P_4_0)
states: 51
abstracting: (P_0_2<=0)
states: 405
abstracting: (1<=R_6)
states: 258
abstracting: (1<=R_2)
states: 344
abstracting: (R_2<=P_3_1)
states: 153
abstracting: (1<=cX_1)
states: 207
abstracting: (P_1_2<=R_2)
states: 462
abstracting: (R_6<=0)
states: 204
abstracting: (L_2<=R_4)
states: 321
abstracting: (P_3_2<=P_0_4)
states: 422
abstracting: (L_6<=1)
states: 462
abstracting: (R_6<=P_4_3)
states: 247
abstracting: (1<=P_1_4)
states: 59
abstracting: (P_3_2<=cY_3)
states: 442
abstracting: (1<=R_2)
states: 344
abstracting: (1<=R_8)
states: 344
abstracting: (1<=L_2)
states: 301
abstracting: (1<=P_0_4)
states: 51
abstracting: (1<=R_3)
states: 301
abstracting: (P_0_4<=1)
states: 462
abstracting: (1<=P_2_1)
states: 43
abstracting: (P_2_3<=1)
states: 462
abstracting: (P_4_0<=P_1_2)
states: 414
abstracting: (P_0_3<=1)
states: 462
abstracting: (1<=L_2)
states: 301
abstracting: (1<=P_2_2)
states: 31
abstracting: (P_4_4<=0)
states: 411
abstracting: (1<=P_4_0)
states: 51
abstracting: (L_9<=0)
states: 0
abstracting: (P_4_3<=0)
states: 403
abstracting: (P_2_1<=1)
states: 462
abstracting: (1<=cX_2)
states: 231
abstracting: (1<=P_1_0)
states: 59
abstracting: (cY_2<=L_3)
states: 376
abstracting: (L_9<=1)
states: 462
abstracting: (L_7<=1)
states: 462
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [~ [[[[[[[~ [[R_5<=0 | 1<=P_4_3]] | [[P_0_2<=P_3_3 & 1<=R_8] & 1<=P_1_1]] | cX_0<=1] | ~ [[~ [1<=cX_3] | ~ [1<=cY_4]]]] & ~ [[P_4_1<=P_4_0 & ~ [[P_2_4<=cX_2 & P_1_0<=1]]]]] & [[[~ [[[cY_2<=cX_3 | cX_3<=0] & [P_2_1<=cX_4 | P_3_4<=P_3_4]]] & [[[1<=R_0 & 1<=R_4] | [1<=R_9 | P_4_3<=0]] & [[1<=P_0_1 & P_3_0<=0] | ~ [L_6<=P_3_1]]]] | [1<=L_2 | [[1<=P_1_4 & P_2_4<=0] & [[1<=P_0_0 & 1<=P_1_0] | 1<=L_5]]]] | [[~ [[[1<=cX_1 & P_0_3<=cX_3] | [1<=cY_1 & P_2_0<=1]]] & [[[P_1_0<=cY_0 | P_3_0<=P_1_0] | ~ [P_0_4<=P_4_4]] & [~ [P_0_4<=P_2_3] & [cY_3<=P_3_4 & R_2<=0]]]] & [[L_0<=0 | P_3_0<=R_2] & R_2<=cY_0]]]] & [R_8<=0 | [[1<=cX_0 | [[[~ [P_1_2<=1] & ~ [R_7<=R_7]] & P_1_2<=1] | [[~ [P_2_2<=L_5] & R_2<=0] & ~ [1<=R_7]]]] | [[~ [cX_2<=R_8] & [~ [L_4<=P_3_2] & [~ [1<=P_1_3] & P_4_3<=1]]] & [~ [1<=cY_1] & [~ [R_8<=L_8] | [[1<=P_4_1 & 1<=cY_3] & ~ [P_3_3<=1]]]]]]]]]]
normalized: E [true U ~ [[[R_8<=0 | [[[[[~ [P_3_3<=1] & [1<=P_4_1 & 1<=cY_3]] | ~ [R_8<=L_8]] & ~ [1<=cY_1]] & [[[P_4_3<=1 & ~ [1<=P_1_3]] & ~ [L_4<=P_3_2]] & ~ [cX_2<=R_8]]] | [1<=cX_0 | [[~ [1<=R_7] & [R_2<=0 & ~ [P_2_2<=L_5]]] | [P_1_2<=1 & [~ [R_7<=R_7] & ~ [P_1_2<=1]]]]]]] & [[[[R_2<=cY_0 & [L_0<=0 | P_3_0<=R_2]] & [[[[cY_3<=P_3_4 & R_2<=0] & ~ [P_0_4<=P_2_3]] & [~ [P_0_4<=P_4_4] | [P_1_0<=cY_0 | P_3_0<=P_1_0]]] & ~ [[[1<=cY_1 & P_2_0<=1] | [1<=cX_1 & P_0_3<=cX_3]]]]] | [[1<=L_2 | [[1<=L_5 | [1<=P_0_0 & 1<=P_1_0]] & [1<=P_1_4 & P_2_4<=0]]] | [[[~ [L_6<=P_3_1] | [1<=P_0_1 & P_3_0<=0]] & [[1<=R_9 | P_4_3<=0] | [1<=R_0 & 1<=R_4]]] & ~ [[[P_2_1<=cX_4 | P_3_4<=P_3_4] & [cY_2<=cX_3 | cX_3<=0]]]]]] & [~ [[P_4_1<=P_4_0 & ~ [[P_2_4<=cX_2 & P_1_0<=1]]]] & [~ [[~ [1<=cY_4] | ~ [1<=cX_3]]] | [cX_0<=1 | [[1<=P_1_1 & [P_0_2<=P_3_3 & 1<=R_8]] | ~ [[R_5<=0 | 1<=P_4_3]]]]]]]]]]

abstracting: (1<=P_4_3)
states: 59
abstracting: (R_5<=0)
states: 227
abstracting: (1<=R_8)
states: 344
abstracting: (P_0_2<=P_3_3)
states: 416
abstracting: (1<=P_1_1)
states: 47
abstracting: (cX_0<=1)
states: 462
abstracting: (1<=cX_3)
states: 207
abstracting: (1<=cY_4)
states: 185
abstracting: (P_1_0<=1)
states: 462
abstracting: (P_2_4<=cX_2)
states: 405
abstracting: (P_4_1<=P_4_0)
states: 403
abstracting: (cX_3<=0)
states: 255
abstracting: (cY_2<=cX_3)
states: 346
abstracting: (P_3_4<=P_3_4)
states: 462
abstracting: (P_2_1<=cX_4)
states: 438
abstracting: (1<=R_4)
states: 258
abstracting: (1<=R_0)
states: 462
abstracting: (P_4_3<=0)
states: 403
abstracting: (1<=R_9)
states: 411
abstracting: (P_3_0<=0)
states: 403
abstracting: (1<=P_0_1)
states: 59
abstracting: (L_6<=P_3_1)
states: 161
abstracting: (P_2_4<=0)
states: 405
abstracting: (1<=P_1_4)
states: 59
abstracting: (1<=P_1_0)
states: 59
abstracting: (1<=P_0_0)
states: 51
abstracting: (1<=L_5)
states: 258
abstracting: (1<=L_2)
states: 301
abstracting: (P_0_3<=cX_3)
states: 429
abstracting: (1<=cX_1)
states: 207
abstracting: (P_2_0<=1)
states: 462
abstracting: (1<=cY_1)
states: 207
abstracting: (P_3_0<=P_1_0)
states: 403
abstracting: (P_1_0<=cY_0)
states: 403
abstracting: (P_0_4<=P_4_4)
states: 411
abstracting: (P_0_4<=P_2_3)
states: 421
abstracting: (R_2<=0)
states: 118
abstracting: (cY_3<=P_3_4)
states: 286
abstracting: (P_3_0<=R_2)
states: 446
abstracting: (L_0<=0)
states: 51
abstracting: (R_2<=cY_0)
states: 280
abstracting: (P_1_2<=1)
states: 462
abstracting: (R_7<=R_7)
states: 462
abstracting: (P_1_2<=1)
states: 462
abstracting: (P_2_2<=L_5)
states: 446
abstracting: (R_2<=0)
states: 118
abstracting: (1<=R_7)
states: 301
abstracting: (1<=cX_0)
states: 185
abstracting: (cX_2<=R_8)
states: 397
abstracting: (L_4<=P_3_2)
states: 248
abstracting: (1<=P_1_3)
states: 47
abstracting: (P_4_3<=1)
states: 462
abstracting: (1<=cY_1)
states: 207
abstracting: (R_8<=L_8)
states: 418
abstracting: (1<=cY_3)
states: 207
abstracting: (1<=P_4_1)
states: 59
abstracting: (P_3_3<=1)
states: 462
abstracting: (R_8<=0)
states: 118
-> the formula is TRUE

FORMULA NQueens-PT-05-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

totally nodes used: 42805 (4.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 12451 149841 162292
used/not used/entry size/cache size: 150211 66958653 16 1024MB
basic ops cache: hits/miss/sum: 16913 262911 279824
used/not used/entry size/cache size: 373216 16404000 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4360 28128 32488
used/not used/entry size/cache size: 28127 8360481 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67067010
1 40929
2 899
3 26
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.569sec


BK_STOP 1678730515504

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
R_0
L_9

The net has transition(s) that can never fire:


check for constant places
L_9
R_0
found 2 constant places
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:328 (13), effective:25 (1)

initing FirstDep: 0m 0.000sec


iterations count:60 (2), effective:3 (0)

iterations count:34 (1), effective:1 (0)

iterations count:25 (1), effective:0 (0)

iterations count:44 (1), effective:3 (0)

iterations count:94 (3), effective:6 (0)

iterations count:25 (1), effective:0 (0)

iterations count:25 (1), effective:0 (0)

iterations count:25 (1), effective:0 (0)

iterations count:25 (1), effective:0 (0)

iterations count:25 (1), effective:0 (0)

iterations count:46 (1), effective:1 (0)

iterations count:25 (1), effective:0 (0)

iterations count:83 (3), effective:7 (0)

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="NQueens-PT-05"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is NQueens-PT-05, 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 r266-smll-167863540300014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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