Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r096-smll-165260575600004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is FlexibleBarrier-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-165260575600004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 6.7K Apr 29 13:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Apr 29 13:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 29 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 23K May 10 09:33 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 FlexibleBarrier-PT-04a-LTLFireability-00
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-01
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-02
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-03
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-04
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-05
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-06
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-07
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-08
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-09
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-10
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-11
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-12
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-13
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-14
FORMULA_NAME FlexibleBarrier-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652606624996

Running Version 202205111006
[2022-05-15 09:23:47] [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]
[2022-05-15 09:23:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 09:23:48] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2022-05-15 09:23:48] [INFO ] Transformed 51 places.
[2022-05-15 09:23:48] [INFO ] Transformed 88 transitions.
[2022-05-15 09:23:48] [INFO ] Found NUPN structural information;
[2022-05-15 09:23:48] [INFO ] Parsed PT model containing 51 places and 88 transitions in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 112 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-04a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 78/78 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 74
Applied a total of 4 rules in 20 ms. Remains 51 /51 variables (removed 0) and now considering 74/78 (removed 4) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:48] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-15 09:23:48] [INFO ] Implicit Places using invariants in 284 ms returned []
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:48] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 09:23:48] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 09:23:48] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:48] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 09:23:49] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 51/51 places, 74/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 74/78 transitions.
Support contains 24 out of 51 places after structural reductions.
[2022-05-15 09:23:49] [INFO ] Flatten gal took : 42 ms
[2022-05-15 09:23:49] [INFO ] Flatten gal took : 18 ms
[2022-05-15 09:23:49] [INFO ] Input system was already deterministic with 74 transitions.
Support contains 23 out of 51 places (down from 24) after GAL structural reductions.
Finished random walk after 261 steps, including 0 resets, run visited all 27 properties in 76 ms. (steps per millisecond=3 )
Computed a total of 3 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G((X(!(p0 U !p1))||(X(p2)&&p3)))))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:50] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 09:23:50] [INFO ] Implicit Places using invariants in 139 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 477 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p1) (AND (NOT p3) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p3 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND p3 (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p2) p1) (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) p3 p1) (AND p3 p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(EQ s11 1), p1:(AND (EQ s12 1) (EQ s47 1) (EQ s49 1)), p3:(OR (EQ s12 0) (EQ s47 0) (EQ s49 0)), p2:(EQ s10 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 565 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 15 in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-00 finished in 1324 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(X(p0))))||(F(p1)&&G(X(p2)))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:51] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 09:23:51] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:51] [INFO ] Computed 6 place invariants in 7 ms
[2022-05-15 09:23:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 09:23:51] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:51] [INFO ] Computed 6 place invariants in 9 ms
[2022-05-15 09:23:51] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 474 ms :[true, (OR (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=3 dest: 8}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 6}, { cond=(NOT p1), acceptance={} source=5 dest: 7}], [{ cond=p2, acceptance={} source=6 dest: 2}, { cond=(NOT p2), acceptance={} source=6 dest: 8}], [{ cond=(AND p1 p2), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(NOT p2), acceptance={} source=7 dest: 8}], [{ cond=(NOT p0), acceptance={} source=8 dest: 0}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=5, aps=[p2:(AND (EQ s24 1) (EQ s47 1) (EQ s49 1)), p1:(AND (EQ s16 1) (EQ s50 1)), p0:(OR (EQ s26 0) (EQ s50 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 75 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-01 finished in 915 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(X(X((X(!(X(p0) U p0))||X(p1))))))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:23:52] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 09:23:52] [INFO ] Implicit Places using invariants in 151 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 154 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 7 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 386 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 5}]], initial=6, aps=[p0:(AND (EQ s11 1) (EQ s36 1) (EQ s49 1)), p1:(EQ s25 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 255 ms.
Product exploration explored 100000 steps with 0 reset in 401 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 157 ms. Reduced automaton from 8 states, 12 edges and 2 AP to 8 states, 12 edges and 2 AP.
Stuttering acceptance computed with spot in 404 ms :[true, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 74 rows 50 cols
[2022-05-15 09:23:54] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 09:23:54] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2022-05-15 09:23:54] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), true, (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 308 ms. Reduced automaton from 8 states, 12 edges and 2 AP to 8 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 359 ms :[true, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 345 ms :[true, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 50 cols
[2022-05-15 09:23:55] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 09:23:55] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 74 rows 50 cols
[2022-05-15 09:23:55] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-15 09:23:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2022-05-15 09:23:55] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 50 cols
[2022-05-15 09:23:55] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-15 09:23:55] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 74/74 transitions.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 83 ms. Reduced automaton from 8 states, 11 edges and 2 AP to 8 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 347 ms :[true, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 208 steps, including 0 resets, run visited all 4 properties in 14 ms. (steps per millisecond=14 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (NOT p1)), (F p0), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 249 ms. Reduced automaton from 8 states, 11 edges and 2 AP to 8 states, 11 edges and 2 AP.
Stuttering acceptance computed with spot in 349 ms :[true, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 346 ms :[true, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 366 ms :[true, p0, (AND (NOT p1) p0), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 106 ms.
Product exploration explored 100000 steps with 0 reset in 168 ms.
Built C files in :
/tmp/ltsmin5721642021739898966
[2022-05-15 09:23:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5721642021739898966
Running compilation step : cd /tmp/ltsmin5721642021739898966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 442 ms.
Running link step : cd /tmp/ltsmin5721642021739898966;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 202 ms.
Running LTSmin : cd /tmp/ltsmin5721642021739898966;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7935946295060793270.hoa' '--buchi-type=spotba'
LTSmin run took 1117 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-02 finished in 7541 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 35 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 35 transition count 57
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 35 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 32 place count 35 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 34 transition count 49
Applied a total of 34 rules in 21 ms. Remains 34 /51 variables (removed 17) and now considering 49/74 (removed 25) transitions.
[2022-05-15 09:23:59] [INFO ] Flow matrix only has 44 transitions (discarded 5 similar events)
// Phase 1: matrix 44 rows 34 cols
[2022-05-15 09:23:59] [INFO ] Computed 6 place invariants in 3 ms
[2022-05-15 09:23:59] [INFO ] Implicit Places using invariants in 60 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/51 places, 49/74 transitions.
Graph (trivial) has 37 edges and 33 vertex of which 6 / 33 are part of one of the 2 SCC in 0 ms
Free SCC test removed 4 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 37
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 25 transition count 37
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 9 place count 25 transition count 33
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 21 transition count 33
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 29 place count 15 transition count 27
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 32 place count 15 transition count 24
Applied a total of 32 rules in 13 ms. Remains 15 /33 variables (removed 18) and now considering 24/49 (removed 25) transitions.
[2022-05-15 09:23:59] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-15 09:23:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 09:23:59] [INFO ] Implicit Places using invariants in 26 ms returned []
[2022-05-15 09:23:59] [INFO ] Flow matrix only has 19 transitions (discarded 5 similar events)
// Phase 1: matrix 19 rows 15 cols
[2022-05-15 09:23:59] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 09:23:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2022-05-15 09:23:59] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/51 places, 24/74 transitions.
Finished structural reductions, in 2 iterations. Remains : 15/51 places, 24/74 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s9 1) (NEQ s12 1) (NEQ s14 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 13 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-04 finished in 218 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((X(X(F((X(p0)||p1))))&&(X(p2)||p1)))))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:00] [INFO ] Computed 6 place invariants in 0 ms
[2022-05-15 09:24:00] [INFO ] Implicit Places using invariants in 65 ms returned [50]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}]], initial=1, aps=[p1:(EQ s10 0), p0:(EQ s8 0), p2:(OR (EQ s23 0) (EQ s49 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 425 ms.
Product exploration explored 100000 steps with 33333 reset in 448 ms.
Computed a total of 2 stabilizing places and 1 stable transitions
Computed a total of 2 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), true, (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 7 factoid took 441 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-05 finished in 1608 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(p0)||(F(p2)&&p1)))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:01] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:01] [INFO ] Implicit Places using invariants in 116 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 119 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 231 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s17 1) (EQ s49 1)), p2:(AND (EQ s17 1) (EQ s49 1)), p0:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 1631 reset in 231 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-06 finished in 637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 38 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 21 place count 33 transition count 53
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 27 place count 33 transition count 47
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 33 transition count 47
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 30 place count 32 transition count 46
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 32 transition count 46
Applied a total of 31 rules in 21 ms. Remains 32 /51 variables (removed 19) and now considering 46/74 (removed 28) transitions.
[2022-05-15 09:24:02] [INFO ] Flow matrix only has 40 transitions (discarded 6 similar events)
// Phase 1: matrix 40 rows 32 cols
[2022-05-15 09:24:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:02] [INFO ] Implicit Places using invariants in 62 ms returned [30]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/51 places, 46/74 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 31 transition count 42
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 42
Applied a total of 8 rules in 8 ms. Remains 27 /31 variables (removed 4) and now considering 42/46 (removed 4) transitions.
[2022-05-15 09:24:02] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 27 cols
[2022-05-15 09:24:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 09:24:02] [INFO ] Implicit Places using invariants in 47 ms returned []
[2022-05-15 09:24:02] [INFO ] Flow matrix only has 36 transitions (discarded 6 similar events)
// Phase 1: matrix 36 rows 27 cols
[2022-05-15 09:24:02] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-15 09:24:02] [INFO ] State equation strengthened by 26 read => feed constraints.
[2022-05-15 09:24:02] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/51 places, 42/74 transitions.
Finished structural reductions, in 2 iterations. Remains : 27/51 places, 42/74 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-07 automaton TGBA Formula[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:(AND (EQ s2 1) (EQ s26 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 1 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-07 finished in 336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&(p1||(p2 U X(p3))))))'
Support contains 6 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:02] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 09:24:02] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:02] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:02] [INFO ] State equation strengthened by 33 read => feed constraints.
[2022-05-15 09:24:02] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:02] [INFO ] Computed 6 place invariants in 2 ms
[2022-05-15 09:24:02] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 51/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p0)), (NOT p0), true, (OR (NOT p0) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND p0 p1), acceptance={} source=0 dest: 3}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p3), acceptance={0} source=1 dest: 3}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p3), acceptance={} source=2 dest: 3}, { cond=(OR (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(OR (NEQ s11 1) (NEQ s36 1) (NEQ s49 1)), p1:(EQ s17 1), p2:(AND (EQ s17 1) (EQ s50 1)), p3:(AND (EQ s11 1) (EQ s24 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-08 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G((X(F(p1))&&p0))))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 36 edges and 51 vertex of which 9 / 51 are part of one of the 3 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 34 transition count 56
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 31 place count 34 transition count 48
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 33 place count 34 transition count 48
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 34 place count 33 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 35 place count 33 transition count 47
Applied a total of 35 rules in 19 ms. Remains 33 /51 variables (removed 18) and now considering 47/74 (removed 27) transitions.
[2022-05-15 09:24:03] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 33 cols
[2022-05-15 09:24:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:03] [INFO ] Implicit Places using invariants in 50 ms returned []
[2022-05-15 09:24:03] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 33 cols
[2022-05-15 09:24:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-15 09:24:03] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2022-05-15 09:24:03] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-15 09:24:03] [INFO ] Flow matrix only has 42 transitions (discarded 5 similar events)
// Phase 1: matrix 42 rows 33 cols
[2022-05-15 09:24:03] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:03] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/51 places, 47/74 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/51 places, 47/74 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (EQ s2 0) (EQ s32 0)) (OR (EQ s27 0) (EQ s31 0) (EQ s22 0))), p1:(AND (EQ s27 1) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 9 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-10 finished in 410 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X((p1&&G(p2)))))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:03] [INFO ] Computed 6 place invariants in 4 ms
[2022-05-15 09:24:03] [INFO ] Implicit Places using invariants in 110 ms returned [49, 50]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 49/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 49 /49 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 49/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 475 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p1 p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s48 0), p1:(EQ s39 0), p2:(NEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 37 steps with 1 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-11 finished in 627 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(G(G(X((F(p0)||p0))))))))'
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 38 edges and 51 vertex of which 12 / 51 are part of one of the 4 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 53 edges and 40 vertex of which 38 / 40 are part of one of the 4 SCC in 0 ms
Free SCC test removed 34 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 6 transition count 62
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 63 place count 3 transition count 6
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 65 place count 3 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 65 place count 3 transition count 3
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 67 place count 2 transition count 3
Applied a total of 67 rules in 9 ms. Remains 2 /51 variables (removed 49) and now considering 3/74 (removed 71) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 09:24:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 09:24:04] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 09:24:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 09:24:04] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2022-05-15 09:24:04] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-15 09:24:04] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-15 09:24:04] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/51 places, 3/74 transitions.
Finished structural reductions, in 1 iterations. Remains : 2/51 places, 3/74 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-12 automaton TGBA Formula[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:(EQ s0 0)], 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 5 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-12 finished in 213 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!(G(p0)||F(p0))) U p0))))'
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 74/74 (removed 0) transitions.
// Phase 1: matrix 74 rows 51 cols
[2022-05-15 09:24:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:04] [INFO ] Implicit Places using invariants in 89 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 90 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 50/51 places, 74/74 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 74/74 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 50/51 places, 74/74 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-13 finished in 241 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(X((p0 U p1)))||F(X(p2)))))))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 74/74 transitions.
Graph (trivial) has 32 edges and 51 vertex of which 6 / 51 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 36 transition count 59
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 36 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 31 place count 36 transition count 52
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 32 place count 35 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 35 transition count 51
Applied a total of 33 rules in 21 ms. Remains 35 /51 variables (removed 16) and now considering 51/74 (removed 23) transitions.
[2022-05-15 09:24:04] [INFO ] Flow matrix only has 47 transitions (discarded 4 similar events)
// Phase 1: matrix 47 rows 35 cols
[2022-05-15 09:24:04] [INFO ] Computed 6 place invariants in 1 ms
[2022-05-15 09:24:04] [INFO ] Implicit Places using invariants in 68 ms returned [34]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 70 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/51 places, 51/74 transitions.
Graph (trivial) has 34 edges and 34 vertex of which 6 / 34 are part of one of the 2 SCC in 1 ms
Free SCC test removed 4 places
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 30 transition count 40
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 27 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 9 place count 26 transition count 39
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 9 place count 26 transition count 35
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 17 place count 22 transition count 35
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 27 place count 17 transition count 30
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 30 place count 17 transition count 27
Applied a total of 30 rules in 14 ms. Remains 17 /34 variables (removed 17) and now considering 27/51 (removed 24) transitions.
[2022-05-15 09:24:04] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 17 cols
[2022-05-15 09:24:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 09:24:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2022-05-15 09:24:04] [INFO ] Flow matrix only has 23 transitions (discarded 4 similar events)
// Phase 1: matrix 23 rows 17 cols
[2022-05-15 09:24:04] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-15 09:24:04] [INFO ] State equation strengthened by 7 read => feed constraints.
[2022-05-15 09:24:04] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/51 places, 27/74 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/51 places, 27/74 transitions.
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : FlexibleBarrier-PT-04a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s4 0), p1:(AND (EQ s7 1) (EQ s13 1) (EQ s16 1)), p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 1 ms.
FORMULA FlexibleBarrier-PT-04a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FlexibleBarrier-PT-04a-LTLFireability-15 finished in 407 ms.
All properties solved by simple procedures.
Total runtime 17416 ms.

BK_STOP 1652606645216

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="FlexibleBarrier-PT-04a"
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 FlexibleBarrier-PT-04a, 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 r096-smll-165260575600004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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