fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r399-tall-171690529800167
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for StigmergyCommit-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8823.376 209014.00 278096.00 792.70 FTFTTTTFFTTTFFFF normal

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.r399-tall-171690529800167.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 greatspnxred
Input is StigmergyCommit-PT-06b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529800167
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.2M
-rw-r--r-- 1 mcc users 7.6K 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 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 16:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 11 17:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M May 18 16:43 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 StigmergyCommit-PT-06b-ReachabilityFireability-2024-00
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-01
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-02
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-03
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-04
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-05
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-06
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-07
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-08
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-09
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-10
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-11
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-12
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-13
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-14
FORMULA_NAME StigmergyCommit-PT-06b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716990861172

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 13:54:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 13:54:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 13:54:22] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2024-05-29 13:54:22] [INFO ] Transformed 2140 places.
[2024-05-29 13:54:22] [INFO ] Transformed 6760 transitions.
[2024-05-29 13:54:22] [INFO ] Found NUPN structural information;
[2024-05-29 13:54:22] [INFO ] Parsed PT model containing 2140 places and 6760 transitions and 67803 arcs in 528 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (313 resets) in 1341 ms. (29 steps per ms) remains 14/16 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (46 resets) in 292 ms. (136 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (44 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 474 ms. (84 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (42 resets) in 140 ms. (283 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 146 ms. (272 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (47 resets) in 181 ms. (219 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (46 resets) in 109 ms. (363 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 432 ms. (92 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (45 resets) in 55 ms. (714 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 1096 ms. (36 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (45 resets) in 69 ms. (571 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (44 resets) in 88 ms. (449 steps per ms) remains 14/14 properties
// Phase 1: matrix 6760 rows 2140 cols
[2024-05-29 13:54:24] [INFO ] Computed 8 invariants in 156 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/102 variables, 102/102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem StigmergyCommit-PT-06b-ReachabilityFireability-2024-07 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-06b-ReachabilityFireability-2024-08 is UNSAT
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2038/2140 variables, 8/110 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2140 variables, 2038/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2140 variables, 0/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 6760/8900 variables, 2140/4288 constraints. Problems are: Problem set: 2 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 8900/8900 variables, and 4288 constraints, problems are : Problem set: 2 solved, 12 unsolved in 5064 ms.
Refiners :[Domain max(s): 2140/2140 constraints, Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 2140/2140 constraints, PredecessorRefiner: 14/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2078/2140 variables, 8/70 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2140 variables, 2078/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2140 variables, 0/2148 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 6760/8900 variables, 2140/4288 constraints. Problems are: Problem set: 2 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8900 variables, 1/4289 constraints. Problems are: Problem set: 2 solved, 12 unsolved
[2024-05-29 13:54:36] [INFO ] Deduced a trap composed of 399 places in 1661 ms of which 55 ms to minimize.
SMT process timed out in 11810ms, After SMT, problems are : Problem set: 2 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 2140 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2140/2140 places, 6760/6760 transitions.
Graph (trivial) has 2038 edges and 2140 vertex of which 126 / 2140 are part of one of the 18 SCC in 9 ms
Free SCC test removed 108 places
Drop transitions (Empty/Sink Transition effects.) removed 138 transitions
Reduce isomorphic transitions removed 138 transitions.
Graph (complete) has 3348 edges and 2032 vertex of which 2020 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.37 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1540 transitions
Trivial Post-agglo rules discarded 1540 transitions
Performed 1540 trivial Post agglomeration. Transition count delta: 1540
Iterating post reduction 0 with 1546 rules applied. Total rules applied 1548 place count 2020 transition count 5070
Reduce places removed 1540 places and 0 transitions.
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 1 with 1588 rules applied. Total rules applied 3136 place count 480 transition count 5022
Reduce places removed 18 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 34 rules applied. Total rules applied 3170 place count 462 transition count 5006
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 20 rules applied. Total rules applied 3190 place count 446 transition count 5002
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 3192 place count 444 transition count 5002
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 74 Pre rules applied. Total rules applied 3192 place count 444 transition count 4928
Deduced a syphon composed of 74 places in 3 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 3340 place count 370 transition count 4928
Discarding 82 places :
Symmetric choice reduction at 5 with 82 rule applications. Total rules 3422 place count 288 transition count 4846
Iterating global reduction 5 with 82 rules applied. Total rules applied 3504 place count 288 transition count 4846
Discarding 30 places :
Symmetric choice reduction at 5 with 30 rule applications. Total rules 3534 place count 258 transition count 4803
Iterating global reduction 5 with 30 rules applied. Total rules applied 3564 place count 258 transition count 4803
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 3571 place count 258 transition count 4796
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 3582 place count 247 transition count 4785
Iterating global reduction 6 with 11 rules applied. Total rules applied 3593 place count 247 transition count 4785
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 3601 place count 239 transition count 4777
Iterating global reduction 6 with 8 rules applied. Total rules applied 3609 place count 239 transition count 4777
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 6 with 8 rules applied. Total rules applied 3617 place count 239 transition count 4769
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 3669 place count 213 transition count 4743
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3670 place count 213 transition count 4742
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3677 place count 206 transition count 4735
Iterating global reduction 8 with 7 rules applied. Total rules applied 3684 place count 206 transition count 4735
Discarding 7 places :
Symmetric choice reduction at 8 with 7 rule applications. Total rules 3691 place count 199 transition count 4728
Iterating global reduction 8 with 7 rules applied. Total rules applied 3698 place count 199 transition count 4728
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 3704 place count 193 transition count 4722
Iterating global reduction 8 with 6 rules applied. Total rules applied 3710 place count 193 transition count 4722
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 4 rules applied. Total rules applied 3714 place count 191 transition count 4740
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 3717 place count 191 transition count 4737
Free-agglomeration rule applied 55 times.
Iterating global reduction 8 with 55 rules applied. Total rules applied 3772 place count 191 transition count 4682
Reduce places removed 55 places and 0 transitions.
Iterating post reduction 8 with 55 rules applied. Total rules applied 3827 place count 136 transition count 4682
Drop transitions (Redundant composition of simpler transitions.) removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 9 with 126 rules applied. Total rules applied 3953 place count 136 transition count 4556
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 3957 place count 134 transition count 4566
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 9 with 2 rules applied. Total rules applied 3959 place count 134 transition count 4564
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 3961 place count 132 transition count 4564
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 10 with 9 rules applied. Total rules applied 3970 place count 132 transition count 4564
Applied a total of 3970 rules in 2170 ms. Remains 132 /2140 variables (removed 2008) and now considering 4564/6760 (removed 2196) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2187 ms. Remains : 132/2140 places, 4564/6760 transitions.
RANDOM walk for 40000 steps (1991 resets) in 946 ms. (42 steps per ms) remains 11/12 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (84 resets) in 110 ms. (360 steps per ms) remains 10/11 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (235 resets) in 174 ms. (228 steps per ms) remains 9/10 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (260 resets) in 108 ms. (367 steps per ms) remains 8/9 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (262 resets) in 83 ms. (476 steps per ms) remains 7/8 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (244 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (80 resets) in 53 ms. (740 steps per ms) remains 6/7 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (263 resets) in 61 ms. (645 steps per ms) remains 5/6 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (65 resets) in 141 ms. (281 steps per ms) remains 4/5 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (66 resets) in 61 ms. (645 steps per ms) remains 3/4 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (88 resets) in 49 ms. (800 steps per ms) remains 2/3 properties
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (243 resets) in 84 ms. (470 steps per ms) remains 2/2 properties
// Phase 1: matrix 4564 rows 132 cols
[2024-05-29 13:54:39] [INFO ] Computed 8 invariants in 34 ms
[2024-05-29 13:54:39] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4564/4696 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4696 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4696 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/4696 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4696/4696 variables, and 154 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1375 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 132/132 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 90/132 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/132 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4564/4696 variables, 132/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4696 variables, 14/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4696 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:54:43] [INFO ] Deduced a trap composed of 33 places in 1254 ms of which 2 ms to minimize.
[2024-05-29 13:54:44] [INFO ] Deduced a trap composed of 27 places in 1232 ms of which 1 ms to minimize.
[2024-05-29 13:54:45] [INFO ] Deduced a trap composed of 24 places in 1186 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/4696 variables, 3/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:54:47] [INFO ] Deduced a trap composed of 20 places in 1349 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/4696 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4696 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/4696 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4696/4696 variables, and 158 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7146 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 132/132 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 4/4 constraints]
After SMT, in 8733ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 42 out of 132 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 132/132 places, 4564/4564 transitions.
Graph (trivial) has 39 edges and 132 vertex of which 2 / 132 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 131 transition count 4554
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 123 transition count 4554
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 17 place count 123 transition count 4552
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 21 place count 121 transition count 4552
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 33 place count 115 transition count 4546
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 35 place count 115 transition count 4544
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 39 place count 111 transition count 4540
Iterating global reduction 3 with 4 rules applied. Total rules applied 43 place count 111 transition count 4540
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 52 place count 111 transition count 4531
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 54 place count 109 transition count 4529
Iterating global reduction 4 with 2 rules applied. Total rules applied 56 place count 109 transition count 4529
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 109 transition count 4528
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 58 place count 108 transition count 4527
Iterating global reduction 5 with 1 rules applied. Total rules applied 59 place count 108 transition count 4527
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 65 place count 108 transition count 4521
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 67 place count 107 transition count 4531
Free-agglomeration rule applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 79 place count 107 transition count 4519
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 6 with 12 rules applied. Total rules applied 91 place count 95 transition count 4519
Applied a total of 91 rules in 1365 ms. Remains 95 /132 variables (removed 37) and now considering 4519/4564 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1365 ms. Remains : 95/132 places, 4519/4564 transitions.
RANDOM walk for 40000 steps (2410 resets) in 472 ms. (84 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (304 resets) in 132 ms. (300 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (304 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 237800 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 2
Probabilistic random walk after 237800 steps, saw 54483 distinct states, run finished after 3004 ms. (steps per millisecond=79 ) properties seen :0
// Phase 1: matrix 4519 rows 95 cols
[2024-05-29 13:54:52] [INFO ] Computed 8 invariants in 20 ms
[2024-05-29 13:54:55] [INFO ] State equation strengthened by 3308 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4519/4614 variables, 95/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4614 variables, 3308/3411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4614 variables, 0/3411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/4614 variables, 0/3411 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4614/4614 variables, and 3411 constraints, problems are : Problem set: 0 solved, 2 unsolved in 10584 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 3308/3308 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 53/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-29 13:55:07] [INFO ] Deduced a trap composed of 19 places in 1021 ms of which 1 ms to minimize.
[2024-05-29 13:55:08] [INFO ] Deduced a trap composed of 20 places in 942 ms of which 1 ms to minimize.
[2024-05-29 13:55:09] [INFO ] Deduced a trap composed of 20 places in 1153 ms of which 1 ms to minimize.
[2024-05-29 13:55:10] [INFO ] Deduced a trap composed of 17 places in 1219 ms of which 2 ms to minimize.
[2024-05-29 13:55:11] [INFO ] Deduced a trap composed of 18 places in 1147 ms of which 1 ms to minimize.
[2024-05-29 13:55:13] [INFO ] Deduced a trap composed of 21 places in 1187 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/95 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 4519/4614 variables, 95/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4614 variables, 3308/3417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4614 variables, 0/3417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/4614 variables, 0/3417 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4614/4614 variables, and 3417 constraints, problems are : Problem set: 0 solved, 2 unsolved in 17617 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 95/95 constraints, ReadFeed: 3308/3308 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 6/6 constraints]
After SMT, in 31016ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 45 ms.
Support contains 42 out of 95 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 4519/4519 transitions.
Applied a total of 0 rules in 1104 ms. Remains 95 /95 variables (removed 0) and now considering 4519/4519 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1107 ms. Remains : 95/95 places, 4519/4519 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 95/95 places, 4519/4519 transitions.
Applied a total of 0 rules in 900 ms. Remains 95 /95 variables (removed 0) and now considering 4519/4519 (removed 0) transitions.
[2024-05-29 13:55:25] [INFO ] Invariant cache hit.
[2024-05-29 13:55:25] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-29 13:55:25] [INFO ] Invariant cache hit.
[2024-05-29 13:55:27] [INFO ] State equation strengthened by 3308 read => feed constraints.
[2024-05-29 13:55:36] [INFO ] Implicit Places using invariants and state equation in 10153 ms returned []
Implicit Place search using SMT with State Equation took 10237 ms to find 0 implicit places.
[2024-05-29 13:55:36] [INFO ] Redundant transitions in 327 ms returned []
Running 4495 sub problems to find dead transitions.
[2024-05-29 13:55:36] [INFO ] Invariant cache hit.
[2024-05-29 13:55:39] [INFO ] State equation strengthened by 3308 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4495 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4495 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 95/4614 variables, and 8 constraints, problems are : Problem set: 0 solved, 4495 unsolved in 30122 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/95 constraints, ReadFeed: 0/3308 constraints, PredecessorRefiner: 4495/65 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4495 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4495 unsolved
At refinement iteration 1 (OVERLAPS) 1/95 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 4495 unsolved
[2024-05-29 13:57:27] [INFO ] Deduced a trap composed of 23 places in 1119 ms of which 1 ms to minimize.
[2024-05-29 13:57:28] [INFO ] Deduced a trap composed of 22 places in 1154 ms of which 1 ms to minimize.
[2024-05-29 13:57:29] [INFO ] Deduced a trap composed of 25 places in 1048 ms of which 1 ms to minimize.
[2024-05-29 13:57:31] [INFO ] Deduced a trap composed of 22 places in 1043 ms of which 1 ms to minimize.
[2024-05-29 13:57:32] [INFO ] Deduced a trap composed of 20 places in 991 ms of which 1 ms to minimize.
[2024-05-29 13:57:33] [INFO ] Deduced a trap composed of 24 places in 1100 ms of which 0 ms to minimize.
[2024-05-29 13:57:34] [INFO ] Deduced a trap composed of 20 places in 1150 ms of which 1 ms to minimize.
[2024-05-29 13:57:35] [INFO ] Deduced a trap composed of 20 places in 1093 ms of which 1 ms to minimize.
[2024-05-29 13:57:36] [INFO ] Deduced a trap composed of 21 places in 913 ms of which 1 ms to minimize.
[2024-05-29 13:57:37] [INFO ] Deduced a trap composed of 20 places in 883 ms of which 1 ms to minimize.
[2024-05-29 13:57:38] [INFO ] Deduced a trap composed of 20 places in 1047 ms of which 1 ms to minimize.
[2024-05-29 13:57:39] [INFO ] Deduced a trap composed of 25 places in 1043 ms of which 0 ms to minimize.
[2024-05-29 13:57:40] [INFO ] Deduced a trap composed of 20 places in 950 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 95/4614 variables, and 21 constraints, problems are : Problem set: 0 solved, 4495 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/95 constraints, ReadFeed: 0/3308 constraints, PredecessorRefiner: 4430/65 constraints, Known Traps: 13/13 constraints]
After SMT, in 124195ms problems are : Problem set: 0 solved, 4495 unsolved
Search for dead transitions found 0 dead transitions in 124243ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135734 ms. Remains : 95/95 places, 4519/4519 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 282 ms. Remains 95 /95 variables (removed 0) and now considering 4519/4519 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 13:57:41] [INFO ] Invariant cache hit.
[2024-05-29 13:57:41] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 13:57:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
SMT process timed out, exceeded limit of 225
[2024-05-29 13:57:42] [INFO ] After 870ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :2
[2024-05-29 13:57:42] [INFO ] After 920ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 1313 ms.
[2024-05-29 13:57:42] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2024-05-29 13:57:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 95 places, 4519 transitions and 62000 arcs took 43 ms.
[2024-05-29 13:57:43] [INFO ] Flatten gal took : 704 ms
Total runtime 200919 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-06b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 95
TRANSITIONS: 4519
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.266s, Sys 0.015s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.025s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 669
MODEL NAME: /home/mcc/execution/410/model
95 places, 4519 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-06b-ReachabilityFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716991070186

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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="StigmergyCommit-PT-06b"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is StigmergyCommit-PT-06b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r399-tall-171690529800167"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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