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-162098205600781.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 ShieldPPPt-PT-010B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r216-tall-162098205600781
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 9.3K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 122K 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.5K Mar 28 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 27 12:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 12:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 18:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 18:34 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 185K 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 ShieldPPPt-PT-010B-00
FORMULA_NAME ShieldPPPt-PT-010B-01
FORMULA_NAME ShieldPPPt-PT-010B-02
FORMULA_NAME ShieldPPPt-PT-010B-03
FORMULA_NAME ShieldPPPt-PT-010B-04
FORMULA_NAME ShieldPPPt-PT-010B-05
FORMULA_NAME ShieldPPPt-PT-010B-06
FORMULA_NAME ShieldPPPt-PT-010B-07
FORMULA_NAME ShieldPPPt-PT-010B-08
FORMULA_NAME ShieldPPPt-PT-010B-09
FORMULA_NAME ShieldPPPt-PT-010B-10
FORMULA_NAME ShieldPPPt-PT-010B-11
FORMULA_NAME ShieldPPPt-PT-010B-12
FORMULA_NAME ShieldPPPt-PT-010B-13
FORMULA_NAME ShieldPPPt-PT-010B-14
FORMULA_NAME ShieldPPPt-PT-010B-15

=== Now, execution of the tool begins

BK_START 1621175107089

Running Version 0
[2021-05-16 14:25:08] [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-16 14:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-16 14:25:08] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2021-05-16 14:25:08] [INFO ] Transformed 783 places.
[2021-05-16 14:25:08] [INFO ] Transformed 713 transitions.
[2021-05-16 14:25:08] [INFO ] Found NUPN structural information;
[2021-05-16 14:25:08] [INFO ] Parsed PT model containing 783 places and 713 transitions in 132 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-16 14:25:08] [INFO ] Initial state test concluded for 2 properties.
FORMULA ShieldPPPt-PT-010B-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 783 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 783/783 places, 713/713 transitions.
Discarding 103 places :
Symmetric choice reduction at 0 with 103 rule applications. Total rules 103 place count 680 transition count 610
Iterating global reduction 0 with 103 rules applied. Total rules applied 206 place count 680 transition count 610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 207 place count 679 transition count 609
Iterating global reduction 0 with 1 rules applied. Total rules applied 208 place count 679 transition count 609
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 209 place count 678 transition count 608
Iterating global reduction 0 with 1 rules applied. Total rules applied 210 place count 678 transition count 608
Applied a total of 210 rules in 201 ms. Remains 678 /783 variables (removed 105) and now considering 608/713 (removed 105) transitions.
// Phase 1: matrix 608 rows 678 cols
[2021-05-16 14:25:09] [INFO ] Computed 111 place invariants in 24 ms
[2021-05-16 14:25:09] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 608 rows 678 cols
[2021-05-16 14:25:09] [INFO ] Computed 111 place invariants in 5 ms
[2021-05-16 14:25:09] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
// Phase 1: matrix 608 rows 678 cols
[2021-05-16 14:25:09] [INFO ] Computed 111 place invariants in 3 ms
[2021-05-16 14:25:10] [INFO ] Dead Transitions using invariants and state equation in 309 ms returned []
Finished structural reductions, in 1 iterations. Remains : 678/783 places, 608/713 transitions.
[2021-05-16 14:25:10] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-16 14:25:10] [INFO ] Flatten gal took : 75 ms
FORMULA ShieldPPPt-PT-010B-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-16 14:25:10] [INFO ] Flatten gal took : 34 ms
[2021-05-16 14:25:10] [INFO ] Input system was already deterministic with 608 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 486 ms. (steps per millisecond=205 ) properties (out of 28) seen :27
Running SMT prover for 1 properties.
// Phase 1: matrix 608 rows 678 cols
[2021-05-16 14:25:10] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:11] [INFO ] [Real]Absence check using 111 positive place invariants in 24 ms returned sat
[2021-05-16 14:25:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-16 14:25:11] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2021-05-16 14:25:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-16 14:25:11] [INFO ] [Nat]Absence check using 111 positive place invariants in 25 ms returned sat
[2021-05-16 14:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-16 14:25:11] [INFO ] [Nat]Absence check using state equation in 186 ms returned sat
[2021-05-16 14:25:11] [INFO ] Deduced a trap composed of 20 places in 136 ms of which 4 ms to minimize.
[2021-05-16 14:25:11] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2021-05-16 14:25:11] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 22 places in 107 ms of which 2 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 18 places in 107 ms of which 1 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 20 places in 99 ms of which 1 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 0 ms to minimize.
[2021-05-16 14:25:12] [INFO ] Deduced a trap composed of 25 places in 80 ms of which 0 ms to minimize.
[2021-05-16 14:25:13] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 0 ms to minimize.
[2021-05-16 14:25:13] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 0 ms to minimize.
[2021-05-16 14:25:13] [INFO ] Deduced a trap composed of 26 places in 61 ms of which 0 ms to minimize.
[2021-05-16 14:25:13] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 0 ms to minimize.
[2021-05-16 14:25:13] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2021-05-16 14:25:13] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1839 ms
[2021-05-16 14:25:13] [INFO ] Computed and/alt/rep : 607/901/607 causal constraints (skipped 0 transitions) in 32 ms.
[2021-05-16 14:25:18] [INFO ] Added : 603 causal constraints over 123 iterations in 5177 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0)&&G(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 677 transition count 469
Reduce places removed 138 places and 0 transitions.
Iterating post reduction 1 with 138 rules applied. Total rules applied 276 place count 539 transition count 469
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 276 place count 539 transition count 392
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 430 place count 462 transition count 392
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 435 place count 457 transition count 387
Iterating global reduction 2 with 5 rules applied. Total rules applied 440 place count 457 transition count 387
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 440 place count 457 transition count 383
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 448 place count 453 transition count 383
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 1 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 786 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 787 place count 284 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 847 place count 254 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 848 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 849 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 849 place count 252 transition count 209
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 853 place count 250 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 854 place count 249 transition count 208
Applied a total of 854 rules in 133 ms. Remains 249 /678 variables (removed 429) and now considering 208/608 (removed 400) transitions.
// Phase 1: matrix 208 rows 249 cols
[2021-05-16 14:25:18] [INFO ] Computed 110 place invariants in 1 ms
[2021-05-16 14:25:18] [INFO ] Implicit Places using invariants in 124 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 126 ms to find 2 implicit places.
[2021-05-16 14:25:18] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 208 rows 247 cols
[2021-05-16 14:25:18] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:18] [INFO ] Dead Transitions using invariants and state equation in 103 ms returned []
Starting structural reductions, iteration 1 : 247/678 places, 208/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 206
Applied a total of 4 rules in 29 ms. Remains 245 /247 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 245 cols
[2021-05-16 14:25:18] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:19] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 206 rows 245 cols
[2021-05-16 14:25:19] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:19] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 245/678 places, 206/608 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-00 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s75 0), p0:(EQ s81 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 1009 steps with 0 reset in 13 ms.
FORMULA ShieldPPPt-PT-010B-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-00 finished in 932 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(p0) U G((p1||X((G(p2) U (p1&&G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 671 transition count 601
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 671 transition count 601
Applied a total of 14 rules in 34 ms. Remains 671 /678 variables (removed 7) and now considering 601/608 (removed 7) transitions.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:25:19] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:19] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:25:19] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:20] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:25:20] [INFO ] Computed 111 place invariants in 4 ms
[2021-05-16 14:25:20] [INFO ] Dead Transitions using invariants and state equation in 288 ms returned []
Finished structural reductions, in 1 iterations. Remains : 671/678 places, 601/608 transitions.
Stuttering acceptance computed with spot in 331 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (AND p0 (NOT p1)), true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={1} source=1 dest: 1}, { cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={1} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND p1 p2), acceptance={} source=3 dest: 9}, { cond=(AND p1 p2), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 7}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p2), acceptance={0, 1} source=5 dest: 5}, { cond=(NOT p2), acceptance={} source=5 dest: 7}, { cond=(AND p1 p2), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(NOT p2), acceptance={} source=8 dest: 7}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(NOT p2), acceptance={1} source=9 dest: 1}, { cond=(NOT p2), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={} source=9 dest: 9}, { cond=(AND p1 p2), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=10 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=11 dest: 8}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=12 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=12 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=12 dest: 8}, { cond=(AND p1 p0 p2), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s58 1), p0:(OR (EQ s58 1) (AND (EQ s378 1) (EQ s427 1))), p2:(NEQ s396 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1614 steps with 0 reset in 9 ms.
FORMULA ShieldPPPt-PT-010B-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-01 finished in 1232 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||F(p1)))], workingDir=/home/mcc/execution]
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 677 transition count 470
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 540 transition count 470
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 77 Pre rules applied. Total rules applied 274 place count 540 transition count 393
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 428 place count 463 transition count 393
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 434 place count 457 transition count 387
Iterating global reduction 2 with 6 rules applied. Total rules applied 440 place count 457 transition count 387
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 440 place count 457 transition count 382
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 450 place count 452 transition count 382
Performed 167 Post agglomeration using F-continuation condition.Transition count delta: 167
Deduced a syphon composed of 167 places in 0 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 2 with 334 rules applied. Total rules applied 784 place count 285 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 785 place count 285 transition count 214
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 787 place count 284 transition count 213
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 845 place count 255 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 846 place count 254 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 847 place count 253 transition count 212
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 847 place count 253 transition count 210
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 851 place count 251 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 852 place count 250 transition count 209
Applied a total of 852 rules in 78 ms. Remains 250 /678 variables (removed 428) and now considering 209/608 (removed 399) transitions.
// Phase 1: matrix 209 rows 250 cols
[2021-05-16 14:25:20] [INFO ] Computed 110 place invariants in 1 ms
[2021-05-16 14:25:20] [INFO ] Implicit Places using invariants in 116 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 117 ms to find 2 implicit places.
[2021-05-16 14:25:20] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 209 rows 248 cols
[2021-05-16 14:25:20] [INFO ] Computed 108 place invariants in 2 ms
[2021-05-16 14:25:21] [INFO ] Dead Transitions using invariants and state equation in 104 ms returned []
Starting structural reductions, iteration 1 : 248/678 places, 209/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 246 transition count 207
Applied a total of 4 rules in 9 ms. Remains 246 /248 variables (removed 2) and now considering 207/209 (removed 2) transitions.
// Phase 1: matrix 207 rows 246 cols
[2021-05-16 14:25:21] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:21] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 207 rows 246 cols
[2021-05-16 14:25:21] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:25:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-16 14:25:21] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 246/678 places, 207/608 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldPPPt-PT-010B-02 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s217 1), p0:(EQ s174 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5307 reset in 346 ms.
Stack based approach found an accepted trace after 109 steps with 7 reset with depth 12 and stack size 12 in 1 ms.
FORMULA ShieldPPPt-PT-010B-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-02 finished in 1015 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 677 transition count 470
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 540 transition count 470
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 78 Pre rules applied. Total rules applied 274 place count 540 transition count 392
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 430 place count 462 transition count 392
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 435 place count 457 transition count 387
Iterating global reduction 2 with 5 rules applied. Total rules applied 440 place count 457 transition count 387
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 440 place count 457 transition count 383
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 448 place count 453 transition count 383
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 786 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 787 place count 284 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 283 transition count 212
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 847 place count 254 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 848 place count 253 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 849 place count 252 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 849 place count 252 transition count 209
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 853 place count 250 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 854 place count 249 transition count 208
Applied a total of 854 rules in 70 ms. Remains 249 /678 variables (removed 429) and now considering 208/608 (removed 400) transitions.
// Phase 1: matrix 208 rows 249 cols
[2021-05-16 14:25:21] [INFO ] Computed 110 place invariants in 0 ms
[2021-05-16 14:25:21] [INFO ] Implicit Places using invariants in 110 ms returned [232, 236]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 111 ms to find 2 implicit places.
[2021-05-16 14:25:21] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 208 rows 247 cols
[2021-05-16 14:25:21] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:22] [INFO ] Dead Transitions using invariants and state equation in 99 ms returned []
Starting structural reductions, iteration 1 : 247/678 places, 208/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 245 transition count 206
Applied a total of 4 rules in 9 ms. Remains 245 /247 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 245 cols
[2021-05-16 14:25:22] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:22] [INFO ] Implicit Places using invariants in 118 ms returned []
// Phase 1: matrix 206 rows 245 cols
[2021-05-16 14:25:22] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 14:25:22] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 245/678 places, 206/608 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s126 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10 reset in 321 ms.
Product exploration explored 100000 steps with 12 reset in 466 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 320 ms.
Product exploration explored 100000 steps with 4 reset in 410 ms.
[2021-05-16 14:25:24] [INFO ] Flatten gal took : 12 ms
[2021-05-16 14:25:24] [INFO ] Flatten gal took : 12 ms
[2021-05-16 14:25:24] [INFO ] Time to serialize gal into /tmp/LTL11697899067133979405.gal : 8 ms
[2021-05-16 14:25:24] [INFO ] Time to serialize properties into /tmp/LTL1304862055411692725.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL11697899067133979405.gal, -t, CGAL, -LTL, /tmp/LTL1304862055411692725.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL11697899067133979405.gal -t CGAL -LTL /tmp/LTL1304862055411692725.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G(F("(p385!=1)"))))
Formula 0 simplified : !GF"(p385!=1)"
Reverse transition relation is NOT exact ! Due to transitions t0.t493, t1.t490, t2.t487, t3.t446, t4.t443, t5.t440, t6.t398, t7.t395, t8.t392, t9.t351, t10.t348, t11.t345, t12.t305, t13.t302, t14.t299, t16.t255, t273, t475.t603.t494.t471.t474, t427.t594.t447.t423.t426, t380.t585.t399.t376.t379, t333.t576.t352.t329.t332, t287.t567.t306.t283.t286, t295.t565.t296.t291.t294, t268.t569.t269.t264.t267, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/182/24/206
Computing Next relation with stutter on 4.09214e+15 deadlock states
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
163 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,1.65371,66824,1,0,388,348694,442,152,7629,231649,438
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldPPPt-PT-010B-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property ShieldPPPt-PT-010B-03 finished in 4161 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(G(p0))||(F(p1)&&X(X(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 672 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 672 transition count 602
Applied a total of 12 rules in 33 ms. Remains 672 /678 variables (removed 6) and now considering 602/608 (removed 6) transitions.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:25] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:26] [INFO ] Implicit Places using invariants in 187 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:26] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:26] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:26] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:26] [INFO ] Dead Transitions using invariants and state equation in 268 ms returned []
Finished structural reductions, in 1 iterations. Remains : 672/678 places, 602/608 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldPPPt-PT-010B-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s413 1), p0:(EQ s139 1), p2:(EQ s14 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1202 reset in 222 ms.
Product exploration explored 100000 steps with 1203 reset in 239 ms.
Knowledge obtained : [(NOT p1), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 1166 reset in 220 ms.
Product exploration explored 100000 steps with 1195 reset in 240 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1)]
Support contains 3 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 672/672 places, 602/602 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 672 transition count 602
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 139 place count 672 transition count 641
Deduced a syphon composed of 188 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 188 place count 672 transition count 641
Performed 188 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 376 places in 0 ms
Iterating global reduction 1 with 188 rules applied. Total rules applied 376 place count 672 transition count 641
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 377 place count 672 transition count 640
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 449 place count 600 transition count 568
Deduced a syphon composed of 304 places in 0 ms
Iterating global reduction 2 with 72 rules applied. Total rules applied 521 place count 600 transition count 568
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 522 place count 600 transition count 568
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 524 place count 598 transition count 566
Deduced a syphon composed of 303 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 526 place count 598 transition count 566
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: -160
Deduced a syphon composed of 341 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 564 place count 598 transition count 726
Discarding 38 places :
Symmetric choice reduction at 2 with 38 rule applications. Total rules 602 place count 560 transition count 650
Deduced a syphon composed of 303 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 640 place count 560 transition count 650
Deduced a syphon composed of 303 places in 0 ms
Applied a total of 640 rules in 174 ms. Remains 560 /672 variables (removed 112) and now considering 650/602 (removed -48) transitions.
[2021-05-16 14:25:28] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 650 rows 560 cols
[2021-05-16 14:25:28] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:28] [INFO ] Dead Transitions using invariants and state equation in 276 ms returned []
Finished structural reductions, in 1 iterations. Remains : 560/672 places, 650/602 transitions.
Product exploration explored 100000 steps with 10248 reset in 996 ms.
Stack based approach found an accepted trace after 35 steps with 3 reset with depth 7 and stack size 5 in 1 ms.
FORMULA ShieldPPPt-PT-010B-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-04 finished in 3870 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 136 transitions
Trivial Post-agglo rules discarded 136 transitions
Performed 136 trivial Post agglomeration. Transition count delta: 136
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 677 transition count 471
Reduce places removed 136 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 137 rules applied. Total rules applied 273 place count 541 transition count 470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 274 place count 540 transition count 470
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 78 Pre rules applied. Total rules applied 274 place count 540 transition count 392
Deduced a syphon composed of 78 places in 1 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 430 place count 462 transition count 392
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 436 place count 456 transition count 386
Iterating global reduction 3 with 6 rules applied. Total rules applied 442 place count 456 transition count 386
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 442 place count 456 transition count 381
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 452 place count 451 transition count 381
Performed 164 Post agglomeration using F-continuation condition.Transition count delta: 164
Deduced a syphon composed of 164 places in 0 ms
Reduce places removed 164 places and 0 transitions.
Iterating global reduction 3 with 328 rules applied. Total rules applied 780 place count 287 transition count 217
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 781 place count 287 transition count 216
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 4 with 2 rules applied. Total rules applied 783 place count 286 transition count 215
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 841 place count 257 transition count 215
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 842 place count 256 transition count 214
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 843 place count 255 transition count 214
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 843 place count 255 transition count 212
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 847 place count 253 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 848 place count 252 transition count 211
Applied a total of 848 rules in 70 ms. Remains 252 /678 variables (removed 426) and now considering 211/608 (removed 397) transitions.
// Phase 1: matrix 211 rows 252 cols
[2021-05-16 14:25:29] [INFO ] Computed 110 place invariants in 0 ms
[2021-05-16 14:25:29] [INFO ] Implicit Places using invariants in 114 ms returned [235, 239]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
[2021-05-16 14:25:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 211 rows 250 cols
[2021-05-16 14:25:29] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:30] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 250/678 places, 211/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 248 transition count 209
Applied a total of 4 rules in 6 ms. Remains 248 /250 variables (removed 2) and now considering 209/211 (removed 2) transitions.
// Phase 1: matrix 209 rows 248 cols
[2021-05-16 14:25:30] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:25:30] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 209 rows 248 cols
[2021-05-16 14:25:30] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2021-05-16 14:25:30] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 248/678 places, 209/608 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 0) (EQ s98 1)), p1:(AND (EQ s41 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 119 reset in 330 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 0 ms.
FORMULA ShieldPPPt-PT-010B-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-05 finished in 970 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 137 transitions
Trivial Post-agglo rules discarded 137 transitions
Performed 137 trivial Post agglomeration. Transition count delta: 137
Iterating post reduction 0 with 137 rules applied. Total rules applied 137 place count 677 transition count 470
Reduce places removed 137 places and 0 transitions.
Iterating post reduction 1 with 137 rules applied. Total rules applied 274 place count 540 transition count 470
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 274 place count 540 transition count 394
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 426 place count 464 transition count 394
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 432 place count 458 transition count 388
Iterating global reduction 2 with 6 rules applied. Total rules applied 438 place count 458 transition count 388
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 438 place count 458 transition count 383
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 448 place count 453 transition count 383
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 2 with 338 rules applied. Total rules applied 786 place count 284 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 787 place count 284 transition count 213
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 789 place count 283 transition count 212
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 845 place count 255 transition count 212
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 846 place count 254 transition count 211
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 847 place count 253 transition count 211
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 847 place count 253 transition count 209
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 851 place count 251 transition count 209
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 852 place count 250 transition count 208
Applied a total of 852 rules in 52 ms. Remains 250 /678 variables (removed 428) and now considering 208/608 (removed 400) transitions.
// Phase 1: matrix 208 rows 250 cols
[2021-05-16 14:25:30] [INFO ] Computed 110 place invariants in 0 ms
[2021-05-16 14:25:30] [INFO ] Implicit Places using invariants in 115 ms returned [233, 237]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 116 ms to find 2 implicit places.
[2021-05-16 14:25:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 208 rows 248 cols
[2021-05-16 14:25:30] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:31] [INFO ] Dead Transitions using invariants and state equation in 110 ms returned []
Starting structural reductions, iteration 1 : 248/678 places, 208/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 246 transition count 206
Applied a total of 4 rules in 6 ms. Remains 246 /248 variables (removed 2) and now considering 206/208 (removed 2) transitions.
// Phase 1: matrix 206 rows 246 cols
[2021-05-16 14:25:31] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:25:31] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 206 rows 246 cols
[2021-05-16 14:25:31] [INFO ] Computed 108 place invariants in 3 ms
[2021-05-16 14:25:31] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 246/678 places, 206/608 transitions.
Stuttering acceptance computed with spot in 28 ms :[true, (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-06 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}]], initial=1, aps=[p0:(AND (NEQ s102 1) (EQ s65 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 637 steps with 0 reset in 2 ms.
FORMULA ShieldPPPt-PT-010B-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-06 finished in 631 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&F(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 138 transitions
Trivial Post-agglo rules discarded 138 transitions
Performed 138 trivial Post agglomeration. Transition count delta: 138
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 677 transition count 469
Reduce places removed 138 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 139 rules applied. Total rules applied 277 place count 539 transition count 468
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 538 transition count 468
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 278 place count 538 transition count 392
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 430 place count 462 transition count 392
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 435 place count 457 transition count 387
Iterating global reduction 3 with 5 rules applied. Total rules applied 440 place count 457 transition count 387
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 440 place count 457 transition count 382
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 450 place count 452 transition count 382
Performed 169 Post agglomeration using F-continuation condition.Transition count delta: 169
Deduced a syphon composed of 169 places in 0 ms
Reduce places removed 169 places and 0 transitions.
Iterating global reduction 3 with 338 rules applied. Total rules applied 788 place count 283 transition count 213
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 789 place count 283 transition count 212
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 4 with 2 rules applied. Total rules applied 791 place count 282 transition count 211
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 849 place count 253 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 850 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 851 place count 251 transition count 210
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 851 place count 251 transition count 208
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 855 place count 249 transition count 208
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 856 place count 248 transition count 207
Applied a total of 856 rules in 49 ms. Remains 248 /678 variables (removed 430) and now considering 207/608 (removed 401) transitions.
// Phase 1: matrix 207 rows 248 cols
[2021-05-16 14:25:31] [INFO ] Computed 110 place invariants in 0 ms
[2021-05-16 14:25:31] [INFO ] Implicit Places using invariants in 113 ms returned [231, 235]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 114 ms to find 2 implicit places.
[2021-05-16 14:25:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 207 rows 246 cols
[2021-05-16 14:25:31] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:31] [INFO ] Dead Transitions using invariants and state equation in 95 ms returned []
Starting structural reductions, iteration 1 : 246/678 places, 207/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 205
Applied a total of 4 rules in 5 ms. Remains 244 /246 variables (removed 2) and now considering 205/207 (removed 2) transitions.
// Phase 1: matrix 205 rows 244 cols
[2021-05-16 14:25:31] [INFO ] Computed 108 place invariants in 0 ms
[2021-05-16 14:25:31] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 205 rows 244 cols
[2021-05-16 14:25:31] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:31] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 244/678 places, 205/608 transitions.
Stuttering acceptance computed with spot in 64 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s221 1), p1:(AND (EQ s206 1) (EQ s208 1) (OR (EQ s206 0) (EQ s208 0) (AND (EQ s206 1) (EQ s208 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 320 ms.
Stack based approach found an accepted trace after 66 steps with 0 reset with depth 67 and stack size 67 in 1 ms.
FORMULA ShieldPPPt-PT-010B-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-07 finished in 953 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 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 672 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 672 transition count 602
Applied a total of 12 rules in 33 ms. Remains 672 /678 variables (removed 6) and now considering 602/608 (removed 6) transitions.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:32] [INFO ] Computed 111 place invariants in 1 ms
[2021-05-16 14:25:32] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:32] [INFO ] Computed 111 place invariants in 4 ms
[2021-05-16 14:25:32] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:32] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:33] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 672/678 places, 602/608 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-09 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s118 1)], 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 6 reset in 294 ms.
Stack based approach found an accepted trace after 2406 steps with 0 reset with depth 2407 and stack size 2407 in 9 ms.
FORMULA ShieldPPPt-PT-010B-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-09 finished in 1214 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((X(G(p1))||(X(p3)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 673 transition count 603
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 673 transition count 603
Applied a total of 10 rules in 30 ms. Remains 673 /678 variables (removed 5) and now considering 603/608 (removed 5) transitions.
// Phase 1: matrix 603 rows 673 cols
[2021-05-16 14:25:33] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:33] [INFO ] Implicit Places using invariants in 156 ms returned []
// Phase 1: matrix 603 rows 673 cols
[2021-05-16 14:25:33] [INFO ] Computed 111 place invariants in 1 ms
[2021-05-16 14:25:34] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 551 ms to find 0 implicit places.
// Phase 1: matrix 603 rows 673 cols
[2021-05-16 14:25:34] [INFO ] Computed 111 place invariants in 1 ms
[2021-05-16 14:25:34] [INFO ] Dead Transitions using invariants and state equation in 271 ms returned []
Finished structural reductions, in 1 iterations. Remains : 673/678 places, 603/608 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), true]
Running random walk in product with property : ShieldPPPt-PT-010B-10 automaton TGBA [mat=[[{ cond=p0, acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p0), acceptance={0, 1} source=0 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=0 dest: 4}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p2) p3) (AND (NOT p3) p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p3) (NOT p1)), acceptance={1} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p3) (NOT p1)), acceptance={0, 1} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p3) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p2 p0 (NOT p3) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p2 p0 p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(OR (EQ s65 1) (AND (EQ s234 1) (EQ s236 1))), p2:(AND (EQ s234 1) (EQ s236 1)), p1:(EQ s65 1), p3:(EQ s535 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], 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 ShieldPPPt-PT-010B-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-10 finished in 1024 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((F(p1)&&p0) U (p2&&X(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 672 transition count 602
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 672 transition count 602
Applied a total of 12 rules in 31 ms. Remains 672 /678 variables (removed 6) and now considering 602/608 (removed 6) transitions.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:34] [INFO ] Computed 111 place invariants in 1 ms
[2021-05-16 14:25:34] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:34] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:35] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
// Phase 1: matrix 602 rows 672 cols
[2021-05-16 14:25:35] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:35] [INFO ] Dead Transitions using invariants and state equation in 266 ms returned []
Finished structural reductions, in 1 iterations. Remains : 672/678 places, 602/608 transitions.
Stuttering acceptance computed with spot in 100 ms :[(OR (NOT p2) p1), true, p1, (NOT p1), p1]
Running random walk in product with property : ShieldPPPt-PT-010B-11 automaton TGBA [mat=[[{ cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=(AND p2 p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s283 1), p0:(AND (EQ s118 0) (EQ s283 0)), p1:(EQ s217 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 740 reset in 243 ms.
Product exploration explored 100000 steps with 727 reset in 267 ms.
Knowledge obtained : [(NOT p2), p0, (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p2) p1), true, p1, (NOT p1), p1]
Product exploration explored 100000 steps with 730 reset in 246 ms.
Product exploration explored 100000 steps with 742 reset in 270 ms.
Applying partial POR strategy [false, true, true, true, false]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p2) p1), true, p1, (NOT p1), p1]
Support contains 3 out of 672 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 672/672 places, 602/602 transitions.
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 139 rules applied. Total rules applied 139 place count 672 transition count 602
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 51 Pre rules applied. Total rules applied 139 place count 672 transition count 643
Deduced a syphon composed of 190 places in 1 ms
Iterating global reduction 1 with 51 rules applied. Total rules applied 190 place count 672 transition count 643
Performed 186 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 376 places in 0 ms
Iterating global reduction 1 with 186 rules applied. Total rules applied 376 place count 672 transition count 643
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 377 place count 672 transition count 642
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 448 place count 601 transition count 571
Deduced a syphon composed of 305 places in 0 ms
Iterating global reduction 2 with 71 rules applied. Total rules applied 519 place count 601 transition count 571
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 306 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 520 place count 601 transition count 571
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 522 place count 599 transition count 569
Deduced a syphon composed of 304 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 524 place count 599 transition count 569
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -164
Deduced a syphon composed of 343 places in 0 ms
Iterating global reduction 2 with 39 rules applied. Total rules applied 563 place count 599 transition count 733
Discarding 40 places :
Symmetric choice reduction at 2 with 40 rule applications. Total rules 603 place count 559 transition count 653
Deduced a syphon composed of 303 places in 0 ms
Iterating global reduction 2 with 40 rules applied. Total rules applied 643 place count 559 transition count 653
Deduced a syphon composed of 303 places in 0 ms
Applied a total of 643 rules in 111 ms. Remains 559 /672 variables (removed 113) and now considering 653/602 (removed -51) transitions.
[2021-05-16 14:25:37] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 653 rows 559 cols
[2021-05-16 14:25:37] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:37] [INFO ] Dead Transitions using invariants and state equation in 265 ms returned []
Finished structural reductions, in 1 iterations. Remains : 559/672 places, 653/602 transitions.
Product exploration explored 100000 steps with 9575 reset in 823 ms.
Stack based approach found an accepted trace after 44 steps with 2 reset with depth 18 and stack size 15 in 1 ms.
FORMULA ShieldPPPt-PT-010B-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-11 finished in 3558 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 671 transition count 601
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 671 transition count 601
Applied a total of 14 rules in 30 ms. Remains 671 /678 variables (removed 7) and now considering 601/608 (removed 7) transitions.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:25:38] [INFO ] Computed 111 place invariants in 2 ms
[2021-05-16 14:25:38] [INFO ] Implicit Places using invariants in 169 ms returned []
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:25:38] [INFO ] Computed 111 place invariants in 1 ms
[2021-05-16 14:25:38] [INFO ] Implicit Places using invariants and state equation in 397 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
// Phase 1: matrix 601 rows 671 cols
[2021-05-16 14:25:38] [INFO ] Computed 111 place invariants in 10 ms
[2021-05-16 14:25:39] [INFO ] Dead Transitions using invariants and state equation in 278 ms returned []
Finished structural reductions, in 1 iterations. Remains : 671/678 places, 601/608 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPt-PT-010B-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s220 1), p0:(EQ s50 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12 reset in 294 ms.
Stack based approach found an accepted trace after 1684 steps with 0 reset with depth 1685 and stack size 1685 in 6 ms.
FORMULA ShieldPPPt-PT-010B-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-12 finished in 1412 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(G(p0)) U G(p1)))], workingDir=/home/mcc/execution]
Support contains 5 out of 678 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 678/678 places, 608/608 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 134 transitions
Trivial Post-agglo rules discarded 134 transitions
Performed 134 trivial Post agglomeration. Transition count delta: 134
Iterating post reduction 0 with 134 rules applied. Total rules applied 134 place count 677 transition count 473
Reduce places removed 134 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 135 rules applied. Total rules applied 269 place count 543 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 270 place count 542 transition count 472
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 270 place count 542 transition count 395
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 424 place count 465 transition count 395
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 430 place count 459 transition count 389
Iterating global reduction 3 with 6 rules applied. Total rules applied 436 place count 459 transition count 389
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 436 place count 459 transition count 384
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 446 place count 454 transition count 384
Performed 168 Post agglomeration using F-continuation condition.Transition count delta: 168
Deduced a syphon composed of 168 places in 1 ms
Reduce places removed 168 places and 0 transitions.
Iterating global reduction 3 with 336 rules applied. Total rules applied 782 place count 286 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 783 place count 286 transition count 215
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 4 with 2 rules applied. Total rules applied 785 place count 285 transition count 214
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 839 place count 258 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 840 place count 257 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 841 place count 256 transition count 213
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 841 place count 256 transition count 211
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 845 place count 254 transition count 211
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 846 place count 253 transition count 210
Applied a total of 846 rules in 49 ms. Remains 253 /678 variables (removed 425) and now considering 210/608 (removed 398) transitions.
// Phase 1: matrix 210 rows 253 cols
[2021-05-16 14:25:39] [INFO ] Computed 110 place invariants in 1 ms
[2021-05-16 14:25:39] [INFO ] Implicit Places using invariants in 112 ms returned [236, 240]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
[2021-05-16 14:25:39] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 210 rows 251 cols
[2021-05-16 14:25:39] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:39] [INFO ] Dead Transitions using invariants and state equation in 97 ms returned []
Starting structural reductions, iteration 1 : 251/678 places, 210/608 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 249 transition count 208
Applied a total of 4 rules in 5 ms. Remains 249 /251 variables (removed 2) and now considering 208/210 (removed 2) transitions.
// Phase 1: matrix 208 rows 249 cols
[2021-05-16 14:25:39] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:39] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 208 rows 249 cols
[2021-05-16 14:25:39] [INFO ] Computed 108 place invariants in 1 ms
[2021-05-16 14:25:40] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 249/678 places, 208/608 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldPPPt-PT-010B-14 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s1 1) (EQ s10 1) (EQ s27 1)), p0:(AND (NEQ s157 1) (NEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 321 ms.
Stack based approach found an accepted trace after 427 steps with 0 reset with depth 428 and stack size 428 in 1 ms.
FORMULA ShieldPPPt-PT-010B-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPt-PT-010B-14 finished in 938 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621175141485

--------------------
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="ShieldPPPt-PT-010B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ShieldPPPt-PT-010B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r216-tall-162098205600781"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-010B.tgz
mv ShieldPPPt-PT-010B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;