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-165286025700716.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 ShieldRVs-PT-001B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r222-tall-165286025700716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 268K
-rw-r--r-- 1 mcc users 7.9K Apr 30 06:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 30 06:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 06:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 30 06:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 9 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:56 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 13K 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 ShieldRVs-PT-001B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-001B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653039087618

Running Version 202205111006
[2022-05-20 09:31:28] [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 09:31:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:31:28] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2022-05-20 09:31:28] [INFO ] Transformed 43 places.
[2022-05-20 09:31:28] [INFO ] Transformed 48 transitions.
[2022-05-20 09:31:28] [INFO ] Found NUPN structural information;
[2022-05-20 09:31:28] [INFO ] Parsed PT model containing 43 places and 48 transitions in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVs-PT-001B-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-001B-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 48/48 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 40 transition count 45
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 40 transition count 45
Applied a total of 6 rules in 11 ms. Remains 40 /43 variables (removed 3) and now considering 45/48 (removed 3) transitions.
// Phase 1: matrix 45 rows 40 cols
[2022-05-20 09:31:29] [INFO ] Computed 5 place invariants in 10 ms
[2022-05-20 09:31:29] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 45 rows 40 cols
[2022-05-20 09:31:29] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:29] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
// Phase 1: matrix 45 rows 40 cols
[2022-05-20 09:31:29] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-20 09:31:29] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 40/43 places, 45/48 transitions.
Finished structural reductions, in 1 iterations. Remains : 40/43 places, 45/48 transitions.
Support contains 24 out of 40 places after structural reductions.
[2022-05-20 09:31:29] [INFO ] Flatten gal took : 27 ms
[2022-05-20 09:31:29] [INFO ] Flatten gal took : 8 ms
[2022-05-20 09:31:29] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 23 out of 40 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 23) seen :22
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 40 cols
[2022-05-20 09:31:29] [INFO ] Computed 5 place invariants in 16 ms
[2022-05-20 09:31:29] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-20 09:31:29] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 09:31:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-05-20 09:31:30] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 09:31:30] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 6 ms to minimize.
[2022-05-20 09:31:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 47 ms
[2022-05-20 09:31:30] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2022-05-20 09:31:30] [INFO ] After 122ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
FORMULA ShieldRVs-PT-001B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 10 stabilizing places and 10 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((X(G(p0))&&X(p1)))&&G(p2)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 45/45 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 2 place count 40 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 38 transition count 43
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 38 transition count 38
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 33 transition count 38
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 18 place count 29 transition count 34
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 29 transition count 34
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 29 transition count 33
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 24 place count 28 transition count 33
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 42 place count 19 transition count 24
Applied a total of 42 rules in 14 ms. Remains 19 /40 variables (removed 21) and now considering 24/45 (removed 21) transitions.
// Phase 1: matrix 24 rows 19 cols
[2022-05-20 09:31:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:30] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 24 rows 19 cols
[2022-05-20 09:31:30] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-20 09:31:30] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2022-05-20 09:31:30] [INFO ] Redundant transitions in 17 ms returned [23]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 23 rows 19 cols
[2022-05-20 09:31:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:30] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/40 places, 23/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/40 places, 23/45 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p2), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=p2, acceptance={1} source=0 dest: 1}, { cond=p2, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0, 1} source=1 dest: 0}, { cond=p2, acceptance={1} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s12 1) (EQ s15 1)), p0:(EQ s0 1), p1:(EQ s18 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 117 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-00 finished in 500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(X((F(p0)||G(p1)||G(p2)))))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Reduce places removed 1 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 2 place count 39 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 37 transition count 42
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 4 place count 37 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 16 place count 31 transition count 36
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 26 transition count 31
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 26 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 26 place count 26 transition count 30
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 28 place count 25 transition count 30
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 19 transition count 24
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 18 transition count 23
Applied a total of 41 rules in 8 ms. Remains 18 /40 variables (removed 22) and now considering 23/45 (removed 22) transitions.
// Phase 1: matrix 23 rows 18 cols
[2022-05-20 09:31:30] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:30] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 23 rows 18 cols
[2022-05-20 09:31:30] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:30] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-20 09:31:31] [INFO ] Redundant transitions in 24 ms returned [22]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 22 rows 18 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:31] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/40 places, 22/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 18 /18 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/40 places, 22/45 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s6 1) (EQ s8 1) (EQ s13 1)), p0:(EQ s1 1), p2:(AND (EQ s2 1) (EQ s6 1) (EQ s17 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 42 steps with 3 reset in 3 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-02 finished in 233 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&X(F(X(X(p1))))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Applied a total of 8 rules in 2 ms. Remains 36 /40 variables (removed 4) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:31] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:31] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:31] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 41/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/40 places, 41/45 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=5, aps=[p0:(EQ s4 1), p1:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-03 finished in 404 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(G(F((X(p1)||p2)))||G(p0)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 37 transition count 42
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 37 transition count 42
Applied a total of 6 rules in 4 ms. Remains 37 /40 variables (removed 3) and now considering 42/45 (removed 3) transitions.
// Phase 1: matrix 42 rows 37 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:31] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 42 rows 37 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 09:31:31] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
// Phase 1: matrix 42 rows 37 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:31] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 37/40 places, 42/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 37/40 places, 42/45 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s16 1), p2:(AND (EQ s25 1) (EQ s34 1)), p1:(EQ s36 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 ShieldRVs-PT-001B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-04 finished in 382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(G(p0))||X(X(p1))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Applied a total of 8 rules in 3 ms. Remains 36 /40 variables (removed 4) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:31] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:31] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:32] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 41/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/40 places, 41/45 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(AND (EQ s24 1) (EQ s31 1)), p0:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-05 finished in 346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 45/45 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 40 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 37 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 16 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 27 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 27 transition count 32
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 26 place count 27 transition count 30
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 30 place count 25 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 40 place count 20 transition count 25
Applied a total of 40 rules in 14 ms. Remains 20 /40 variables (removed 20) and now considering 25/45 (removed 20) transitions.
// Phase 1: matrix 25 rows 20 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 6 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2022-05-20 09:31:32] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 25 rows 20 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/40 places, 25/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/40 places, 25/45 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s12 1)), p0:(NEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-06 finished in 212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U p1))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Applied a total of 8 rules in 3 ms. Remains 36 /40 variables (removed 4) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 2 ms
[2022-05-20 09:31:32] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 41/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/40 places, 41/45 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s23 1), p0:(AND (EQ s3 1) (EQ s11 1) (EQ s34 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-08 finished in 215 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 39 transition count 40
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 35 transition count 40
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 35 transition count 35
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 30 transition count 35
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 25 transition count 30
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 25 transition count 30
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 28 place count 25 transition count 29
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 30 place count 24 transition count 29
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 17 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 16 transition count 21
Applied a total of 45 rules in 16 ms. Remains 16 /40 variables (removed 24) and now considering 21/45 (removed 24) transitions.
// Phase 1: matrix 21 rows 16 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 21 rows 16 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:32] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-20 09:31:32] [INFO ] Redundant transitions in 17 ms returned [20]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 20 rows 16 cols
[2022-05-20 09:31:32] [INFO ] Computed 5 place invariants in 4 ms
[2022-05-20 09:31:32] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/40 places, 20/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/40 places, 20/45 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s1 0) (EQ s3 0) (EQ s15 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1072 reset in 232 ms.
Stack based approach found an accepted trace after 55 steps with 0 reset with depth 56 and stack size 47 in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-10 finished in 423 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 35 transition count 40
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 35 transition count 40
Applied a total of 10 rules in 2 ms. Remains 35 /40 variables (removed 5) and now considering 40/45 (removed 5) transitions.
// Phase 1: matrix 40 rows 35 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 40 rows 35 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
// Phase 1: matrix 40 rows 35 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 35/40 places, 40/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 35/40 places, 40/45 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-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:(AND (EQ s3 1) (EQ s11 1) (EQ s32 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 ShieldRVs-PT-001B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-11 finished in 212 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Applied a total of 8 rules in 2 ms. Remains 36 /40 variables (removed 4) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 3 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 41/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/40 places, 41/45 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-12 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:(EQ s10 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 934 steps with 32 reset in 5 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-12 finished in 238 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(p0)&&p0))))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 36 transition count 41
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 36 transition count 41
Applied a total of 8 rules in 1 ms. Remains 36 /40 variables (removed 4) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 1 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
// Phase 1: matrix 41 rows 36 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 36/40 places, 41/45 transitions.
Finished structural reductions, in 1 iterations. Remains : 36/40 places, 41/45 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-14 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 s10 0)], 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 825 steps with 0 reset in 2 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-14 finished in 210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 45/45 transitions.
Reduce places removed 1 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 2 place count 39 transition count 42
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 37 transition count 42
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 4 place count 37 transition count 37
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 14 place count 32 transition count 37
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 19 place count 27 transition count 32
Iterating global reduction 2 with 5 rules applied. Total rules applied 24 place count 27 transition count 32
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 38 place count 20 transition count 25
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 19 transition count 24
Applied a total of 39 rules in 9 ms. Remains 19 /40 variables (removed 21) and now considering 24/45 (removed 21) transitions.
// Phase 1: matrix 24 rows 19 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 24 rows 19 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2022-05-20 09:31:33] [INFO ] Redundant transitions in 15 ms returned [23]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 23 rows 19 cols
[2022-05-20 09:31:33] [INFO ] Computed 5 place invariants in 0 ms
[2022-05-20 09:31:33] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/40 places, 23/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 19 /19 variables (removed 0) and now considering 23/23 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 19/40 places, 23/45 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-001B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s5 1) (NEQ s18 1)), p1:(NEQ s13 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 653 reset in 79 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 0 ms.
FORMULA ShieldRVs-PT-001B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-001B-LTLFireability-15 finished in 323 ms.
All properties solved by simple procedures.
Total runtime 5344 ms.

BK_STOP 1653039094172

--------------------
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="ShieldRVs-PT-001B"
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 ShieldRVs-PT-001B, 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-165286025700716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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