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.r199-smll-167840346200612.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 lolaxred
Input is HouseConstruction-PT-16000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346200612
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 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 HouseConstruction-PT-16000-LTLFireability-00
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-01
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-02
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-03
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-04
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-05
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-06
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-07
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-08
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-09
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-10
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-11
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-12
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-13
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-14
FORMULA_NAME HouseConstruction-PT-16000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678571260565

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-16000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 21:47:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 21:47:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 21:47:44] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-11 21:47:44] [INFO ] Transformed 26 places.
[2023-03-11 21:47:44] [INFO ] Transformed 18 transitions.
[2023-03-11 21:47:44] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HouseConstruction-PT-16000-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 20 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-11 21:47:44] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-11 21:47:45] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-11 21:47:45] [INFO ] Invariant cache hit.
[2023-03-11 21:47:45] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 329 ms to find 0 implicit places.
[2023-03-11 21:47:45] [INFO ] Invariant cache hit.
[2023-03-11 21:47:45] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 416 ms. Remains : 26/26 places, 18/18 transitions.
Support contains 24 out of 26 places after structural reductions.
[2023-03-11 21:47:45] [INFO ] Flatten gal took : 43 ms
[2023-03-11 21:47:45] [INFO ] Flatten gal took : 23 ms
[2023-03-11 21:47:45] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 50 ms. (steps per millisecond=320 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 16) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=16 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
[2023-03-11 21:47:45] [INFO ] Invariant cache hit.
[2023-03-11 21:47:46] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 5 ms returned sat
[2023-03-11 21:47:46] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 21:47:46] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-11 21:47:46] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 21:47:46] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 21:47:46] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 16000 steps, including 0 resets, run visited all 1 properties in 143 ms. (steps per millisecond=111 )
Parikh walk visited 1 properties in 146 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA HouseConstruction-PT-16000-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 26 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 26 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((G((!p0||F(p1)))||X(!p0))))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-11 21:47:46] [INFO ] Computed 7 place invariants in 2 ms
[2023-03-11 21:47:46] [INFO ] Implicit Places using invariants in 51 ms returned [3, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 55 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 58 ms. Remains : 23/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 595 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1), false]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(GEQ s17 1), p1:(AND (GEQ s8 1) (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1125 reset in 575 ms.
Product exploration explored 100000 steps with 1047 reset in 280 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 364 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 21:47:49] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-11 21:47:49] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 4 ms returned sat
[2023-03-11 21:47:49] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 21:47:49] [INFO ] After 45ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-11 21:47:49] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=19 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 8 factoid took 634 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 164 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:47:50] [INFO ] Invariant cache hit.
[2023-03-11 21:47:50] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-11 21:47:50] [INFO ] Invariant cache hit.
[2023-03-11 21:47:50] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2023-03-11 21:47:50] [INFO ] Invariant cache hit.
[2023-03-11 21:47:50] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 23/23 places, 18/18 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 18
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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 427 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 8 ms. (steps per millisecond=2000 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 21:47:51] [INFO ] Invariant cache hit.
[2023-03-11 21:47:51] [INFO ] [Real]Absence check using 0 positive and 5 generalized place invariants in 7 ms returned sat
[2023-03-11 21:47:51] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-11 21:47:51] [INFO ] After 36ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 21:47:51] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 19 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 530 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1071 reset in 247 ms.
Product exploration explored 100000 steps with 1094 reset in 259 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Graph (complete) has 26 edges and 23 vertex of which 14 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 14 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 14 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 14 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 12 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 9 rules in 17 ms. Remains 12 /23 variables (removed 11) and now considering 9/18 (removed 9) transitions.
[2023-03-11 21:47:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2023-03-11 21:47:53] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 21:47:53] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/23 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 74 ms. Remains : 12/23 places, 9/18 transitions.
Support contains 4 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 21:47:53] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 21:47:53] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-11 21:47:53] [INFO ] Invariant cache hit.
[2023-03-11 21:47:53] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-11 21:47:53] [INFO ] Invariant cache hit.
[2023-03-11 21:47:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 171 ms. Remains : 23/23 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-16000-LTLFireability-00 finished in 6735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1&&G((p2 U !p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 4 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 14 output transitions
Drop transitions removed 14 transitions
Applied a total of 1 rules in 3 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 21:47:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 21:47:53] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-11 21:47:53] [INFO ] Invariant cache hit.
[2023-03-11 21:47:53] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 21:47:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 21:47:53] [INFO ] Invariant cache hit.
[2023-03-11 21:47:53] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 92 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 300 ms :[true, (NOT p0), p1, p1]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=3 dest: 2}, { cond=(OR (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s0 1), p2:(OR (GEQ s2 1) (GEQ s3 1)), p0:(GEQ s2 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 21738 reset in 120 ms.
Product exploration explored 100000 steps with 21879 reset in 130 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 13 factoid took 1156 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 261 ms :[true, (NOT p0), p1, p1]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 21:47:56] [INFO ] Invariant cache hit.
[2023-03-11 21:47:56] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 21:47:56] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 21:47:56] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-11 21:47:56] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 16000 steps, including 0 resets, run visited all 2 properties in 144 ms. (steps per millisecond=111 )
Parikh walk visited 4 properties in 2045 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F (AND p1 p2))]
Knowledge based reduction with 13 factoid took 1086 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 273 ms :[true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p0), p1, p1]
[2023-03-11 21:47:59] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F (AND p1 p2)), true]
Knowledge based reduction with 13 factoid took 1104 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 252 ms :[true, (NOT p0), p1, p1]
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 2 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 21:48:01] [INFO ] Invariant cache hit.
[2023-03-11 21:48:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 21:48:01] [INFO ] Invariant cache hit.
[2023-03-11 21:48:01] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 21:48:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:48:01] [INFO ] Invariant cache hit.
[2023-03-11 21:48:01] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 4/4 places, 4/4 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 13 factoid took 860 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), p1, p1]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
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 :0
Running SMT prover for 4 properties.
[2023-03-11 21:48:02] [INFO ] Invariant cache hit.
[2023-03-11 21:48:02] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 21:48:02] [INFO ] After 14ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 21:48:02] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 21:48:02] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 16000 steps, including 0 resets, run visited all 2 properties in 124 ms. (steps per millisecond=129 )
Parikh walk visited 4 properties in 1862 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F (AND p1 p2))]
Knowledge based reduction with 13 factoid took 801 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p0), p1, p1]
[2023-03-11 21:48:06] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (OR (NOT p1) p2)), (X (NOT p0)), (X (NOT (AND p1 (NOT p2)))), (X (OR (NOT p1) (NOT p2))), (X (NOT (AND p1 p2))), (X (X (OR (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 p2)))), (F (G p1)), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (OR (NOT p1) (NOT p2)))), (F p0), (F (AND p1 p2)), true]
Knowledge based reduction with 13 factoid took 788 ms. Reduced automaton from 4 states, 12 edges and 3 AP (stutter insensitive) to 4 states, 12 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[true, (NOT p0), p1, p1]
Stuttering acceptance computed with spot in 229 ms :[true, (NOT p0), p1, p1]
Product exploration explored 100000 steps with 21815 reset in 100 ms.
Product exploration explored 100000 steps with 21819 reset in 79 ms.
Support contains 3 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2023-03-11 21:48:07] [INFO ] Invariant cache hit.
[2023-03-11 21:48:07] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 21:48:07] [INFO ] Invariant cache hit.
[2023-03-11 21:48:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2023-03-11 21:48:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:48:07] [INFO ] Invariant cache hit.
[2023-03-11 21:48:07] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 81 ms. Remains : 4/4 places, 4/4 transitions.
Treatment of property HouseConstruction-PT-16000-LTLFireability-01 finished in 14134 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F(p1)))))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-11 21:48:07] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 21:48:07] [INFO ] Implicit Places using invariants in 59 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 61 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 155 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s12 1), p1:(LT s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Product exploration explored 100000 steps with 0 reset in 240 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
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) (NOT p1)), (X (AND (NOT p0) (NOT p1))), true, (X (X (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 7 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-02 finished in 926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F((p1&&X((p1 U (!p2||G(p1))))))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:48:08] [INFO ] Invariant cache hit.
[2023-03-11 21:48:08] [INFO ] Implicit Places using invariants in 51 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s7 1), p1:(LT s0 1), p2:(GEQ s15 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-03 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0))&&F(p1)))'
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 7 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 11 output transitions
Drop transitions removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 4 transition count 4
Applied a total of 5 rules in 2357 ms. Remains 4 /26 variables (removed 22) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 4 cols
[2023-03-11 21:48:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 21:48:11] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 21:48:11] [INFO ] Invariant cache hit.
[2023-03-11 21:48:11] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2023-03-11 21:48:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:48:11] [INFO ] Invariant cache hit.
[2023-03-11 21:48:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2441 ms. Remains : 4/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LT s2 1), p0:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 84 ms.
Product exploration explored 100000 steps with 1 reset in 154 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 4
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 p1 (NOT p0)), (X (NOT p0)), (X (NOT p1)), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 5 factoid took 267 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-04 finished in 3127 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p1)&&p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-11 21:48:12] [INFO ] Computed 7 place invariants in 0 ms
[2023-03-11 21:48:12] [INFO ] Implicit Places using invariants in 32 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 34 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[(OR (NOT p0) p1), p1]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s5 1)), p1:(LT s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1518 reset in 158 ms.
Product exploration explored 100000 steps with 1541 reset in 208 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
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 p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 361 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p0) p1), p1]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 3) seen :0
Finished Best-First random walk after 261 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=261 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 9 factoid took 584 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 73 ms :[(OR (NOT p0) p1), p1]
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) p1), p1]
// Phase 1: matrix 18 rows 21 cols
[2023-03-11 21:48:13] [INFO ] Computed 3 place invariants in 3 ms
Proved EG (NOT p0)
[2023-03-11 21:48:13] [INFO ] Invariant cache hit.
[2023-03-11 21:48:13] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 21:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:48:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 21:48:13] [INFO ] Computed and/alt/rep : 17/20/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 21:48:13] [INFO ] Added : 1 causal constraints over 1 iterations in 20 ms. Result :sat
Could not prove EG p1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F p0), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 9 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-07 finished in 2017 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U X(p1)))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 3 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-11 21:48:14] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 21:48:14] [INFO ] Implicit Places using invariants in 44 ms returned [9, 13, 19]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 55 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 335 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s3 1) (GEQ s7 1)), p1:(LT s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 225 ms.
Product exploration explored 100000 steps with 25000 reset in 309 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
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 (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 188 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=8000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Finished Best-First random walk after 238 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=238 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X (NOT p0))), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 471 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 245 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 21:48:16] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 21:48:16] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 21:48:16] [INFO ] Invariant cache hit.
[2023-03-11 21:48:16] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-11 21:48:16] [INFO ] Invariant cache hit.
[2023-03-11 21:48:16] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 130 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
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), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 255 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Finished Best-First random walk after 3446 steps, including 1 resets, run visited all 3 properties in 4 ms. (steps per millisecond=861 )
Knowledge obtained : [(AND (NOT p0) p1), true, (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 274 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Product exploration explored 100000 steps with 25000 reset in 106 ms.
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 257 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0]
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Graph (complete) has 24 edges and 22 vertex of which 9 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.0 ms
Discarding 13 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 9 transition count 8
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 9 transition count 8
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 9 transition count 8
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 7 transition count 6
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 9 rules in 8 ms. Remains 7 /22 variables (removed 15) and now considering 6/18 (removed 12) transitions.
[2023-03-11 21:48:18] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 7 cols
[2023-03-11 21:48:18] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 21:48:19] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/22 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 54 ms. Remains : 7/22 places, 6/18 transitions.
Support contains 3 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 21:48:19] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 21:48:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 21:48:19] [INFO ] Invariant cache hit.
[2023-03-11 21:48:19] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-11 21:48:19] [INFO ] Invariant cache hit.
[2023-03-11 21:48:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 22/22 places, 18/18 transitions.
Treatment of property HouseConstruction-PT-16000-LTLFireability-08 finished in 5235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 18 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 16 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 14 transition count 10
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 5 place count 14 transition count 7
Deduced a syphon composed of 3 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 13 place count 9 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 13 place count 9 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 18 place count 6 transition count 5
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 18 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 5 transition count 4
Applied a total of 20 rules in 2894 ms. Remains 5 /26 variables (removed 21) and now considering 4/18 (removed 14) transitions.
// Phase 1: matrix 4 rows 5 cols
[2023-03-11 21:48:22] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 21:48:22] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 21:48:22] [INFO ] Invariant cache hit.
[2023-03-11 21:48:22] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-03-11 21:48:22] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:48:22] [INFO ] Invariant cache hit.
[2023-03-11 21:48:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/26 places, 4/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3014 ms. Remains : 5/26 places, 4/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s4 1) (GEQ s2 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 121 reset in 111 ms.
Product exploration explored 100000 steps with 65 reset in 254 ms.
Computed a total of 5 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 4
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 : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLFireability-12 finished in 3681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||(p2 U !p0))))'
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-11 21:48:22] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 21:48:23] [INFO ] Implicit Places using invariants in 62 ms returned [3, 9, 13, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 68 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p0), (NOT p1), p0, (AND p0 (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s14 1)), p0:(LT s0 1), p2:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-13 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F((p1&&X(F(p2))))))'
Support contains 3 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 2 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-11 21:48:23] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-11 21:48:23] [INFO ] Implicit Places using invariants in 40 ms returned [3, 9, 13, 19]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 44 ms. Remains : 21/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (OR (NOT p0) (NOT p2)), true, (OR (NOT p2) (NOT p1) (NOT p0)), (OR (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p0), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(GEQ s15 1), p2:(GEQ s12 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLFireability-14 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 6 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 25 transition count 18
Applied a total of 1 rules in 1 ms. Remains 25 /26 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:48:23] [INFO ] Invariant cache hit.
[2023-03-11 21:48:23] [INFO ] Implicit Places using invariants in 34 ms returned [3, 9, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/26 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 40 ms. Remains : 22/26 places, 18/18 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s20 1) (GEQ s8 1) (GEQ s9 1)), p1:(GEQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 177 ms.
Product exploration explored 100000 steps with 0 reset in 248 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
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) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 295 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 1) seen :0
Finished Best-First random walk after 119 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=119 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 5 factoid took 196 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
// Phase 1: matrix 18 rows 22 cols
[2023-03-11 21:48:24] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-11 21:48:24] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-11 21:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:48:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 21:48:24] [INFO ] Computed and/alt/rep : 17/21/17 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 21:48:24] [INFO ] Added : 9 causal constraints over 2 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 21 transition count 14
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 18 transition count 13
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 17 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 17 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 14 transition count 10
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 13 transition count 10
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 16 place count 12 transition count 9
Applied a total of 16 rules in 12354 ms. Remains 12 /22 variables (removed 10) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2023-03-11 21:48:37] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-11 21:48:37] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-11 21:48:37] [INFO ] Invariant cache hit.
[2023-03-11 21:48:37] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2023-03-11 21:48:37] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:48:37] [INFO ] Invariant cache hit.
[2023-03-11 21:48:37] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 12/22 places, 9/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12461 ms. Remains : 12/22 places, 9/18 transitions.
Computed a total of 12 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 9
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 : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 133 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 1) seen :0
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 218 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p1)]
[2023-03-11 21:48:37] [INFO ] Invariant cache hit.
[2023-03-11 21:48:38] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 21:48:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:48:38] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 21:48:38] [INFO ] Computed and/alt/rep : 7/10/7 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 21:48:38] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 51 ms :[(NOT p1)]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 259 ms.
Support contains 1 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Graph (complete) has 11 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 2 places and 2 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 2 transition count 2
Applied a total of 4 rules in 5510 ms. Remains 2 /12 variables (removed 10) and now considering 2/9 (removed 7) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 21:48:44] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 21:48:44] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-11 21:48:44] [INFO ] Invariant cache hit.
[2023-03-11 21:48:44] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2023-03-11 21:48:44] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:48:44] [INFO ] Invariant cache hit.
[2023-03-11 21:48:44] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/12 places, 2/9 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5579 ms. Remains : 2/12 places, 2/9 transitions.
Treatment of property HouseConstruction-PT-16000-LTLFireability-15 finished in 20560 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((G((!p0||F(p1)))||X(!p0))))))'
Found a Lengthening insensitive property : HouseConstruction-PT-16000-LTLFireability-00
Stuttering acceptance computed with spot in 293 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p1) p0), (NOT p1), false]
Support contains 4 out of 26 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Graph (complete) has 31 edges and 26 vertex of which 15 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 13 transition count 8
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 10 transition count 7
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 9 transition count 6
Applied a total of 8 rules in 12388 ms. Remains 9 /26 variables (removed 17) and now considering 6/18 (removed 12) transitions.
// Phase 1: matrix 6 rows 9 cols
[2023-03-11 21:48:56] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 21:48:56] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-11 21:48:56] [INFO ] Invariant cache hit.
[2023-03-11 21:48:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2023-03-11 21:48:56] [INFO ] Invariant cache hit.
[2023-03-11 21:48:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 9/26 places, 6/18 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 12481 ms. Remains : 9/26 places, 6/18 transitions.
Running random walk in product with property : HouseConstruction-PT-16000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}]], initial=0, aps=[p0:(GEQ s8 1), p1:(AND (GEQ s2 1) (GEQ s5 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1534 reset in 120 ms.
Product exploration explored 100000 steps with 851 reset in 190 ms.
Computed a total of 9 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 6
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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 569 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 21:48:58] [INFO ] Invariant cache hit.
[2023-03-11 21:48:58] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 21:48:58] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 21:48:58] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 21:48:58] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 21:48:58] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 21:48:58] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 8 factoid took 487 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-11 21:48:59] [INFO ] Invariant cache hit.
[2023-03-11 21:48:59] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 21:48:59] [INFO ] Invariant cache hit.
[2023-03-11 21:48:59] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 21:48:59] [INFO ] Invariant cache hit.
[2023-03-11 21:48:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 9/9 places, 6/6 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 6
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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 356 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 5 ms. (steps per millisecond=3200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-11 21:48:59] [INFO ] Invariant cache hit.
[2023-03-11 21:48:59] [INFO ] [Real]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 21:48:59] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 21:48:59] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-11 21:48:59] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 21:48:59] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 21:48:59] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 1 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1))))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F p1)]
Knowledge based reduction with 7 factoid took 382 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 143 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 141 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 1748 reset in 142 ms.
Product exploration explored 100000 steps with 1916 reset in 186 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-11 21:49:01] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:49:01] [INFO ] Invariant cache hit.
[2023-03-11 21:49:01] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 40 ms. Remains : 9/9 places, 6/6 transitions.
Support contains 4 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-11 21:49:01] [INFO ] Invariant cache hit.
[2023-03-11 21:49:01] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-11 21:49:01] [INFO ] Invariant cache hit.
[2023-03-11 21:49:01] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2023-03-11 21:49:01] [INFO ] Invariant cache hit.
[2023-03-11 21:49:01] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 9/9 places, 6/6 transitions.
Treatment of property HouseConstruction-PT-16000-LTLFireability-00 finished in 17245 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0)) U (p1&&G((p2 U !p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U X(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
[2023-03-11 21:49:01] [INFO ] Flatten gal took : 7 ms
[2023-03-11 21:49:01] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-11 21:49:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 26 places, 18 transitions and 51 arcs took 1 ms.
Total runtime 77293 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HouseConstruction-PT-16000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA HouseConstruction-PT-16000-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-16000-LTLFireability-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HouseConstruction-PT-16000-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678571354403

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 4 (type EXCL) for 3 HouseConstruction-PT-16000-LTLFireability-01
lola: time limit : 900 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-16000-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
HouseConstruction-PT-16000-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/900 17/32 HouseConstruction-PT-16000-LTLFireability-01 2510270 m, 502054 m/sec, 4929767 t fired, .

Time elapsed: 5 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for HouseConstruction-PT-16000-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-16000-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
HouseConstruction-PT-16000-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLFireability-15: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 HouseConstruction-PT-16000-LTLFireability-15
lola: time limit : 1196 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for HouseConstruction-PT-16000-LTLFireability-15
lola: result : false
lola: markings : 288001
lola: fired transitions : 288001
lola: time used : 0.000000
lola: memory pages used : 2
lola: LAUNCH task # 7 (type EXCL) for 6 HouseConstruction-PT-16000-LTLFireability-08
lola: time limit : 1795 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for HouseConstruction-PT-16000-LTLFireability-08
lola: result : true
lola: markings : 12
lola: fired transitions : 13
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 HouseConstruction-PT-16000-LTLFireability-00
lola: time limit : 3590 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HouseConstruction-PT-16000-LTLFireability-00
lola: result : false
lola: markings : 464002
lola: fired transitions : 464002
lola: time used : 1.000000
lola: memory pages used : 4
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-16000-LTLFireability-00: LTL false LTL model checker
HouseConstruction-PT-16000-LTLFireability-01: LTL unknown AGGR
HouseConstruction-PT-16000-LTLFireability-08: LTL true LTL model checker
HouseConstruction-PT-16000-LTLFireability-15: LTL false LTL model checker


Time elapsed: 11 secs. Pages in use: 32

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="HouseConstruction-PT-16000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is HouseConstruction-PT-16000, 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 r199-smll-167840346200612"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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