Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r311-tall-162132108000213.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is TwoPhaseLocking-PT-nC00004vD, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-162132108000213
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 348K
-rw-r--r-- 1 mcc users 15K May 15 08:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 121K May 15 08:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 15 08:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 15 08:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 12 08:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 12 08:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 12 08:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 12 08:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 08:13 NewModel
-rw-r--r-- 1 mcc users 3.5K May 12 04:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 12 04:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 11 18:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K May 11 18:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 12 04:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 12 04:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 08:13 equiv_col
-rw-r--r-- 1 mcc users 10 May 12 08:13 instance
-rw-r--r-- 1 mcc users 6 May 12 08:13 iscolored
-rw-r--r-- 1 mcc users 4.6K May 12 08:13 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 TwoPhaseLocking-PT-nC00004vD-00
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-01
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-02
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-03
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-04
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-05
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-06
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-07
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-08
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-09
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-10
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-11
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-12
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-13
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-14
FORMULA_NAME TwoPhaseLocking-PT-nC00004vD-15

=== Now, execution of the tool begins

BK_START 1621451267262

Running Version 0
[2021-05-19 19:07:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-19 19:07:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 19:07:51] [INFO ] Load time of PNML (sax parser for PT used): 19 ms
[2021-05-19 19:07:51] [INFO ] Transformed 8 places.
[2021-05-19 19:07:51] [INFO ] Transformed 6 transitions.
[2021-05-19 19:07:51] [INFO ] Parsed PT model containing 8 places and 6 transitions in 55 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-19 19:07:51] [INFO ] Initial state test concluded for 4 properties.
FORMULA TwoPhaseLocking-PT-nC00004vD-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 8 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 7 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:51] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-19 19:07:51] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:51] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:51] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
[2021-05-19 19:07:51] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-19 19:07:51] [INFO ] Flatten gal took : 16 ms
FORMULA TwoPhaseLocking-PT-nC00004vD-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TwoPhaseLocking-PT-nC00004vD-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-19 19:07:51] [INFO ] Flatten gal took : 3 ms
[2021-05-19 19:07:51] [INFO ] Input system was already deterministic with 6 transitions.
Finished random walk after 15 steps, including 0 resets, run visited all 7 properties in 1 ms. (steps per millisecond=15 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||(p1 U X(p2))||X((p0||F(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:51] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:51] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:51] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:51] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 349 ms :[(AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0) (NOT p2))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=6 dest: 2}]], initial=0, aps=[p0:(GEQ s2 1), p1:(AND (GEQ s3 1) (GEQ s5 1)), p3:(GEQ s7 1), p2:(LT s6 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-00 finished in 433 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 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 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 11 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:07:52] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:07:52] [INFO ] Implicit Places using invariants in 23 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-19 19:07:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-19 19:07:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 19:07:52] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Starting structural reductions, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-19 19:07:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-19 19:07:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 19:07:52] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 3 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-01 finished in 141 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(!p0)&&(X((X(G(!p0))||p1)) U ((G(p2)&&X((X(G(!p0))||p3)))||X(G((X(G(!p0))||p4)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:52] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:07:52] [INFO ] Implicit Places using invariants in 11 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:07:52] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:07:52] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:07:52] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 19:07:52] [INFO ] Dead Transitions using invariants and state equation in 12 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 5485 ms :[p0, p0, (AND (NOT p2) (NOT p1) (NOT p4) p0), (AND p0 (NOT p2) (NOT p4)), (AND (NOT p4) p2 (NOT p1) (NOT p3) p0), (AND p0 (NOT p3) (NOT p4)), (AND (NOT p4) (NOT p1) p0), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), true, p0, (AND p0 (NOT p2) (NOT p4)), (AND (NOT p4) p0), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p4)), (OR (AND p0 (NOT p3) (NOT p4)) (AND p0 (NOT p2) (NOT p4))), (AND p0 (NOT p3) (NOT p4)), (NOT p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}, { cond=p2, acceptance={} source=0 dest: 5}, { cond=(NOT p2), acceptance={} source=0 dest: 6}, { cond=(NOT p2), acceptance={} source=0 dest: 7}], [{ cond=p0, acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=2 dest: 9}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=2 dest: 10}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=2 dest: 11}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=2 dest: 12}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=p2, acceptance={2} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=(NOT p2), acceptance={0, 2} source=3 dest: 7}, { cond=(AND p2 (NOT p4)), acceptance={1, 2} source=3 dest: 13}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0, 1, 2} source=3 dest: 14}], [{ cond=(AND p2 (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 9}, { cond=(AND p2 (NOT p1) p4 (NOT p3)), acceptance={} source=4 dest: 11}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p4) (NOT p3)), acceptance={1, 2} source=5 dest: 13}, { cond=(AND p2 p4 (NOT p3)), acceptance={2} source=5 dest: 13}, { cond=(AND (NOT p2) (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 14}, { cond=(AND (NOT p2) p4 (NOT p3)), acceptance={0, 2} source=5 dest: 14}, { cond=(AND p2 (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=5 dest: 15}, { cond=(AND p2 p4 (NOT p3)), acceptance={0, 2} source=5 dest: 15}], [{ cond=(AND (NOT p1) (NOT p4)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p1) p4), acceptance={} source=6 dest: 11}], [{ cond=p2, acceptance={} source=7 dest: 2}, { cond=p2, acceptance={2} source=7 dest: 3}, { cond=p2, acceptance={} source=7 dest: 4}, { cond=p2, acceptance={0, 2} source=7 dest: 5}, { cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={0, 2} source=7 dest: 7}, { cond=(AND p2 (NOT p4)), acceptance={1, 2} source=7 dest: 13}, { cond=(AND (NOT p2) (NOT p4)), acceptance={0, 1, 2} source=7 dest: 14}, { cond=(AND p2 (NOT p4)), acceptance={0, 1, 2} source=7 dest: 15}], [{ cond=true, acceptance={0, 1, 2} source=8 dest: 8}], [{ cond=p0, acceptance={} source=9 dest: 8}, { cond=(NOT p0), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=10 dest: 9}, { cond=(AND p2 p4), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p2) p4), acceptance={} source=10 dest: 11}, { cond=(AND p2 (NOT p4)), acceptance={} source=10 dest: 12}], [{ cond=(NOT p4), acceptance={} source=11 dest: 9}, { cond=p4, acceptance={} source=11 dest: 11}], [{ cond=(AND (NOT p2) p0), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=12 dest: 9}, { cond=(AND p2 (NOT p0)), acceptance={} source=12 dest: 12}, { cond=(AND p2 p0), acceptance={} source=12 dest: 16}], [{ cond=p2, acceptance={} source=13 dest: 2}, { cond=(AND p2 p0), acceptance={2} source=13 dest: 3}, { cond=(NOT p2), acceptance={} source=13 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0, 2} source=13 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p4)), acceptance={1} source=13 dest: 13}, { cond=(AND p2 (NOT p0) p4), acceptance={} source=13 dest: 13}, { cond=(AND p2 p0 (NOT p4)), acceptance={1, 2} source=13 dest: 13}, { cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={0, 1} source=13 dest: 14}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={0} source=13 dest: 14}, { cond=(AND (NOT p2) p0 (NOT p4)), acceptance={0, 1, 2} source=13 dest: 14}], [{ cond=p2, acceptance={} source=14 dest: 2}, { cond=(AND p2 p0), acceptance={2} source=14 dest: 3}, { cond=p2, acceptance={} source=14 dest: 4}, { cond=(AND p2 p0), acceptance={0, 2} source=14 dest: 5}, { cond=(NOT p2), acceptance={} source=14 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={0, 2} source=14 dest: 7}, { cond=(AND p2 (NOT p0) (NOT p4)), acceptance={1} source=14 dest: 13}, { cond=(AND p2 (NOT p0) p4), acceptance={} source=14 dest: 13}, { cond=(AND p2 p0 (NOT p4)), acceptance={1, 2} source=14 dest: 13}, { cond=(AND (NOT p2) (NOT p0) (NOT p4)), acceptance={0, 1} source=14 dest: 14}, { cond=(AND (NOT p2) (NOT p0) p4), acceptance={0} source=14 dest: 14}, { cond=(AND (NOT p2) p0 (NOT p4)), acceptance={0, 1, 2} source=14 dest: 14}, { cond=(AND p2 (NOT p0) (NOT p4)), acceptance={0, 1} source=14 dest: 15}, { cond=(AND p2 (NOT p0) p4), acceptance={0} source=14 dest: 15}, { cond=(AND p2 p0 (NOT p4)), acceptance={0, 1, 2} source=14 dest: 15}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=15 dest: 2}, { cond=(AND p2 (NOT p3)), acceptance={} source=15 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=15 dest: 6}, { cond=(AND p2 (NOT p0) (NOT p4) (NOT p3)), acceptance={1} source=15 dest: 13}, { cond=(AND p2 (NOT p0) p4 (NOT p3)), acceptance={} source=15 dest: 13}, { cond=(AND p2 p0 (NOT p4) (NOT p3)), acceptance={1, 2} source=15 dest: 13}, { cond=(AND p2 p0 p4 (NOT p3)), acceptance={2} source=15 dest: 13}, { cond=(AND (NOT p2) (NOT p0) (NOT p4) (NOT p3)), acceptance={0, 1} source=15 dest: 14}, { cond=(AND (NOT p2) (NOT p0) p4 (NOT p3)), acceptance={0} source=15 dest: 14}, { cond=(AND (NOT p2) p0 (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=15 dest: 14}, { cond=(AND (NOT p2) p0 p4 (NOT p3)), acceptance={0, 2} source=15 dest: 14}, { cond=(AND p2 (NOT p0) (NOT p4) (NOT p3)), acceptance={0, 1} source=15 dest: 15}, { cond=(AND p2 (NOT p0) p4 (NOT p3)), acceptance={0} source=15 dest: 15}, { cond=(AND p2 p0 (NOT p4) (NOT p3)), acceptance={0, 1, 2} source=15 dest: 15}, { cond=(AND p2 p0 p4 (NOT p3)), acceptance={0, 2} source=15 dest: 15}], [{ cond=(NOT p2), acceptance={} source=16 dest: 8}, { cond=p2, acceptance={} source=16 dest: 16}]], initial=0, aps=[p2:(OR (LT s3 1) (LT s4 1)), p0:(GEQ s2 1), p1:(OR (LT s3 1) (LT s4 1)), p4:(OR (LT s3 1) (LT s4 1)), p3:(OR (LT s3 1) (LT s4 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 2 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-03 finished in 5577 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(F((p0||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:07:58] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:58] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:07:58] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2021-05-19 19:07:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:58] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-19 19:07:58] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 50000 reset in 205 ms.
Product exploration explored 100000 steps with 50000 reset in 133 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 125 ms.
Product exploration explored 100000 steps with 50000 reset in 172 ms.
[2021-05-19 19:07:58] [INFO ] Flatten gal took : 5 ms
[2021-05-19 19:07:58] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:07:58] [INFO ] Time to serialize gal into /tmp/LTL12605879627003932348.gal : 1 ms
[2021-05-19 19:07:58] [INFO ] Time to serialize properties into /tmp/LTL4125286787933468249.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12605879627003932348.gal, -t, CGAL, -LTL, /tmp/LTL4125286787933468249.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12605879627003932348.gal -t CGAL -LTL /tmp/LTL4125286787933468249.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("((resB>=1)&&(haveA>=1))")||(G("((resA>=1)&&(Clients>=1))")))))||("((resB>=1)&&(haveA>=1))"))))
Formula 0 simplified : !F("((resB>=1)&&(haveA>=1))" | GF("((resB>=1)&&(haveA>=1))" | G"((resA>=1)&&(Clients>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.023112,16812,1,0,22,638,45,13,235,569,35
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00004vD-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property TwoPhaseLocking-PT-nC00004vD-04 finished in 946 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(!p0) U X(X(!p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:59] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-19 19:07:59] [INFO ] Implicit Places using invariants in 14 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 16 ms to find 1 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:07:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:07:59] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Starting structural reductions, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:07:59] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:07:59] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 221 ms :[p1, p1, p1, p1, p1, true, p1, p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 5}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(GEQ s6 1), p1:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-05 finished in 321 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((!p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:59] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:59] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:07:59] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:07:59] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:07:59] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 135 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s3 1) (GEQ s5 1)), p0:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Product exploration explored 100000 steps with 50000 reset in 52 ms.
Product exploration explored 100000 steps with 50000 reset in 62 ms.
Applying partial POR strategy [true, false, true, true]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Support contains 3 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:08:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:08:00] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Product exploration explored 100000 steps with 50000 reset in 176 ms.
Product exploration explored 100000 steps with 50000 reset in 150 ms.
[2021-05-19 19:08:00] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:00] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:00] [INFO ] Time to serialize gal into /tmp/LTL9153219588173819690.gal : 1 ms
[2021-05-19 19:08:00] [INFO ] Time to serialize properties into /tmp/LTL258730050632534071.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL9153219588173819690.gal, -t, CGAL, -LTL, /tmp/LTL258730050632534071.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9153219588173819690.gal -t CGAL -LTL /tmp/LTL258730050632534071.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(haveA2<1)")||(G("((resA>=1)&&(Clients>=1))")))))
Formula 0 simplified : !X("(haveA2<1)" | G"((resA>=1)&&(Clients>=1))")
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.01322,16528,1,0,21,635,37,11,236,556,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00004vD-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TwoPhaseLocking-PT-nC00004vD-06 finished in 1269 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((F(!p1)&&((p2 U p3)||G(!p3))&&p0)))], workingDir=/home/mcc/execution]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:08:00] [INFO ] Implicit Places using invariants in 11 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:00] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 26 ms to find 0 implicit places.
[2021-05-19 19:08:00] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:00] [INFO ] Dead Transitions using invariants and state equation in 13 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) p1), false, (OR (AND (NOT p0) p3) (AND p1 p3)), p1, (AND p1 p3)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p3) (NOT p2))), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p3), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p3), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1)), p3:(AND (GEQ s3 1) (GEQ s5 1)), p2:(GEQ s2 1), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 22185 reset in 104 ms.
Stack based approach found an accepted trace after 159 steps with 33 reset with depth 8 and stack size 8 in 1 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-08 finished in 319 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((F((!p0||G(F(p1)))) U X(!p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:00] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:00] [INFO ] Implicit Places using invariants in 11 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 12 ms to find 1 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:00] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:00] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Starting structural reductions, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:00] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 19:08:00] [INFO ] Dead Transitions using invariants and state equation in 14 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 186 ms :[p2, p2, p2, (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s4 1)), p2:(LT s5 1), p1:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25815 reset in 64 ms.
Product exploration explored 100000 steps with 25747 reset in 123 ms.
Knowledge obtained : [p0, p2, (NOT p1)]
Stuttering acceptance computed with spot in 169 ms :[p2, p2, p2, (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25806 reset in 60 ms.
Product exploration explored 100000 steps with 25836 reset in 74 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 179 ms :[p2, p2, p2, (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:08:01] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:01] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:01] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Product exploration explored 100000 steps with 25820 reset in 139 ms.
Product exploration explored 100000 steps with 25863 reset in 80 ms.
[2021-05-19 19:08:02] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:02] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:02] [INFO ] Time to serialize gal into /tmp/LTL6798110277137576708.gal : 0 ms
[2021-05-19 19:08:02] [INFO ] Time to serialize properties into /tmp/LTL4120765510462430802.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6798110277137576708.gal, -t, CGAL, -LTL, /tmp/LTL4120765510462430802.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6798110277137576708.gal -t CGAL -LTL /tmp/LTL4120765510462430802.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X((F((G(F("((resB>=1)&&(haveA>=1))")))||("((resA>=1)&&(haveB>=1))")))U(X("(haveAandB>=1)")))))
Formula 0 simplified : !X(F("((resA>=1)&&(haveB>=1))" | GF"((resB>=1)&&(haveA>=1))") U X"(haveAandB>=1)")
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
Computing Next relation with stutter on 1 deadlock states
10 unique states visited
0 strongly connected components in search stack
10 transitions explored
6 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.015179,17740,1,0,31,460,54,20,207,467,71
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00004vD-09 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TwoPhaseLocking-PT-nC00004vD-09 finished in 1376 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 5
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2021-05-19 19:08:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Implicit Places using invariants in 9 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
[2021-05-19 19:08:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-19 19:08:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Dead Transitions using invariants and state equation in 11 ms returned []
Starting structural reductions, iteration 1 : 5/8 places, 4/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2021-05-19 19:08:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 4 rows 5 cols
[2021-05-19 19:08:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Dead Transitions using invariants and state equation in 10 ms returned []
Finished structural reductions, in 2 iterations. Remains : 5/8 places, 4/6 transitions.
Stuttering acceptance computed with spot in 26 ms :[p0]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-13 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-13 finished in 73 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(((!p1||G(!p2)) U (!p1&&X(p0))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 8 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Implicit Places using invariants in 10 ms returned []
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:08:02] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 24 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:02] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-19 19:08:02] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 8/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) p1), (OR (NOT p0) p2 p1), (OR (NOT p0) p1), true, (NOT p0), (OR (NOT p0) p2)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-14 automaton TGBA [mat=[[{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (AND p1 p2)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (NOT p0) p2), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 5}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(OR (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s5 1)), p1:(GEQ s7 1), p2:(GEQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA TwoPhaseLocking-PT-nC00004vD-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TwoPhaseLocking-PT-nC00004vD-14 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||(p1&&G((p1 U p0))&&X(p0))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-19 19:08:02] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Implicit Places using invariants in 8 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 9 ms to find 1 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Starting structural reductions, iteration 1 : 7/8 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:02] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:02] [INFO ] Dead Transitions using invariants and state equation in 9 ms returned []
Finished structural reductions, in 2 iterations. Remains : 7/8 places, 6/6 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TwoPhaseLocking-PT-nC00004vD-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s1 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 49 ms.
Product exploration explored 100000 steps with 50000 reset in 60 ms.
Knowledge obtained : [(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Product exploration explored 100000 steps with 50000 reset in 61 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 7 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 7/7 places, 6/6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 1 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2021-05-19 19:08:03] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:03] [INFO ] Dead Transitions using invariants and state equation in 15 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
Product exploration explored 100000 steps with 50000 reset in 104 ms.
Product exploration explored 100000 steps with 50000 reset in 112 ms.
Starting structural reductions, iteration 0 : 7/7 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 6/6 (removed 0) transitions.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:03] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-19 19:08:03] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:03] [INFO ] Implicit Places using invariants and state equation in 10 ms returned []
Implicit Place search using SMT with State Equation took 23 ms to find 0 implicit places.
// Phase 1: matrix 6 rows 7 cols
[2021-05-19 19:08:03] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-19 19:08:03] [INFO ] Dead Transitions using invariants and state equation in 8 ms returned []
Finished structural reductions, in 1 iterations. Remains : 7/7 places, 6/6 transitions.
[2021-05-19 19:08:03] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:03] [INFO ] Flatten gal took : 1 ms
[2021-05-19 19:08:03] [INFO ] Time to serialize gal into /tmp/LTL4632902708518720620.gal : 1 ms
[2021-05-19 19:08:03] [INFO ] Time to serialize properties into /tmp/LTL6263524822085317131.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL4632902708518720620.gal, -t, CGAL, -LTL, /tmp/LTL6263524822085317131.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4632902708518720620.gal -t CGAL -LTL /tmp/LTL6263524822085317131.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F(("((resB>=1)&&(haveA>=1))")||((("(haveA2>=1)")&&(G(("(haveA2>=1)")U("((resB>=1)&&(haveA>=1))"))))&&(X("((resB>=1)&&(haveA>=1))")))))))
Formula 0 simplified : !XF("((resB>=1)&&(haveA>=1))" | ("(haveA2>=1)" & G("(haveA2>=1)" U "((resB>=1)&&(haveA>=1))") & X"((resB>=1)&&(haveA>=1))"))
Reverse transition relation is NOT exact ! Due to transitions t3, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/5/1/6
Computing Next relation with stutter on 1 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.011993,16724,1,0,21,635,36,11,229,556,24
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA TwoPhaseLocking-PT-nC00004vD-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property TwoPhaseLocking-PT-nC00004vD-15 finished in 794 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621451289296

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="TwoPhaseLocking-PT-nC00004vD"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is TwoPhaseLocking-PT-nC00004vD, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r311-tall-162132108000213"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TwoPhaseLocking-PT-nC00004vD.tgz
mv TwoPhaseLocking-PT-nC00004vD execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;