Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 336K
-rw-r--r-- 1 mcc users 5.7K Apr 30 00:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 30 00:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 30 00:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 30 00:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 09:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 09:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 09:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 09:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 09:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 09:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 119K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-010B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653074759573

Running Version 202205111006
[2022-05-20 19:26:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 19:26:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 19:26:00] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2022-05-20 19:26:00] [INFO ] Transformed 503 places.
[2022-05-20 19:26:00] [INFO ] Transformed 503 transitions.
[2022-05-20 19:26:00] [INFO ] Found NUPN structural information;
[2022-05-20 19:26:00] [INFO ] Parsed PT model containing 503 places and 503 transitions in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-010B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-010B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 101 places :
Symmetric choice reduction at 0 with 101 rule applications. Total rules 101 place count 402 transition count 402
Iterating global reduction 0 with 101 rules applied. Total rules applied 202 place count 402 transition count 402
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 203 place count 401 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 204 place count 401 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 205 place count 400 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 206 place count 400 transition count 400
Applied a total of 206 rules in 92 ms. Remains 400 /503 variables (removed 103) and now considering 400/503 (removed 103) transitions.
// Phase 1: matrix 400 rows 400 cols
[2022-05-20 19:26:01] [INFO ] Computed 41 place invariants in 22 ms
[2022-05-20 19:26:01] [INFO ] Implicit Places using invariants in 227 ms returned []
// Phase 1: matrix 400 rows 400 cols
[2022-05-20 19:26:01] [INFO ] Computed 41 place invariants in 18 ms
[2022-05-20 19:26:01] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
// Phase 1: matrix 400 rows 400 cols
[2022-05-20 19:26:01] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 19:26:01] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 400/503 places, 400/503 transitions.
Finished structural reductions, in 1 iterations. Remains : 400/503 places, 400/503 transitions.
Support contains 32 out of 400 places after structural reductions.
[2022-05-20 19:26:02] [INFO ] Flatten gal took : 56 ms
[2022-05-20 19:26:02] [INFO ] Flatten gal took : 23 ms
[2022-05-20 19:26:02] [INFO ] Input system was already deterministic with 400 transitions.
Support contains 30 out of 400 places (down from 32) after GAL structural reductions.
Finished random walk after 4646 steps, including 1 resets, run visited all 29 properties in 290 ms. (steps per millisecond=16 )
Computed a total of 119 stabilizing places and 119 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U p1)))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 393 transition count 393
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 393 transition count 393
Applied a total of 14 rules in 33 ms. Remains 393 /400 variables (removed 7) and now considering 393/400 (removed 7) transitions.
// Phase 1: matrix 393 rows 393 cols
[2022-05-20 19:26:02] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:02] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 393 rows 393 cols
[2022-05-20 19:26:02] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 19:26:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
// Phase 1: matrix 393 rows 393 cols
[2022-05-20 19:26:03] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 19:26:03] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 393/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/400 places, 393/400 transitions.
Stuttering acceptance computed with spot in 386 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s256 1), p1:(NEQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-00 finished in 999 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 399 transition count 287
Reduce places removed 112 places and 0 transitions.
Iterating post reduction 1 with 112 rules applied. Total rules applied 224 place count 287 transition count 287
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 224 place count 287 transition count 214
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 370 place count 214 transition count 214
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 375 place count 209 transition count 209
Iterating global reduction 2 with 5 rules applied. Total rules applied 380 place count 209 transition count 209
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 380 place count 209 transition count 205
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 388 place count 205 transition count 205
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 0 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 568 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 114 transition count 113
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 629 place count 85 transition count 141
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 630 place count 85 transition count 141
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 632 place count 83 transition count 139
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 633 place count 82 transition count 139
Applied a total of 633 rules in 74 ms. Remains 82 /400 variables (removed 318) and now considering 139/400 (removed 261) transitions.
// Phase 1: matrix 139 rows 82 cols
[2022-05-20 19:26:03] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-20 19:26:03] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 139 rows 82 cols
[2022-05-20 19:26:03] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-20 19:26:04] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2022-05-20 19:26:04] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 139 rows 82 cols
[2022-05-20 19:26:04] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-20 19:26:04] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/400 places, 139/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 82/400 places, 139/400 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-01 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:(NEQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 1177 steps with 0 reset in 25 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-01 finished in 583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(X(G((F(p0)||p1)))))&&X(p2)))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 393 transition count 393
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 393 transition count 393
Applied a total of 14 rules in 21 ms. Remains 393 /400 variables (removed 7) and now considering 393/400 (removed 7) transitions.
// Phase 1: matrix 393 rows 393 cols
[2022-05-20 19:26:04] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:04] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 393 rows 393 cols
[2022-05-20 19:26:04] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:04] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 393 rows 393 cols
[2022-05-20 19:26:04] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 19:26:04] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/400 places, 393/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 393/400 places, 393/400 transitions.
Stuttering acceptance computed with spot in 170 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s345 1), p1:(EQ s273 0), p0:(EQ s294 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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 ShieldRVt-PT-010B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-02 finished in 685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(X(F(p0)))&&p1))||G((X(p2)||p3))))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 19 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:05] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:05] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:05] [INFO ] Computed 41 place invariants in 4 ms
[2022-05-20 19:26:05] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:05] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:05] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 360 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p3) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p3) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p3 p2), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 7}], [{ cond=(AND p3 p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 3}, { cond=(NOT p2), acceptance={} source=1 dest: 8}], [{ cond=(AND p3 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND p3 p2 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=4 dest: 4}, { cond=(AND p1 p3), acceptance={} source=4 dest: 5}], [{ cond=p3, acceptance={} source=5 dest: 2}, { cond=(NOT p3), acceptance={} source=5 dest: 3}], [{ cond=true, acceptance={} source=6 dest: 8}], [{ cond=p1, acceptance={0} source=7 dest: 6}, { cond=(NOT p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=4, aps=[p1:(EQ s328 1), p3:(EQ s80 1), p2:(EQ s309 1), p0:(EQ s160 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 60 reset in 317 ms.
Stack based approach found an accepted trace after 653 steps with 0 reset with depth 654 and stack size 654 in 2 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-04 finished in 1245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 13 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:06] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:06] [INFO ] Implicit Places using invariants in 92 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:06] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:06] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:06] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:06] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s253 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 315 ms.
Computed a total of 119 stabilizing places and 119 stable transitions
Computed a total of 119 stabilizing places and 119 stable transitions
Detected a total of 119/392 stabilizing places and 119/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-010B-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-05 finished in 1286 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(((G(p0)||p1)&&p0))&&p1))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 399 transition count 288
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 288 transition count 288
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 222 place count 288 transition count 217
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 364 place count 217 transition count 217
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 369 place count 212 transition count 212
Iterating global reduction 2 with 5 rules applied. Total rules applied 374 place count 212 transition count 212
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 374 place count 212 transition count 208
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 382 place count 208 transition count 208
Performed 93 Post agglomeration using F-continuation condition.Transition count delta: 93
Deduced a syphon composed of 93 places in 0 ms
Reduce places removed 93 places and 0 transitions.
Iterating global reduction 2 with 186 rules applied. Total rules applied 568 place count 115 transition count 115
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 569 place count 115 transition count 114
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 571 place count 114 transition count 113
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 625 place count 87 transition count 137
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 627 place count 85 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 628 place count 84 transition count 135
Applied a total of 628 rules in 44 ms. Remains 84 /400 variables (removed 316) and now considering 135/400 (removed 265) transitions.
// Phase 1: matrix 135 rows 84 cols
[2022-05-20 19:26:07] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-20 19:26:07] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 135 rows 84 cols
[2022-05-20 19:26:07] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-20 19:26:07] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-05-20 19:26:07] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 135 rows 84 cols
[2022-05-20 19:26:07] [INFO ] Computed 40 place invariants in 1 ms
[2022-05-20 19:26:07] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/400 places, 135/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 84/400 places, 135/400 transitions.
Stuttering acceptance computed with spot in 29 ms :[(OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-06 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(F(p0))&&X(!(X(p1) U p2)))))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 11 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:07] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:08] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:08] [INFO ] Computed 41 place invariants in 18 ms
[2022-05-20 19:26:08] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:08] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:08] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 444 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 5}, { cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=6 dest: 7}, { cond=(OR (NOT p2) (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}], [{ cond=(AND p2 p1), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(EQ s114 1), p1:(EQ s332 1), p0:(EQ s261 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, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1288 reset in 170 ms.
Product exploration explored 100000 steps with 1269 reset in 276 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/392 stabilizing places and 118/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 10 states, 16 edges and 3 AP to 10 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:09] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:10] [INFO ] [Real]Absence check using 41 positive place invariants in 16 ms returned sat
[2022-05-20 19:26:10] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 19:26:10] [INFO ] [Nat]Absence check using 41 positive place invariants in 9 ms returned sat
[2022-05-20 19:26:10] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 19:26:10] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2022-05-20 19:26:10] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 2 ms to minimize.
[2022-05-20 19:26:10] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2022-05-20 19:26:10] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2022-05-20 19:26:11] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 1 ms to minimize.
[2022-05-20 19:26:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 381 ms
[2022-05-20 19:26:11] [INFO ] After 543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-20 19:26:11] [INFO ] After 773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 392 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 392/392 places, 392/392 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 392 transition count 284
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 284 transition count 284
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 216 place count 284 transition count 205
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 374 place count 205 transition count 205
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 556 place count 114 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 114 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 559 place count 113 transition count 112
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 615 place count 85 transition count 138
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 85 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 617 place count 84 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 618 place count 83 transition count 136
Applied a total of 618 rules in 36 ms. Remains 83 /392 variables (removed 309) and now considering 136/392 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/392 places, 136/392 transitions.
Finished random walk after 30 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (F (AND p2 p1))]
Knowledge based reduction with 3 factoid took 290 ms. Reduced automaton from 10 states, 16 edges and 3 AP to 10 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Stuttering acceptance computed with spot in 345 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:12] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:12] [INFO ] [Real]Absence check using 41 positive place invariants in 11 ms returned sat
[2022-05-20 19:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:26:12] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2022-05-20 19:26:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:26:12] [INFO ] [Nat]Absence check using 41 positive place invariants in 11 ms returned sat
[2022-05-20 19:26:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:26:12] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2022-05-20 19:26:12] [INFO ] Computed and/alt/rep : 391/572/391 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-20 19:26:15] [INFO ] Added : 389 causal constraints over 78 iterations in 2684 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Applied a total of 0 rules in 9 ms. Remains 392 /392 variables (removed 0) and now considering 392/392 (removed 0) transitions.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:15] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 19:26:15] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:15] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:15] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:15] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:16] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/392 places, 392/392 transitions.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/392 stabilizing places and 118/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 10 states, 16 edges and 3 AP to 10 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:16] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:16] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2022-05-20 19:26:17] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 19:26:17] [INFO ] [Nat]Absence check using 41 positive place invariants in 7 ms returned sat
[2022-05-20 19:26:17] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 19:26:17] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2022-05-20 19:26:17] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 0 ms to minimize.
[2022-05-20 19:26:17] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 0 ms to minimize.
[2022-05-20 19:26:17] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2022-05-20 19:26:17] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 1 ms to minimize.
[2022-05-20 19:26:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 297 ms
[2022-05-20 19:26:17] [INFO ] After 465ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2022-05-20 19:26:17] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 392 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 392/392 places, 392/392 transitions.
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 108 rules applied. Total rules applied 108 place count 392 transition count 284
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 216 place count 284 transition count 284
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 79 Pre rules applied. Total rules applied 216 place count 284 transition count 205
Deduced a syphon composed of 79 places in 0 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 374 place count 205 transition count 205
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 556 place count 114 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 557 place count 114 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 559 place count 113 transition count 112
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -26
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 615 place count 85 transition count 138
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 85 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 617 place count 84 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 618 place count 83 transition count 136
Applied a total of 618 rules in 22 ms. Remains 83 /392 variables (removed 309) and now considering 136/392 (removed 256) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/392 places, 136/392 transitions.
Finished random walk after 91 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), true, (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT (OR (NOT p2) (NOT p1)))), (F p0), (F p2), (F (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1))))), (F (AND p2 p1))]
Knowledge based reduction with 3 factoid took 256 ms. Reduced automaton from 10 states, 16 edges and 3 AP to 10 states, 16 edges and 3 AP.
Stuttering acceptance computed with spot in 377 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Stuttering acceptance computed with spot in 576 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:18] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 19:26:19] [INFO ] [Real]Absence check using 41 positive place invariants in 10 ms returned sat
[2022-05-20 19:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 19:26:19] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2022-05-20 19:26:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 19:26:19] [INFO ] [Nat]Absence check using 41 positive place invariants in 10 ms returned sat
[2022-05-20 19:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 19:26:19] [INFO ] [Nat]Absence check using state equation in 246 ms returned sat
[2022-05-20 19:26:19] [INFO ] Computed and/alt/rep : 391/572/391 causal constraints (skipped 0 transitions) in 19 ms.
[2022-05-20 19:26:22] [INFO ] Added : 389 causal constraints over 78 iterations in 2649 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 399 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Product exploration explored 100000 steps with 1318 reset in 170 ms.
Product exploration explored 100000 steps with 1291 reset in 181 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true, true]
Stuttering acceptance computed with spot in 428 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), (OR (NOT p0) p2), true, (OR (NOT p0) (AND p1 p2)), (NOT p0), (NOT p0), (AND p2 p1)]
Support contains 3 out of 392 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 392/392 places, 392/392 transitions.
Performed 107 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 107 rules applied. Total rules applied 107 place count 392 transition count 392
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 39 Pre rules applied. Total rules applied 107 place count 392 transition count 432
Deduced a syphon composed of 146 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 146 place count 392 transition count 432
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 267 places in 0 ms
Iterating global reduction 1 with 121 rules applied. Total rules applied 267 place count 392 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 268 place count 392 transition count 432
Discarding 81 places :
Symmetric choice reduction at 2 with 81 rule applications. Total rules 349 place count 311 transition count 350
Deduced a syphon composed of 186 places in 0 ms
Iterating global reduction 2 with 81 rules applied. Total rules applied 430 place count 311 transition count 350
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 187 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 311 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 433 place count 309 transition count 348
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 435 place count 309 transition count 348
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -262
Deduced a syphon composed of 222 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 472 place count 309 transition count 610
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 509 place count 272 transition count 536
Deduced a syphon composed of 185 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 546 place count 272 transition count 536
Deduced a syphon composed of 185 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 549 place count 272 transition count 533
Deduced a syphon composed of 185 places in 0 ms
Applied a total of 549 rules in 97 ms. Remains 272 /392 variables (removed 120) and now considering 533/392 (removed -141) transitions.
[2022-05-20 19:26:23] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 533 rows 272 cols
[2022-05-20 19:26:23] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:23] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 272/392 places, 533/392 transitions.
Finished structural reductions, in 1 iterations. Remains : 272/392 places, 533/392 transitions.
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-07 finished in 16094 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 391 transition count 391
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 391 transition count 391
Applied a total of 18 rules in 24 ms. Remains 391 /400 variables (removed 9) and now considering 391/400 (removed 9) transitions.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:24] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:24] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:24] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:24] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:24] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:24] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/400 places, 391/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 391/400 places, 391/400 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s248 1) (EQ s290 1) (EQ s316 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 56481 steps with 57 reset in 111 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-08 finished in 757 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(G(p0) U p1)))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 391 transition count 391
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 391 transition count 391
Applied a total of 18 rules in 21 ms. Remains 391 /400 variables (removed 9) and now considering 391/400 (removed 9) transitions.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:24] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:24] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:24] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:25] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:25] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:25] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/400 places, 391/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 391/400 places, 391/400 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, p0, p1, p1, (AND p0 p1)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(EQ s342 1), p1:(EQ s291 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 271 ms.
Product exploration explored 100000 steps with 50000 reset in 270 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/391 stabilizing places and 118/391 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), true, (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 98 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-010B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-10 finished in 1263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 391 transition count 391
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 391 transition count 391
Applied a total of 18 rules in 13 ms. Remains 391 /400 variables (removed 9) and now considering 391/400 (removed 9) transitions.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:26] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:26] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:26] [INFO ] Computed 41 place invariants in 3 ms
[2022-05-20 19:26:26] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:26] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/400 places, 391/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 391/400 places, 391/400 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s233 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-11 finished in 529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((F(X(p0))||G((F(G(p1))&&F(p2)))))))'
Support contains 3 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 391 transition count 391
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 391 transition count 391
Applied a total of 18 rules in 13 ms. Remains 391 /400 variables (removed 9) and now considering 391/400 (removed 9) transitions.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:26] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:26] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 391 rows 391 cols
[2022-05-20 19:26:26] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:27] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 391/400 places, 391/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 391/400 places, 391/400 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-12 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: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s212 0), p1:(EQ s127 1), p2:(EQ s308 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 197 ms.
Product exploration explored 100000 steps with 33333 reset in 198 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/391 stabilizing places and 118/391 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 115 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-010B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-12 finished in 1138 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p0)&&p1))))'
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 15 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:27] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:27] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:27] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:28] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:28] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s119 0), p0:(EQ s340 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4 reset in 179 ms.
Stack based approach found an accepted trace after 1506 steps with 0 reset with depth 1507 and stack size 1507 in 4 ms.
FORMULA ShieldRVt-PT-010B-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-010B-LTLFireability-13 finished in 748 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((!(F(X(p0)) U p1)||p2))&&p3)))'
Support contains 4 out of 400 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 400/400 places, 400/400 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 392 transition count 392
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 392 transition count 392
Applied a total of 16 rules in 11 ms. Remains 392 /400 variables (removed 8) and now considering 392/400 (removed 8) transitions.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:28] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:28] [INFO ] Implicit Places using invariants in 83 ms returned []
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:28] [INFO ] Computed 41 place invariants in 1 ms
[2022-05-20 19:26:28] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
// Phase 1: matrix 392 rows 392 cols
[2022-05-20 19:26:28] [INFO ] Computed 41 place invariants in 2 ms
[2022-05-20 19:26:28] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 392/400 places, 392/400 transitions.
Finished structural reductions, in 1 iterations. Remains : 392/400 places, 392/400 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p3) (AND p1 (NOT p2))), (OR (NOT p3) (AND p1 (NOT p2))), true, (AND p1 (NOT p2)), (AND (NOT p2) p1 p0), (AND (NOT p2) p1 p0)]
Running random walk in product with property : ShieldRVt-PT-010B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 4}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=4 dest: 5}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=5 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=5 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={1} source=5 dest: 5}]], initial=0, aps=[p3:(EQ s55 0), p2:(AND (EQ s132 0) (EQ s101 0)), p1:(EQ s358 1), p0:(EQ s55 1)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 50000 reset in 246 ms.
Product exploration explored 100000 steps with 50000 reset in 257 ms.
Computed a total of 118 stabilizing places and 118 stable transitions
Computed a total of 118 stabilizing places and 118 stable transitions
Detected a total of 118/392 stabilizing places and 118/392 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (NOT (AND p3 (NOT p2) (NOT p1)))), (X (NOT (AND p3 (NOT p2) p1))), (X p3), true, (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p3)
Knowledge based reduction with 14 factoid took 222 ms. Reduced automaton from 6 states, 15 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ShieldRVt-PT-010B-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-010B-LTLFireability-15 finished in 1509 ms.
All properties solved by simple procedures.
Total runtime 29267 ms.

BK_STOP 1653074790051

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-010B, 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 r222-tall-165286026100972"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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