Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r423-tajo-167905976500252.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldRVt-PT-005B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976500252
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 23:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 23:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 147K Feb 25 23:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 23:06 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 23:06 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 60K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679244894290

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-005B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:54:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:54:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:54:56] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-19 16:54:56] [INFO ] Transformed 253 places.
[2023-03-19 16:54:56] [INFO ] Transformed 253 transitions.
[2023-03-19 16:54:56] [INFO ] Found NUPN structural information;
[2023-03-19 16:54:56] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 110 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ShieldRVt-PT-005B-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 253 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 253/253 places, 253/253 transitions.
Discarding 47 places :
Symmetric choice reduction at 0 with 47 rule applications. Total rules 47 place count 206 transition count 206
Iterating global reduction 0 with 47 rules applied. Total rules applied 94 place count 206 transition count 206
Applied a total of 94 rules in 35 ms. Remains 206 /253 variables (removed 47) and now considering 206/253 (removed 47) transitions.
// Phase 1: matrix 206 rows 206 cols
[2023-03-19 16:54:56] [INFO ] Computed 21 place invariants in 10 ms
[2023-03-19 16:54:56] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-19 16:54:56] [INFO ] Invariant cache hit.
[2023-03-19 16:54:56] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 349 ms to find 0 implicit places.
[2023-03-19 16:54:56] [INFO ] Invariant cache hit.
[2023-03-19 16:54:56] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 206/253 places, 206/253 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 515 ms. Remains : 206/253 places, 206/253 transitions.
Support contains 32 out of 206 places after structural reductions.
[2023-03-19 16:54:56] [INFO ] Flatten gal took : 29 ms
[2023-03-19 16:54:56] [INFO ] Flatten gal took : 13 ms
[2023-03-19 16:54:57] [INFO ] Input system was already deterministic with 206 transitions.
Finished random walk after 1784 steps, including 0 resets, run visited all 29 properties in 88 ms. (steps per millisecond=20 )
Computed a total of 64 stabilizing places and 64 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1) U p2))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 205 transition count 150
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 150 transition count 148
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 114 place count 149 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 115 place count 148 transition count 147
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 36 Pre rules applied. Total rules applied 115 place count 148 transition count 111
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 4 with 72 rules applied. Total rules applied 187 place count 112 transition count 111
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 194 place count 105 transition count 104
Iterating global reduction 4 with 7 rules applied. Total rules applied 201 place count 105 transition count 104
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 201 place count 105 transition count 100
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 101 transition count 100
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 287 place count 62 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 313 place count 49 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 47 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 46 transition count 71
Applied a total of 316 rules in 45 ms. Remains 46 /206 variables (removed 160) and now considering 71/206 (removed 135) transitions.
// Phase 1: matrix 71 rows 46 cols
[2023-03-19 16:54:57] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-19 16:54:57] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 16:54:57] [INFO ] Invariant cache hit.
[2023-03-19 16:54:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-19 16:54:57] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-19 16:54:57] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:54:57] [INFO ] Invariant cache hit.
[2023-03-19 16:54:57] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/206 places, 71/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 46/206 places, 71/206 transitions.
Stuttering acceptance computed with spot in 316 ms :[(NOT p2), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(EQ s43 1), p1:(EQ s7 1), p0:(EQ s41 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 21250 reset in 323 ms.
Stack based approach found an accepted trace after 2920 steps with 625 reset with depth 5 and stack size 5 in 7 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-00 finished in 910 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 205 transition count 146
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 146 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 145 transition count 144
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 121 place count 145 transition count 110
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 189 place count 111 transition count 110
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 196 place count 104 transition count 103
Iterating global reduction 3 with 7 rules applied. Total rules applied 203 place count 104 transition count 103
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 203 place count 104 transition count 99
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 211 place count 100 transition count 99
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 291 place count 60 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 319 place count 46 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 44 transition count 70
Applied a total of 321 rules in 53 ms. Remains 44 /206 variables (removed 162) and now considering 70/206 (removed 136) transitions.
// Phase 1: matrix 70 rows 44 cols
[2023-03-19 16:54:58] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:54:58] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 16:54:58] [INFO ] Invariant cache hit.
[2023-03-19 16:54:58] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 16:54:58] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-19 16:54:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:54:58] [INFO ] Invariant cache hit.
[2023-03-19 16:54:58] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/206 places, 70/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 44/206 places, 70/206 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s22 1), p1:(EQ s37 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-01 finished in 401 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 205 transition count 146
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 146 transition count 144
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 122 place count 145 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 123 place count 144 transition count 143
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 123 place count 144 transition count 108
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 193 place count 109 transition count 108
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 201 place count 101 transition count 100
Iterating global reduction 4 with 8 rules applied. Total rules applied 209 place count 101 transition count 100
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 209 place count 101 transition count 95
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 219 place count 96 transition count 95
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 293 place count 59 transition count 58
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 321 place count 45 transition count 71
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 43 transition count 69
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 324 place count 42 transition count 69
Applied a total of 324 rules in 26 ms. Remains 42 /206 variables (removed 164) and now considering 69/206 (removed 137) transitions.
// Phase 1: matrix 69 rows 42 cols
[2023-03-19 16:54:58] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-19 16:54:58] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 16:54:58] [INFO ] Invariant cache hit.
[2023-03-19 16:54:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 16:54:58] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-19 16:54:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:54:58] [INFO ] Invariant cache hit.
[2023-03-19 16:54:59] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/206 places, 69/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 226 ms. Remains : 42/206 places, 69/206 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-03 finished in 277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p2)||X(G(p3))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 199 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 199 transition count 199
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 198 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 198 transition count 198
Applied a total of 16 rules in 15 ms. Remains 198 /206 variables (removed 8) and now considering 198/206 (removed 8) transitions.
// Phase 1: matrix 198 rows 198 cols
[2023-03-19 16:54:59] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-19 16:54:59] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-19 16:54:59] [INFO ] Invariant cache hit.
[2023-03-19 16:54:59] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-19 16:54:59] [INFO ] Invariant cache hit.
[2023-03-19 16:54:59] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 198/206 places, 198/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 310 ms. Remains : 198/206 places, 198/206 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s125 1), p0:(EQ s99 1), p1:(NEQ s138 1), p3:(EQ s138 0)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 6558 reset in 254 ms.
Product exploration explored 100000 steps with 6535 reset in 254 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/198 stabilizing places and 58/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 894 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:55:01] [INFO ] Invariant cache hit.
[2023-03-19 16:55:01] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p3))), (G (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (NOT (AND (NOT p2) p3))), (F (NOT p1)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 19 factoid took 1199 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 295 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2023-03-19 16:55:03] [INFO ] Invariant cache hit.
[2023-03-19 16:55:03] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-19 16:55:03] [INFO ] Invariant cache hit.
[2023-03-19 16:55:03] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-19 16:55:03] [INFO ] Invariant cache hit.
[2023-03-19 16:55:03] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 198/198 places, 198/198 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/198 stabilizing places and 58/198 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p3))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 465 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Finished random walk after 180 steps, including 0 resets, run visited all 5 properties in 13 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (AND (NOT p2) p3))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT p1)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 10 factoid took 697 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 232 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 6550 reset in 201 ms.
Product exploration explored 100000 steps with 6503 reset in 255 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 226 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 198 transition count 198
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 53 place count 198 transition count 218
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 72 place count 198 transition count 218
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 134 places in 0 ms
Iterating global reduction 1 with 62 rules applied. Total rules applied 134 place count 198 transition count 220
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 135 place count 198 transition count 219
Discarding 43 places :
Symmetric choice reduction at 2 with 43 rule applications. Total rules 178 place count 155 transition count 174
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 43 rules applied. Total rules applied 221 place count 155 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 222 place count 155 transition count 174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 224 place count 153 transition count 172
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 226 place count 153 transition count 172
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -128
Deduced a syphon composed of 107 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 243 place count 153 transition count 300
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 260 place count 136 transition count 266
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 2 with 17 rules applied. Total rules applied 277 place count 136 transition count 266
Deduced a syphon composed of 90 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 280 place count 136 transition count 263
Deduced a syphon composed of 90 places in 0 ms
Applied a total of 280 rules in 70 ms. Remains 136 /198 variables (removed 62) and now considering 263/198 (removed -65) transitions.
[2023-03-19 16:55:07] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 263 rows 136 cols
[2023-03-19 16:55:07] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-19 16:55:07] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 136/198 places, 263/198 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 219 ms. Remains : 136/198 places, 263/198 transitions.
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 198/198 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 198 cols
[2023-03-19 16:55:07] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 16:55:07] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-19 16:55:07] [INFO ] Invariant cache hit.
[2023-03-19 16:55:07] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2023-03-19 16:55:07] [INFO ] Invariant cache hit.
[2023-03-19 16:55:07] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 198/198 places, 198/198 transitions.
Treatment of property ShieldRVt-PT-005B-LTLFireability-04 finished in 8553 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p0)||(p0&&G(!p1)))) U (p2 U p3)))'
Support contains 6 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 205 transition count 146
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 146 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 145 transition count 144
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 121 place count 145 transition count 112
Deduced a syphon composed of 32 places in 1 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 185 place count 113 transition count 112
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 193 place count 105 transition count 104
Iterating global reduction 3 with 8 rules applied. Total rules applied 201 place count 105 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 201 place count 105 transition count 99
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 211 place count 100 transition count 99
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 283 place count 64 transition count 63
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 311 place count 50 transition count 76
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 313 place count 48 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 47 transition count 74
Applied a total of 314 rules in 29 ms. Remains 47 /206 variables (removed 159) and now considering 74/206 (removed 132) transitions.
// Phase 1: matrix 74 rows 47 cols
[2023-03-19 16:55:07] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-19 16:55:07] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 16:55:07] [INFO ] Invariant cache hit.
[2023-03-19 16:55:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 16:55:07] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2023-03-19 16:55:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:55:07] [INFO ] Invariant cache hit.
[2023-03-19 16:55:07] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/206 places, 74/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 47/206 places, 74/206 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p3), true, (NOT p3), (NOT p0), (AND (NOT p0) p1), p1]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={0} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 1}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p3:(AND (EQ s12 1) (EQ s22 1) (EQ s30 1)), p0:(NEQ s32 1), p2:(EQ s25 1), p1:(OR (AND (EQ s1 1) (EQ s32 1)) (AND (EQ s12 1) (EQ s22 1) (EQ s30 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-05 finished in 502 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(p1&&F(p2))))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 57 transitions
Trivial Post-agglo rules discarded 57 transitions
Performed 57 trivial Post agglomeration. Transition count delta: 57
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 205 transition count 148
Reduce places removed 57 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 59 rules applied. Total rules applied 116 place count 148 transition count 146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 117 place count 147 transition count 146
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 117 place count 147 transition count 112
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 185 place count 113 transition count 112
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 192 place count 106 transition count 105
Iterating global reduction 3 with 7 rules applied. Total rules applied 199 place count 106 transition count 105
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 199 place count 106 transition count 101
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 207 place count 102 transition count 101
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 287 place count 62 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 313 place count 49 transition count 72
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 314 place count 49 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 316 place count 47 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 317 place count 46 transition count 70
Applied a total of 317 rules in 39 ms. Remains 46 /206 variables (removed 160) and now considering 70/206 (removed 136) transitions.
// Phase 1: matrix 70 rows 46 cols
[2023-03-19 16:55:08] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-19 16:55:08] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 16:55:08] [INFO ] Invariant cache hit.
[2023-03-19 16:55:08] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-19 16:55:08] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
[2023-03-19 16:55:08] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:55:08] [INFO ] Invariant cache hit.
[2023-03-19 16:55:08] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/206 places, 70/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 251 ms. Remains : 46/206 places, 70/206 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s38 0) (EQ s29 0)), p2:(EQ s45 1), p1:(EQ s29 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 1083 steps with 5 reset in 17 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-06 finished in 445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1||X(F(p2)))))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 197
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 197
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 196 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 196 transition count 196
Applied a total of 20 rules in 11 ms. Remains 196 /206 variables (removed 10) and now considering 196/206 (removed 10) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-19 16:55:08] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 16:55:08] [INFO ] Implicit Places using invariants in 93 ms returned []
[2023-03-19 16:55:08] [INFO ] Invariant cache hit.
[2023-03-19 16:55:08] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-19 16:55:08] [INFO ] Invariant cache hit.
[2023-03-19 16:55:08] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 196/206 places, 196/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 196/206 places, 196/206 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s81 1), p0:(NEQ s178 1), p2:(EQ s142 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][false, false, false, false]]
Product exploration explored 100000 steps with 3140 reset in 271 ms.
Product exploration explored 100000 steps with 3070 reset in 242 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/196 stabilizing places and 58/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 514 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 45 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2)]
Knowledge based reduction with 11 factoid took 577 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-19 16:55:11] [INFO ] Invariant cache hit.
[2023-03-19 16:55:11] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-19 16:55:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:55:11] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2023-03-19 16:55:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:55:11] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-19 16:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:55:11] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2023-03-19 16:55:11] [INFO ] Computed and/alt/rep : 195/286/195 causal constraints (skipped 0 transitions) in 22 ms.
[2023-03-19 16:55:12] [INFO ] Added : 195 causal constraints over 39 iterations in 674 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2023-03-19 16:55:12] [INFO ] Invariant cache hit.
[2023-03-19 16:55:12] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 16:55:12] [INFO ] Invariant cache hit.
[2023-03-19 16:55:12] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-19 16:55:12] [INFO ] Invariant cache hit.
[2023-03-19 16:55:12] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 196/196 places, 196/196 transitions.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Detected a total of 58/196 stabilizing places and 58/196 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 446 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 55 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (AND (NOT p2) (NOT p1))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F p2)]
Knowledge based reduction with 11 factoid took 660 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2023-03-19 16:55:14] [INFO ] Invariant cache hit.
[2023-03-19 16:55:14] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-19 16:55:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:55:14] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2023-03-19 16:55:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:55:14] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned sat
[2023-03-19 16:55:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:55:15] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2023-03-19 16:55:15] [INFO ] Computed and/alt/rep : 195/286/195 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-19 16:55:15] [INFO ] Added : 195 causal constraints over 39 iterations in 562 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 3059 reset in 173 ms.
Product exploration explored 100000 steps with 3109 reset in 268 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 159 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 196 transition count 196
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 21 Pre rules applied. Total rules applied 51 place count 196 transition count 216
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 72 place count 196 transition count 216
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 129 places in 0 ms
Iterating global reduction 1 with 57 rules applied. Total rules applied 129 place count 196 transition count 216
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 130 place count 196 transition count 215
Discarding 37 places :
Symmetric choice reduction at 2 with 37 rule applications. Total rules 167 place count 159 transition count 178
Deduced a syphon composed of 92 places in 0 ms
Iterating global reduction 2 with 37 rules applied. Total rules applied 204 place count 159 transition count 178
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 205 place count 159 transition count 178
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 207 place count 157 transition count 176
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 209 place count 157 transition count 176
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 109 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 227 place count 157 transition count 299
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 245 place count 139 transition count 263
Deduced a syphon composed of 91 places in 0 ms
Iterating global reduction 2 with 18 rules applied. Total rules applied 263 place count 139 transition count 263
Deduced a syphon composed of 91 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 266 place count 139 transition count 260
Deduced a syphon composed of 91 places in 0 ms
Applied a total of 266 rules in 37 ms. Remains 139 /196 variables (removed 57) and now considering 260/196 (removed -64) transitions.
[2023-03-19 16:55:16] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 260 rows 139 cols
[2023-03-19 16:55:16] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-19 16:55:16] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 139/196 places, 260/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 175 ms. Remains : 139/196 places, 260/196 transitions.
Support contains 3 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 196 /196 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 196 cols
[2023-03-19 16:55:16] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:55:16] [INFO ] Implicit Places using invariants in 61 ms returned []
[2023-03-19 16:55:16] [INFO ] Invariant cache hit.
[2023-03-19 16:55:16] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-19 16:55:16] [INFO ] Invariant cache hit.
[2023-03-19 16:55:17] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 196/196 places, 196/196 transitions.
Treatment of property ShieldRVt-PT-005B-LTLFireability-08 finished in 8478 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 205 transition count 146
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 146 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 145 transition count 144
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 33 Pre rules applied. Total rules applied 121 place count 145 transition count 111
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 187 place count 112 transition count 111
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 194 place count 105 transition count 104
Iterating global reduction 3 with 7 rules applied. Total rules applied 201 place count 105 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 201 place count 105 transition count 99
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 211 place count 100 transition count 99
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 289 place count 61 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 317 place count 47 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 45 transition count 71
Applied a total of 319 rules in 21 ms. Remains 45 /206 variables (removed 161) and now considering 71/206 (removed 135) transitions.
// Phase 1: matrix 71 rows 45 cols
[2023-03-19 16:55:17] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:55:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 16:55:17] [INFO ] Invariant cache hit.
[2023-03-19 16:55:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 16:55:17] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-19 16:55:17] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:55:17] [INFO ] Invariant cache hit.
[2023-03-19 16:55:17] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/206 places, 71/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 45/206 places, 71/206 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s31 0) (OR (EQ s38 1) (EQ s11 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-09 finished in 219 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 198 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 6 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2023-03-19 16:55:17] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:55:17] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 16:55:17] [INFO ] Invariant cache hit.
[2023-03-19 16:55:17] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
[2023-03-19 16:55:17] [INFO ] Invariant cache hit.
[2023-03-19 16:55:17] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 119 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s93 0), p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Product exploration explored 100000 steps with 50000 reset in 209 ms.
Computed a total of 58 stabilizing places and 58 stable transitions
Computed a total of 58 stabilizing places and 58 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 7 factoid took 145 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-005B-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-005B-LTLFireability-10 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X((p1 U (p2||G(p1)))))) U ((p3&&X((p0||X((p1 U (p2||G(p1)))))))||X(G((p0||X((p1 U (p2||G(p1))))))))))'
Support contains 4 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 199 transition count 199
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 199 transition count 199
Applied a total of 14 rules in 4 ms. Remains 199 /206 variables (removed 7) and now considering 199/206 (removed 7) transitions.
// Phase 1: matrix 199 rows 199 cols
[2023-03-19 16:55:18] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:55:18] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-19 16:55:18] [INFO ] Invariant cache hit.
[2023-03-19 16:55:18] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-19 16:55:18] [INFO ] Invariant cache hit.
[2023-03-19 16:55:18] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 199/206 places, 199/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 199/206 places, 199/206 transitions.
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}, { cond=(NOT p3), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) p0 (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=1, aps=[p0:(NEQ s113 1), p3:(EQ s168 1), p2:(AND (OR (EQ s63 1) (EQ s113 1)) (NEQ s178 1)), p1:(NEQ s178 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33398 reset in 167 ms.
Product exploration explored 100000 steps with 33358 reset in 175 ms.
Computed a total of 61 stabilizing places and 61 stable transitions
Computed a total of 61 stabilizing places and 61 stable transitions
Detected a total of 61/199 stabilizing places and 61/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p3) p0 (NOT p2) p1)), true, (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) p0 (NOT p2) p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1448 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) 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 3) seen :2
Running SMT prover for 1 properties.
[2023-03-19 16:55:21] [INFO ] Invariant cache hit.
[2023-03-19 16:55:21] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) p1), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p1)))), (X (AND (NOT p2) p1)), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p3) p0 (NOT p2) p1)), true, (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1))))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p3) (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p3) p0 (NOT p2) p1))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p3) (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p3) (NOT p0))), (F p3), (F (NOT (AND (NOT p3) p0 p1 (NOT p2)))), (F (AND (NOT p3) (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 23 factoid took 1466 ms. Reduced automaton from 6 states, 14 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 199/199 (removed 0) transitions.
[2023-03-19 16:55:23] [INFO ] Invariant cache hit.
[2023-03-19 16:55:23] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-19 16:55:23] [INFO ] Invariant cache hit.
[2023-03-19 16:55:23] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-19 16:55:23] [INFO ] Invariant cache hit.
[2023-03-19 16:55:23] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 320 ms. Remains : 199/199 places, 199/199 transitions.
Computed a total of 61 stabilizing places and 61 stable transitions
Computed a total of 61 stabilizing places and 61 stable transitions
Detected a total of 61/199 stabilizing places and 61/199 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND p1 p0 (NOT p2) (NOT p3))), true, (X (X (AND p1 (NOT p2)))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p1 p0 (NOT p2) (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 20 factoid took 996 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:55:25] [INFO ] Invariant cache hit.
[2023-03-19 16:55:25] [INFO ] [Real]Absence check using 21 positive place invariants in 6 ms returned sat
[2023-03-19 16:55:25] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:55:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 4 ms returned sat
[2023-03-19 16:55:25] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:55:25] [INFO ] After 93ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-19 16:55:25] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 61 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 3 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (AND p1 (NOT p2))), (X (NOT p3)), (X p0), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (AND p1 p0 (NOT p2) (NOT p3))), true, (X (X (AND p1 (NOT p2)))), (X (X (NOT p3))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p3))))), (X (X (AND p1 p0 (NOT p2) (NOT p3)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND (NOT p3) (NOT p0))), (F p3), (F (AND (NOT p3) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p3) p0 p1 (NOT p2))))]
Knowledge based reduction with 20 factoid took 1368 ms. Reduced automaton from 6 states, 13 edges and 4 AP (stutter sensitive) to 6 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 288 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 33358 reset in 231 ms.
Product exploration explored 100000 steps with 33296 reset in 207 ms.
Applying partial POR strategy [false, false, true, true, false, false]
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (AND (NOT p1) (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2)))]
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 53 place count 199 transition count 199
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 19 Pre rules applied. Total rules applied 53 place count 199 transition count 217
Deduced a syphon composed of 72 places in 0 ms
Iterating global reduction 1 with 19 rules applied. Total rules applied 72 place count 199 transition count 217
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 59 rules applied. Total rules applied 131 place count 199 transition count 217
Discarding 38 places :
Symmetric choice reduction at 1 with 38 rule applications. Total rules 169 place count 161 transition count 179
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 207 place count 161 transition count 179
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -141
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 225 place count 161 transition count 320
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 243 place count 143 transition count 284
Deduced a syphon composed of 93 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 261 place count 143 transition count 284
Deduced a syphon composed of 93 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 264 place count 143 transition count 281
Deduced a syphon composed of 93 places in 0 ms
Applied a total of 264 rules in 47 ms. Remains 143 /199 variables (removed 56) and now considering 281/199 (removed -82) transitions.
[2023-03-19 16:55:28] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 281 rows 143 cols
[2023-03-19 16:55:28] [INFO ] Computed 21 place invariants in 4 ms
[2023-03-19 16:55:28] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/199 places, 281/199 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 143/199 places, 281/199 transitions.
Support contains 4 out of 199 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 199/199 places, 199/199 transitions.
Applied a total of 0 rules in 2 ms. Remains 199 /199 variables (removed 0) and now considering 199/199 (removed 0) transitions.
// Phase 1: matrix 199 rows 199 cols
[2023-03-19 16:55:28] [INFO ] Computed 21 place invariants in 1 ms
[2023-03-19 16:55:28] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-19 16:55:28] [INFO ] Invariant cache hit.
[2023-03-19 16:55:28] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-19 16:55:28] [INFO ] Invariant cache hit.
[2023-03-19 16:55:28] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 327 ms. Remains : 199/199 places, 199/199 transitions.
Treatment of property ShieldRVt-PT-005B-LTLFireability-11 finished in 10746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(p1))))))'
Support contains 2 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 198 transition count 198
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 198 transition count 198
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 197 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 197 transition count 197
Applied a total of 18 rules in 6 ms. Remains 197 /206 variables (removed 9) and now considering 197/206 (removed 9) transitions.
// Phase 1: matrix 197 rows 197 cols
[2023-03-19 16:55:29] [INFO ] Computed 21 place invariants in 3 ms
[2023-03-19 16:55:29] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-19 16:55:29] [INFO ] Invariant cache hit.
[2023-03-19 16:55:29] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-19 16:55:29] [INFO ] Invariant cache hit.
[2023-03-19 16:55:29] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 197/206 places, 197/206 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 197/206 places, 197/206 transitions.
Stuttering acceptance computed with spot in 189 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(EQ s148 1), p0:(EQ s142 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-13 finished in 580 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 205 transition count 146
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 146 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 145 transition count 144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 121 place count 145 transition count 109
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 191 place count 110 transition count 109
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 199 place count 102 transition count 101
Iterating global reduction 3 with 8 rules applied. Total rules applied 207 place count 102 transition count 101
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 207 place count 102 transition count 96
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 217 place count 97 transition count 96
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 295 place count 58 transition count 57
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 321 place count 45 transition count 68
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 323 place count 43 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 324 place count 42 transition count 66
Applied a total of 324 rules in 28 ms. Remains 42 /206 variables (removed 164) and now considering 66/206 (removed 140) transitions.
// Phase 1: matrix 66 rows 42 cols
[2023-03-19 16:55:29] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-19 16:55:29] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 16:55:29] [INFO ] Invariant cache hit.
[2023-03-19 16:55:29] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 16:55:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:55:29] [INFO ] Invariant cache hit.
[2023-03-19 16:55:29] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/206 places, 66/206 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 42/206 places, 66/206 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(NEQ s29 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-005B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-005B-LTLFireability-14 finished in 257 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((p0||F(p1)) U p2)||X(G(p3))))'
Found a Lengthening insensitive property : ShieldRVt-PT-005B-LTLFireability-04
Stuttering acceptance computed with spot in 318 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 205 transition count 146
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 146 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 145 transition count 144
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 121 place count 145 transition count 109
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 191 place count 110 transition count 109
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 197 place count 104 transition count 103
Iterating global reduction 3 with 6 rules applied. Total rules applied 203 place count 104 transition count 103
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 203 place count 104 transition count 98
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 213 place count 99 transition count 98
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 76 rules applied. Total rules applied 289 place count 61 transition count 60
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 317 place count 47 transition count 73
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 319 place count 45 transition count 71
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 320 place count 44 transition count 71
Applied a total of 320 rules in 37 ms. Remains 44 /206 variables (removed 162) and now considering 71/206 (removed 135) transitions.
// Phase 1: matrix 71 rows 44 cols
[2023-03-19 16:55:30] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-19 16:55:30] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-19 16:55:30] [INFO ] Invariant cache hit.
[2023-03-19 16:55:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 16:55:30] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-19 16:55:30] [INFO ] Invariant cache hit.
[2023-03-19 16:55:30] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 44/206 places, 71/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 257 ms. Remains : 44/206 places, 71/206 transitions.
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) p3), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s28 1), p0:(EQ s20 1), p1:(NEQ s31 1), p3:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 27780 reset in 223 ms.
Product exploration explored 100000 steps with 27840 reset in 262 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/44 stabilizing places and 2/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 14 factoid took 869 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:55:32] [INFO ] Invariant cache hit.
[2023-03-19 16:55:32] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1 p3), (X (NOT (AND (NOT p1) p3))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3))), (X (NOT (AND (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) p3)))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) p3))), (G (NOT (AND (NOT p1) (NOT p2) p3 (NOT p0))))]
False Knowledge obtained : [(X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (AND (NOT p1) (NOT p2) (NOT p3) (NOT p0))), (F (NOT (AND (NOT p2) p3))), (F (NOT p1)), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p3))), (F p2), (F (AND (NOT p1) (NOT p2) (NOT p0)))]
Knowledge based reduction with 16 factoid took 956 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 176 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 71/71 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-19 16:55:33] [INFO ] Invariant cache hit.
[2023-03-19 16:55:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-19 16:55:33] [INFO ] Invariant cache hit.
[2023-03-19 16:55:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 16:55:33] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-19 16:55:33] [INFO ] Invariant cache hit.
[2023-03-19 16:55:33] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 44/44 places, 71/71 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Detected a total of 2/44 stabilizing places and 2/71 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 452 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Finished random walk after 90 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=45 )
Knowledge obtained : [(AND (NOT p2) p3 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X p1)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (AND (NOT p2) p3)), (X (NOT (AND (NOT p2) p3))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F p2), (F (NOT p1)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p2) (NOT p0) (NOT p1)))]
Knowledge based reduction with 7 factoid took 574 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 4 states, 7 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 27944 reset in 195 ms.
Product exploration explored 100000 steps with 27819 reset in 182 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (NOT p1), (NOT p2)]
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 71/71 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-19 16:55:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:55:36] [INFO ] Invariant cache hit.
[2023-03-19 16:55:36] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 44/44 places, 71/71 transitions.
Support contains 3 out of 44 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 44/44 places, 71/71 transitions.
Applied a total of 0 rules in 0 ms. Remains 44 /44 variables (removed 0) and now considering 71/71 (removed 0) transitions.
[2023-03-19 16:55:36] [INFO ] Invariant cache hit.
[2023-03-19 16:55:36] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 16:55:36] [INFO ] Invariant cache hit.
[2023-03-19 16:55:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-19 16:55:36] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-19 16:55:36] [INFO ] Invariant cache hit.
[2023-03-19 16:55:36] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 44/44 places, 71/71 transitions.
Treatment of property ShieldRVt-PT-005B-LTLFireability-04 finished in 6832 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U (p1||X(F(p2)))))'
Found a Shortening insensitive property : ShieldRVt-PT-005B-LTLFireability-08
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 3 out of 206 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 206/206 places, 206/206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 205 transition count 150
Reduce places removed 55 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 112 place count 150 transition count 148
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 115 place count 149 transition count 146
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 117 place count 147 transition count 146
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 35 Pre rules applied. Total rules applied 117 place count 147 transition count 111
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 187 place count 112 transition count 111
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 194 place count 105 transition count 104
Iterating global reduction 4 with 7 rules applied. Total rules applied 201 place count 105 transition count 104
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 201 place count 105 transition count 99
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 211 place count 100 transition count 99
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 287 place count 62 transition count 61
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 313 place count 49 transition count 72
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 315 place count 47 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 316 place count 46 transition count 70
Applied a total of 316 rules in 26 ms. Remains 46 /206 variables (removed 160) and now considering 70/206 (removed 136) transitions.
// Phase 1: matrix 70 rows 46 cols
[2023-03-19 16:55:36] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-19 16:55:37] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-19 16:55:37] [INFO ] Invariant cache hit.
[2023-03-19 16:55:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-19 16:55:37] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-19 16:55:37] [INFO ] Invariant cache hit.
[2023-03-19 16:55:37] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 46/206 places, 70/206 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 233 ms. Remains : 46/206 places, 70/206 transitions.
Running random walk in product with property : ShieldRVt-PT-005B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s19 1), p0:(NEQ s41 1), p2:(EQ s33 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
Treatment of property ShieldRVt-PT-005B-LTLFireability-08 finished in 519 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||X((p1 U (p2||G(p1)))))) U ((p3&&X((p0||X((p1 U (p2||G(p1)))))))||X(G((p0||X((p1 U (p2||G(p1))))))))))'
[2023-03-19 16:55:37] [INFO ] Flatten gal took : 12 ms
[2023-03-19 16:55:37] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 16:55:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 206 places, 206 transitions and 502 arcs took 2 ms.
Total runtime 41318 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-005B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

FORMULA ShieldRVt-PT-005B-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679245007826

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVt-PT-005B-LTLFireability-04
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1200 6/32 ShieldRVt-PT-005B-LTLFireability-04 725280 m, 145056 m/sec, 3385633 t fired, .

Time elapsed: 5 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1200 12/32 ShieldRVt-PT-005B-LTLFireability-04 1460318 m, 147007 m/sec, 7152533 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1200 17/32 ShieldRVt-PT-005B-LTLFireability-04 2128185 m, 133573 m/sec, 10470294 t fired, .

Time elapsed: 15 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1200 21/32 ShieldRVt-PT-005B-LTLFireability-04 2760574 m, 126477 m/sec, 13989772 t fired, .

Time elapsed: 20 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1200 25/32 ShieldRVt-PT-005B-LTLFireability-04 3336299 m, 115145 m/sec, 17337208 t fired, .

Time elapsed: 25 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1200 29/32 ShieldRVt-PT-005B-LTLFireability-04 3969694 m, 126679 m/sec, 20864791 t fired, .

Time elapsed: 30 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for ShieldRVt-PT-005B-LTLFireability-04 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVt-PT-005B-LTLFireability-11: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldRVt-PT-005B-LTLFireability-11
lola: time limit : 1782 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for ShieldRVt-PT-005B-LTLFireability-11
lola: result : false
lola: markings : 155
lola: fired transitions : 156
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVt-PT-005B-LTLFireability-08
lola: time limit : 3565 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3565 6/32 ShieldRVt-PT-005B-LTLFireability-08 805579 m, 161115 m/sec, 2883574 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3565 11/32 ShieldRVt-PT-005B-LTLFireability-08 1546246 m, 148133 m/sec, 5735799 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3565 16/32 ShieldRVt-PT-005B-LTLFireability-08 2208965 m, 132543 m/sec, 8457289 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3565 21/32 ShieldRVt-PT-005B-LTLFireability-08 2905394 m, 139285 m/sec, 11267389 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3565 25/32 ShieldRVt-PT-005B-LTLFireability-08 3520871 m, 123095 m/sec, 13959939 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3565 29/32 ShieldRVt-PT-005B-LTLFireability-08 4121293 m, 120084 m/sec, 16694527 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 4 (type EXCL) for ShieldRVt-PT-005B-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVt-PT-005B-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
ShieldRVt-PT-005B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-LTLFireability-04: LTL unknown AGGR
ShieldRVt-PT-005B-LTLFireability-08: LTL unknown AGGR
ShieldRVt-PT-005B-LTLFireability-11: LTL false LTL model checker


Time elapsed: 70 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-005B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldRVt-PT-005B, 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 r423-tajo-167905976500252"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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