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-167905976400220.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-003B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r423-tajo-167905976400220
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.5K Feb 25 22:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 25 22:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 22:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 22:49 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.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 22:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 22:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 22:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 22:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 36K 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-003B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679244387275

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-003B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:46:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:46:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:46:28] [INFO ] Load time of PNML (sax parser for PT used): 34 ms
[2023-03-19 16:46:28] [INFO ] Transformed 153 places.
[2023-03-19 16:46:28] [INFO ] Transformed 153 transitions.
[2023-03-19 16:46:28] [INFO ] Found NUPN structural information;
[2023-03-19 16:46:28] [INFO ] Parsed PT model containing 153 places and 153 transitions and 360 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVt-PT-003B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 153/153 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 129 transition count 129
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 129 transition count 129
Applied a total of 48 rules in 19 ms. Remains 129 /153 variables (removed 24) and now considering 129/153 (removed 24) transitions.
// Phase 1: matrix 129 rows 129 cols
[2023-03-19 16:46:29] [INFO ] Computed 13 place invariants in 18 ms
[2023-03-19 16:46:29] [INFO ] Implicit Places using invariants in 166 ms returned []
[2023-03-19 16:46:29] [INFO ] Invariant cache hit.
[2023-03-19 16:46:29] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2023-03-19 16:46:29] [INFO ] Invariant cache hit.
[2023-03-19 16:46:29] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/153 places, 129/153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 407 ms. Remains : 129/153 places, 129/153 transitions.
Support contains 37 out of 129 places after structural reductions.
[2023-03-19 16:46:29] [INFO ] Flatten gal took : 29 ms
[2023-03-19 16:46:29] [INFO ] Flatten gal took : 10 ms
[2023-03-19 16:46:29] [INFO ] Input system was already deterministic with 129 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 35) seen :34
Finished Best-First random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
FORMULA ShieldRVt-PT-003B-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 39 stabilizing places and 39 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(G((F(p0) U p1))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 128 transition count 93
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 92 transition count 92
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 72 place count 92 transition count 73
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 110 place count 73 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 68 transition count 68
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 68 transition count 64
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 128 place count 64 transition count 64
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 176 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 177 place count 40 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 179 place count 39 transition count 38
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 193 place count 32 transition count 44
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 194 place count 32 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 195 place count 31 transition count 43
Applied a total of 195 rules in 29 ms. Remains 31 /129 variables (removed 98) and now considering 43/129 (removed 86) transitions.
// Phase 1: matrix 43 rows 31 cols
[2023-03-19 16:46:30] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:46:30] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 16:46:30] [INFO ] Invariant cache hit.
[2023-03-19 16:46:30] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-19 16:46:30] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 16:46:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:46:30] [INFO ] Invariant cache hit.
[2023-03-19 16:46:30] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/129 places, 43/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 172 ms. Remains : 31/129 places, 43/129 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s28 1) (EQ s12 1)), p0:(EQ s21 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 1294 steps with 0 reset in 11 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-00 finished in 481 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(F((p0||G(F(p0))||(p1&&F(p2))))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Applied a total of 20 rules in 21 ms. Remains 119 /129 variables (removed 10) and now considering 119/129 (removed 10) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-19 16:46:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:46:30] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 16:46:30] [INFO ] Invariant cache hit.
[2023-03-19 16:46:30] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-19 16:46:30] [INFO ] Invariant cache hit.
[2023-03-19 16:46:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 119/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 119/129 places, 119/129 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s15 0), p2:(AND (EQ s20 0) (EQ s15 0)), p1:(EQ s20 0)], 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 190 ms.
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-003B-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-01 finished in 821 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(F(p0)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 16 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-19 16:46:31] [INFO ] Computed 13 place invariants in 4 ms
[2023-03-19 16:46:31] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:46:31] [INFO ] Invariant cache hit.
[2023-03-19 16:46:31] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-19 16:46:31] [INFO ] Invariant cache hit.
[2023-03-19 16:46:31] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 246 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s106 0)], 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-003B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-003B-LTLFireability-02 finished in 741 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(((F(p0) U p1)&&X(X((p2&&F(!p1)))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 7 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
[2023-03-19 16:46:32] [INFO ] Invariant cache hit.
[2023-03-19 16:46:32] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 16:46:32] [INFO ] Invariant cache hit.
[2023-03-19 16:46:32] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2023-03-19 16:46:32] [INFO ] Invariant cache hit.
[2023-03-19 16:46:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 484 ms :[true, (NOT p0), (NOT p1), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p1) (NOT p2)), (OR (NOT p2) p1), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND p1 (NOT p0)), p1]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(NOT p1), acceptance={} source=3 dest: 6}, { cond=true, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={} source=7 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=8 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=9 dest: 9}], [{ cond=p1, acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(NEQ s78 1), p0:(EQ s9 1), p2:(EQ s32 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 516 reset in 103 ms.
Stack based approach found an accepted trace after 909 steps with 5 reset with depth 183 and stack size 183 in 2 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-03 finished in 829 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)&&F(G(p1)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 128 transition count 92
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 74 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 76 place count 90 transition count 90
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 76 place count 90 transition count 73
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 110 place count 73 transition count 73
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 115 place count 68 transition count 68
Iterating global reduction 3 with 5 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 120 place count 68 transition count 64
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 128 place count 64 transition count 64
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 178 place count 39 transition count 39
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 179 place count 39 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 181 place count 38 transition count 37
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 195 place count 31 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 29 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 198 place count 28 transition count 40
Applied a total of 198 rules in 15 ms. Remains 28 /129 variables (removed 101) and now considering 40/129 (removed 89) transitions.
// Phase 1: matrix 40 rows 28 cols
[2023-03-19 16:46:33] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-19 16:46:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:33] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 28/129 places, 40/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 28/129 places, 40/129 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s5 0), p1:(AND (OR (EQ s19 0) (EQ s5 0)) (EQ s19 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 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-04 finished in 245 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)))'
Support contains 5 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 128 transition count 95
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 95 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 94 transition count 94
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 68 place count 94 transition count 74
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 108 place count 74 transition count 74
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 113 place count 69 transition count 69
Iterating global reduction 3 with 5 rules applied. Total rules applied 118 place count 69 transition count 69
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 118 place count 69 transition count 66
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 124 place count 66 transition count 66
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 174 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 175 place count 41 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 177 place count 40 transition count 39
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 191 place count 33 transition count 44
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 193 place count 31 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 194 place count 30 transition count 42
Applied a total of 194 rules in 12 ms. Remains 30 /129 variables (removed 99) and now considering 42/129 (removed 87) transitions.
// Phase 1: matrix 42 rows 30 cols
[2023-03-19 16:46:33] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-19 16:46:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:33] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/129 places, 42/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 108 ms. Remains : 30/129 places, 42/129 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s12 1) (EQ s6 1) (AND (EQ s1 1) (EQ s5 1) (EQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-05 finished in 186 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 G((p2&&X(!p1)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 128 transition count 93
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 93 transition count 92
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 92 transition count 92
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 72 place count 92 transition count 74
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 108 place count 74 transition count 74
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 112 place count 70 transition count 70
Iterating global reduction 3 with 4 rules applied. Total rules applied 116 place count 70 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 116 place count 70 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 122 place count 67 transition count 67
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 176 place count 40 transition count 40
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 192 place count 32 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 194 place count 30 transition count 45
Applied a total of 194 rules in 11 ms. Remains 30 /129 variables (removed 99) and now considering 45/129 (removed 84) transitions.
// Phase 1: matrix 45 rows 30 cols
[2023-03-19 16:46:33] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-19 16:46:33] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:33] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/129 places, 45/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 30/129 places, 45/129 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p2) p1), (NOT p1), p1, (AND (NOT p1) (NOT p2) p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(EQ s16 1), p0:(EQ s20 1), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-06 finished in 302 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((F(p0)||(F(p1)&&G(F(p2))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 4 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-19 16:46:33] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:46:33] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 16:46:33] [INFO ] Invariant cache hit.
[2023-03-19 16:46:34] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2023-03-19 16:46:34] [INFO ] Invariant cache hit.
[2023-03-19 16:46:34] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s73 1) (EQ s101 1)), p1:(EQ s73 1), p2:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1891 reset in 165 ms.
Stack based approach found an accepted trace after 357 steps with 6 reset with depth 81 and stack size 81 in 4 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-08 finished in 557 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&&G(p1)) U X(X(G(!p0)))))'
Support contains 2 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Applied a total of 18 rules in 4 ms. Remains 120 /129 variables (removed 9) and now considering 120/129 (removed 9) transitions.
// Phase 1: matrix 120 rows 120 cols
[2023-03-19 16:46:34] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:46:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:46:34] [INFO ] Invariant cache hit.
[2023-03-19 16:46:34] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-19 16:46:34] [INFO ] Invariant cache hit.
[2023-03-19 16:46:34] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 120/129 places, 120/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 120/129 places, 120/129 transitions.
Stuttering acceptance computed with spot in 303 ms :[p0, (AND (NOT p1) p0), p0, p0, true, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(EQ s35 1), p0:(NEQ s94 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-09 finished in 617 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)||G((p1||(p2 U (G(p2)||(p2&&G(p3))))))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 120 transition count 120
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 118 transition count 118
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 118 transition count 118
Applied a total of 22 rules in 6 ms. Remains 118 /129 variables (removed 11) and now considering 118/129 (removed 11) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-19 16:46:35] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:46:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-19 16:46:35] [INFO ] Invariant cache hit.
[2023-03-19 16:46:35] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2023-03-19 16:46:35] [INFO ] Invariant cache hit.
[2023-03-19 16:46:35] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 118/129 places, 118/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 118/129 places, 118/129 transitions.
Stuttering acceptance computed with spot in 467 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p3 p2 (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p3 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2 (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p1) p3 p2 (NOT p0)), acceptance={} source=5 dest: 7}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 8}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}, { cond=(AND p3 p2), acceptance={} source=6 dest: 7}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=7 dest: 6}, { cond=(AND p3 p2), acceptance={} source=7 dest: 7}, { cond=(AND p1 p3 (NOT p2)), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=8 dest: 7}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p3)), acceptance={} source=9 dest: 0}, { cond=(OR (AND p1 p3) (AND p3 p2)), acceptance={} source=9 dest: 9}]], initial=2, aps=[p0:(EQ s19 1), p1:(EQ s110 0), p2:(NEQ s70 1), p3:(NEQ s110 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 17 reset in 182 ms.
Product exploration explored 100000 steps with 20 reset in 219 ms.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p3 p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (OR (AND p1 p3) (AND p3 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 1080 ms. Reduced automaton from 10 states, 30 edges and 4 AP (stutter sensitive) to 6 states, 15 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[true, (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 11) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
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 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:46:37] [INFO ] Invariant cache hit.
[2023-03-19 16:46:37] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-03-19 16:46:37] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 16:46:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:46:37] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-19 16:46:38] [INFO ] Deduced a trap composed of 27 places in 41 ms of which 4 ms to minimize.
[2023-03-19 16:46:38] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2023-03-19 16:46:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2023-03-19 16:46:38] [INFO ] After 170ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 16:46:38] [INFO ] After 242ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 118/118 places, 118/118 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 118 transition count 89
Reduce places removed 29 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 89 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 88 transition count 88
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 60 place count 88 transition count 63
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 110 place count 63 transition count 63
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 160 place count 38 transition count 38
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 161 place count 38 transition count 37
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 163 place count 37 transition count 36
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 30 transition count 41
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 178 place count 30 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 179 place count 29 transition count 39
Applied a total of 179 rules in 15 ms. Remains 29 /118 variables (removed 89) and now considering 39/118 (removed 79) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 29/118 places, 39/118 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Probably explored full state space saw : 8194 states, properties seen :0
Probabilistic random walk after 59396 steps, saw 8194 distinct states, run finished after 144 ms. (steps per millisecond=412 ) properties seen :0
Explored full state space saw : 8194 states, properties seen :0
Exhaustive walk after 59396 steps, saw 8194 distinct states, run finished after 98 ms. (steps per millisecond=606 ) properties seen :0
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2 p3), (X (NOT (AND (NOT p1) p3 p2 (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT p0)), (X (NOT (AND p1 p3 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p3) p2 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (AND p3 p2 (NOT p0))), (X (NOT (AND (NOT p3) p2 (NOT p0)))), (X (NOT (OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p3) (NOT p2) (NOT p0))))), true, (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (OR (AND p1 p3) (AND p3 p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p1 p3 (NOT p2))))), (X (X (AND p3 p2))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (OR (AND (NOT p1) (NOT p2)) (NOT p3))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (G (NOT (AND (NOT p2) (NOT p1)))), (G (NOT (AND p2 p3 (NOT p1)))), (G (NOT (OR (AND (NOT p2) (NOT p3)) (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND p2 (NOT p3) (NOT p1))), (F (NOT p1)), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND p2 (NOT p3))), (F (AND (NOT p2) p3 p1)), (F (NOT (OR (AND p2 p3) (AND p3 p1)))), (F (OR (AND (NOT p2) (NOT p1)) (NOT p3)))]
Knowledge based reduction with 29 factoid took 1159 ms. Reduced automaton from 6 states, 15 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Support contains 2 out of 118 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Applied a total of 0 rules in 0 ms. Remains 118 /118 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-19 16:46:40] [INFO ] Invariant cache hit.
[2023-03-19 16:46:40] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-19 16:46:40] [INFO ] Invariant cache hit.
[2023-03-19 16:46:40] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-19 16:46:40] [INFO ] Invariant cache hit.
[2023-03-19 16:46:40] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 118/118 places, 118/118 transitions.
Computed a total of 34 stabilizing places and 34 stable transitions
Computed a total of 34 stabilizing places and 34 stable transitions
Detected a total of 34/118 stabilizing places and 34/118 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p2 p3 p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (OR p3 p1)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (OR p3 p1))), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 443 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Finished random walk after 117 steps, including 0 resets, run visited all 7 properties in 1 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p2 p3 p1), (X (NOT (AND (NOT p3) (NOT p1)))), (X (OR p3 p1)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (OR p3 p1))), (X (X p2)), (X (X (AND p2 p3))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p3))), (F (NOT p3)), (F (NOT (OR p1 p3))), (F (AND (NOT p1) (NOT p3))), (F (NOT p2)), (F (NOT (AND p2 p3))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 10 factoid took 708 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 6 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Stuttering acceptance computed with spot in 208 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Product exploration explored 100000 steps with 19 reset in 148 ms.
Product exploration explored 100000 steps with 25 reset in 207 ms.
Applying partial POR strategy [true, false, false, true, false, false]
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p2) (NOT p3) (NOT p1)), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p1))]
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 118 transition count 118
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 14 Pre rules applied. Total rules applied 30 place count 118 transition count 130
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 14 rules applied. Total rules applied 44 place count 118 transition count 130
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 77 place count 118 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 78 place count 118 transition count 129
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 99 place count 97 transition count 108
Deduced a syphon composed of 56 places in 0 ms
Iterating global reduction 2 with 21 rules applied. Total rules applied 120 place count 97 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 57 places in 0 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 121 place count 97 transition count 108
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 123 place count 95 transition count 106
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 125 place count 95 transition count 106
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -61
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 135 place count 95 transition count 167
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 145 place count 85 transition count 147
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 2 with 10 rules applied. Total rules applied 155 place count 85 transition count 147
Deduced a syphon composed of 55 places in 1 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 158 place count 85 transition count 144
Deduced a syphon composed of 55 places in 1 ms
Applied a total of 158 rules in 41 ms. Remains 85 /118 variables (removed 33) and now considering 144/118 (removed -26) transitions.
[2023-03-19 16:46:43] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 144 rows 85 cols
[2023-03-19 16:46:43] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:46:43] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/118 places, 144/118 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 85/118 places, 144/118 transitions.
Support contains 2 out of 118 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 118/118 places, 118/118 transitions.
Applied a total of 0 rules in 2 ms. Remains 118 /118 variables (removed 0) and now considering 118/118 (removed 0) transitions.
// Phase 1: matrix 118 rows 118 cols
[2023-03-19 16:46:43] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-19 16:46:43] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-19 16:46:43] [INFO ] Invariant cache hit.
[2023-03-19 16:46:43] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-19 16:46:43] [INFO ] Invariant cache hit.
[2023-03-19 16:46:43] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 118/118 places, 118/118 transitions.
Treatment of property ShieldRVt-PT-003B-LTLFireability-11 finished in 8668 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(G(p0)))'
Support contains 1 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Applied a total of 20 rules in 9 ms. Remains 119 /129 variables (removed 10) and now considering 119/129 (removed 10) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-19 16:46:43] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:46:43] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-19 16:46:43] [INFO ] Invariant cache hit.
[2023-03-19 16:46:44] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-19 16:46:44] [INFO ] Invariant cache hit.
[2023-03-19 16:46:44] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 119/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 119/129 places, 119/129 transitions.
Stuttering acceptance computed with spot in 152 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s38 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-12 finished in 559 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(X((X(X(!(G(p0) U !p1)))&&F(p2)))))'
Support contains 7 out of 129 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 121 transition count 121
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 121 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 120 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 120 transition count 120
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 119 transition count 119
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 119 transition count 119
Applied a total of 20 rules in 4 ms. Remains 119 /129 variables (removed 10) and now considering 119/129 (removed 10) transitions.
// Phase 1: matrix 119 rows 119 cols
[2023-03-19 16:46:44] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:46:44] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 16:46:44] [INFO ] Invariant cache hit.
[2023-03-19 16:46:44] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-19 16:46:44] [INFO ] Invariant cache hit.
[2023-03-19 16:46:44] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 119/129 places, 119/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 119/129 places, 119/129 transitions.
Stuttering acceptance computed with spot in 355 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (NOT p1), (AND (NOT p2) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) p0)]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p2:(AND (EQ s52 1) (EQ s93 1) (EQ s118 1)), p1:(AND (EQ s17 1) (EQ s21 1) (EQ s34 1)), p0:(EQ s44 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1342 steps with 3 reset in 2 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-14 finished in 595 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)||F(((F(p1) U p2)&&G(p3)))))'
Support contains 3 out of 129 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 129/129 places, 129/129 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 128 transition count 91
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 91 transition count 91
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 74 place count 91 transition count 73
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 110 place count 73 transition count 73
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 70 transition count 70
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 70 transition count 70
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 116 place count 70 transition count 68
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 120 place count 68 transition count 68
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 174 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 175 place count 41 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 177 place count 40 transition count 39
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 193 place count 32 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 195 place count 30 transition count 44
Applied a total of 195 rules in 11 ms. Remains 30 /129 variables (removed 99) and now considering 44/129 (removed 85) transitions.
// Phase 1: matrix 44 rows 30 cols
[2023-03-19 16:46:44] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:46:45] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-19 16:46:45] [INFO ] Invariant cache hit.
[2023-03-19 16:46:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-19 16:46:45] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-19 16:46:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 16:46:45] [INFO ] Invariant cache hit.
[2023-03-19 16:46:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/129 places, 44/129 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 213 ms. Remains : 30/129 places, 44/129 transitions.
Stuttering acceptance computed with spot in 431 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p2), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p3), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1) p3), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p2) p3), acceptance={} source=0 dest: 6}, { cond=(AND p0 p3), acceptance={} source=0 dest: 7}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1) p3), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1) (NOT p3))), acceptance={} source=5 dest: 2}, { cond=(OR (AND p0 (NOT p2) (NOT p1)) (AND p0 (NOT p1) (NOT p3))), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p2 (NOT p1) p3), acceptance={} source=5 dest: 8}, { cond=(AND p0 p2 (NOT p1) p3), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p0) p3), acceptance={} source=7 dest: 4}, { cond=(AND p0 p3), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=9 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=9 dest: 8}, { cond=(AND p0 (NOT p1) p3), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(EQ s18 0), p3:(EQ s18 1), p2:(EQ s15 1), p1:(EQ s22 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-003B-LTLFireability-15 finished in 660 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)||G((p1||(p2 U (G(p2)||(p2&&G(p3))))))))'
[2023-03-19 16:46:45] [INFO ] Flatten gal took : 17 ms
[2023-03-19 16:46:45] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-19 16:46:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 129 places, 129 transitions and 312 arcs took 1 ms.
Total runtime 16914 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-003B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/372
LTLFireability

BK_STOP 1679244436247

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ 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/372/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/372/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/372/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVt-PT-003B-LTLFireability-11
lola: time limit : 3600 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-003B-LTLFireability-11: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 8/32 ShieldRVt-PT-003B-LTLFireability-11 1140231 m, 228046 m/sec, 3322809 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3600 14/32 ShieldRVt-PT-003B-LTLFireability-11 2020078 m, 175969 m/sec, 6090390 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3600 19/32 ShieldRVt-PT-003B-LTLFireability-11 2704085 m, 136801 m/sec, 8302733 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3600 24/32 ShieldRVt-PT-003B-LTLFireability-11 3487061 m, 156595 m/sec, 10881139 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3600 29/32 ShieldRVt-PT-003B-LTLFireability-11 4240341 m, 150656 m/sec, 13425429 t fired, .

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

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-003B-LTLFireability-11: LTL unknown AGGR


Time elapsed: 30 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-003B"
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-003B, 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-167905976400220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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