Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r521-tall-167987246100004.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Anderson-PT-04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r521-tall-167987246100004
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 428K
-rw-r--r-- 1 mcc users 6.4K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 23 15:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 23 15:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.6K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 103K Mar 31 16:48 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 Anderson-PT-04-LTLFireability-00
FORMULA_NAME Anderson-PT-04-LTLFireability-01
FORMULA_NAME Anderson-PT-04-LTLFireability-02
FORMULA_NAME Anderson-PT-04-LTLFireability-03
FORMULA_NAME Anderson-PT-04-LTLFireability-04
FORMULA_NAME Anderson-PT-04-LTLFireability-05
FORMULA_NAME Anderson-PT-04-LTLFireability-06
FORMULA_NAME Anderson-PT-04-LTLFireability-07
FORMULA_NAME Anderson-PT-04-LTLFireability-08
FORMULA_NAME Anderson-PT-04-LTLFireability-09
FORMULA_NAME Anderson-PT-04-LTLFireability-10
FORMULA_NAME Anderson-PT-04-LTLFireability-11
FORMULA_NAME Anderson-PT-04-LTLFireability-12
FORMULA_NAME Anderson-PT-04-LTLFireability-13
FORMULA_NAME Anderson-PT-04-LTLFireability-14
FORMULA_NAME Anderson-PT-04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680853350156

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-04
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202304061127
[2023-04-07 07:42:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-07 07:42:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 07:42:31] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-04-07 07:42:31] [INFO ] Transformed 105 places.
[2023-04-07 07:42:31] [INFO ] Transformed 200 transitions.
[2023-04-07 07:42:31] [INFO ] Found NUPN structural information;
[2023-04-07 07:42:31] [INFO ] Parsed PT model containing 105 places and 200 transitions and 752 arcs in 238 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-04-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 200/200 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 97 transition count 186
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 97 transition count 186
Applied a total of 16 rules in 17 ms. Remains 97 /105 variables (removed 8) and now considering 186/200 (removed 14) transitions.
// Phase 1: matrix 186 rows 97 cols
[2023-04-07 07:42:32] [INFO ] Computed 11 invariants in 14 ms
[2023-04-07 07:42:32] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-04-07 07:42:32] [INFO ] Invariant cache hit.
[2023-04-07 07:42:32] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:32] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
[2023-04-07 07:42:32] [INFO ] Invariant cache hit.
[2023-04-07 07:42:32] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/105 places, 186/200 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 570 ms. Remains : 97/105 places, 186/200 transitions.
Support contains 39 out of 97 places after structural reductions.
[2023-04-07 07:42:32] [INFO ] Flatten gal took : 39 ms
[2023-04-07 07:42:32] [INFO ] Flatten gal took : 17 ms
[2023-04-07 07:42:32] [INFO ] Input system was already deterministic with 186 transitions.
Support contains 38 out of 97 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 374 ms. (steps per millisecond=26 ) properties (out of 34) seen :27
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-04-07 07:42:33] [INFO ] Invariant cache hit.
[2023-04-07 07:42:33] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-04-07 07:42:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-04-07 07:42:33] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-07 07:42:33] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA Anderson-PT-04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((!p0 U (X(p0)&&p1)))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 97 transition count 174
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 85 transition count 174
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 39 place count 70 transition count 99
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 70 transition count 99
Applied a total of 54 rules in 19 ms. Remains 70 /97 variables (removed 27) and now considering 99/186 (removed 87) transitions.
// Phase 1: matrix 99 rows 70 cols
[2023-04-07 07:42:34] [INFO ] Computed 11 invariants in 3 ms
[2023-04-07 07:42:34] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-04-07 07:42:34] [INFO ] Invariant cache hit.
[2023-04-07 07:42:34] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-04-07 07:42:34] [INFO ] Redundant transitions in 2 ms returned []
[2023-04-07 07:42:34] [INFO ] Invariant cache hit.
[2023-04-07 07:42:34] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/97 places, 99/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 327 ms. Remains : 70/97 places, 99/186 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s54 1)), p0:(AND (EQ s10 1) (EQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 41 steps with 0 reset with depth 42 and stack size 42 in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-00 finished in 918 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(F(p1)))))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 82 transition count 111
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 82 transition count 111
Applied a total of 30 rules in 12 ms. Remains 82 /97 variables (removed 15) and now considering 111/186 (removed 75) transitions.
// Phase 1: matrix 111 rows 82 cols
[2023-04-07 07:42:35] [INFO ] Computed 11 invariants in 5 ms
[2023-04-07 07:42:35] [INFO ] Implicit Places using invariants in 100 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/97 places, 111/186 transitions.
Applied a total of 0 rules in 3 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 81/97 places, 111/186 transitions.
Stuttering acceptance computed with spot in 271 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-04-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 7}], [{ cond=p0, acceptance={} source=7 dest: 2}, { cond=(NOT p0), acceptance={} source=7 dest: 4}]], initial=1, aps=[p1:(OR (EQ s5 0) (EQ s12 0)), p0:(OR (NEQ s1 1) (NEQ s51 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, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19943 reset in 170 ms.
Product exploration explored 100000 steps with 19946 reset in 161 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 94 ms. Reduced automaton from 8 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 111 rows 81 cols
[2023-04-07 07:42:36] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 07:42:36] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 07:42:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 4 ms returned sat
[2023-04-07 07:42:36] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 4 ms returned sat
[2023-04-07 07:42:36] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), true, (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 161 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Applied a total of 0 rules in 6 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2023-04-07 07:42:36] [INFO ] Invariant cache hit.
[2023-04-07 07:42:36] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-04-07 07:42:36] [INFO ] Invariant cache hit.
[2023-04-07 07:42:36] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:36] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-04-07 07:42:36] [INFO ] Invariant cache hit.
[2023-04-07 07:42:36] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 81/81 places, 111/111 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 295 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=59 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 122 ms.
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Applying partial POR strategy [false, true, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 81 transition count 111
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 11 place count 81 transition count 111
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 23 place count 81 transition count 111
Deduced a syphon composed of 23 places in 1 ms
Applied a total of 23 rules in 17 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
[2023-04-07 07:42:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 111 rows 81 cols
[2023-04-07 07:42:38] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 07:42:38] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 111/111 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 94 ms. Remains : 81/81 places, 111/111 transitions.
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 111/111 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 111/111 (removed 0) transitions.
// Phase 1: matrix 111 rows 81 cols
[2023-04-07 07:42:38] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 07:42:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-04-07 07:42:38] [INFO ] Invariant cache hit.
[2023-04-07 07:42:38] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:38] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-04-07 07:42:38] [INFO ] Invariant cache hit.
[2023-04-07 07:42:38] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 261 ms. Remains : 81/81 places, 111/111 transitions.
Treatment of property Anderson-PT-04-LTLFireability-01 finished in 3812 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(p0)||G(p1)) U p2))'
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 118
Applied a total of 28 rules in 18 ms. Remains 83 /97 variables (removed 14) and now considering 118/186 (removed 68) transitions.
// Phase 1: matrix 118 rows 83 cols
[2023-04-07 07:42:39] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 07:42:39] [INFO ] Implicit Places using invariants in 104 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 118/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 142 ms. Remains : 82/97 places, 118/186 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s10 1) (EQ s29 1)), p1:(AND (EQ s5 1) (EQ s14 1)), p0:(AND (EQ s6 1) (EQ s16 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-02 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&F(p1)))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 118
Applied a total of 28 rules in 4 ms. Remains 83 /97 variables (removed 14) and now considering 118/186 (removed 68) transitions.
// Phase 1: matrix 118 rows 83 cols
[2023-04-07 07:42:39] [INFO ] Computed 11 invariants in 7 ms
[2023-04-07 07:42:39] [INFO ] Implicit Places using invariants in 82 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 82 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 118/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 87 ms. Remains : 82/97 places, 118/186 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : Anderson-PT-04-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s15 1)), p0:(AND (EQ s10 1) (EQ s17 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-03 finished in 230 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 97 transition count 174
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 24 place count 85 transition count 174
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 40 place count 69 transition count 92
Iterating global reduction 0 with 16 rules applied. Total rules applied 56 place count 69 transition count 92
Applied a total of 56 rules in 10 ms. Remains 69 /97 variables (removed 28) and now considering 92/186 (removed 94) transitions.
// Phase 1: matrix 92 rows 69 cols
[2023-04-07 07:42:39] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 07:42:39] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-04-07 07:42:39] [INFO ] Invariant cache hit.
[2023-04-07 07:42:39] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:39] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-04-07 07:42:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-04-07 07:42:39] [INFO ] Invariant cache hit.
[2023-04-07 07:42:39] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/97 places, 92/186 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 243 ms. Remains : 69/97 places, 92/186 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 307 reset in 77 ms.
Stack based approach found an accepted trace after 42 steps with 1 reset with depth 23 and stack size 23 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-05 finished in 361 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 97 transition count 175
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 22 place count 86 transition count 175
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 37 place count 71 transition count 94
Iterating global reduction 0 with 15 rules applied. Total rules applied 52 place count 71 transition count 94
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 0 with 2 rules applied. Total rules applied 54 place count 70 transition count 93
Applied a total of 54 rules in 7 ms. Remains 70 /97 variables (removed 27) and now considering 93/186 (removed 93) transitions.
// Phase 1: matrix 93 rows 70 cols
[2023-04-07 07:42:39] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 07:42:39] [INFO ] Implicit Places using invariants in 61 ms returned [0]
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 : 69/97 places, 93/186 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 69 transition count 77
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 53 transition count 77
Applied a total of 32 rules in 3 ms. Remains 53 /69 variables (removed 16) and now considering 77/93 (removed 16) transitions.
// Phase 1: matrix 77 rows 53 cols
[2023-04-07 07:42:39] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 07:42:39] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-04-07 07:42:39] [INFO ] Invariant cache hit.
[2023-04-07 07:42:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:40] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/97 places, 77/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 203 ms. Remains : 53/97 places, 77/186 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-06 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 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]]
Product exploration explored 100000 steps with 857 reset in 82 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-06 finished in 353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F((X((!p2 U (!p3||G(!p2))))&&p1))&&p0))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 112
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 112
Applied a total of 28 rules in 4 ms. Remains 83 /97 variables (removed 14) and now considering 112/186 (removed 74) transitions.
// Phase 1: matrix 112 rows 83 cols
[2023-04-07 07:42:40] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 07:42:40] [INFO ] Implicit Places using invariants in 88 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 112/186 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 95 ms. Remains : 82/97 places, 112/186 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p0) (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (AND p2 p3)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) p3 p2), acceptance={0} source=3 dest: 2}, { cond=(AND p3 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p3 p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s24 1)), p1:(AND (OR (NEQ s5 1) (NEQ s15 1)) (NEQ s25 1)), p3:(AND (EQ s5 1) (EQ s15 1)), p2:(OR (AND (EQ s5 1) (EQ s15 1)) (EQ s25...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 29 reset in 85 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-07 finished in 366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&(F(!p1) U G((F(p0)&&p2))))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 11 Pre rules applied. Total rules applied 0 place count 97 transition count 175
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 22 place count 86 transition count 175
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 36 place count 72 transition count 101
Iterating global reduction 0 with 14 rules applied. Total rules applied 50 place count 72 transition count 101
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 0 with 2 rules applied. Total rules applied 52 place count 71 transition count 100
Applied a total of 52 rules in 13 ms. Remains 71 /97 variables (removed 26) and now considering 100/186 (removed 86) transitions.
// Phase 1: matrix 100 rows 71 cols
[2023-04-07 07:42:40] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 07:42:40] [INFO ] Implicit Places using invariants in 57 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/97 places, 100/186 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 70 transition count 92
Reduce places removed 8 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 11 rules applied. Total rules applied 19 place count 62 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 59 transition count 89
Applied a total of 22 rules in 5 ms. Remains 59 /70 variables (removed 11) and now considering 89/100 (removed 11) transitions.
// Phase 1: matrix 89 rows 59 cols
[2023-04-07 07:42:40] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 07:42:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-04-07 07:42:40] [INFO ] Invariant cache hit.
[2023-04-07 07:42:40] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:40] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 124 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/97 places, 89/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 214 ms. Remains : 59/97 places, 89/186 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (OR (AND (NOT p0) p1) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p0) p1)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s22 1), p2:(AND (EQ s6 1) (EQ s16 1)), p1:(AND (EQ s0 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 316 reset in 92 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-08 finished in 523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||(p1 U p2)||(F(p4)&&p3))))))'
Support contains 5 out of 97 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 84 transition count 119
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 84 transition count 119
Applied a total of 26 rules in 5 ms. Remains 84 /97 variables (removed 13) and now considering 119/186 (removed 67) transitions.
// Phase 1: matrix 119 rows 84 cols
[2023-04-07 07:42:41] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 07:42:41] [INFO ] Implicit Places using invariants in 54 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 83/97 places, 119/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 83 /83 variables (removed 0) and now considering 119/119 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 83/97 places, 119/186 transitions.
Stuttering acceptance computed with spot in 150 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p2) (NOT p4)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)))]
Running random walk in product with property : Anderson-PT-04-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3 (NOT p4)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p4)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=2, aps=[p0:(EQ s26 1), p2:(AND (EQ s9 1) (EQ s14 1)), p3:(AND (EQ s9 1) (EQ s14 1)), p4:(AND (EQ s8 1) (EQ s16 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 14 reset in 94 ms.
Stack based approach found an accepted trace after 37 steps with 0 reset with depth 38 and stack size 38 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-09 finished in 326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p0))||(F(p0)&&(!p1||G(F(!p2))))))))'
Support contains 6 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 83 transition count 118
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 83 transition count 118
Applied a total of 28 rules in 2 ms. Remains 83 /97 variables (removed 14) and now considering 118/186 (removed 68) transitions.
// Phase 1: matrix 118 rows 83 cols
[2023-04-07 07:42:41] [INFO ] Computed 11 invariants in 3 ms
[2023-04-07 07:42:41] [INFO ] Implicit Places using invariants in 56 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 57 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/97 places, 118/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 82 /82 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60 ms. Remains : 82/97 places, 118/186 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s16 1)), p1:(AND (EQ s3 1) (EQ s62 1)), p2:(AND (EQ s6 1) (EQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 77 ms.
Stack based approach found an accepted trace after 25 steps with 0 reset with depth 26 and stack size 26 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-10 finished in 352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(!p0)) U p1))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 104
Applied a total of 32 rules in 2 ms. Remains 81 /97 variables (removed 16) and now considering 104/186 (removed 82) transitions.
// Phase 1: matrix 104 rows 81 cols
[2023-04-07 07:42:41] [INFO ] Computed 11 invariants in 1 ms
[2023-04-07 07:42:41] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-04-07 07:42:41] [INFO ] Invariant cache hit.
[2023-04-07 07:42:41] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:41] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2023-04-07 07:42:41] [INFO ] Invariant cache hit.
[2023-04-07 07:42:41] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/97 places, 104/186 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 81/97 places, 104/186 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (NOT p1), (NOT p1), p0]
Running random walk in product with property : Anderson-PT-04-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s2 1) (EQ s43 1)), p0:(AND (EQ s0 1) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 82 ms.
Stack based approach found an accepted trace after 186 steps with 0 reset with depth 187 and stack size 117 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-11 finished in 432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 97 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 97 transition count 174
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 24 place count 85 transition count 174
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 39 place count 70 transition count 99
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 70 transition count 99
Applied a total of 54 rules in 6 ms. Remains 70 /97 variables (removed 27) and now considering 99/186 (removed 87) transitions.
// Phase 1: matrix 99 rows 70 cols
[2023-04-07 07:42:42] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 07:42:42] [INFO ] Implicit Places using invariants in 68 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/97 places, 99/186 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 84
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 54 transition count 84
Applied a total of 30 rules in 5 ms. Remains 54 /69 variables (removed 15) and now considering 84/99 (removed 15) transitions.
// Phase 1: matrix 84 rows 54 cols
[2023-04-07 07:42:42] [INFO ] Computed 10 invariants in 1 ms
[2023-04-07 07:42:42] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-04-07 07:42:42] [INFO ] Invariant cache hit.
[2023-04-07 07:42:42] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-04-07 07:42:42] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 54/97 places, 84/186 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 54/97 places, 84/186 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 80 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 56 in 0 ms.
FORMULA Anderson-PT-04-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-04-LTLFireability-12 finished in 325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0)||X(p1)))))'
Support contains 4 out of 97 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 97/97 places, 186/186 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 81 transition count 104
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 81 transition count 104
Applied a total of 32 rules in 1 ms. Remains 81 /97 variables (removed 16) and now considering 104/186 (removed 82) transitions.
// Phase 1: matrix 104 rows 81 cols
[2023-04-07 07:42:42] [INFO ] Computed 11 invariants in 2 ms
[2023-04-07 07:42:42] [INFO ] Implicit Places using invariants in 57 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 72 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/97 places, 104/186 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 80/97 places, 104/186 transitions.
Stuttering acceptance computed with spot in 199 ms :[true, (NOT p1), (AND (NOT p1) p0), (AND p0 (NOT p1)), p0, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-04-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={} source=6 dest: 2}]], initial=5, aps=[p1:(OR (EQ s3 0) (EQ s60 0)), p0:(OR (NEQ s1 1) (NEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 171 steps with 42 reset in 1 ms.
FORMULA Anderson-PT-04-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-04-LTLFireability-13 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(X(F(p1)))))))'
[2023-04-07 07:42:42] [INFO ] Flatten gal took : 14 ms
[2023-04-07 07:42:42] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-04-07 07:42:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 97 places, 186 transitions and 710 arcs took 2 ms.
Total runtime 11295 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1087/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Anderson-PT-04-LTLFireability-01

BK_STOP 1680853364127

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Anderson-PT-04-LTLFireability-01
ltl formula formula --ltl=/tmp/1087/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 97 places, 186 transitions and 710 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1087/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1087/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1087/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1087/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is Anderson-PT-04, 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 r521-tall-167987246100004"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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