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-167905976200044.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 ShieldRVs-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-167905976200044
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 6.8K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 18:24 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Feb 26 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:01 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 ShieldRVs-PT-003B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-003B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679242097038

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=ShieldRVs-PT-003B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 16:08:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 16:08:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 16:08:18] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2023-03-19 16:08:18] [INFO ] Transformed 123 places.
[2023-03-19 16:08:18] [INFO ] Transformed 138 transitions.
[2023-03-19 16:08:18] [INFO ] Found NUPN structural information;
[2023-03-19 16:08:18] [INFO ] Parsed PT model containing 123 places and 138 transitions and 432 arcs in 126 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 3 formulas.
FORMULA ShieldRVs-PT-003B-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-003B-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 123 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 123/123 places, 138/138 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 108 transition count 123
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 108 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 107 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 107 transition count 122
Applied a total of 32 rules in 19 ms. Remains 107 /123 variables (removed 16) and now considering 122/138 (removed 16) transitions.
// Phase 1: matrix 122 rows 107 cols
[2023-03-19 16:08:19] [INFO ] Computed 13 place invariants in 13 ms
[2023-03-19 16:08:19] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-19 16:08:19] [INFO ] Invariant cache hit.
[2023-03-19 16:08:19] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-19 16:08:19] [INFO ] Invariant cache hit.
[2023-03-19 16:08:19] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 107/123 places, 122/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 468 ms. Remains : 107/123 places, 122/138 transitions.
Support contains 38 out of 107 places after structural reductions.
[2023-03-19 16:08:19] [INFO ] Flatten gal took : 38 ms
[2023-03-19 16:08:19] [INFO ] Flatten gal took : 13 ms
[2023-03-19 16:08:19] [INFO ] Input system was already deterministic with 122 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 29) seen :27
Incomplete Best-First random walk after 10000 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 16:08:20] [INFO ] Invariant cache hit.
[2023-03-19 16:08:20] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-19 16:08:20] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 16:08:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:20] [INFO ] After 56ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 16:08:20] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 6 ms to minimize.
[2023-03-19 16:08:20] [INFO ] Deduced a trap composed of 24 places in 41 ms of which 1 ms to minimize.
[2023-03-19 16:08:20] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2023-03-19 16:08:20] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 2 ms to minimize.
[2023-03-19 16:08:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 182 ms
[2023-03-19 16:08:20] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2023-03-19 16:08:20] [INFO ] Deduced a trap composed of 20 places in 18 ms of which 0 ms to minimize.
[2023-03-19 16:08:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2023-03-19 16:08:20] [INFO ] After 310ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-19 16:08:20] [INFO ] After 369ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 6 ms.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 122/122 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 107 transition count 111
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 96 transition count 111
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 96 transition count 95
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 80 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 74 transition count 89
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 74 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 74 transition count 88
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 73 transition count 88
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 120 place count 47 transition count 62
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 128 place count 47 transition count 62
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 129 place count 46 transition count 61
Applied a total of 129 rules in 24 ms. Remains 46 /107 variables (removed 61) and now considering 61/122 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 46/107 places, 61/122 transitions.
Incomplete random walk after 10000 steps, including 165 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2819589 steps, run timeout after 3003 ms. (steps per millisecond=938 ) properties seen :{}
Probabilistic random walk after 2819589 steps, saw 462266 distinct states, run finished after 3004 ms. (steps per millisecond=938 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 61 rows 46 cols
[2023-03-19 16:08:23] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-19 16:08:23] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-19 16:08:23] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:23] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:23] [INFO ] After 21ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-19 16:08:23] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 46/46 places, 61/61 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 16:08:23] [INFO ] Invariant cache hit.
[2023-03-19 16:08:23] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 16:08:23] [INFO ] Invariant cache hit.
[2023-03-19 16:08:23] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-19 16:08:23] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-19 16:08:23] [INFO ] Invariant cache hit.
[2023-03-19 16:08:23] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 190 ms. Remains : 46/46 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:08:23] [INFO ] Invariant cache hit.
[2023-03-19 16:08:23] [INFO ] [Real]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-19 16:08:23] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:24] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:24] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 16:08:24] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 27 stabilizing places and 27 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' '!((((p0 U p1) U X(p2))||F((p0&&X(G(p3))))))'
Support contains 6 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 8 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:24] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:08:24] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 16:08:24] [INFO ] Invariant cache hit.
[2023-03-19 16:08:24] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 149 ms to find 0 implicit places.
[2023-03-19 16:08:24] [INFO ] Invariant cache hit.
[2023-03-19 16:08:24] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 576 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2) p3) (AND p0 (NOT p2) p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) p3), acceptance={} source=3 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}, { cond=p0, acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=p3, acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={} source=8 dest: 6}]], initial=0, aps=[p1:(EQ s47 1), p0:(EQ s7 1), p2:(AND (EQ s27 1) (EQ s36 1) (EQ s56 1)), p3:(EQ s38 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 176 steps with 0 reset in 3 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-00 finished in 884 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)||G(p1))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 106 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 95 transition count 110
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 22 place count 95 transition count 95
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 58 place count 74 transition count 89
Iterating global reduction 2 with 6 rules applied. Total rules applied 64 place count 74 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 74 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 73 transition count 88
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 118 place count 47 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 45 transition count 60
Applied a total of 120 rules in 21 ms. Remains 45 /107 variables (removed 62) and now considering 60/122 (removed 62) transitions.
// Phase 1: matrix 60 rows 45 cols
[2023-03-19 16:08:25] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:25] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-19 16:08:25] [INFO ] Invariant cache hit.
[2023-03-19 16:08:25] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-19 16:08:25] [INFO ] Redundant transitions in 45 ms returned [59]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 59 rows 45 cols
[2023-03-19 16:08:25] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-19 16:08:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 45/107 places, 59/122 transitions.
Applied a total of 0 rules in 3 ms. Remains 45 /45 variables (removed 0) and now considering 59/59 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 45/107 places, 59/122 transitions.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s17 1), p1:(AND (EQ s6 1) (EQ s8 1) (EQ s13 1))], nbAcceptance=2, 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 58 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-01 finished in 308 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))||(p1 U X(!p1))))'
Support contains 5 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 5 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:25] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:08:25] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-19 16:08:25] [INFO ] Invariant cache hit.
[2023-03-19 16:08:25] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-19 16:08:25] [INFO ] Invariant cache hit.
[2023-03-19 16:08:25] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 216 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (AND (NOT p0) p1), (AND p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(NEQ s99 1), p0:(OR (AND (EQ s45 1) (EQ s78 1) (EQ s100 1)) (EQ s30 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, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2680 reset in 214 ms.
Product exploration explored 100000 steps with 2665 reset in 233 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 372 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 60 ms :[p1, p1]
Finished random walk after 40 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), true, (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 (NOT p0)))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 8 factoid took 303 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[p1]
Stuttering acceptance computed with spot in 30 ms :[p1]
[2023-03-19 16:08:27] [INFO ] Invariant cache hit.
[2023-03-19 16:08:27] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:08:27] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2023-03-19 16:08:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:08:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:08:27] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-19 16:08:27] [INFO ] Computed and/alt/rep : 116/348/116 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-19 16:08:27] [INFO ] Added : 80 causal constraints over 16 iterations in 191 ms. Result :sat
Could not prove EG p1
Support contains 1 out of 102 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 101 transition count 104
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 89 transition count 104
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 24 place count 89 transition count 89
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 54 place count 74 transition count 89
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 106 place count 48 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 46 transition count 61
Applied a total of 108 rules in 10 ms. Remains 46 /102 variables (removed 56) and now considering 61/117 (removed 56) transitions.
// Phase 1: matrix 61 rows 46 cols
[2023-03-19 16:08:27] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:08:27] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-19 16:08:27] [INFO ] Invariant cache hit.
[2023-03-19 16:08:27] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-19 16:08:27] [INFO ] Redundant transitions in 23 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-19 16:08:27] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:27] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/102 places, 60/117 transitions.
Applied a total of 0 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 205 ms. Remains : 46/102 places, 60/117 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p1)))
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003B-LTLFireability-02 finished in 2389 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 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 106 transition count 109
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 94 transition count 109
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 24 place count 94 transition count 95
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 52 place count 80 transition count 95
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 76 transition count 91
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 76 transition count 91
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 114 place count 49 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 47 transition count 62
Applied a total of 116 rules in 15 ms. Remains 47 /107 variables (removed 60) and now considering 62/122 (removed 60) transitions.
// Phase 1: matrix 62 rows 47 cols
[2023-03-19 16:08:27] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:28] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 16:08:28] [INFO ] Invariant cache hit.
[2023-03-19 16:08:28] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
[2023-03-19 16:08:28] [INFO ] Redundant transitions in 31 ms returned [61]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 61 rows 47 cols
[2023-03-19 16:08:28] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:28] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/107 places, 61/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 259 ms. Remains : 47/107 places, 61/122 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-03 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 s36 0) (EQ s17 0) (AND (EQ s17 1) (EQ s30 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2610 reset in 210 ms.
Product exploration explored 100000 steps with 2629 reset in 225 ms.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (NOT p0)]
Finished random walk after 106 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 16:08:29] [INFO ] Invariant cache hit.
[2023-03-19 16:08:29] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 16:08:29] [INFO ] Invariant cache hit.
[2023-03-19 16:08:29] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-19 16:08:29] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-19 16:08:29] [INFO ] Invariant cache hit.
[2023-03-19 16:08:29] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 185 ms. Remains : 47/47 places, 61/61 transitions.
Computed a total of 4 stabilizing places and 4 stable transitions
Computed a total of 4 stabilizing places and 4 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Finished random walk after 156 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=78 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2630 reset in 143 ms.
Product exploration explored 100000 steps with 2647 reset in 143 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:30] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-19 16:08:30] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:30] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 191 ms. Remains : 47/47 places, 61/61 transitions.
Treatment of property ShieldRVs-PT-003B-LTLFireability-03 finished in 2578 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 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 2 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:08:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:30] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:30] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-04 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:(NEQ s18 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 23 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-04 finished in 259 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)||X(G(p1))))'
Support contains 2 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 103 transition count 118
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 103 transition count 118
Applied a total of 8 rules in 3 ms. Remains 103 /107 variables (removed 4) and now considering 118/122 (removed 4) transitions.
// Phase 1: matrix 118 rows 103 cols
[2023-03-19 16:08:30] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:08:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:30] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 16:08:30] [INFO ] Invariant cache hit.
[2023-03-19 16:08:31] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 103/107 places, 118/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 191 ms. Remains : 103/107 places, 118/122 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s83 1), p1:(EQ s45 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]]
Stuttering criterion allowed to conclude after 1514 steps with 21 reset in 3 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-05 finished in 311 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((G(F(p2))&&p1))&&p0)))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 3 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:31] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:08:31] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-19 16:08:31] [INFO ] Invariant cache hit.
[2023-03-19 16:08:31] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2023-03-19 16:08:31] [INFO ] Invariant cache hit.
[2023-03-19 16:08:31] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s35 1)), p1:(AND (EQ s92 1) (EQ s35 1)), p2:(EQ s35 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-06 finished in 360 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(F(p0))))'
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 3 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:31] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:08:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-19 16:08:31] [INFO ] Invariant cache hit.
[2023-03-19 16:08:31] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
[2023-03-19 16:08:31] [INFO ] Invariant cache hit.
[2023-03-19 16:08:31] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s81 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 5272 reset in 111 ms.
Product exploration explored 100000 steps with 5281 reset in 132 ms.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/102 stabilizing places and 24/117 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 16:08:32] [INFO ] Invariant cache hit.
[2023-03-19 16:08:32] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:08:32] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2023-03-19 16:08:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:08:32] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-19 16:08:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:08:32] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-19 16:08:32] [INFO ] Computed and/alt/rep : 116/348/116 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 16:08:33] [INFO ] Added : 98 causal constraints over 22 iterations in 265 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 117/117 (removed 0) transitions.
[2023-03-19 16:08:33] [INFO ] Invariant cache hit.
[2023-03-19 16:08:33] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-19 16:08:33] [INFO ] Invariant cache hit.
[2023-03-19 16:08:33] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-19 16:08:33] [INFO ] Invariant cache hit.
[2023-03-19 16:08:33] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 198 ms. Remains : 102/102 places, 117/117 transitions.
Computed a total of 24 stabilizing places and 24 stable transitions
Computed a total of 24 stabilizing places and 24 stable transitions
Detected a total of 24/102 stabilizing places and 24/117 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-19 16:08:33] [INFO ] Invariant cache hit.
[2023-03-19 16:08:33] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 16:08:33] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-19 16:08:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-19 16:08:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-19 16:08:34] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2023-03-19 16:08:34] [INFO ] Computed and/alt/rep : 116/348/116 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-19 16:08:34] [INFO ] Added : 98 causal constraints over 22 iterations in 271 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5271 reset in 127 ms.
Product exploration explored 100000 steps with 5268 reset in 137 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 102 transition count 117
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 12 place count 102 transition count 119
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 18 place count 102 transition count 119
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 101 transition count 118
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 101 transition count 118
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 55 places in 0 ms
Iterating global reduction 1 with 38 rules applied. Total rules applied 58 place count 101 transition count 118
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 79 place count 80 transition count 97
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 100 place count 80 transition count 97
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 100 rules in 27 ms. Remains 80 /102 variables (removed 22) and now considering 97/117 (removed 20) transitions.
[2023-03-19 16:08:35] [INFO ] Redundant transitions in 24 ms returned [96]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 96 rows 80 cols
[2023-03-19 16:08:35] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:08:35] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/102 places, 96/117 transitions.
Deduced a syphon composed of 34 places in 1 ms
Applied a total of 0 rules in 4 ms. Remains 80 /80 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 126 ms. Remains : 80/102 places, 96/117 transitions.
Support contains 1 out of 102 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 102/102 places, 117/117 transitions.
Applied a total of 0 rules in 1 ms. Remains 102 /102 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:35] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:08:35] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-19 16:08:35] [INFO ] Invariant cache hit.
[2023-03-19 16:08:35] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-19 16:08:35] [INFO ] Invariant cache hit.
[2023-03-19 16:08:35] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 102/102 places, 117/117 transitions.
Treatment of property ShieldRVs-PT-003B-LTLFireability-08 finished in 3933 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 (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 106 transition count 110
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 95 transition count 110
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 95 transition count 94
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 79 transition count 94
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 73 transition count 88
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 73 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 66 place count 73 transition count 87
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 68 place count 72 transition count 87
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 2 with 48 rules applied. Total rules applied 116 place count 48 transition count 63
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 46 transition count 61
Applied a total of 118 rules in 14 ms. Remains 46 /107 variables (removed 61) and now considering 61/122 (removed 61) transitions.
// Phase 1: matrix 61 rows 46 cols
[2023-03-19 16:08:35] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:35] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-19 16:08:35] [INFO ] Invariant cache hit.
[2023-03-19 16:08:35] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-19 16:08:35] [INFO ] Redundant transitions in 23 ms returned [60]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-19 16:08:35] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:35] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/107 places, 60/122 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 46/107 places, 60/122 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s39 1) (EQ s45 1))) (NOT (AND (EQ s27 1) (EQ s39 1) (EQ s45 1)))), p1:(AND (EQ s27 1) (EQ s39 1) (EQ s45 1)), p0:(NEQ s27 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4554 reset in 156 ms.
Product exploration explored 100000 steps with 4570 reset in 173 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/46 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 8 factoid took 464 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-19 16:08:37] [INFO ] Invariant cache hit.
[2023-03-19 16:08:37] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:37] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:1
[2023-03-19 16:08:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:37] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-19 16:08:37] [INFO ] After 28ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 16:08:37] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 60
Applied a total of 8 rules in 4 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 46/46 places, 60/60 transitions.
Incomplete random walk after 10000 steps, including 167 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2612847 steps, run timeout after 3001 ms. (steps per millisecond=870 ) properties seen :{}
Probabilistic random walk after 2612847 steps, saw 437637 distinct states, run finished after 3001 ms. (steps per millisecond=870 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 46 cols
[2023-03-19 16:08:40] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-19 16:08:40] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:40] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:40] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:40] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 0 ms to minimize.
[2023-03-19 16:08:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-19 16:08:40] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 16:08:40] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 46/46 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 16:08:40] [INFO ] Invariant cache hit.
[2023-03-19 16:08:40] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-19 16:08:40] [INFO ] Invariant cache hit.
[2023-03-19 16:08:40] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
[2023-03-19 16:08:40] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-19 16:08:40] [INFO ] Invariant cache hit.
[2023-03-19 16:08:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 172 ms. Remains : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:08:40] [INFO ] Invariant cache hit.
[2023-03-19 16:08:40] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:40] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:40] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:40] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:40] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-19 16:08:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-19 16:08:40] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 16:08:40] [INFO ] After 99ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND p1 p0 (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p1) p0 (NOT p2))), (F (OR (AND p1 (NOT p2)) (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 10 factoid took 578 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-19 16:08:41] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:41] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 16:08:41] [INFO ] Invariant cache hit.
[2023-03-19 16:08:41] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-19 16:08:41] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-19 16:08:41] [INFO ] Invariant cache hit.
[2023-03-19 16:08:41] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 46/46 places, 60/60 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/46 stabilizing places and 2/60 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 316 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 180 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 38 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 16:08:42] [INFO ] Invariant cache hit.
[2023-03-19 16:08:42] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:42] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:42] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:42] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 16:08:42] [INFO ] After 66ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 46 transition count 60
Applied a total of 8 rules in 3 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 46/46 places, 60/60 transitions.
Incomplete random walk after 10000 steps, including 164 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2434734 steps, run timeout after 3001 ms. (steps per millisecond=811 ) properties seen :{}
Probabilistic random walk after 2434734 steps, saw 410010 distinct states, run finished after 3001 ms. (steps per millisecond=811 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 46 cols
[2023-03-19 16:08:45] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:45] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-19 16:08:45] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:45] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:45] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2023-03-19 16:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-19 16:08:45] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 16:08:45] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 46/46 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-19 16:08:45] [INFO ] Invariant cache hit.
[2023-03-19 16:08:45] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-19 16:08:45] [INFO ] Invariant cache hit.
[2023-03-19 16:08:45] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 120 ms to find 0 implicit places.
[2023-03-19 16:08:45] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-19 16:08:45] [INFO ] Invariant cache hit.
[2023-03-19 16:08:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-19 16:08:45] [INFO ] Invariant cache hit.
[2023-03-19 16:08:45] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:45] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 16:08:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-19 16:08:45] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 16:08:45] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2023-03-19 16:08:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2023-03-19 16:08:45] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-19 16:08:45] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p2) p0))]
Knowledge based reduction with 5 factoid took 318 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 4569 reset in 116 ms.
Product exploration explored 100000 steps with 4617 reset in 123 ms.
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 46 /46 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 46 cols
[2023-03-19 16:08:46] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:08:46] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-19 16:08:46] [INFO ] Invariant cache hit.
[2023-03-19 16:08:46] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 127 ms to find 0 implicit places.
[2023-03-19 16:08:46] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-19 16:08:46] [INFO ] Invariant cache hit.
[2023-03-19 16:08:47] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 46/46 places, 60/60 transitions.
Treatment of property ShieldRVs-PT-003B-LTLFireability-09 finished in 11621 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(G(p0))&&(p1||G(p0))))))'
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 116
Applied a total of 12 rules in 4 ms. Remains 101 /107 variables (removed 6) and now considering 116/122 (removed 6) transitions.
// Phase 1: matrix 116 rows 101 cols
[2023-03-19 16:08:47] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:47] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-19 16:08:47] [INFO ] Invariant cache hit.
[2023-03-19 16:08:47] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-19 16:08:47] [INFO ] Invariant cache hit.
[2023-03-19 16:08:47] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/107 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 101/107 places, 116/122 transitions.
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVs-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=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(OR p1 p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(EQ s6 1), p1:(AND (EQ s16 1) (EQ s19 1) (EQ s26 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-11 finished in 379 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 (p1||X(F(!p2)))))'
Support contains 7 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 101 transition count 116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 101 transition count 116
Applied a total of 12 rules in 3 ms. Remains 101 /107 variables (removed 6) and now considering 116/122 (removed 6) transitions.
[2023-03-19 16:08:47] [INFO ] Invariant cache hit.
[2023-03-19 16:08:47] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-19 16:08:47] [INFO ] Invariant cache hit.
[2023-03-19 16:08:47] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-19 16:08:47] [INFO ] Invariant cache hit.
[2023-03-19 16:08:47] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 101/107 places, 116/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 280 ms. Remains : 101/107 places, 116/122 transitions.
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) p2), p2, (AND (NOT p1) p2)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s44 1) (EQ s79 1) (EQ s98 1)), p0:(EQ s37 1), p2:(AND (EQ s59 1) (EQ s66 1) (EQ s86 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 163 ms.
Product exploration explored 100000 steps with 50000 reset in 143 ms.
Computed a total of 23 stabilizing places and 23 stable transitions
Computed a total of 23 stabilizing places and 23 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p2))
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-003B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-003B-LTLFireability-12 finished in 870 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||G(!p0))))))'
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 106 transition count 110
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 23 place count 95 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 94 transition count 109
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 24 place count 94 transition count 95
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 52 place count 80 transition count 95
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 57 place count 75 transition count 90
Iterating global reduction 3 with 5 rules applied. Total rules applied 62 place count 75 transition count 90
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 52 rules applied. Total rules applied 114 place count 49 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 116 place count 47 transition count 62
Applied a total of 116 rules in 14 ms. Remains 47 /107 variables (removed 60) and now considering 62/122 (removed 60) transitions.
// Phase 1: matrix 62 rows 47 cols
[2023-03-19 16:08:48] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:48] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-19 16:08:48] [INFO ] Invariant cache hit.
[2023-03-19 16:08:48] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-19 16:08:48] [INFO ] Redundant transitions in 23 ms returned [61]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 61 rows 47 cols
[2023-03-19 16:08:48] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-19 16:08:48] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/107 places, 61/122 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 187 ms. Remains : 47/107 places, 61/122 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s37 1) (EQ s43 1))) (NOT (EQ s13 1))), p0:(AND (EQ s37 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5071 reset in 149 ms.
Product exploration explored 100000 steps with 5032 reset in 142 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 239 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 16:08:49] [INFO ] Invariant cache hit.
[2023-03-19 16:08:49] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 16:08:49] [INFO ] Invariant cache hit.
[2023-03-19 16:08:49] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2023-03-19 16:08:49] [INFO ] Redundant transitions in 26 ms returned []
[2023-03-19 16:08:49] [INFO ] Invariant cache hit.
[2023-03-19 16:08:49] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 47/47 places, 61/61 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 9 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 214 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 5034 reset in 105 ms.
Product exploration explored 100000 steps with 5090 reset in 150 ms.
Support contains 3 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2023-03-19 16:08:50] [INFO ] Invariant cache hit.
[2023-03-19 16:08:50] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-19 16:08:50] [INFO ] Invariant cache hit.
[2023-03-19 16:08:50] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-19 16:08:50] [INFO ] Redundant transitions in 27 ms returned []
[2023-03-19 16:08:50] [INFO ] Invariant cache hit.
[2023-03-19 16:08:50] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 250 ms. Remains : 47/47 places, 61/61 transitions.
Treatment of property ShieldRVs-PT-003B-LTLFireability-13 finished in 2686 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) U p2)))'
Support contains 8 out of 107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 102 transition count 117
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 102 transition count 117
Applied a total of 10 rules in 2 ms. Remains 102 /107 variables (removed 5) and now considering 117/122 (removed 5) transitions.
// Phase 1: matrix 117 rows 102 cols
[2023-03-19 16:08:51] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:51] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-19 16:08:51] [INFO ] Invariant cache hit.
[2023-03-19 16:08:51] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-19 16:08:51] [INFO ] Invariant cache hit.
[2023-03-19 16:08:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/107 places, 117/122 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 203 ms. Remains : 102/107 places, 117/122 transitions.
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p2) (NOT p0)), true, (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s15 1) (EQ s19 1) (EQ s26 1)), p1:(OR (EQ s93 1) (NEQ s33 1)), p0:(OR (EQ s49 0) (EQ s52 0) (EQ s59 0) (EQ s33 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]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-003B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-003B-LTLFireability-15 finished in 397 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)))'
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(F(p0))))'
Found a Shortening insensitive property : ShieldRVs-PT-003B-LTLFireability-08
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 107/107 places, 122/122 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 106 transition count 108
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 26 place count 93 transition count 108
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 26 place count 93 transition count 94
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 54 place count 79 transition count 94
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 74 transition count 89
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 74 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 64 place count 74 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 66 place count 73 transition count 88
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 118 place count 47 transition count 62
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 45 transition count 60
Applied a total of 120 rules in 13 ms. Remains 45 /107 variables (removed 62) and now considering 60/122 (removed 62) transitions.
// Phase 1: matrix 60 rows 45 cols
[2023-03-19 16:08:51] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-19 16:08:51] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-19 16:08:51] [INFO ] Invariant cache hit.
[2023-03-19 16:08:51] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-19 16:08:51] [INFO ] Invariant cache hit.
[2023-03-19 16:08:51] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 45/107 places, 60/122 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 170 ms. Remains : 45/107 places, 60/122 transitions.
Running random walk in product with property : ShieldRVs-PT-003B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s34 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 73 steps with 4 reset in 0 ms.
Treatment of property ShieldRVs-PT-003B-LTLFireability-08 finished in 389 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' '!(G(F((p0 U (G(p0)||(p0&&(!p1 U (p2||G(!p1)))))))))'
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||G(!p0))))))'
[2023-03-19 16:08:52] [INFO ] Flatten gal took : 12 ms
[2023-03-19 16:08:52] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 3 ms.
[2023-03-19 16:08:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 107 places, 122 transitions and 400 arcs took 10 ms.
Total runtime 33333 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVs-PT-003B
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA ShieldRVs-PT-003B-LTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-003B-LTLFireability-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVs-PT-003B-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679242170346

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 10 (type EXCL) for 9 ShieldRVs-PT-003B-LTLFireability-13
lola: time limit : 900 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
ShieldRVs-PT-003B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-13: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
10 LTL EXCL 5/900 8/32 ShieldRVs-PT-003B-LTLFireability-13 1201166 m, 240233 m/sec, 4630969 t fired, .

Time elapsed: 5 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 10 (type EXCL) for ShieldRVs-PT-003B-LTLFireability-13
lola: result : true
lola: markings : 1795672
lola: fired transitions : 6786890
lola: time used : 8.000000
lola: memory pages used : 12
lola: LAUNCH task # 4 (type EXCL) for 3 ShieldRVs-PT-003B-LTLFireability-08
lola: time limit : 1197 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-003B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 2/1197 5/32 ShieldRVs-PT-003B-LTLFireability-08 692061 m, 138412 m/sec, 2142750 t fired, .

Time elapsed: 10 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-003B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 7/1197 14/32 ShieldRVs-PT-003B-LTLFireability-08 2081623 m, 277912 m/sec, 7071639 t fired, .

Time elapsed: 15 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-003B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 12/1197 23/32 ShieldRVs-PT-003B-LTLFireability-08 3413168 m, 266309 m/sec, 11914064 t fired, .

Time elapsed: 20 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-003B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-08: LTL 0 0 1 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-09: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 17/1197 31/32 ShieldRVs-PT-003B-LTLFireability-08 4636471 m, 244660 m/sec, 16920432 t fired, .

Time elapsed: 25 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 4 (type EXCL) for ShieldRVs-PT-003B-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
ShieldRVs-PT-003B-LTLFireability-03: LTL 0 1 0 0 1 0 0 0
ShieldRVs-PT-003B-LTLFireability-08: LTL 0 0 0 0 1 0 1 0
ShieldRVs-PT-003B-LTLFireability-09: LTL 0 1 0 0 1 0 0 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: 4
lola: LAUNCH task # 1 (type EXCL) for 0 ShieldRVs-PT-003B-LTLFireability-03
lola: time limit : 1785 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ShieldRVs-PT-003B-LTLFireability-03
lola: result : true
lola: markings : 664845
lola: fired transitions : 1827600
lola: time used : 2.000000
lola: memory pages used : 5
lola: LAUNCH task # 7 (type EXCL) for 6 ShieldRVs-PT-003B-LTLFireability-09
lola: time limit : 3568 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-03: LTL true LTL model checker
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 3/3568 4/32 ShieldRVs-PT-003B-LTLFireability-09 568937 m, 113787 m/sec, 1676679 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: FINISHED task # 7 (type EXCL) for ShieldRVs-PT-003B-LTLFireability-09
lola: result : true
lola: markings : 1183627
lola: fired transitions : 3455146
lola: time used : 6.000000
lola: memory pages used : 8
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVs-PT-003B-LTLFireability-03: LTL true LTL model checker
ShieldRVs-PT-003B-LTLFireability-08: LTL unknown AGGR
ShieldRVs-PT-003B-LTLFireability-09: LTL true LTL model checker
ShieldRVs-PT-003B-LTLFireability-13: LTL true LTL model checker


Time elapsed: 38 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="ShieldRVs-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 ShieldRVs-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-167905976200044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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