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.r425-tajo-167905977600028.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 ltsminxred
Input is ShieldRVs-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905977600028
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 6.1K Feb 26 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 18:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K Feb 25 17:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 18:25 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 24K 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-002B-LTLFireability-00
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-01
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-02
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-03
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-04
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-05
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-06
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-07
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-08
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-09
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-10
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-11
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-12
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-13
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-14
FORMULA_NAME ShieldRVs-PT-002B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679295132748

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVs-PT-002B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 06:52:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 06:52:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 06:52:14] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-20 06:52:14] [INFO ] Transformed 83 places.
[2023-03-20 06:52:14] [INFO ] Transformed 93 transitions.
[2023-03-20 06:52:14] [INFO ] Found NUPN structural information;
[2023-03-20 06:52:14] [INFO ] Parsed PT model containing 83 places and 93 transitions and 288 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ShieldRVs-PT-002B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVs-PT-002B-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 44 out of 83 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 83/83 places, 93/93 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 78 transition count 88
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 78 transition count 88
Applied a total of 10 rules in 24 ms. Remains 78 /83 variables (removed 5) and now considering 88/93 (removed 5) transitions.
// Phase 1: matrix 88 rows 78 cols
[2023-03-20 06:52:14] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-20 06:52:15] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-20 06:52:15] [INFO ] Invariant cache hit.
[2023-03-20 06:52:15] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-20 06:52:15] [INFO ] Invariant cache hit.
[2023-03-20 06:52:15] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 78/83 places, 88/93 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 341 ms. Remains : 78/83 places, 88/93 transitions.
Support contains 44 out of 78 places after structural reductions.
[2023-03-20 06:52:15] [INFO ] Flatten gal took : 30 ms
[2023-03-20 06:52:15] [INFO ] Flatten gal took : 10 ms
[2023-03-20 06:52:15] [INFO ] Input system was already deterministic with 88 transitions.
Support contains 41 out of 78 places (down from 44) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 256 ms. (steps per millisecond=39 ) properties (out of 35) seen :33
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 06:52:15] [INFO ] Invariant cache hit.
[2023-03-20 06:52:15] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 06:52:15] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Computed a total of 23 stabilizing places and 23 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 X(p1)))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 4 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:16] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 06:52:16] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 06:52:16] [INFO ] Invariant cache hit.
[2023-03-20 06:52:16] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-20 06:52:16] [INFO ] Invariant cache hit.
[2023-03-20 06:52:16] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 197 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 255 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(EQ s49 1), p1:(EQ s52 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-00 finished in 506 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 6 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 80
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 70 transition count 71
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 61 transition count 71
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 42 place count 51 transition count 61
Iterating global reduction 2 with 10 rules applied. Total rules applied 52 place count 51 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 52 place count 51 transition count 56
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 62 place count 46 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 84 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 33 transition count 43
Applied a total of 86 rules in 20 ms. Remains 33 /78 variables (removed 45) and now considering 43/88 (removed 45) transitions.
// Phase 1: matrix 43 rows 33 cols
[2023-03-20 06:52:16] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 06:52:16] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 06:52:16] [INFO ] Invariant cache hit.
[2023-03-20 06:52:16] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-20 06:52:16] [INFO ] Redundant transitions in 27 ms returned [42]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 42 rows 33 cols
[2023-03-20 06:52:16] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-20 06:52:16] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/78 places, 42/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 220 ms. Remains : 33/78 places, 42/88 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-002B-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 s5 1), p1:(OR (AND (EQ s3 1) (EQ s20 1) (EQ s32 1)) (AND (EQ s23 1) (EQ s29 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 47 steps with 0 reset in 4 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-01 finished in 279 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(p0)||(p1 U (G(p1)||(p1&&G((p2 U p3))))))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 3 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:17] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 06:52:17] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 06:52:17] [INFO ] Invariant cache hit.
[2023-03-20 06:52:17] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 104 ms to find 0 implicit places.
[2023-03-20 06:52:17] [INFO ] Invariant cache hit.
[2023-03-20 06:52:17] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 159 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0))), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}, { cond=(OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0))), acceptance={} source=4 dest: 9}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 6}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(OR (AND p3 p1) (AND p2 p1)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 8}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=7 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 8}, { cond=(OR p3 p2), acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(EQ s68 1), p3:(EQ s52 1), p2:(AND (EQ s2 1) (EQ s22 1)), p0:(EQ s23 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 233 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 15 stabilizing places and 15 stable transitions
Computed a total of 15 stabilizing places and 15 stable transitions
Detected a total of 15/69 stabilizing places and 15/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p3) (NOT p2) p0), (X (NOT (OR (AND p3 p1) (AND p2 p1)))), (X (NOT (AND (NOT p3) (NOT p2) p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p3) p2 (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p3 p1 (NOT p0)) (AND p2 p1 (NOT p0)))))), (X (X (NOT (OR (AND p3 (NOT p1) (NOT p0)) (AND p2 (NOT p1) (NOT p0)))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p2) p1 (NOT p0))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 12 factoid took 313 ms. Reduced automaton from 10 states, 27 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-02 finished in 1297 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)&&F(p2)))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 9 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:18] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 06:52:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-20 06:52:18] [INFO ] Invariant cache hit.
[2023-03-20 06:52:18] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-20 06:52:18] [INFO ] Invariant cache hit.
[2023-03-20 06:52:18] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (EQ s24 0) (EQ s33 0) (EQ s54 0)), p2:(EQ s41 0), p0:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Product exploration explored 100000 steps with 50000 reset in 107 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/69 stabilizing places and 16/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), true, (X (X (AND p1 p2))), (X (X p1)), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 p2)))
Knowledge based reduction with 10 factoid took 232 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-03 finished in 844 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))) U (p1||(p2&&X(X(X(p3)))))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Applied a total of 16 rules in 5 ms. Remains 70 /78 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-20 06:52:19] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 06:52:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-20 06:52:19] [INFO ] Invariant cache hit.
[2023-03-20 06:52:19] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-20 06:52:19] [INFO ] Invariant cache hit.
[2023-03-20 06:52:19] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/78 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 70/78 places, 80/88 transitions.
Stuttering acceptance computed with spot in 722 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=p0, acceptance={} source=5 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={} source=6 dest: 10}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 12}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(OR (AND p1 p0 (NOT p3)) (AND p2 p0 (NOT p3))), acceptance={} source=8 dest: 3}], [{ cond=(NOT p3), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=10 dest: 7}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=11 dest: 9}], [{ cond=(NOT p3), acceptance={} source=12 dest: 10}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=12 dest: 11}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=12 dest: 12}]], initial=0, aps=[p1:(EQ s16 1), p2:(OR (EQ s17 1) (EQ s19 1)), p0:(EQ s60 1), p3:(EQ s17 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5242 reset in 126 ms.
Product exploration explored 100000 steps with 5287 reset in 113 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 456 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 581 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Finished random walk after 97 steps, including 0 resets, run visited all 9 properties in 5 ms. (steps per millisecond=19 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p2 p0))), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p3) p0)), (F p3)]
Knowledge based reduction with 8 factoid took 767 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 736 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Stuttering acceptance computed with spot in 706 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
[2023-03-20 06:52:23] [INFO ] Invariant cache hit.
[2023-03-20 06:52:23] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:23] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:52:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 06:52:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:23] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:52:23] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 06:52:23] [INFO ] Added : 79 causal constraints over 17 iterations in 186 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2023-03-20 06:52:23] [INFO ] Invariant cache hit.
[2023-03-20 06:52:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:24] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2023-03-20 06:52:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-20 06:52:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:24] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-20 06:52:24] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-20 06:52:24] [INFO ] Added : 79 causal constraints over 16 iterations in 131 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Applied a total of 0 rules in 9 ms. Remains 70 /70 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-20 06:52:24] [INFO ] Invariant cache hit.
[2023-03-20 06:52:24] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 06:52:24] [INFO ] Invariant cache hit.
[2023-03-20 06:52:24] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2023-03-20 06:52:24] [INFO ] Invariant cache hit.
[2023-03-20 06:52:24] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 70/70 places, 80/80 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 457 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 667 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Finished random walk after 46 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0) (NOT p3)), (X (NOT (AND (NOT p1) p2))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p3) (NOT p2)))), (F (NOT (AND (NOT p3) (NOT p0)))), (F (OR (AND p1 (NOT p3) p0) (AND (NOT p3) p2 p0))), (F (AND (NOT p1) (NOT p3) p2)), (F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F (AND (NOT p1) p2)), (F (AND (NOT p3) p0)), (F p3)]
Knowledge based reduction with 8 factoid took 684 ms. Reduced automaton from 13 states, 30 edges and 4 AP (stutter sensitive) to 13 states, 30 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 475 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Stuttering acceptance computed with spot in 551 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
[2023-03-20 06:52:27] [INFO ] Invariant cache hit.
[2023-03-20 06:52:27] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:27] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2023-03-20 06:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:27] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2023-03-20 06:52:27] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-20 06:52:27] [INFO ] Added : 79 causal constraints over 17 iterations in 140 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
[2023-03-20 06:52:27] [INFO ] Invariant cache hit.
[2023-03-20 06:52:27] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 06:52:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:27] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2023-03-20 06:52:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:27] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 06:52:27] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-20 06:52:27] [INFO ] Added : 79 causal constraints over 16 iterations in 142 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p3))
Stuttering acceptance computed with spot in 739 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Product exploration explored 100000 steps with 5293 reset in 123 ms.
Product exploration explored 100000 steps with 5224 reset in 116 ms.
Applying partial POR strategy [false, false, false, true, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 924 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p0), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 80
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 6 place count 70 transition count 81
Deduced a syphon composed of 10 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 70 transition count 81
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 69 transition count 80
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 69 transition count 80
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 23 rules applied. Total rules applied 35 place count 69 transition count 80
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 45 place count 59 transition count 70
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 55 place count 59 transition count 70
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 55 rules in 22 ms. Remains 59 /70 variables (removed 11) and now considering 70/80 (removed 10) transitions.
[2023-03-20 06:52:30] [INFO ] Redundant transitions in 27 ms returned [69]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-20 06:52:30] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 06:52:30] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/70 places, 69/80 transitions.
Deduced a syphon composed of 22 places in 0 ms
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 59/70 places, 69/80 transitions.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-20 06:52:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 06:52:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-20 06:52:30] [INFO ] Invariant cache hit.
[2023-03-20 06:52:30] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-20 06:52:30] [INFO ] Invariant cache hit.
[2023-03-20 06:52:30] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 70/70 places, 80/80 transitions.
Treatment of property ShieldRVs-PT-002B-LTLFireability-04 finished in 11366 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1||F(p2))))))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Applied a total of 16 rules in 3 ms. Remains 70 /78 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-20 06:52:30] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 06:52:30] [INFO ] Implicit Places using invariants in 46 ms returned []
[2023-03-20 06:52:30] [INFO ] Invariant cache hit.
[2023-03-20 06:52:30] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
[2023-03-20 06:52:30] [INFO ] Invariant cache hit.
[2023-03-20 06:52:30] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/78 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 70/78 places, 80/88 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s21 0), p1:(EQ s35 1), p2:(EQ s8 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-05 finished in 383 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 77 transition count 79
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 69 transition count 79
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 16 place count 69 transition count 69
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 36 place count 59 transition count 69
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 46 place count 49 transition count 59
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 49 transition count 59
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 56 place count 49 transition count 53
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 68 place count 43 transition count 53
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 90 place count 32 transition count 42
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 92 place count 30 transition count 40
Applied a total of 92 rules in 22 ms. Remains 30 /78 variables (removed 48) and now considering 40/88 (removed 48) transitions.
// Phase 1: matrix 40 rows 30 cols
[2023-03-20 06:52:30] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 06:52:30] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 06:52:30] [INFO ] Invariant cache hit.
[2023-03-20 06:52:31] [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-20 06:52:31] [INFO ] Redundant transitions in 25 ms returned [39]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 39 rows 30 cols
[2023-03-20 06:52:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 06:52:31] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 30/78 places, 39/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 39/39 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 30/78 places, 39/88 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s3 1) (NEQ s18 1) (NEQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2719 reset in 196 ms.
Stack based approach found an accepted trace after 657 steps with 17 reset with depth 51 and stack size 51 in 3 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-06 finished in 476 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(X((p1||X((G(p2) U (p1&&G(p2)))))))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 3 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:31] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 06:52:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-20 06:52:31] [INFO ] Invariant cache hit.
[2023-03-20 06:52:31] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2023-03-20 06:52:31] [INFO ] Invariant cache hit.
[2023-03-20 06:52:31] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p0:(AND (EQ s14 1) (EQ s18 1) (EQ s25 1)), p2:(NEQ s32 1), p1:(EQ s35 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]]
Stuttering criterion allowed to conclude after 8436 steps with 80 reset in 19 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-07 finished in 465 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(p1 U X(X(p1)))))'
Support contains 4 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 3 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:31] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 06:52:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-20 06:52:31] [INFO ] Invariant cache hit.
[2023-03-20 06:52:31] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-20 06:52:31] [INFO ] Invariant cache hit.
[2023-03-20 06:52:32] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 p1), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 10}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 11}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 12}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 11}], [{ cond=true, acceptance={} source=9 dest: 2}], [{ cond=(NOT p1), acceptance={} source=10 dest: 11}, { cond=p1, acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 2}], [{ cond=(NOT p1), acceptance={} source=12 dest: 11}]], initial=3, aps=[p0:(EQ s59 1), p1:(AND (EQ s15 1) (EQ s18 1) (EQ s25 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, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-10 finished in 604 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(p1)||p0)))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 3 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:32] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 06:52:32] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-20 06:52:32] [INFO ] Invariant cache hit.
[2023-03-20 06:52:32] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2023-03-20 06:52:32] [INFO ] Invariant cache hit.
[2023-03-20 06:52:32] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 147 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 104 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s59 1), p0:(OR (EQ s11 0) (EQ s46 0) (EQ s66 0) (EQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 78 ms.
Product exploration explored 100000 steps with 50000 reset in 75 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/69 stabilizing places and 16/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 6 factoid took 128 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVs-PT-002B-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-11 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&(p1||X(p2)))))'
Support contains 2 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 69 transition count 79
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 69 transition count 79
Applied a total of 18 rules in 1 ms. Remains 69 /78 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 69 cols
[2023-03-20 06:52:32] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 06:52:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 06:52:33] [INFO ] Invariant cache hit.
[2023-03-20 06:52:33] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-20 06:52:33] [INFO ] Invariant cache hit.
[2023-03-20 06:52:33] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 69/78 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 169 ms. Remains : 69/78 places, 79/88 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s36 0), p1:(EQ s37 1), p2:(EQ s37 0)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 111 ms.
Computed a total of 16 stabilizing places and 16 stable transitions
Computed a total of 16 stabilizing places and 16 stable transitions
Detected a total of 16/69 stabilizing places and 16/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p0), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 9 factoid took 250 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-002B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVs-PT-002B-LTLFireability-12 finished in 774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(((F(p0)||X(F(p1))) U G(p2)))))'
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 70 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 70 transition count 80
Applied a total of 16 rules in 4 ms. Remains 70 /78 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-20 06:52:33] [INFO ] Computed 9 place invariants in 1 ms
[2023-03-20 06:52:33] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-20 06:52:33] [INFO ] Invariant cache hit.
[2023-03-20 06:52:33] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2023-03-20 06:52:33] [INFO ] Invariant cache hit.
[2023-03-20 06:52:33] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 70/78 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 153 ms. Remains : 70/78 places, 80/88 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s21 1), p2:(EQ s60 1), p1:(AND (EQ s4 1) (EQ s15 1) (EQ s35 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2282 reset in 101 ms.
Product exploration explored 100000 steps with 2274 reset in 106 ms.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 416 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 42 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=21 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT p0)), (X (AND (NOT p0) (NOT p2))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 9 factoid took 448 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
[2023-03-20 06:52:35] [INFO ] Invariant cache hit.
[2023-03-20 06:52:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:35] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:52:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-20 06:52:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:35] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2023-03-20 06:52:35] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 8 ms to minimize.
[2023-03-20 06:52:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-20 06:52:35] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-20 06:52:36] [INFO ] Added : 75 causal constraints over 16 iterations in 184 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-20 06:52:36] [INFO ] Invariant cache hit.
[2023-03-20 06:52:36] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:36] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-20 06:52:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:36] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:36] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:52:36] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 06:52:36] [INFO ] Added : 61 causal constraints over 13 iterations in 99 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-20 06:52:36] [INFO ] Invariant cache hit.
[2023-03-20 06:52:36] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-20 06:52:36] [INFO ] Invariant cache hit.
[2023-03-20 06:52:36] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-20 06:52:36] [INFO ] Invariant cache hit.
[2023-03-20 06:52:36] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 70/70 places, 80/80 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Computed a total of 17 stabilizing places and 17 stable transitions
Detected a total of 17/70 stabilizing places and 17/80 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 346 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Finished random walk after 40 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=20 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT p2)), (X (AND (NOT p0) (NOT p2))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 8 factoid took 482 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
[2023-03-20 06:52:37] [INFO ] Invariant cache hit.
[2023-03-20 06:52:37] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:37] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-20 06:52:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-20 06:52:38] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2023-03-20 06:52:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-20 06:52:38] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-20 06:52:38] [INFO ] Added : 75 causal constraints over 16 iterations in 144 ms. Result :sat
Could not prove EG (NOT p2)
[2023-03-20 06:52:38] [INFO ] Invariant cache hit.
[2023-03-20 06:52:38] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-20 06:52:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:38] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-20 06:52:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 06:52:38] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-20 06:52:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 06:52:38] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-20 06:52:38] [INFO ] Computed and/alt/rep : 79/228/79 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-20 06:52:38] [INFO ] Added : 61 causal constraints over 13 iterations in 105 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2277 reset in 140 ms.
Product exploration explored 100000 steps with 2258 reset in 121 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 80
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 6 place count 70 transition count 82
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 12 place count 70 transition count 82
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 69 transition count 81
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 69 transition count 81
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 35 places in 0 ms
Iterating global reduction 1 with 24 rules applied. Total rules applied 38 place count 69 transition count 81
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 58 transition count 70
Deduced a syphon composed of 24 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 58 transition count 70
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 60 rules in 19 ms. Remains 58 /70 variables (removed 12) and now considering 70/80 (removed 10) transitions.
[2023-03-20 06:52:39] [INFO ] Redundant transitions in 21 ms returned [69]
Found 1 redundant transitions using SMT.
Drop transitions removed 1 transitions
Redundant transitions reduction (with SMT) removed 1 transitions.
// Phase 1: matrix 69 rows 58 cols
[2023-03-20 06:52:39] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 06:52:39] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 58/70 places, 69/80 transitions.
Deduced a syphon composed of 24 places in 0 ms
Applied a total of 0 rules in 3 ms. Remains 58 /58 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 58/70 places, 69/80 transitions.
Support contains 5 out of 70 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 70/70 places, 80/80 transitions.
Applied a total of 0 rules in 1 ms. Remains 70 /70 variables (removed 0) and now considering 80/80 (removed 0) transitions.
// Phase 1: matrix 80 rows 70 cols
[2023-03-20 06:52:39] [INFO ] Computed 9 place invariants in 2 ms
[2023-03-20 06:52:39] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-20 06:52:39] [INFO ] Invariant cache hit.
[2023-03-20 06:52:39] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2023-03-20 06:52:39] [INFO ] Invariant cache hit.
[2023-03-20 06:52:39] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 70/70 places, 80/80 transitions.
Treatment of property ShieldRVs-PT-002B-LTLFireability-14 finished in 5736 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)) U G((F(p1)||G(p2)))))'
Support contains 7 out of 78 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 80
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 14 place count 70 transition count 69
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 36 place count 59 transition count 69
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 45 place count 50 transition count 60
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 50 transition count 60
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 54 place count 50 transition count 56
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 62 place count 46 transition count 56
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 84 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 33 transition count 43
Applied a total of 86 rules in 13 ms. Remains 33 /78 variables (removed 45) and now considering 43/88 (removed 45) transitions.
// Phase 1: matrix 43 rows 33 cols
[2023-03-20 06:52:39] [INFO ] Computed 9 place invariants in 0 ms
[2023-03-20 06:52:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-20 06:52:39] [INFO ] Invariant cache hit.
[2023-03-20 06:52:39] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-20 06:52:39] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-20 06:52:39] [INFO ] Invariant cache hit.
[2023-03-20 06:52:39] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/78 places, 43/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 33/78 places, 43/88 transitions.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s13 1) (EQ s16 1) (EQ s25 1)), p2:(AND (EQ s21 1) (EQ s23 1) (EQ s28 1)), p0:(NEQ s10 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2969 reset in 142 ms.
Stack based approach found an accepted trace after 5670 steps with 163 reset with depth 38 and stack size 38 in 9 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVs-PT-002B-LTLFireability-15 finished in 469 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))) U (p1||(p2&&X(X(X(p3)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(((F(p0)||X(F(p1))) U G(p2)))))'
Found a Lengthening insensitive property : ShieldRVs-PT-002B-LTLFireability-14
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 78 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 78/78 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 77 transition count 80
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 70 transition count 80
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 14 place count 70 transition count 70
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 34 place count 60 transition count 70
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 42 place count 52 transition count 62
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 52 transition count 62
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 50 place count 52 transition count 59
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 56 place count 49 transition count 59
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
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 84 place count 35 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 86 place count 33 transition count 43
Applied a total of 86 rules in 11 ms. Remains 33 /78 variables (removed 45) and now considering 43/88 (removed 45) transitions.
// Phase 1: matrix 43 rows 33 cols
[2023-03-20 06:52:40] [INFO ] Computed 9 place invariants in 4 ms
[2023-03-20 06:52:40] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-20 06:52:40] [INFO ] Invariant cache hit.
[2023-03-20 06:52:40] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-20 06:52:40] [INFO ] Invariant cache hit.
[2023-03-20 06:52:40] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 33/78 places, 43/88 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 133 ms. Remains : 33/78 places, 43/88 transitions.
Running random walk in product with property : ShieldRVs-PT-002B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s9 1), p2:(EQ s28 1), p1:(AND (EQ s1 1) (EQ s6 1) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7046 reset in 101 ms.
Stuttering criterion allowed to conclude after 26514 steps with 1876 reset in 29 ms.
Treatment of property ShieldRVs-PT-002B-LTLFireability-14 finished in 598 ms.
FORMULA ShieldRVs-PT-002B-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-20 06:52:40] [INFO ] Flatten gal took : 8 ms
[2023-03-20 06:52:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-20 06:52:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 78 places, 88 transitions and 278 arcs took 1 ms.
Total runtime 26163 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1961/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1961/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : ShieldRVs-PT-002B-LTLFireability-04
Could not compute solution for formula : ShieldRVs-PT-002B-LTLFireability-14

BK_STOP 1679295161225

--------------------
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
mcc2023
ltl formula name ShieldRVs-PT-002B-LTLFireability-04
ltl formula formula --ltl=/tmp/1961/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 78 places, 88 transitions and 278 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1961/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 22 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
ltl formula name ShieldRVs-PT-002B-LTLFireability-14
ltl formula formula --ltl=/tmp/1961/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 78 places, 88 transitions and 278 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1961/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:

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-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVs-PT-002B, 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 r425-tajo-167905977600028"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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