Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 161K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 11:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 27 11:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 5 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 17K May 5 16:52 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 ShieldIIPt-PT-001B-00
FORMULA_NAME ShieldIIPt-PT-001B-01
FORMULA_NAME ShieldIIPt-PT-001B-02
FORMULA_NAME ShieldIIPt-PT-001B-03
FORMULA_NAME ShieldIIPt-PT-001B-04
FORMULA_NAME ShieldIIPt-PT-001B-05
FORMULA_NAME ShieldIIPt-PT-001B-06
FORMULA_NAME ShieldIIPt-PT-001B-07
FORMULA_NAME ShieldIIPt-PT-001B-08
FORMULA_NAME ShieldIIPt-PT-001B-09
FORMULA_NAME ShieldIIPt-PT-001B-10
FORMULA_NAME ShieldIIPt-PT-001B-11
FORMULA_NAME ShieldIIPt-PT-001B-12
FORMULA_NAME ShieldIIPt-PT-001B-13
FORMULA_NAME ShieldIIPt-PT-001B-14
FORMULA_NAME ShieldIIPt-PT-001B-15

=== Now, execution of the tool begins

BK_START 1621095355177

Running Version 0
[2021-05-15 16:15:56] [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]
[2021-05-15 16:15:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-15 16:15:56] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2021-05-15 16:15:56] [INFO ] Transformed 73 places.
[2021-05-15 16:15:56] [INFO ] Transformed 68 transitions.
[2021-05-15 16:15:56] [INFO ] Found NUPN structural information;
[2021-05-15 16:15:56] [INFO ] Parsed PT model containing 73 places and 68 transitions in 71 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-15 16:15:56] [INFO ] Initial state test concluded for 1 properties.
Support contains 32 out of 73 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 73/73 places, 68/68 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 70 transition count 65
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 70 transition count 65
Applied a total of 6 rules in 16 ms. Remains 70 /73 variables (removed 3) and now considering 65/68 (removed 3) transitions.
// Phase 1: matrix 65 rows 70 cols
[2021-05-15 16:15:56] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-15 16:15:57] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 65 rows 70 cols
[2021-05-15 16:15:57] [INFO ] Computed 10 place invariants in 5 ms
[2021-05-15 16:15:57] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 65 rows 70 cols
[2021-05-15 16:15:57] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 16:15:57] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Finished structural reductions, in 1 iterations. Remains : 70/73 places, 65/68 transitions.
[2021-05-15 16:15:57] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-15 16:15:57] [INFO ] Flatten gal took : 27 ms
FORMULA ShieldIIPt-PT-001B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-001B-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-15 16:15:57] [INFO ] Flatten gal took : 8 ms
[2021-05-15 16:15:57] [INFO ] Input system was already deterministic with 65 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 347 ms. (steps per millisecond=288 ) properties (out of 30) seen :28
Running SMT prover for 2 properties.
// Phase 1: matrix 65 rows 70 cols
[2021-05-15 16:15:57] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-15 16:15:57] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-15 16:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 16:15:57] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2021-05-15 16:15:57] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 16:15:57] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2021-05-15 16:15:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-15 16:15:57] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-15 16:15:58] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 3 ms to minimize.
[2021-05-15 16:15:58] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 78 ms
[2021-05-15 16:15:58] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-15 16:15:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-15 16:15:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-15 16:15:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-15 16:15:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
[2021-05-15 16:15:58] [INFO ] Initial state test concluded for 1 properties.
FORMULA ShieldIIPt-PT-001B-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&F((G(p1)||G(p2)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 69 transition count 46
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 38 place count 51 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 39 place count 50 transition count 44
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 39 place count 50 transition count 40
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 47 place count 46 transition count 40
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 52 place count 41 transition count 35
Iterating global reduction 3 with 5 rules applied. Total rules applied 57 place count 41 transition count 35
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 57 place count 41 transition count 33
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 61 place count 39 transition count 33
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 87 place count 26 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 89 place count 25 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 90 place count 24 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 91 place count 23 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 91 place count 23 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 93 place count 22 transition count 18
Applied a total of 93 rules in 24 ms. Remains 22 /70 variables (removed 48) and now considering 18/65 (removed 47) transitions.
// Phase 1: matrix 18 rows 22 cols
[2021-05-15 16:15:58] [INFO ] Computed 9 place invariants in 2 ms
[2021-05-15 16:15:58] [INFO ] Implicit Places using invariants in 28 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
[2021-05-15 16:15:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 21 cols
[2021-05-15 16:15:58] [INFO ] Computed 8 place invariants in 7 ms
[2021-05-15 16:15:58] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 21/70 places, 18/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 17
Applied a total of 2 rules in 3 ms. Remains 20 /21 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 20 cols
[2021-05-15 16:15:58] [INFO ] Computed 8 place invariants in 0 ms
[2021-05-15 16:15:58] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 17 rows 20 cols
[2021-05-15 16:15:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 16:15:58] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/70 places, 17/65 transitions.
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-001B-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s16 1), p1:(EQ s9 1), p2:(EQ s16 0)], nbAcceptance=2, 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 12 reset in 325 ms.
Stack based approach found an accepted trace after 26 steps with 0 reset with depth 27 and stack size 26 in 0 ms.
FORMULA ShieldIIPt-PT-001B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-00 finished in 706 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&G((G(p1) U p2)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 69 transition count 49
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 32 place count 54 transition count 47
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 35 place count 53 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 37 place count 51 transition count 45
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 37 place count 51 transition count 40
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 47 place count 46 transition count 40
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 51 place count 42 transition count 36
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 42 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 55 place count 42 transition count 34
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 59 place count 40 transition count 34
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 87 place count 26 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 89 place count 25 transition count 20
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 90 place count 25 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 91 place count 24 transition count 19
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 93 place count 22 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 93 place count 22 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 95 place count 21 transition count 18
Applied a total of 95 rules in 18 ms. Remains 21 /70 variables (removed 49) and now considering 18/65 (removed 47) transitions.
// Phase 1: matrix 18 rows 21 cols
[2021-05-15 16:15:58] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-15 16:15:58] [INFO ] Implicit Places using invariants in 24 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 25 ms to find 1 implicit places.
[2021-05-15 16:15:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 18 rows 20 cols
[2021-05-15 16:15:58] [INFO ] Computed 7 place invariants in 1 ms
[2021-05-15 16:15:58] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 20/70 places, 18/65 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 19 transition count 17
Applied a total of 2 rules in 3 ms. Remains 19 /20 variables (removed 1) and now considering 17/18 (removed 1) transitions.
// Phase 1: matrix 17 rows 19 cols
[2021-05-15 16:15:58] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 16:15:58] [INFO ] Implicit Places using invariants in 16 ms returned []
// Phase 1: matrix 17 rows 19 cols
[2021-05-15 16:15:58] [INFO ] Computed 7 place invariants in 0 ms
[2021-05-15 16:15:58] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 19/70 places, 17/65 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldIIPt-PT-001B-01 automaton TGBA [mat=[[{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND p0 p2) (AND p0 p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=0 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 0}, { cond=(OR p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0, 1} source=2 dest: 0}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p2) p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={1} source=4 dest: 2}, { cond=(AND p2 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s8 1), p2:(EQ s13 1), p1:(EQ s15 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 22917 steps with 0 reset in 42 ms.
FORMULA ShieldIIPt-PT-001B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-01 finished in 326 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0 U X(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 9 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:15:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:15:59] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:15:59] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 1), p1:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 145 ms.
Stack based approach found an accepted trace after 167 steps with 1 reset with depth 158 and stack size 158 in 1 ms.
FORMULA ShieldIIPt-PT-001B-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-03 finished in 353 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F(p1)&&X((X(p2)&&G((p0||X(G(p3)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 64 transition count 59
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 64 transition count 59
Applied a total of 12 rules in 4 ms. Remains 64 /70 variables (removed 6) and now considering 59/65 (removed 6) transitions.
// Phase 1: matrix 59 rows 64 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:15:59] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 59 rows 64 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:15:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
// Phase 1: matrix 59 rows 64 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:15:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 64/70 places, 59/65 transitions.
Stuttering acceptance computed with spot in 222 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-001B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p0), acceptance={} source=4 dest: 6}, { cond=p0, acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}], [{ cond=(NOT p3), acceptance={} source=6 dest: 2}, { cond=p3, acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(NEQ s58 1), p1:(EQ s9 1), p2:(EQ s36 1), p3:(NEQ s46 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-04 finished in 351 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0&&G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:15:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:15:59] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:15:59] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-15 16:15:59] [INFO ] Dead Transitions using invariants and state equation in 57 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldIIPt-PT-001B-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (OR (NEQ s20 1) (NEQ s50 1)) (NEQ s9 0) (NEQ s4 1)), p0:(EQ s9 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-05 finished in 271 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&X((p1&&F(p2)&&X(F(!p2))))))], workingDir=/home/mcc/execution]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 15 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-15 16:16:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), true, true, (NOT p2), p2]
Running random walk in product with property : ShieldIIPt-PT-001B-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}], [{ cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s9 1)), p1:(EQ s51 1), p2:(EQ s9 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 1 ms.
FORMULA ShieldIIPt-PT-001B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-06 finished in 247 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(((p0 U p1) U p2))||G(p3)))], workingDir=/home/mcc/execution]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 70 transition count 52
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 28 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 31 place count 56 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 33 place count 54 transition count 48
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 33 place count 54 transition count 41
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 47 place count 47 transition count 41
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 51 place count 43 transition count 37
Iterating global reduction 4 with 4 rules applied. Total rules applied 55 place count 43 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 55 place count 43 transition count 36
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 57 place count 42 transition count 36
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 83 place count 29 transition count 23
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 87 place count 27 transition count 24
Applied a total of 87 rules in 11 ms. Remains 27 /70 variables (removed 43) and now considering 24/65 (removed 41) transitions.
// Phase 1: matrix 24 rows 27 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 24 rows 27 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2021-05-15 16:16:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 24 rows 27 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:00] [INFO ] Dead Transitions using invariants and state equation in 17 ms returned []
Finished structural reductions, in 1 iterations. Remains : 27/70 places, 24/65 transitions.
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p2) (NOT p3)), true, (NOT p1), (NOT p2), (NOT p2), (NOT p3), (AND (NOT p1) p2 (NOT p3))]
Running random walk in product with property : ShieldIIPt-PT-001B-07 automaton TGBA [mat=[[{ cond=(OR (AND p2 p3) (AND p1 p3) (AND p0 p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0 (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) p0 (NOT p3))), acceptance={} source=0 dest: 3}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3)) (AND p0 (NOT p3))), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={} source=0 dest: 5}, { cond=(AND (NOT p2) (NOT p1) p0 p3), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=4 dest: 2}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=4 dest: 3}, { cond=(OR p2 p1 p0), acceptance={} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 1}, { cond=p3, acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p1) p0 (NOT p3)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p1) (NOT p0) p3), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1) p0 p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(EQ s3 0), p3:(EQ s21 1), p1:(AND (EQ s11 1) (EQ s24 1)), p0:(EQ s16 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-07 finished in 420 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 69 transition count 46
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 51 transition count 46
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 36 place count 51 transition count 42
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 44 place count 47 transition count 42
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 43 transition count 38
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 43 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 52 place count 43 transition count 36
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 41 transition count 36
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 88 place count 25 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 92 place count 23 transition count 21
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 22 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 21 transition count 20
Applied a total of 94 rules in 9 ms. Remains 21 /70 variables (removed 49) and now considering 20/65 (removed 45) transitions.
// Phase 1: matrix 20 rows 21 cols
[2021-05-15 16:16:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-15 16:16:00] [INFO ] Computed 9 place invariants in 1 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2021-05-15 16:16:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 20 rows 21 cols
[2021-05-15 16:16:00] [INFO ] Computed 9 place invariants in 0 ms
[2021-05-15 16:16:00] [INFO ] Dead Transitions using invariants and state equation in 16 ms returned []
Finished structural reductions, in 1 iterations. Remains : 21/70 places, 20/65 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s12 1) (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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-10 finished in 119 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 7 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:00] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s58 1) (NEQ s14 1) (NEQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 242 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-11 finished in 204 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 4 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:01] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-15 16:16:01] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-001B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s11 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 5549 reset in 121 ms.
Stack based approach found an accepted trace after 49941 steps with 2775 reset with depth 28 and stack size 28 in 66 ms.
FORMULA ShieldIIPt-PT-001B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-12 finished in 345 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0||G((!p1&&F(G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 62 transition count 57
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 60 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 60 transition count 55
Applied a total of 20 rules in 3 ms. Remains 60 /70 variables (removed 10) and now considering 55/65 (removed 10) transitions.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:01] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:01] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
// Phase 1: matrix 55 rows 60 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Finished structural reductions, in 1 iterations. Remains : 60/70 places, 55/65 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, (NOT p2), (OR (NOT p2) p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s10 1), p1:(EQ s25 1), p2:(NEQ s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-001B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-14 finished in 205 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(F((p0&&X(p1)))))&&G((F(p3)||p2))))], workingDir=/home/mcc/execution]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 70/70 places, 65/65 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 63 transition count 58
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 63 transition count 58
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 62 transition count 57
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 62 transition count 57
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 61 transition count 56
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 61 transition count 56
Applied a total of 18 rules in 3 ms. Remains 61 /70 variables (removed 9) and now considering 56/65 (removed 9) transitions.
// Phase 1: matrix 56 rows 61 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:01] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 56 rows 61 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-15 16:16:01] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
// Phase 1: matrix 56 rows 61 cols
[2021-05-15 16:16:01] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-15 16:16:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 61/70 places, 56/65 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (NOT p0)), (NOT p3), (AND (NOT p3) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldIIPt-PT-001B-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}, { cond=p0, acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (EQ s52 1) (EQ s49 1)), p3:(EQ s29 1), p0:(EQ s26 1), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1269 reset in 102 ms.
Stack based approach found an accepted trace after 78 steps with 0 reset with depth 79 and stack size 79 in 0 ms.
FORMULA ShieldIIPt-PT-001B-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-001B-15 finished in 368 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621095363266

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ShieldIIPt-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 ShieldIIPt-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 r216-tall-162098204900349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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