Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 304K
-rw-r--r-- 1 mcc users 7.8K Apr 29 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Apr 29 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 18:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 18:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 9 08:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 53K May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652955680717

Running Version 202205111006
[2022-05-19 10:21:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 10:21:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 10:21:22] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-19 10:21:22] [INFO ] Transformed 193 places.
[2022-05-19 10:21:22] [INFO ] Transformed 143 transitions.
[2022-05-19 10:21:22] [INFO ] Found NUPN structural information;
[2022-05-19 10:21:22] [INFO ] Parsed PT model containing 193 places and 143 transitions in 186 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldIIPt-PT-010A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPt-PT-010A-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 23 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:22] [INFO ] Computed 91 place invariants in 11 ms
[2022-05-19 10:21:22] [INFO ] Implicit Places using invariants in 244 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:22] [INFO ] Computed 91 place invariants in 5 ms
[2022-05-19 10:21:22] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:22] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:21:22] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Support contains 53 out of 193 places after structural reductions.
[2022-05-19 10:21:22] [INFO ] Flatten gal took : 45 ms
[2022-05-19 10:21:22] [INFO ] Flatten gal took : 19 ms
[2022-05-19 10:21:22] [INFO ] Input system was already deterministic with 142 transitions.
Support contains 48 out of 193 places (down from 53) after GAL structural reductions.
Finished random walk after 4323 steps, including 1 resets, run visited all 27 properties in 272 ms. (steps per millisecond=15 )
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((F(G(p0))&&F(p1)))||p1)))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 14 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:23] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:21:23] [INFO ] Implicit Places using invariants in 111 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:23] [INFO ] Computed 91 place invariants in 9 ms
[2022-05-19 10:21:23] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:23] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:21:24] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 409 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s37 1)), p0:(AND (EQ s108 1) (EQ s114 1) (EQ s116 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 449 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-00 finished in 1336 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U (F(p1)&&G(p2)))&&p0)))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 15 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:24] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:21:25] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:25] [INFO ] Computed 91 place invariants in 4 ms
[2022-05-19 10:21:25] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:25] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:25] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 p2), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p1 p2), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s79 1) (EQ s96 1)), p1:(AND (EQ s61 1) (EQ s74 1)), p2:(OR (AND (EQ s33 1) (EQ s48 1)) (NEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-01 finished in 662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!((G(X((F(p0) U !p1)))||(!p0 U p0)) U p2))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:25] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:25] [INFO ] Implicit Places using invariants in 106 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:25] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:21:25] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:25] [INFO ] Computed 91 place invariants in 2 ms
[2022-05-19 10:21:25] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 225 ms :[true, (AND p0 p2), p0, (OR (NOT p1) p0), p2, (OR (AND (NOT p1) p2) (AND p0 p2))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 5}]], initial=4, aps=[p0:(AND (EQ s136 1) (EQ s153 1)), p2:(AND (EQ s99 1) (EQ s112 1)), p1:(AND (EQ s14 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 207 steps with 0 reset in 3 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-02 finished in 604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(X(G(p0))))||p1) U p1))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 192 transition count 140
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 140
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 188 transition count 138
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 187 transition count 138
Applied a total of 8 rules in 29 ms. Remains 187 /193 variables (removed 6) and now considering 138/142 (removed 4) transitions.
// Phase 1: matrix 138 rows 187 cols
[2022-05-19 10:21:26] [INFO ] Computed 89 place invariants in 0 ms
[2022-05-19 10:21:26] [INFO ] Implicit Places using invariants in 92 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/193 places, 138/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 137
Applied a total of 2 rules in 10 ms. Remains 185 /186 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 185 cols
[2022-05-19 10:21:26] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:26] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 137 rows 185 cols
[2022-05-19 10:21:26] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:21:26] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 185/193 places, 137/142 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/193 places, 137/142 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s15 1), p0:(AND (EQ s6 1) (EQ s8 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 0 reset in 286 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-03 finished in 749 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((!(p0 U p1)&&F(p0)) U p2))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
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 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 140
Applied a total of 4 rules in 14 ms. Remains 191 /193 variables (removed 2) and now considering 140/142 (removed 2) transitions.
// Phase 1: matrix 140 rows 191 cols
[2022-05-19 10:21:26] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:27] [INFO ] Implicit Places using invariants in 106 ms returned [183, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 107 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/193 places, 140/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 189 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 8 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2022-05-19 10:21:27] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:21:27] [INFO ] Implicit Places using invariants in 93 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/193 places, 139/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 138
Applied a total of 2 rules in 14 ms. Remains 186 /187 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:27] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:27] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:27] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:27] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 186/193 places, 138/142 transitions.
Finished structural reductions, in 3 iterations. Remains : 186/193 places, 138/142 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p2), true, p1, (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s1 1) (EQ s18 1)), p1:(AND (EQ s1 1) (EQ s18 1) (EQ s180 1)), p0:(EQ s77 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 305 reset in 405 ms.
Stack based approach found an accepted trace after 33 steps with 0 reset with depth 34 and stack size 34 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-04 finished in 1036 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:27] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:28] [INFO ] Implicit Places using invariants in 116 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:28] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:28] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:28] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:28] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s31 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-07 finished in 460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(p0 U !(G((F(p1) U p2)) U p0))))'
Support contains 8 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:28] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:28] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:28] [INFO ] Computed 91 place invariants in 0 ms
[2022-05-19 10:21:28] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:21:28] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:28] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (NOT p1), (NOT p2), (NOT p2), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(NOT p0), acceptance={0} source=5 dest: 4}, { cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s184 1) (EQ s190 1) (EQ s192 1)), p2:(AND (EQ s68 1) (EQ s72 1) (EQ s78 1)), p1:(AND (EQ s65 1) (EQ s76 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 119 reset in 252 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 1 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-08 finished in 821 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(p0 U G((F((X(p0) U X((G(p0)&&p1))))||p2))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
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 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 140
Applied a total of 4 rules in 15 ms. Remains 191 /193 variables (removed 2) and now considering 140/142 (removed 2) transitions.
// Phase 1: matrix 140 rows 191 cols
[2022-05-19 10:21:29] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:21:29] [INFO ] Implicit Places using invariants in 95 ms returned [183, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/193 places, 140/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 189 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 8 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2022-05-19 10:21:29] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:21:29] [INFO ] Implicit Places using invariants in 101 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/193 places, 139/142 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 138
Applied a total of 2 rules in 8 ms. Remains 186 /187 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:29] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:21:29] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:29] [INFO ] Computed 88 place invariants in 3 ms
[2022-05-19 10:21:29] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 186/193 places, 138/142 transitions.
Finished structural reductions, in 3 iterations. Remains : 186/193 places, 138/142 transitions.
Stuttering acceptance computed with spot in 188 ms :[(OR p2 (AND p0 p1)), (OR p2 (AND p0 p1)), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s49 1) (EQ s53 1) (EQ s59 1)), p2:(AND (EQ s7 1) (EQ s9 1)), p1:(EQ s35 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 6 reset in 255 ms.
Product exploration explored 100000 steps with 2 reset in 334 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 519 ms. Reduced automaton from 5 states, 13 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 148 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:31] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:31] [INFO ] [Real]Absence check using 88 positive place invariants in 21 ms returned sat
[2022-05-19 10:21:31] [INFO ] After 214ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 10:21:31] [INFO ] [Nat]Absence check using 88 positive place invariants in 26 ms returned sat
[2022-05-19 10:21:31] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 10:21:31] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-05-19 10:21:31] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 186/186 places, 138/138 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 186 transition count 138
Applied a total of 17 rules in 38 ms. Remains 186 /186 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 138/138 transitions.
Finished random walk after 3112 steps, including 0 resets, run visited all 2 properties in 39 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND p0 p2 p1))), (X (NOT p0)), (X (X (NOT p2))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0)))]
False Knowledge obtained : [(F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (AND p1 (NOT p2) p0)), (F (AND (NOT p1) p0)), (F (AND p1 p2 p0))]
Knowledge based reduction with 13 factoid took 494 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 140 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Stuttering acceptance computed with spot in 128 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 138/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 186 /186 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:32] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:32] [INFO ] Implicit Places using invariants in 104 ms returned []
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:32] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:21:33] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:33] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:33] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 138/138 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), true, (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 331 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 123 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:33] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:21:33] [INFO ] [Real]Absence check using 88 positive place invariants in 15 ms returned sat
[2022-05-19 10:21:33] [INFO ] After 138ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 10:21:33] [INFO ] [Nat]Absence check using 88 positive place invariants in 9 ms returned sat
[2022-05-19 10:21:34] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-19 10:21:34] [INFO ] After 109ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2022-05-19 10:21:34] [INFO ] After 196ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 186/186 places, 138/138 transitions.
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 186 transition count 138
Applied a total of 17 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 138/138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:34] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:21:34] [INFO ] [Real]Absence check using 88 positive place invariants in 9 ms returned sat
[2022-05-19 10:21:34] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 10:21:34] [INFO ] [Nat]Absence check using 88 positive place invariants in 10 ms returned sat
[2022-05-19 10:21:34] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 10:21:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2022-05-19 10:21:34] [INFO ] After 25ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-19 10:21:34] [INFO ] After 45ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2022-05-19 10:21:34] [INFO ] After 170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 186/186 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 186 /186 variables (removed 0) and now considering 138/138 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 138/138 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1554 steps, run visited all 1 properties in 13 ms. (steps per millisecond=119 )
Probabilistic random walk after 1554 steps, saw 1439 distinct states, run finished after 13 ms. (steps per millisecond=119 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 p2 p0))), true, (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p2 p0)), (F (AND (NOT p2) p0)), (F (AND (NOT p2) p0 p1)), (F (AND p0 (NOT p1))), (F (AND p2 p0 p1))]
Knowledge based reduction with 9 factoid took 1076 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 4 states, 9 edges and 3 AP.
Stuttering acceptance computed with spot in 116 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Stuttering acceptance computed with spot in 140 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Stuttering acceptance computed with spot in 129 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Product exploration explored 100000 steps with 9 reset in 252 ms.
Product exploration explored 100000 steps with 3 reset in 300 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 137 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (OR (AND p0 p2) (AND p0 p1))]
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 138/138 transitions.
Applied a total of 0 rules in 12 ms. Remains 186 /186 variables (removed 0) and now considering 138/138 (removed 0) transitions.
[2022-05-19 10:21:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:36] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:36] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 138/138 transitions.
Product exploration explored 100000 steps with 5 reset in 277 ms.
Product exploration explored 100000 steps with 3 reset in 313 ms.
Built C files in :
/tmp/ltsmin8362080633651329906
[2022-05-19 10:21:37] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8362080633651329906
Running compilation step : cd /tmp/ltsmin8362080633651329906;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 334 ms.
Running link step : cd /tmp/ltsmin8362080633651329906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8362080633651329906;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17196578485873630742.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 138/138 transitions.
Applied a total of 0 rules in 7 ms. Remains 186 /186 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:52] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:52] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:52] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:21:52] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:21:52] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:21:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 186/186 places, 138/138 transitions.
Built C files in :
/tmp/ltsmin14632470944452544636
[2022-05-19 10:21:53] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14632470944452544636
Running compilation step : cd /tmp/ltsmin14632470944452544636;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 241 ms.
Running link step : cd /tmp/ltsmin14632470944452544636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin14632470944452544636;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6050663623176837550.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 10:22:08] [INFO ] Flatten gal took : 13 ms
[2022-05-19 10:22:08] [INFO ] Flatten gal took : 12 ms
[2022-05-19 10:22:08] [INFO ] Time to serialize gal into /tmp/LTL11747478320692522303.gal : 3 ms
[2022-05-19 10:22:08] [INFO ] Time to serialize properties into /tmp/LTL17904929070337719381.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11747478320692522303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17904929070337719381.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1174747...268
Read 1 LTL properties
Checking formula 0 : !((!(("(((p49==1)&&(p53==1))&&(p59==1))")U(G((F((X("(((p49==1)&&(p53==1))&&(p59==1))"))U(X((G("(((p49==1)&&(p53==1))&&(p59==1))"))&&("...198
Formula 0 simplified : "(((p49==1)&&(p53==1))&&(p59==1))" U G("((p7==1)&&(p9==1))" | F(X"(((p49==1)&&(p53==1))&&(p59==1))" U X("(p35==1)" & G"(((p49==1)&&(...178
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
8 unique states visited
5 strongly connected components in search stack
9 transitions explored
7 items max in DFS search stack
71 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,0.747197,43816,1,0,49,130630,49,17,4751,155373,121
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ShieldIIPt-PT-010A-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property ShieldIIPt-PT-010A-LTLFireability-09 finished in 39817 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(!G(p0))) U !X((F(p1)||X(p0))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:22:09] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:22:09] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:22:09] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:22:09] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:22:09] [INFO ] Computed 91 place invariants in 0 ms
[2022-05-19 10:22:09] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR p0 p1), (OR p0 p1), p1, p0]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s191 1), p0:(AND (EQ s31 1) (EQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10628 reset in 258 ms.
Stack based approach found an accepted trace after 7 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-10 finished in 754 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 193 transition count 141
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 192 transition count 141
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 140
Applied a total of 4 rules in 14 ms. Remains 191 /193 variables (removed 2) and now considering 140/142 (removed 2) transitions.
// Phase 1: matrix 140 rows 191 cols
[2022-05-19 10:22:09] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:22:09] [INFO ] Implicit Places using invariants in 95 ms returned [183, 184]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 96 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 189/193 places, 140/142 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 189 transition count 139
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 188 transition count 139
Applied a total of 2 rules in 6 ms. Remains 188 /189 variables (removed 1) and now considering 139/140 (removed 1) transitions.
// Phase 1: matrix 139 rows 188 cols
[2022-05-19 10:22:09] [INFO ] Computed 89 place invariants in 0 ms
[2022-05-19 10:22:10] [INFO ] Implicit Places using invariants in 90 ms returned [177]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 187/193 places, 139/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 138
Applied a total of 2 rules in 7 ms. Remains 186 /187 variables (removed 1) and now considering 138/139 (removed 1) transitions.
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:22:10] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:22:10] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 138 rows 186 cols
[2022-05-19 10:22:10] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:22:10] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 186/193 places, 138/142 transitions.
Finished structural reductions, in 3 iterations. Remains : 186/193 places, 138/142 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s8 1) (EQ s19 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 27 reset in 249 ms.
Stack based approach found an accepted trace after 165 steps with 1 reset with depth 33 and stack size 33 in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-11 finished in 747 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(X(p1))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 142/142 (removed 0) transitions.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:22:10] [INFO ] Computed 91 place invariants in 0 ms
[2022-05-19 10:22:10] [INFO ] Implicit Places using invariants in 99 ms returned []
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:22:10] [INFO ] Computed 91 place invariants in 1 ms
[2022-05-19 10:22:10] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
// Phase 1: matrix 142 rows 193 cols
[2022-05-19 10:22:10] [INFO ] Computed 91 place invariants in 0 ms
[2022-05-19 10:22:10] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 193/193 places, 142/142 transitions.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s107 1) (EQ s132 1)), p1:(AND (EQ s126 1) (EQ s151 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-12 finished in 467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F((F(p0)&&((p1 U p2)||p3)))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 192 transition count 140
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 190 transition count 140
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 188 transition count 139
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 188 transition count 138
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 187 transition count 138
Applied a total of 8 rules in 15 ms. Remains 187 /193 variables (removed 6) and now considering 138/142 (removed 4) transitions.
// Phase 1: matrix 138 rows 187 cols
[2022-05-19 10:22:11] [INFO ] Computed 89 place invariants in 1 ms
[2022-05-19 10:22:11] [INFO ] Implicit Places using invariants in 93 ms returned [176]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 93 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 186/193 places, 138/142 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 185 transition count 137
Applied a total of 2 rules in 5 ms. Remains 185 /186 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 185 cols
[2022-05-19 10:22:11] [INFO ] Computed 88 place invariants in 1 ms
[2022-05-19 10:22:11] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 137 rows 185 cols
[2022-05-19 10:22:11] [INFO ] Computed 88 place invariants in 0 ms
[2022-05-19 10:22:11] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 185/193 places, 137/142 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/193 places, 137/142 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p0) (NOT p2)), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0)]
Running random walk in product with property : ShieldIIPt-PT-010A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p3 (NOT p2) p1), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p0) p3 (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p3:(EQ s19 1), p2:(EQ s127 1), p1:(OR (EQ s167 1) (NEQ s127 1)), p0:(EQ s167 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 460 reset in 293 ms.
Stack based approach found an accepted trace after 114 steps with 1 reset with depth 3 and stack size 3 in 1 ms.
FORMULA ShieldIIPt-PT-010A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldIIPt-PT-010A-LTLFireability-13 finished in 773 ms.
All properties solved by simple procedures.
Total runtime 49964 ms.

BK_STOP 1652955732529

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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