About the Execution of 2023-gold for ShieldRVt-PT-002B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1435.855 | 22204.00 | 36644.00 | 2377.20 | TFTFTFFFFFFFTFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r373-tall-171683789600568.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldRVt-PT-002B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789600568
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 11 21:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 11 21:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Apr 11 21:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 24K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-002B-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717012627217
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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-002B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 19:57:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-29 19:57:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 19:57:10] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2024-05-29 19:57:10] [INFO ] Transformed 103 places.
[2024-05-29 19:57:10] [INFO ] Transformed 103 transitions.
[2024-05-29 19:57:10] [INFO ] Found NUPN structural information;
[2024-05-29 19:57:10] [INFO ] Parsed PT model containing 103 places and 103 transitions and 242 arcs in 127 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 5 formulas.
FORMULA ShieldRVt-PT-002B-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002B-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 103/103 places, 103/103 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 88 transition count 88
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 88 transition count 88
Applied a total of 30 rules in 25 ms. Remains 88 /103 variables (removed 15) and now considering 88/103 (removed 15) transitions.
// Phase 1: matrix 88 rows 88 cols
[2024-05-29 19:57:10] [INFO ] Computed 9 invariants in 8 ms
[2024-05-29 19:57:10] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-29 19:57:10] [INFO ] Invariant cache hit.
[2024-05-29 19:57:10] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-29 19:57:10] [INFO ] Invariant cache hit.
[2024-05-29 19:57:10] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 88/103 places, 88/103 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 446 ms. Remains : 88/103 places, 88/103 transitions.
Support contains 28 out of 88 places after structural reductions.
[2024-05-29 19:57:11] [INFO ] Flatten gal took : 24 ms
[2024-05-29 19:57:11] [INFO ] Flatten gal took : 10 ms
[2024-05-29 19:57:11] [INFO ] Input system was already deterministic with 88 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 24) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-29 19:57:11] [INFO ] Invariant cache hit.
[2024-05-29 19:57:11] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-29 19:57:11] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 26 stabilizing places and 26 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 80 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 79
Applied a total of 18 rules in 10 ms. Remains 79 /88 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-29 19:57:12] [INFO ] Computed 9 invariants in 4 ms
[2024-05-29 19:57:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-29 19:57:12] [INFO ] Invariant cache hit.
[2024-05-29 19:57:12] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2024-05-29 19:57:12] [INFO ] Invariant cache hit.
[2024-05-29 19:57:12] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/88 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 205 ms. Remains : 79/88 places, 79/88 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s22 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][false, false]]
Product exploration explored 100000 steps with 965 reset in 313 ms.
Stack based approach found an accepted trace after 75 steps with 0 reset with depth 76 and stack size 76 in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-01 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||G(p1))) U (p2 U p3)))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 80 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 79
Applied a total of 18 rules in 15 ms. Remains 79 /88 variables (removed 9) and now considering 79/88 (removed 9) transitions.
[2024-05-29 19:57:12] [INFO ] Invariant cache hit.
[2024-05-29 19:57:12] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-29 19:57:12] [INFO ] Invariant cache hit.
[2024-05-29 19:57:12] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-29 19:57:12] [INFO ] Invariant cache hit.
[2024-05-29 19:57:12] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/88 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 79/88 places, 79/88 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(EQ s45 1), p2:(EQ s41 1), p0:(NEQ s77 1), p1:(EQ s30 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 34598 reset in 150 ms.
Product exploration explored 100000 steps with 34595 reset in 136 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Detected a total of 22/79 stabilizing places and 22/79 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 26 factoid took 220 ms. Reduced automaton from 7 states, 18 edges and 4 AP (stutter sensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 264 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Finished random walk after 348 steps, including 0 resets, run visited all 15 properties in 16 ms. (steps per millisecond=21 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p3) (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p3) p2 (NOT p0) p1))), (X (NOT p3)), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1)))), (X (AND (NOT p3) (NOT p2))), (X (X (NOT (AND (NOT p3) p2 p0 p1)))), (X (X (AND (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) p1)))), (X (X (NOT p1))), (X (X (AND (NOT p3) (NOT p2) p0 (NOT p1)))), (X (X (NOT p3))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND (NOT p3) p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p3) p2 p0 (NOT p1))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(F p1), (F (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3))), (F (NOT (AND (NOT p2) (NOT p3)))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND (NOT p0) p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3))), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (NOT (AND p0 (NOT p2) (NOT p3)))), (F (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 26 factoid took 838 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 6 states, 17 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 221 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
Stuttering acceptance computed with spot in 214 ms :[(NOT p3), (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) p2)), true, (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3))]
[2024-05-29 19:57:15] [INFO ] Invariant cache hit.
[2024-05-29 19:57:15] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 19:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-29 19:57:15] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-29 19:57:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-29 19:57:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-29 19:57:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-29 19:57:15] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-29 19:57:15] [INFO ] Computed and/alt/rep : 78/115/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-29 19:57:15] [INFO ] Added : 70 causal constraints over 14 iterations in 146 ms. Result :sat
Could not prove EG (NOT p3)
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 79/79 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 78 transition count 61
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 61 transition count 61
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 34 place count 61 transition count 46
Deduced a syphon composed of 15 places in 7 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 64 place count 46 transition count 46
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 98 place count 29 transition count 29
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 99 place count 29 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 101 place count 28 transition count 27
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 105 place count 26 transition count 27
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 25 transition count 26
Applied a total of 106 rules in 36 ms. Remains 25 /79 variables (removed 54) and now considering 26/79 (removed 53) transitions.
// Phase 1: matrix 26 rows 25 cols
[2024-05-29 19:57:15] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 19:57:15] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-29 19:57:15] [INFO ] Invariant cache hit.
[2024-05-29 19:57:15] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-29 19:57:15] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-29 19:57:15] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:57:15] [INFO ] Invariant cache hit.
[2024-05-29 19:57:15] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/79 places, 26/79 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 25/79 places, 26/79 transitions.
Computed a total of 3 stabilizing places and 2 stable transitions
Computed a total of 3 stabilizing places and 2 stable transitions
Detected a total of 3/25 stabilizing places and 2/26 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p1) (NOT p2)), (X (NOT (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3)))), (X (NOT (AND p0 p1 p2 (NOT p3)))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)))), (X (NOT (AND p2 (NOT p3)))), (X (NOT (AND p0 p1 (NOT p2) (NOT p3)))), (X (NOT (AND p0 (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), (X (NOT p1)), (X (NOT (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3)))), (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), (X (X (OR (AND p0 (NOT p3)) (AND p1 (NOT p3))))), (X (X (AND p0 (NOT p1) (NOT p2) (NOT p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3))))), (X (X (NOT (AND p0 p1 p2 (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p0 p1 (NOT p2) (NOT p3))))), (X (X (AND p0 (NOT p2) (NOT p3)))), true, (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3))))), (X (X (NOT p1))), (X (X (NOT (OR (AND (NOT p0) p1 p2) (AND (NOT p0) p1 p3))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 33 factoid took 274 ms. Reduced automaton from 6 states, 17 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-04 finished in 3362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(G((p0&&(F(p2)||p1))))&&(p3 U p2)))))'
Support contains 4 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 82
Applied a total of 12 rules in 8 ms. Remains 82 /88 variables (removed 6) and now considering 82/88 (removed 6) transitions.
// Phase 1: matrix 82 rows 82 cols
[2024-05-29 19:57:16] [INFO ] Computed 9 invariants in 2 ms
[2024-05-29 19:57:16] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-29 19:57:16] [INFO ] Invariant cache hit.
[2024-05-29 19:57:16] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2024-05-29 19:57:16] [INFO ] Invariant cache hit.
[2024-05-29 19:57:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 82/88 places, 82/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 82/88 places, 82/88 transitions.
Stuttering acceptance computed with spot in 1117 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 p3), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(EQ s55 1), p3:(AND (EQ s71 1) (EQ s81 1)), p0:(EQ s76 1), p1:(OR (EQ s71 0) (EQ s81 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-05 finished in 1307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 63
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 62 transition count 61
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 51 place count 62 transition count 49
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 75 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 44 transition count 43
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 44 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 87 place count 44 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 95 place count 40 transition count 39
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 123 place count 26 transition count 25
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 133 place count 21 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 21 transition count 29
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 136 place count 19 transition count 27
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 137 place count 18 transition count 27
Applied a total of 137 rules in 25 ms. Remains 18 /88 variables (removed 70) and now considering 27/88 (removed 61) transitions.
// Phase 1: matrix 27 rows 18 cols
[2024-05-29 19:57:17] [INFO ] Computed 8 invariants in 2 ms
[2024-05-29 19:57:17] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 19:57:17] [INFO ] Invariant cache hit.
[2024-05-29 19:57:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-29 19:57:17] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:57:17] [INFO ] Invariant cache hit.
[2024-05-29 19:57:17] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/88 places, 27/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 18/88 places, 27/88 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s6 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-06 finished in 240 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U X(G(p1))))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 80 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 79
Applied a total of 18 rules in 10 ms. Remains 79 /88 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-29 19:57:17] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 19:57:17] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-29 19:57:17] [INFO ] Invariant cache hit.
[2024-05-29 19:57:17] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-29 19:57:17] [INFO ] Invariant cache hit.
[2024-05-29 19:57:17] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/88 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 167 ms. Remains : 79/88 places, 79/88 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s3 1), p0:(NEQ s32 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 48 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-07 finished in 389 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(p1)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 81 transition count 81
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 81 transition count 81
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 80 transition count 80
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 80 transition count 80
Applied a total of 16 rules in 6 ms. Remains 80 /88 variables (removed 8) and now considering 80/88 (removed 8) transitions.
// Phase 1: matrix 80 rows 80 cols
[2024-05-29 19:57:18] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 19:57:18] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 19:57:18] [INFO ] Invariant cache hit.
[2024-05-29 19:57:18] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2024-05-29 19:57:18] [INFO ] Invariant cache hit.
[2024-05-29 19:57:18] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 80/88 places, 80/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 80/88 places, 80/88 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(OR (EQ s14 1) (EQ s16 0) (EQ s47 0)), p0:(EQ s14 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 42 reset in 238 ms.
Product exploration explored 100000 steps with 45 reset in 179 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 102 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 4) seen :3
Finished Best-First random walk after 230 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=230 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 200 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 80/80 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2024-05-29 19:57:19] [INFO ] Invariant cache hit.
[2024-05-29 19:57:19] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 19:57:19] [INFO ] Invariant cache hit.
[2024-05-29 19:57:19] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2024-05-29 19:57:19] [INFO ] Invariant cache hit.
[2024-05-29 19:57:19] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 80/80 places, 80/80 transitions.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 116 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :3
Finished Best-First random walk after 245 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=245 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F p0), (F (NOT p1)), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 6 factoid took 192 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 46 reset in 144 ms.
Product exploration explored 100000 steps with 37 reset in 139 ms.
Built C files in :
/tmp/ltsmin11363952744831728392
[2024-05-29 19:57:21] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11363952744831728392
Running compilation step : cd /tmp/ltsmin11363952744831728392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2428 ms.
Running link step : cd /tmp/ltsmin11363952744831728392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin11363952744831728392;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4629448129500668559.hoa' '--buchi-type=spotba'
LTSmin run took 3013 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-08 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-002B-LTLFireability-08 finished in 8534 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 87 transition count 64
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 48 place count 64 transition count 62
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 50 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 62 transition count 61
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 51 place count 62 transition count 49
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 75 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 81 place count 44 transition count 43
Iterating global reduction 4 with 6 rules applied. Total rules applied 87 place count 44 transition count 43
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 87 place count 44 transition count 39
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 95 place count 40 transition count 39
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 121 place count 27 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 131 place count 22 transition count 30
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 132 place count 21 transition count 29
Applied a total of 132 rules in 15 ms. Remains 21 /88 variables (removed 67) and now considering 29/88 (removed 59) transitions.
// Phase 1: matrix 29 rows 21 cols
[2024-05-29 19:57:26] [INFO ] Computed 9 invariants in 0 ms
[2024-05-29 19:57:26] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 19:57:26] [INFO ] Invariant cache hit.
[2024-05-29 19:57:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-29 19:57:26] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-29 19:57:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:57:26] [INFO ] Invariant cache hit.
[2024-05-29 19:57:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/88 places, 29/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 127 ms. Remains : 21/88 places, 29/88 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s16 0), p1:(EQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 13 steps with 3 reset in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-09 finished in 260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(G(p1)))))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 82 transition count 82
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 82 transition count 82
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 81 transition count 81
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 81 transition count 81
Applied a total of 14 rules in 2 ms. Remains 81 /88 variables (removed 7) and now considering 81/88 (removed 7) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-29 19:57:26] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 19:57:26] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-29 19:57:26] [INFO ] Invariant cache hit.
[2024-05-29 19:57:26] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-29 19:57:26] [INFO ] Invariant cache hit.
[2024-05-29 19:57:26] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 81/88 places, 81/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 81/88 places, 81/88 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (EQ s65 1) (OR (EQ s52 1) (EQ s25 1))), p1:(EQ s52 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 39 reset in 116 ms.
Stack based approach found an accepted trace after 219 steps with 0 reset with depth 220 and stack size 220 in 1 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-10 finished in 393 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(p1)))'
Support contains 6 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 87 transition count 67
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 22 rules applied. Total rules applied 42 place count 67 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 66 transition count 65
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 43 place count 66 transition count 52
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 69 place count 53 transition count 52
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 75 place count 47 transition count 46
Iterating global reduction 3 with 6 rules applied. Total rules applied 81 place count 47 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 47 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 45 transition count 44
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 113 place count 31 transition count 30
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 123 place count 26 transition count 34
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 125 place count 24 transition count 32
Applied a total of 125 rules in 16 ms. Remains 24 /88 variables (removed 64) and now considering 32/88 (removed 56) transitions.
// Phase 1: matrix 32 rows 24 cols
[2024-05-29 19:57:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 19:57:27] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-29 19:57:27] [INFO ] Invariant cache hit.
[2024-05-29 19:57:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-29 19:57:27] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 19:57:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:57:27] [INFO ] Invariant cache hit.
[2024-05-29 19:57:27] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/88 places, 32/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 119 ms. Remains : 24/88 places, 32/88 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s17 1), p0:(AND (OR (EQ s12 0) (EQ s14 0) (EQ s20 0)) (OR (EQ s3 0) (EQ s12 0) (EQ s23 0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23429 reset in 125 ms.
Stack based approach found an accepted trace after 67794 steps with 15943 reset with depth 15 and stack size 15 in 83 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-11 finished in 410 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 80 transition count 80
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 80 transition count 80
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 79 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 79 transition count 79
Applied a total of 18 rules in 3 ms. Remains 79 /88 variables (removed 9) and now considering 79/88 (removed 9) transitions.
// Phase 1: matrix 79 rows 79 cols
[2024-05-29 19:57:27] [INFO ] Computed 9 invariants in 1 ms
[2024-05-29 19:57:27] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-29 19:57:27] [INFO ] Invariant cache hit.
[2024-05-29 19:57:27] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-29 19:57:27] [INFO ] Invariant cache hit.
[2024-05-29 19:57:27] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 79/88 places, 79/88 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 156 ms. Remains : 79/88 places, 79/88 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s31 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 92 ms.
Computed a total of 22 stabilizing places and 22 stable transitions
Computed a total of 22 stabilizing places and 22 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-002B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-002B-LTLFireability-12 finished in 439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 88/88 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 63
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 63 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 51 place count 62 transition count 61
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 51 place count 62 transition count 49
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 75 place count 50 transition count 49
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 81 place count 44 transition count 43
Iterating global reduction 3 with 6 rules applied. Total rules applied 87 place count 44 transition count 43
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 87 place count 44 transition count 40
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 93 place count 41 transition count 40
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 121 place count 27 transition count 26
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 22 transition count 30
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 20 transition count 28
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 134 place count 19 transition count 28
Applied a total of 134 rules in 19 ms. Remains 19 /88 variables (removed 69) and now considering 28/88 (removed 60) transitions.
// Phase 1: matrix 28 rows 19 cols
[2024-05-29 19:57:28] [INFO ] Computed 8 invariants in 0 ms
[2024-05-29 19:57:28] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-29 19:57:28] [INFO ] Invariant cache hit.
[2024-05-29 19:57:28] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-29 19:57:28] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-29 19:57:28] [INFO ] Invariant cache hit.
[2024-05-29 19:57:28] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/88 places, 28/88 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 19/88 places, 28/88 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-002B-LTLFireability-15 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 (EQ s15 0) (EQ s18 0) (EQ s10 0))], 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 125 reset in 140 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 10 in 0 ms.
FORMULA ShieldRVt-PT-002B-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-002B-LTLFireability-15 finished in 304 ms.
All properties solved by simple procedures.
Total runtime 18403 ms.
BK_STOP 1717012649421
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldRVt-PT-002B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldRVt-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 r373-tall-171683789600568"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-002B.tgz
mv ShieldRVt-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 '
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 ;