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-171683789800623.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-030A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789800623
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Apr 12 01:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 12 01:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 00:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 00:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 82K 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-030A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-030A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717015000342

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-030A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:36:42] [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 20:36:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:36:42] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-29 20:36:42] [INFO ] Transformed 243 places.
[2024-05-29 20:36:42] [INFO ] Transformed 243 transitions.
[2024-05-29 20:36:42] [INFO ] Found NUPN structural information;
[2024-05-29 20:36:42] [INFO ] Parsed PT model containing 243 places and 243 transitions and 1026 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-030A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 25 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-29 20:36:42] [INFO ] Computed 121 invariants in 8 ms
[2024-05-29 20:36:43] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-29 20:36:43] [INFO ] Invariant cache hit.
[2024-05-29 20:36:43] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 564 ms to find 0 implicit places.
[2024-05-29 20:36:43] [INFO ] Invariant cache hit.
[2024-05-29 20:36:43] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 773 ms. Remains : 243/243 places, 242/242 transitions.
Support contains 58 out of 243 places after structural reductions.
[2024-05-29 20:36:43] [INFO ] Flatten gal took : 59 ms
[2024-05-29 20:36:43] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:36:43] [INFO ] Input system was already deterministic with 242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 666 ms. (steps per millisecond=15 ) properties (out of 30) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-29 20:36:44] [INFO ] Invariant cache hit.
[2024-05-29 20:36:44] [INFO ] [Real]Absence check using 121 positive place invariants in 32 ms returned sat
[2024-05-29 20:36:45] [INFO ] After 882ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-05-29 20:36:45] [INFO ] [Nat]Absence check using 121 positive place invariants in 16 ms returned sat
[2024-05-29 20:36:46] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-29 20:36:46] [INFO ] After 807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 297 ms.
[2024-05-29 20:36:46] [INFO ] After 1363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 4 properties in 421 ms.
Support contains 27 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 241
Partial Free-agglomeration rule applied 26 times.
Drop transitions removed 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 28 place count 242 transition count 241
Drop transitions removed 26 transitions
Redundant transition composition rules discarded 26 transitions
Iterating global reduction 0 with 26 rules applied. Total rules applied 54 place count 242 transition count 215
Applied a total of 54 rules in 78 ms. Remains 242 /243 variables (removed 1) and now considering 215/242 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 242/243 places, 215/242 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 15) seen :6
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 215 rows 242 cols
[2024-05-29 20:36:47] [INFO ] Computed 121 invariants in 4 ms
[2024-05-29 20:36:48] [INFO ] [Real]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 20:36:48] [INFO ] After 360ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-29 20:36:48] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 20:36:48] [INFO ] After 175ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-29 20:36:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 20:36:48] [INFO ] After 133ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2024-05-29 20:36:48] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 135 ms.
[2024-05-29 20:36:49] [INFO ] After 758ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Parikh walk visited 0 properties in 169 ms.
Support contains 15 out of 242 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 242/242 places, 215/215 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 242 transition count 215
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 242 transition count 214
Applied a total of 2 rules in 24 ms. Remains 242 /242 variables (removed 0) and now considering 214/215 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 242/242 places, 214/215 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Finished probabilistic random walk after 2936 steps, run visited all 9 properties in 72 ms. (steps per millisecond=40 )
Probabilistic random walk after 2936 steps, saw 2841 distinct states, run finished after 73 ms. (steps per millisecond=40 ) properties seen :9
Parikh walk visited 0 properties in 0 ms.
Computed a total of 1 stabilizing places and 1 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' '!((p0 U X(G(p1))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-29 20:36:50] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 20:36:50] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-29 20:36:50] [INFO ] Invariant cache hit.
[2024-05-29 20:36:50] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 429 ms to find 0 implicit places.
[2024-05-29 20:36:50] [INFO ] Invariant cache hit.
[2024-05-29 20:36:50] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 623 ms. Remains : 243/243 places, 242/242 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 226 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (AND (EQ s118 1) (EQ s121 1))) (NEQ s187 1)), p0:(AND (EQ s65 1) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 159 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-00 finished in 905 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(G(p0))||((X(p3)||p2)&&p1))))'
Support contains 9 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:51] [INFO ] Invariant cache hit.
[2024-05-29 20:36:51] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 20:36:51] [INFO ] Invariant cache hit.
[2024-05-29 20:36:51] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
[2024-05-29 20:36:51] [INFO ] Invariant cache hit.
[2024-05-29 20:36:51] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 545 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p3)), acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(AND (EQ s201 0) (OR (EQ s216 0) (EQ s218 0) (EQ s223 0))), p2:(OR (EQ s4 0) (EQ s5 0) (EQ s8 0)), p0:(OR (EQ s78 0) (EQ s81 0)), p3:(EQ s201 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 808 ms.
Product exploration explored 100000 steps with 50000 reset in 733 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p0 (NOT p3))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 29 ms. Reduced automaton from 5 states, 8 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-01 finished in 2309 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((G((p0&&F(p1)))||(G(p0)&&p2)))&&X(p3))))'
Support contains 6 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:53] [INFO ] Invariant cache hit.
[2024-05-29 20:36:53] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-29 20:36:53] [INFO ] Invariant cache hit.
[2024-05-29 20:36:53] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 433 ms to find 0 implicit places.
[2024-05-29 20:36:54] [INFO ] Invariant cache hit.
[2024-05-29 20:36:54] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 618 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p2), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(EQ s23 1), p1:(AND (EQ s142 1) (EQ s145 1)), p2:(AND (EQ s160 1) (EQ s162 1) (EQ s167 1)), p3:(AND (EQ s160 1) (EQ s162 1) (EQ s167 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 343 ms.
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-02 finished in 1353 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&&X(G(p1)))) U G(p1)))'
Support contains 5 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:54] [INFO ] Invariant cache hit.
[2024-05-29 20:36:55] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 20:36:55] [INFO ] Invariant cache hit.
[2024-05-29 20:36:55] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
[2024-05-29 20:36:55] [INFO ] Invariant cache hit.
[2024-05-29 20:36:55] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 615 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (NOT p1), (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s12 1) (EQ s13 1) (EQ s16 1)), p0:(AND (EQ s30 1) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, 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 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-03 finished in 818 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 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:55] [INFO ] Invariant cache hit.
[2024-05-29 20:36:55] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-29 20:36:55] [INFO ] Invariant cache hit.
[2024-05-29 20:36:56] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-29 20:36:56] [INFO ] Invariant cache hit.
[2024-05-29 20:36:56] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 524 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s163 1) (EQ s172 1) (EQ s178 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 28 reset in 348 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-04 finished in 968 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&&(p1 U X(p2))))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:56] [INFO ] Invariant cache hit.
[2024-05-29 20:36:56] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-29 20:36:56] [INFO ] Invariant cache hit.
[2024-05-29 20:36:57] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2024-05-29 20:36:57] [INFO ] Invariant cache hit.
[2024-05-29 20:36:57] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 543 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s17 1), p1:(EQ s83 1), p2:(EQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 355 ms.
Stack based approach found an accepted trace after 16 steps with 0 reset with depth 17 and stack size 17 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-06 finished in 1061 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((X(p0)||F(p1)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 5 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:57] [INFO ] Invariant cache hit.
[2024-05-29 20:36:57] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-05-29 20:36:57] [INFO ] Invariant cache hit.
[2024-05-29 20:36:58] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-29 20:36:58] [INFO ] Invariant cache hit.
[2024-05-29 20:36:58] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(OR (EQ s4 0) (EQ s5 0) (EQ s8 0) (EQ s65 1)), p0:(AND (EQ s83 1) (EQ s92 1) (EQ s98 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 493 ms.
Product exploration explored 100000 steps with 33333 reset in 535 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 19 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-030A-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-030A-LTLFireability-07 finished in 1775 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(G(p0))))'
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:36:59] [INFO ] Invariant cache hit.
[2024-05-29 20:36:59] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 20:36:59] [INFO ] Invariant cache hit.
[2024-05-29 20:36:59] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2024-05-29 20:36:59] [INFO ] Invariant cache hit.
[2024-05-29 20:37:00] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 492 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (EQ s227 0) (EQ s236 0) (EQ s242 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-08 finished in 634 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||G(F(p1))))))'
Support contains 4 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 15 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:37:00] [INFO ] Invariant cache hit.
[2024-05-29 20:37:00] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 20:37:00] [INFO ] Invariant cache hit.
[2024-05-29 20:37:00] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-29 20:37:00] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-29 20:37:00] [INFO ] Invariant cache hit.
[2024-05-29 20:37:00] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 533 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s59 1) (EQ s68 1) (EQ s74 1)), p1:(NEQ s235 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2239 reset in 374 ms.
Stack based approach found an accepted trace after 698 steps with 17 reset with depth 23 and stack size 21 in 3 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-10 finished in 1017 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 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 241
Applied a total of 2 rules in 12 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
// Phase 1: matrix 241 rows 242 cols
[2024-05-29 20:37:01] [INFO ] Computed 121 invariants in 7 ms
[2024-05-29 20:37:01] [INFO ] Implicit Places using invariants in 152 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 153 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 8 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 173 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-11 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:(AND (EQ s43 1) (EQ s52 1) (EQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 336 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-11 finished in 605 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 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 241
Applied a total of 2 rules in 14 ms. Remains 242 /243 variables (removed 1) and now considering 241/242 (removed 1) transitions.
[2024-05-29 20:37:01] [INFO ] Invariant cache hit.
[2024-05-29 20:37:01] [INFO ] Implicit Places using invariants in 123 ms returned [235]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 129 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 241/243 places, 241/242 transitions.
Applied a total of 0 rules in 14 ms. Remains 241 /241 variables (removed 0) and now considering 241/241 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 158 ms. Remains : 241/243 places, 241/242 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-12 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 s131 0) (EQ s140 0) (EQ s146 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 0 reset in 344 ms.
Stack based approach found an accepted trace after 10867 steps with 0 reset with depth 10868 and stack size 3452 in 45 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-12 finished in 611 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)) U (!p1&&X((!p1 U (G(!p1)||(X(p0)&&p2)))))))'
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 2 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-29 20:37:02] [INFO ] Computed 121 invariants in 3 ms
[2024-05-29 20:37:02] [INFO ] Implicit Places using invariants in 133 ms returned []
[2024-05-29 20:37:02] [INFO ] Invariant cache hit.
[2024-05-29 20:37:02] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2024-05-29 20:37:02] [INFO ] Invariant cache hit.
[2024-05-29 20:37:02] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 498 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 276 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}, { cond=(AND p1 p2), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 6}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=0, aps=[p1:(AND (EQ s171 1) (EQ s180 1) (EQ s186 1)), p0:(AND (EQ s128 1) (EQ s130 1) (EQ s135 1)), p2:(AND (EQ s142 1) (EQ s145 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 24954 reset in 501 ms.
Product exploration explored 100000 steps with 25075 reset in 533 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 279 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 285 ms. (steps per millisecond=35 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-29 20:37:05] [INFO ] Invariant cache hit.
[2024-05-29 20:37:05] [INFO ] [Real]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 20:37:05] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:37:05] [INFO ] [Nat]Absence check using 121 positive place invariants in 18 ms returned sat
[2024-05-29 20:37:05] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:37:05] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 46 ms.
[2024-05-29 20:37:05] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 51 ms.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 241
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 31 place count 242 transition count 241
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 60 place count 242 transition count 212
Applied a total of 60 rules in 35 ms. Remains 242 /243 variables (removed 1) and now considering 212/242 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 242/243 places, 212/242 transitions.
Finished random walk after 3655 steps, including 1 resets, run visited all 3 properties in 91 ms. (steps per millisecond=40 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p2))), (X (NOT p0)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), true, (X (X (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (AND p1 (NOT p2) p0)), (F p0), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2 (NOT p0))), (F (AND p1 p2)), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 21 factoid took 734 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 255 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 3 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:37:07] [INFO ] Invariant cache hit.
[2024-05-29 20:37:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-29 20:37:07] [INFO ] Invariant cache hit.
[2024-05-29 20:37:07] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
[2024-05-29 20:37:07] [INFO ] Invariant cache hit.
[2024-05-29 20:37:07] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 496 ms. Remains : 243/243 places, 242/242 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 177 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 176 ms. (steps per millisecond=56 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 11) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-05-29 20:37:08] [INFO ] Invariant cache hit.
[2024-05-29 20:37:08] [INFO ] [Real]Absence check using 121 positive place invariants in 16 ms returned sat
[2024-05-29 20:37:08] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-29 20:37:09] [INFO ] [Nat]Absence check using 121 positive place invariants in 17 ms returned sat
[2024-05-29 20:37:09] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-29 20:37:09] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 68 ms.
[2024-05-29 20:37:09] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 68 ms.
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 242 transition count 241
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 31 place count 242 transition count 241
Drop transitions removed 29 transitions
Redundant transition composition rules discarded 29 transitions
Iterating global reduction 0 with 29 rules applied. Total rules applied 60 place count 242 transition count 212
Applied a total of 60 rules in 18 ms. Remains 242 /243 variables (removed 1) and now considering 212/242 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 242/243 places, 212/242 transitions.
Finished random walk after 3664 steps, including 1 resets, run visited all 5 properties in 51 ms. (steps per millisecond=71 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 p2))), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND (NOT p1) p2))), true, (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (AND (NOT p1) p2)), (F (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (F p1), (F (AND p1 (NOT p2) p0)), (F p0), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2 (NOT p0))), (F (AND p1 p2)), (F (AND (NOT p1) p2 (NOT p0)))]
Knowledge based reduction with 21 factoid took 760 ms. Reduced automaton from 7 states, 21 edges and 3 AP (stutter sensitive) to 7 states, 21 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 264 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 282 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 25094 reset in 496 ms.
Product exploration explored 100000 steps with 24948 reset in 543 ms.
Applying partial POR strategy [false, true, false, true, true, false, true]
Stuttering acceptance computed with spot in 241 ms :[p1, (NOT p0), (OR (AND p1 (NOT p2)) (AND (NOT p0) p1)), true, (AND p1 p0 (NOT p2)), (AND (NOT p0) p1), (NOT p0)]
Support contains 8 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 243 transition count 242
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 30 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
[2024-05-29 20:37:12] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 242 rows 243 cols
[2024-05-29 20:37:12] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 20:37:12] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 243/243 places, 242/242 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 194 ms. Remains : 243/243 places, 242/242 transitions.
Built C files in :
/tmp/ltsmin3829513895109921561
[2024-05-29 20:37:12] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3829513895109921561
Running compilation step : cd /tmp/ltsmin3829513895109921561;'/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 493 ms.
Running link step : cd /tmp/ltsmin3829513895109921561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3829513895109921561;'/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/stateBased8266714063607536615.hoa' '--buchi-type=spotba'
LTSmin run took 250 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-030A-LTLFireability-14 finished in 11236 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&&X((X(G(p2))&&p1))) U X(X(p3)))))'
Support contains 7 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 242/242 transitions.
Applied a total of 0 rules in 11 ms. Remains 243 /243 variables (removed 0) and now considering 242/242 (removed 0) transitions.
// Phase 1: matrix 242 rows 243 cols
[2024-05-29 20:37:13] [INFO ] Computed 121 invariants in 1 ms
[2024-05-29 20:37:13] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-29 20:37:13] [INFO ] Invariant cache hit.
[2024-05-29 20:37:14] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
[2024-05-29 20:37:14] [INFO ] Invariant cache hit.
[2024-05-29 20:37:14] [INFO ] Dead Transitions using invariants and state equation in 167 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 574 ms. Remains : 243/243 places, 242/242 transitions.
Stuttering acceptance computed with spot in 517 ms :[(NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), true, (NOT p3), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-030A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}, { cond=(AND p0 p1), acceptance={} source=3 dest: 8}, { cond=p1, acceptance={} source=3 dest: 9}], [{ cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p3)), acceptance={0} source=7 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={0} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=9 dest: 10}], [{ cond=(NOT p2), acceptance={} source=10 dest: 5}, { cond=p2, acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(EQ s239 1), p1:(AND (EQ s1 1) (EQ s7 1)), p3:(AND (EQ s192 1) (EQ s194 1) (EQ s199 1)), p2:(NEQ s77 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-030A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-030A-LTLFireability-15 finished in 1115 ms.
All properties solved by simple procedures.
Total runtime 32406 ms.

BK_STOP 1717015035742

--------------------
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-030A"
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-030A, 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-171683789800623"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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