About the Execution of ITS-Tools for Sudoku-PT-AN11
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16212.932 | 3600000.00 | 2934858.00 | 587188.10 | FTFFTF?FTFFFTTTF | normal |
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.r258-tall-165303545500283.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 Sudoku-PT-AN11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r258-tall-165303545500283
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.0M
-rw-r--r-- 1 mcc users 207K Apr 30 12:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 967K Apr 30 12:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 534K Apr 30 12:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 30 12:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 178K May 9 09:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 603K May 9 09:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 680K May 9 09:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 2.5M May 9 09:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 65K May 9 09:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 161K May 9 09:11 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 746K May 10 09:34 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 Sudoku-PT-AN11-LTLCardinality-00
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-01
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-02
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-03
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-04
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-05
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-06
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-07
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-08
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-09
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-10
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-11
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-12
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-13
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-14
FORMULA_NAME Sudoku-PT-AN11-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1653107504385
Running Version 202205111006
[2022-05-21 04:31:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-21 04:31:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-21 04:31:45] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2022-05-21 04:31:45] [INFO ] Transformed 1694 places.
[2022-05-21 04:31:45] [INFO ] Transformed 1331 transitions.
[2022-05-21 04:31:45] [INFO ] Parsed PT model containing 1694 places and 1331 transitions in 277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 102 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA Sudoku-PT-AN11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1694 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 23 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:31:46] [INFO ] Computed 363 place invariants in 35 ms
[2022-05-21 04:31:46] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:31:46] [INFO ] Computed 363 place invariants in 12 ms
[2022-05-21 04:31:47] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:31:47] [INFO ] Computed 363 place invariants in 10 ms
[2022-05-21 04:31:48] [INFO ] Dead Transitions using invariants and state equation in 769 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Support contains 1694 out of 1694 places after structural reductions.
[2022-05-21 04:31:48] [INFO ] Flatten gal took : 211 ms
[2022-05-21 04:31:48] [INFO ] Flatten gal took : 112 ms
[2022-05-21 04:31:49] [INFO ] Input system was already deterministic with 1331 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 1952 ms. (steps per millisecond=5 ) properties (out of 20) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:31:52] [INFO ] Computed 363 place invariants in 5 ms
[2022-05-21 04:31:53] [INFO ] After 621ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-05-21 04:31:54] [INFO ] [Nat]Absence check using 363 positive place invariants in 75 ms returned sat
[2022-05-21 04:31:58] [INFO ] After 2485ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :4
[2022-05-21 04:31:58] [INFO ] After 2897ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :4
Attempting to minimize the solution found.
Minimization took 254 ms.
[2022-05-21 04:31:58] [INFO ] After 5374ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :4
Fused 12 Parikh solutions to 1 different solutions.
Finished Parikh walk after 121 steps, including 0 resets, run visited all 4 properties in 37 ms. (steps per millisecond=3 )
Parikh walk visited 4 properties in 46 ms.
Successfully simplified 8 atomic propositions for a total of 11 simplifications.
FORMULA Sudoku-PT-AN11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN11-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1694 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 1694 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA Sudoku-PT-AN11-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((true U true) U true))&&F((true U true))))'
Support contains 0 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 0 are kept as prefixes of interest. Removing 1694 places using SCC suffix rule.8 ms
Discarding 1694 places :
Also discarding 1331 output transitions
Drop transitions removed 1331 transitions
Applied a total of 1 rules in 18 ms. Remains 0 /1694 variables (removed 1694) and now considering 0/1331 (removed 1331) transitions.
[2022-05-21 04:31:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 04:31:59] [INFO ] Implicit Places using invariants in 4 ms returned []
[2022-05-21 04:31:59] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-21 04:31:59] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 22 ms to find 0 implicit places.
[2022-05-21 04:31:59] [INFO ] Redundant transitions in 0 ms returned []
[2022-05-21 04:31:59] [INFO ] Computed 0 place invariants in 2 ms
[2022-05-21 04:31:59] [INFO ] Dead Transitions using invariants and state equation in 6 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 0/1694 places, 0/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 0/1694 places, 0/1331 transitions.
Stuttering acceptance computed with spot in 28 ms :[false]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-01 automaton TGBA Formula[mat=[[]], initial=0, aps=[], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-01 TRUE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-01 finished in 133 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G((F(p0)&&p1)))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 89 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:31:59] [INFO ] Computed 363 place invariants in 5 ms
[2022-05-21 04:32:00] [INFO ] Implicit Places using invariants in 763 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:32:00] [INFO ] Computed 363 place invariants in 10 ms
[2022-05-21 04:32:01] [INFO ] Implicit Places using invariants and state equation in 1399 ms returned []
Implicit Place search using SMT with State Equation took 2166 ms to find 0 implicit places.
[2022-05-21 04:32:01] [INFO ] Redundant transitions in 87 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:32:01] [INFO ] Computed 363 place invariants in 11 ms
[2022-05-21 04:32:02] [INFO ] Dead Transitions using invariants and state equation in 752 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (GT 3 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s...], 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 104 steps with 0 reset in 91 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-03 finished in 3411 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U X(!X(p1))))'
Support contains 1452 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 26 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:32:02] [INFO ] Computed 363 place invariants in 9 ms
[2022-05-21 04:32:03] [INFO ] Implicit Places using invariants in 576 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:32:03] [INFO ] Computed 363 place invariants in 10 ms
[2022-05-21 04:32:04] [INFO ] Implicit Places using invariants and state equation in 1439 ms returned []
Implicit Place search using SMT with State Equation took 2017 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:32:04] [INFO ] Computed 363 place invariants in 5 ms
[2022-05-21 04:32:05] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 179 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], 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][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-05 finished in 2968 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((X(X(p1)) U p1))||p0))))'
Support contains 363 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1331 places and 0 transitions.
Iterating post reduction 0 with 1331 rules applied. Total rules applied 1331 place count 363 transition count 1331
Applied a total of 1331 rules in 14 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:05] [INFO ] Computed 32 place invariants in 74 ms
[2022-05-21 04:32:05] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:05] [INFO ] Computed 32 place invariants in 77 ms
[2022-05-21 04:32:06] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:32:06] [INFO ] Computed 32 place invariants in 67 ms
[2022-05-21 04:32:06] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(OR (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 ...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 947 reset in 8105 ms.
Product exploration explored 100000 steps with 946 reset in 8198 ms.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 404 ms. Reduced automaton from 6 states, 10 edges and 2 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 251606 steps, run timeout after 3004 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251606 steps, saw 127864 distinct states, run finished after 3005 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:19] [INFO ] Computed 32 place invariants in 52 ms
[2022-05-21 04:33:19] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2022-05-21 04:33:20] [INFO ] After 1163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 04:33:20] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 17 ms returned sat
[2022-05-21 04:33:21] [INFO ] After 794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 04:33:21] [INFO ] After 850ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2022-05-21 04:33:21] [INFO ] After 967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 9 factoid took 403 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 121 out of 363 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 3 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:22] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-21 04:33:22] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:22] [INFO ] Computed 32 place invariants in 26 ms
[2022-05-21 04:33:23] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:23] [INFO ] Computed 32 place invariants in 36 ms
[2022-05-21 04:33:23] [INFO ] Dead Transitions using invariants and state equation in 437 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Computed a total of 363 stabilizing places and 1331 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 363 transition count 1331
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 94 resets, run finished after 815 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 293811 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293811 steps, saw 135453 distinct states, run finished after 3001 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:33:40] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-21 04:33:40] [INFO ] [Real]Absence check using 0 positive and 32 generalized place invariants in 18 ms returned sat
[2022-05-21 04:33:41] [INFO ] After 1132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-21 04:33:41] [INFO ] [Nat]Absence check using 0 positive and 32 generalized place invariants in 19 ms returned sat
[2022-05-21 04:33:42] [INFO ] After 786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-21 04:33:42] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2022-05-21 04:33:42] [INFO ] After 975ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 121 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=20 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [p1, (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 5 states, 7 edges and 1 AP to 5 states, 7 edges and 1 AP.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 945 reset in 8150 ms.
Product exploration explored 100000 steps with 948 reset in 8241 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 112 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
[2022-05-21 04:34:00] [INFO ] Redundant transitions in 66 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:00] [INFO ] Computed 32 place invariants in 28 ms
[2022-05-21 04:34:00] [INFO ] Dead Transitions using invariants and state equation in 446 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Product exploration explored 100000 steps with 947 reset in 8156 ms.
Product exploration explored 100000 steps with 945 reset in 8224 ms.
Built C files in :
/tmp/ltsmin11198135986415706043
[2022-05-21 04:34:17] [INFO ] Built C files in 30ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11198135986415706043
Running compilation step : cd /tmp/ltsmin11198135986415706043;'/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 2411 ms.
Running link step : cd /tmp/ltsmin11198135986415706043;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 304 ms.
Running LTSmin : cd /tmp/ltsmin11198135986415706043;'/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/stateBased1126378025590515040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 121 out of 363 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 363/363 places, 1331/1331 transitions.
Applied a total of 0 rules in 19 ms. Remains 363 /363 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:32] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-21 04:34:32] [INFO ] Implicit Places using invariants in 258 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:32] [INFO ] Computed 32 place invariants in 31 ms
[2022-05-21 04:34:33] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1406 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:34:33] [INFO ] Computed 32 place invariants in 25 ms
[2022-05-21 04:34:34] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/363 places, 1331/1331 transitions.
Built C files in :
/tmp/ltsmin17987470444902043332
[2022-05-21 04:34:34] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17987470444902043332
Running compilation step : cd /tmp/ltsmin17987470444902043332;'/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 2325 ms.
Running link step : cd /tmp/ltsmin17987470444902043332;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin17987470444902043332;'/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/stateBased1496868330816574473.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-21 04:34:49] [INFO ] Flatten gal took : 59 ms
[2022-05-21 04:34:49] [INFO ] Flatten gal took : 60 ms
[2022-05-21 04:34:49] [INFO ] Time to serialize gal into /tmp/LTL7960603231384101509.gal : 13 ms
[2022-05-21 04:34:49] [INFO ] Time to serialize properties into /tmp/LTL2997293575351839784.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7960603231384101509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2997293575351839784.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7960603...266
Read 1 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+((...8043
Formula 0 simplified : !GX("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0...8027
Detected timeout of ITS tools.
[2022-05-21 04:35:04] [INFO ] Flatten gal took : 55 ms
[2022-05-21 04:35:04] [INFO ] Applying decomposition
[2022-05-21 04:35:04] [INFO ] Flatten gal took : 53 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1509306772550279569.txt' '-o' '/tmp/graph1509306772550279569.bin' '-w' '/tmp/graph1509306772550279569.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1509306772550279569.bin' '-l' '-1' '-v' '-w' '/tmp/graph1509306772550279569.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:35:04] [INFO ] Decomposing Gal with order
[2022-05-21 04:35:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:35:06] [INFO ] Removed a total of 1210 redundant transitions.
[2022-05-21 04:35:07] [INFO ] Flatten gal took : 2068 ms
[2022-05-21 04:35:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 86 ms.
[2022-05-21 04:35:07] [INFO ] Time to serialize gal into /tmp/LTL8515248482361552723.gal : 6 ms
[2022-05-21 04:35:07] [INFO ] Time to serialize properties into /tmp/LTL4644917439535195079.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8515248482361552723.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4644917439535195079.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8515248...266
Read 1 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((gu1.Columns_0_0+gu1.Columns_0_1)+(gu1.Columns_0_2+gu1.Columns_0_3))+((gu1.Columns_0_4+gu1.Columns_0_5)+(gu1.C...10463
Formula 0 simplified : !GX("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...10447
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8192787894973060837
[2022-05-21 04:35:22] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8192787894973060837
Running compilation step : cd /tmp/ltsmin8192787894973060837;'/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 2243 ms.
Running link step : cd /tmp/ltsmin8192787894973060837;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8192787894973060837;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Sudoku-PT-AN11-LTLCardinality-06 finished in 211812 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!G(!F(p0)) U X(p0)))'
Support contains 1331 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Applied a total of 0 rules in 28 ms. Remains 1694 /1694 variables (removed 0) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:35:37] [INFO ] Computed 363 place invariants in 8 ms
[2022-05-21 04:35:38] [INFO ] Implicit Places using invariants in 716 ms returned []
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:35:38] [INFO ] Computed 363 place invariants in 12 ms
[2022-05-21 04:35:39] [INFO ] Implicit Places using invariants and state equation in 1589 ms returned []
Implicit Place search using SMT with State Equation took 2308 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 1694 cols
[2022-05-21 04:35:39] [INFO ] Computed 363 place invariants in 11 ms
[2022-05-21 04:35:40] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1694/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, p0, p0]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s121 s122 s123 s124 s125 s126 s127 s128 s129 s130 s131 s132 s133 s134 s135 s136 s137 s138 s139 s140 s141 s142 s143 s144 s145 s146 s147 s148...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-07 finished in 3125 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(G((X(p0)&&p0))))))))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Graph (complete) has 3993 edges and 1694 vertex of which 363 are kept as prefixes of interest. Removing 1331 places using SCC suffix rule.5 ms
Discarding 1331 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 34 ms. Remains 363 /1694 variables (removed 1331) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:35:40] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-21 04:35:40] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:35:40] [INFO ] Computed 32 place invariants in 24 ms
[2022-05-21 04:35:42] [INFO ] Implicit Places using invariants and state equation in 1232 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2022-05-21 04:35:42] [INFO ] Redundant transitions in 25 ms returned []
// Phase 1: matrix 1331 rows 363 cols
[2022-05-21 04:35:42] [INFO ] Computed 32 place invariants in 29 ms
[2022-05-21 04:35:42] [INFO ] Dead Transitions using invariants and state equation in 460 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 363/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 363/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s261 s236)], 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 105 steps with 0 reset in 12 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-09 finished in 2177 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(p1)))'
Support contains 2 out of 1694 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1694/1694 places, 1331/1331 transitions.
Reduce places removed 1330 places and 0 transitions.
Iterating post reduction 0 with 1330 rules applied. Total rules applied 1330 place count 364 transition count 1331
Applied a total of 1330 rules in 32 ms. Remains 364 /1694 variables (removed 1330) and now considering 1331/1331 (removed 0) transitions.
// Phase 1: matrix 1331 rows 364 cols
[2022-05-21 04:35:42] [INFO ] Computed 32 place invariants in 39 ms
[2022-05-21 04:35:43] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 1331 rows 364 cols
[2022-05-21 04:35:43] [INFO ] Computed 32 place invariants in 40 ms
[2022-05-21 04:35:44] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2053 ms to find 0 implicit places.
// Phase 1: matrix 1331 rows 364 cols
[2022-05-21 04:35:44] [INFO ] Computed 32 place invariants in 30 ms
[2022-05-21 04:35:45] [INFO ] Dead Transitions using invariants and state equation in 470 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 364/1694 places, 1331/1331 transitions.
Finished structural reductions, in 1 iterations. Remains : 364/1694 places, 1331/1331 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Sudoku-PT-AN11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT 1 s224), p1:(GT 1 s121)], 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][false, false, false]]
Stuttering criterion allowed to conclude after 24134 steps with 11857 reset in 2973 ms.
FORMULA Sudoku-PT-AN11-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Sudoku-PT-AN11-LTLCardinality-11 finished in 5660 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((G((X(X(p1)) U p1))||p0))))'
[2022-05-21 04:35:48] [INFO ] Flatten gal took : 67 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5163646036985752566
[2022-05-21 04:35:48] [INFO ] Computing symmetric may disable matrix : 1331 transitions.
[2022-05-21 04:35:48] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:35:48] [INFO ] Applying decomposition
[2022-05-21 04:35:48] [INFO ] Computing symmetric may enable matrix : 1331 transitions.
[2022-05-21 04:35:48] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:35:48] [INFO ] Flatten gal took : 66 ms
[2022-05-21 04:35:48] [INFO ] Computing Do-Not-Accords matrix : 1331 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1053115159601752309.txt' '-o' '/tmp/graph1053115159601752309.bin' '-w' '/tmp/graph1053115159601752309.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1053115159601752309.bin' '-l' '-1' '-v' '-w' '/tmp/graph1053115159601752309.weights' '-q' '0' '-e' '0.001'
[2022-05-21 04:35:48] [INFO ] Decomposing Gal with order
[2022-05-21 04:35:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-21 04:35:48] [INFO ] Computation of Completed DNA matrix. took 64 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-21 04:35:48] [INFO ] Built C files in 340ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5163646036985752566
Running compilation step : cd /tmp/ltsmin5163646036985752566;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' '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'
[2022-05-21 04:35:50] [INFO ] Removed a total of 1210 redundant transitions.
[2022-05-21 04:35:50] [INFO ] Flatten gal took : 1382 ms
[2022-05-21 04:35:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1331 labels/synchronizations in 30 ms.
[2022-05-21 04:35:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality8743648123772627142.gal : 6 ms
[2022-05-21 04:35:50] [INFO ] Time to serialize properties into /tmp/LTLCardinality6555039069855385391.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality8743648123772627142.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6555039069855385391.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...288
Read 1 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((gu1.Columns_0_0+gu1.Columns_0_1)+(gu1.Columns_0_2+gu1.Columns_0_3))+((gu1.Columns_0_4+gu1.Columns_0_5)+(gu1.C...10463
Formula 0 simplified : !GX("((((((((gu0.Rows_0_0+gu0.Rows_0_1)+(gu0.Rows_0_2+gu0.Rows_0_3))+((gu0.Rows_0_4+gu0.Rows_0_5)+(gu0.Rows_0_6+gu0.Rows_0_7)))+(((g...10447
Compilation finished in 4956 ms.
Running link step : cd /tmp/ltsmin5163646036985752566;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin5163646036985752566;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.224: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.225: LTL layer: formula: [](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 3/ 8), 0.225: "[](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.225: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.254: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.266: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.276: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.277: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.285: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.335: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.566: DFS-FIFO for weak LTL, using special progress label 1334
pins2lts-mc-linux64( 0/ 8), 0.566: There are 1335 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.566: State length is 1695, there are 1344 groups
pins2lts-mc-linux64( 0/ 8), 0.566: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.566: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.566: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.566: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 6/ 8), 6.270: ~1 levels ~960 states ~1248248 transitions
pins2lts-mc-linux64( 6/ 8), 10.232: ~1 levels ~1920 states ~2483576 transitions
pins2lts-mc-linux64( 6/ 8), 18.582: ~1 levels ~3840 states ~4920856 transitions
pins2lts-mc-linux64( 3/ 8), 35.086: ~1 levels ~7680 states ~9805368 transitions
pins2lts-mc-linux64( 7/ 8), 48.963: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 82.800:
pins2lts-mc-linux64( 0/ 8), 82.800: mean standard work distribution: 1.1% (states) 0.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 82.800:
pins2lts-mc-linux64( 0/ 8), 82.800: Explored 10276 states 13080932 transitions, fanout: 1272.960
pins2lts-mc-linux64( 0/ 8), 82.800: Total exploration time 82.230 sec (65.450 sec minimum, 74.314 sec on average)
pins2lts-mc-linux64( 0/ 8), 82.800: States per second: 125, Transitions per second: 159077
pins2lts-mc-linux64( 0/ 8), 82.800:
pins2lts-mc-linux64( 0/ 8), 82.800: Progress states detected: 9651803
pins2lts-mc-linux64( 0/ 8), 82.800: Redundant explorations: -99.8936
pins2lts-mc-linux64( 0/ 8), 82.800:
pins2lts-mc-linux64( 0/ 8), 82.800: Queue width: 8B, total height: 10504804, memory: 80.15MB
pins2lts-mc-linux64( 0/ 8), 82.800: Tree memory: 329.7MB, 35.8 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 82.800: Tree fill ratio (roots/leafs): 7.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 82.800: Stored 1588 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 82.800: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 82.800: Est. total memory use: 409.8MB (~1104.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5163646036985752566;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin5163646036985752566;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](X(([]((X(X((LTLAPp1==true))) U (LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:242)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:177)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:115)
at java.base/java.lang.Thread.run(Thread.java:829)
Detected timeout of ITS tools.
[2022-05-21 04:57:43] [INFO ] Flatten gal took : 509 ms
[2022-05-21 04:57:43] [INFO ] Time to serialize gal into /tmp/LTLCardinality10872293904195682126.gal : 55 ms
[2022-05-21 04:57:43] [INFO ] Time to serialize properties into /tmp/LTLCardinality17428870595148849016.ltl : 43 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10872293904195682126.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17428870595148849016.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...290
Read 1 LTL properties
Checking formula 0 : !((G(X(((G((X(X("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+((...8043
Formula 0 simplified : !GX("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0...8027
Detected timeout of ITS tools.
[2022-05-21 05:19:37] [INFO ] Flatten gal took : 449 ms
[2022-05-21 05:19:39] [INFO ] Input system was already deterministic with 1331 transitions.
[2022-05-21 05:19:40] [INFO ] Transformed 1694 places.
[2022-05-21 05:19:40] [INFO ] Transformed 1331 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-21 05:19:40] [INFO ] Time to serialize gal into /tmp/LTLCardinality12810700480675808499.gal : 46 ms
[2022-05-21 05:19:40] [INFO ] Time to serialize properties into /tmp/LTLCardinality10325064037129992849.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality12810700480675808499.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10325064037129992849.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(X(((G((X(X("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+((...8043
Formula 0 simplified : !GX("((((((((Columns_0_0+Columns_0_1)+(Columns_0_2+Columns_0_3))+((Columns_0_4+Columns_0_5)+(Columns_0_6+Columns_0_7)))+(((Columns_0...8027
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Sudoku-PT-AN11"
export BK_EXAMINATION="LTLCardinality"
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 Sudoku-PT-AN11, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r258-tall-165303545500283"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN11.tgz
mv Sudoku-PT-AN11 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;