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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K 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.6K 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 18K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 23:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 23:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 11 22:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 11 22:43 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 109K 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-040A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717015441052

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-040A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:44:02] [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:44:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:44:03] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2024-05-29 20:44:03] [INFO ] Transformed 323 places.
[2024-05-29 20:44:03] [INFO ] Transformed 323 transitions.
[2024-05-29 20:44:03] [INFO ] Found NUPN structural information;
[2024-05-29 20:44:03] [INFO ] Parsed PT model containing 323 places and 323 transitions and 1366 arcs in 419 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.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-040A-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040A-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 42 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-29 20:44:03] [INFO ] Computed 161 invariants in 21 ms
[2024-05-29 20:44:03] [INFO ] Implicit Places using invariants in 334 ms returned []
[2024-05-29 20:44:03] [INFO ] Invariant cache hit.
[2024-05-29 20:44:04] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 729 ms to find 0 implicit places.
[2024-05-29 20:44:04] [INFO ] Invariant cache hit.
[2024-05-29 20:44:04] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 975 ms. Remains : 323/323 places, 322/322 transitions.
Support contains 40 out of 323 places after structural reductions.
[2024-05-29 20:44:04] [INFO ] Flatten gal took : 74 ms
[2024-05-29 20:44:04] [INFO ] Flatten gal took : 30 ms
[2024-05-29 20:44:04] [INFO ] Input system was already deterministic with 322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 520 ms. (steps per millisecond=19 ) properties (out of 25) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2024-05-29 20:44:05] [INFO ] Invariant cache hit.
[2024-05-29 20:44:05] [INFO ] [Real]Absence check using 161 positive place invariants in 23 ms returned sat
[2024-05-29 20:44:05] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-29 20:44:06] [INFO ] [Nat]Absence check using 161 positive place invariants in 22 ms returned sat
[2024-05-29 20:44:06] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-29 20:44:07] [INFO ] After 956ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 337 ms.
[2024-05-29 20:44:07] [INFO ] After 1574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Fused 16 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 462 ms.
Support contains 33 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 36 place count 322 transition count 321
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 0 with 34 rules applied. Total rules applied 70 place count 322 transition count 287
Applied a total of 70 rules in 57 ms. Remains 322 /323 variables (removed 1) and now considering 287/322 (removed 35) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 322/323 places, 287/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
// Phase 1: matrix 287 rows 322 cols
[2024-05-29 20:44:08] [INFO ] Computed 161 invariants in 7 ms
[2024-05-29 20:44:09] [INFO ] [Real]Absence check using 161 positive place invariants in 21 ms returned sat
[2024-05-29 20:44:09] [INFO ] After 544ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-29 20:44:09] [INFO ] [Nat]Absence check using 161 positive place invariants in 26 ms returned sat
[2024-05-29 20:44:10] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-29 20:44:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-29 20:44:10] [INFO ] After 176ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :11
[2024-05-29 20:44:10] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 172 ms.
[2024-05-29 20:44:10] [INFO ] After 1163ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Parikh walk visited 0 properties in 193 ms.
Support contains 25 out of 322 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 322/322 places, 287/287 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 322 transition count 287
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 322 transition count 286
Applied a total of 2 rules in 42 ms. Remains 322 /322 variables (removed 0) and now considering 286/287 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 322/322 places, 286/287 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 11) seen :0
Finished probabilistic random walk after 5115 steps, run visited all 11 properties in 112 ms. (steps per millisecond=45 )
Probabilistic random walk after 5115 steps, saw 4988 distinct states, run finished after 113 ms. (steps per millisecond=45 ) properties seen :11
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' '!(X((X(p0) U (X(G(p0))||(!p1&&X((p0&&(p1 U p2))))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-29 20:44:12] [INFO ] Computed 161 invariants in 5 ms
[2024-05-29 20:44:12] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-05-29 20:44:12] [INFO ] Invariant cache hit.
[2024-05-29 20:44:12] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-29 20:44:12] [INFO ] Invariant cache hit.
[2024-05-29 20:44:13] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 863 ms. Remains : 323/323 places, 322/322 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 416 ms :[true, (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 2}, { cond=p1, acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(AND (EQ s2 1) (EQ s4 1) (EQ s10 1)), p2:(AND (EQ s20 1) (EQ s21 1) (EQ s24 1)), p0:(NEQ s235 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4234 steps with 0 reset in 46 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-00 finished in 1407 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 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 22 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-29 20:44:13] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 20:44:13] [INFO ] Implicit Places using invariants in 172 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-01 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 s128 1) (EQ s130 1) (EQ s135 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 520 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 4 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-01 finished in 845 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 G((X(p1)||G(p2))))))'
Support contains 7 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 7 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-29 20:44:14] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 20:44:14] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-29 20:44:14] [INFO ] Invariant cache hit.
[2024-05-29 20:44:14] [INFO ] Implicit Places using invariants and state equation in 314 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2024-05-29 20:44:14] [INFO ] Invariant cache hit.
[2024-05-29 20:44:15] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 728 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), true, (NOT p0), (AND (NOT p2) p1), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p0), acceptance={0, 1} source=1 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0), acceptance={1} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 7}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=6 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=6 dest: 10}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 7}, { cond=(AND p2 p1), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=10 dest: 1}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=10 dest: 4}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 5}, { cond=(AND p2 p0 p1), acceptance={1} source=10 dest: 6}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=10 dest: 8}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=10 dest: 9}, { cond=(AND p2 p0 p1), acceptance={} source=10 dest: 10}]], initial=0, aps=[p0:(OR (AND (EQ s116 1) (EQ s117 1) (EQ s120 1)) (AND (EQ s172 1) (EQ s173 1) (EQ s176 1))), p2:(AND (EQ s116 1) (EQ s117 1) (EQ s120 1)), p1:(EQ s211 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], 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-040A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-02 finished in 1462 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))&&(G(p1)||G(p2))))'
Support contains 2 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 6 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-29 20:44:15] [INFO ] Invariant cache hit.
[2024-05-29 20:44:16] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 20:44:16] [INFO ] Invariant cache hit.
[2024-05-29 20:44:16] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 509 ms to find 0 implicit places.
[2024-05-29 20:44:16] [INFO ] Invariant cache hit.
[2024-05-29 20:44:16] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 739 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p2) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s207 0), p2:(EQ s207 1), p0:(EQ s231 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-03 finished in 952 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 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
[2024-05-29 20:44:16] [INFO ] Invariant cache hit.
[2024-05-29 20:44:16] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-29 20:44:16] [INFO ] Invariant cache hit.
[2024-05-29 20:44:17] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
[2024-05-29 20:44:17] [INFO ] Invariant cache hit.
[2024-05-29 20:44:17] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 681 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-04 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 s160 0) (EQ s162 0) (EQ s167 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 98225 steps with 0 reset in 408 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-04 finished in 1240 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(p0))'
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 23 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-29 20:44:18] [INFO ] Computed 161 invariants in 1 ms
[2024-05-29 20:44:18] [INFO ] Implicit Places using invariants in 159 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 160 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 9 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s7 1) (EQ s275 1) (EQ s284 1) (EQ s290 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 398 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-06 finished in 640 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((X((p0&&(p1||X(p2))))&&(!p3 U (p4||G(!p3)))))))'
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Applied a total of 0 rules in 3 ms. Remains 323 /323 variables (removed 0) and now considering 322/322 (removed 0) transitions.
// Phase 1: matrix 322 rows 323 cols
[2024-05-29 20:44:18] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 20:44:18] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-29 20:44:18] [INFO ] Invariant cache hit.
[2024-05-29 20:44:19] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 479 ms to find 0 implicit places.
[2024-05-29 20:44:19] [INFO ] Invariant cache hit.
[2024-05-29 20:44:19] [INFO ] Dead Transitions using invariants and state equation in 220 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 703 ms. Remains : 323/323 places, 322/322 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p4) p3), acceptance={} source=0 dest: 1}, { cond=(OR p4 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p4) p3), acceptance={0} source=1 dest: 1}, { cond=(OR p4 (NOT p3)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p4) p3 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))), acceptance={0} source=2 dest: 4}, { cond=(AND (NOT p4) (NOT p3) p0 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p4) p3 p0 (NOT p1)), acceptance={0} source=2 dest: 6}], [{ cond=(AND (NOT p4) p3), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p4) p3 (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2))), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) p3 p0 (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p4) p3 p0 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p4) (NOT p3) p0 (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p4) p3 (NOT p2)), acceptance={0} source=6 dest: 1}, { cond=(OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2))), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p4) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 3}]], initial=0, aps=[p4:(AND (NEQ s317 1) (NOT (AND (EQ s52 1) (EQ s53 1) (EQ s56 1)))), p3:(AND (EQ s52 1) (EQ s53 1) (EQ s56 1)), p0:(EQ s211 0), p1:(EQ s315 0), p2:(OR (EQ ...], 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 33155 reset in 841 ms.
Product exploration explored 100000 steps with 33129 reset in 828 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 p4 (NOT p3) p0 p1 p2), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) p3))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 30 factoid took 231 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 7 states, 25 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 343 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND p3 (NOT p4))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND p3 (NOT p4)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND p0 (NOT p2) p3 (NOT p4)), (OR (AND (NOT p2) p3 (NOT p4)) (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 337 ms. (steps per millisecond=29 ) properties (out of 20) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) 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 17) 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 17) 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 17) 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 17) 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 17) 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 17) seen :0
Running SMT prover for 17 properties.
[2024-05-29 20:44:22] [INFO ] Invariant cache hit.
[2024-05-29 20:44:22] [INFO ] [Real]Absence check using 161 positive place invariants in 21 ms returned sat
[2024-05-29 20:44:23] [INFO ] After 461ms SMT Verify possible using all constraints in real domain returned unsat :7 sat :0 real:10
[2024-05-29 20:44:23] [INFO ] [Nat]Absence check using 161 positive place invariants in 23 ms returned sat
[2024-05-29 20:44:23] [INFO ] After 336ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :10
[2024-05-29 20:44:23] [INFO ] After 596ms SMT Verify possible using trap constraints in natural domain returned unsat :7 sat :10
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-29 20:44:23] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :7 sat :10
Fused 17 Parikh solutions to 10 different solutions.
Finished Parikh walk after 162 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=54 )
Parikh walk visited 7 properties in 83 ms.
Support contains 5 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 322/322 transitions.
Partial Free-agglomeration rule applied 39 times.
Drop transitions removed 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 39 place count 323 transition count 322
Drop transitions removed 39 transitions
Redundant transition composition rules discarded 39 transitions
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 323 transition count 283
Applied a total of 78 rules in 22 ms. Remains 323 /323 variables (removed 0) and now considering 283/322 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 323/323 places, 283/322 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) seen :0
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 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Finished probabilistic random walk after 3769 steps, run visited all 3 properties in 47 ms. (steps per millisecond=80 )
Probabilistic random walk after 3769 steps, saw 3667 distinct states, run finished after 47 ms. (steps per millisecond=80 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Found 4 invariant AP formulas.
Knowledge obtained : [(AND p4 (NOT p3) p0 p1 p2), (X (NOT (AND (NOT p4) (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1)))), (X (NOT (AND (NOT p4) p3))), (X (NOT (AND (NOT p4) p3 (NOT p0)))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0))))), (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1))))), (X (OR p4 (NOT p3))), (X (NOT (AND (NOT p4) p3 p0 (NOT p1)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 (NOT p2)) (AND (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0))))), (X (X (NOT (OR (AND p4 p0 (NOT p1) (NOT p2)) (AND (NOT p3) p0 (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p4) p3 (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND p4 (NOT p0)) (AND (NOT p3) (NOT p0)))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3 (NOT p2))))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p1))))), (X (X (NOT (AND (NOT p4) p3)))), (X (X (NOT (AND (NOT p4) p3 (NOT p0))))), (X (X (NOT (AND (NOT p4) (NOT p3) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p0 (NOT p1) (NOT p2))))), (X (X (NOT (OR (AND p4 (NOT p0) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2)))))), (X (X (NOT (OR (AND p4 p0 (NOT p1)) (AND (NOT p3) p0 (NOT p1)))))), (X (X (OR p4 (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3) p0 (NOT p2))))), (G (NOT (AND (NOT p3) (NOT p4) p0 (NOT p1) (NOT p2)))), (G (NOT (AND (NOT p3) (NOT p4) (NOT p2)))), (G (NOT (OR (AND (NOT p3) (NOT p2)) (AND p4 (NOT p2))))), (G (NOT (AND (NOT p3) (NOT p4) p0 (NOT p2))))]
False Knowledge obtained : [(F (AND p3 (NOT p4) p0 (NOT p1))), (F (AND (NOT p3) (NOT p4) p0 (NOT p1))), (F (AND p3 (NOT p4) (NOT p0) (NOT p2))), (F (OR (AND (NOT p3) (NOT p0)) (AND p4 (NOT p0)))), (F (AND p3 (NOT p4) p0 (NOT p2))), (F (AND p3 (NOT p4) (NOT p0))), (F (AND p3 (NOT p4) p0 (NOT p1) (NOT p2))), (F (OR (AND (NOT p3) p0 (NOT p1)) (AND p4 p0 (NOT p1)))), (F (OR (AND (NOT p3) p0 (NOT p1) (NOT p2)) (AND p4 p0 (NOT p1) (NOT p2)))), (F (AND (NOT p3) (NOT p4) (NOT p0))), (F (AND p3 (NOT p4))), (F (AND (NOT p3) (NOT p4))), (F (AND p3 (NOT p4) (NOT p2))), (F (NOT (OR (NOT p3) p4))), (F (AND (NOT p3) (NOT p4) (NOT p0) (NOT p2))), (F (OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND p4 (NOT p0) (NOT p2))))]
Property proved to be false thanks to negative knowledge :(F (OR (AND (NOT p3) p0 (NOT p1) (NOT p2)) (AND p4 p0 (NOT p1) (NOT p2))))
Knowledge based reduction with 34 factoid took 1003 ms. Reduced automaton from 7 states, 25 edges and 5 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-040A-LTLFireability-07 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-040A-LTLFireability-07 finished in 6656 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)||(p0&&F(!p1))))))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 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 322 transition count 321
Applied a total of 2 rules in 18 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-29 20:44:25] [INFO ] Computed 161 invariants in 2 ms
[2024-05-29 20:44:25] [INFO ] Implicit Places using invariants in 189 ms returned [315]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/323 places, 321/322 transitions.
Applied a total of 0 rules in 22 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 245 ms. Remains : 321/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s126 1) (EQ s129 1)), p0:(NEQ s113 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 0 reset in 528 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) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Finished probabilistic random walk after 25974 steps, run visited all 3 properties in 172 ms. (steps per millisecond=151 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 173 ms. (steps per millisecond=150 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 207 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Support contains 3 out of 321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 321/321 places, 321/321 transitions.
Applied a total of 0 rules in 14 ms. Remains 321 /321 variables (removed 0) and now considering 321/321 (removed 0) transitions.
// Phase 1: matrix 321 rows 321 cols
[2024-05-29 20:44:27] [INFO ] Computed 160 invariants in 4 ms
[2024-05-29 20:44:28] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-29 20:44:28] [INFO ] Invariant cache hit.
[2024-05-29 20:44:28] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2024-05-29 20:44:28] [INFO ] Redundant transitions in 20 ms returned []
[2024-05-29 20:44:28] [INFO ] Invariant cache hit.
[2024-05-29 20:44:28] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 703 ms. Remains : 321/321 places, 321/321 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) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 3) 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 3) 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 3) 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 3) seen :0
Finished probabilistic random walk after 25974 steps, run visited all 3 properties in 169 ms. (steps per millisecond=153 )
Probabilistic random walk after 25974 steps, saw 25091 distinct states, run finished after 169 ms. (steps per millisecond=153 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p0)))), (X (X p0)), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p1 (NOT p0))), (F (AND p1 p0)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 434 ms.
Product exploration explored 100000 steps with 0 reset in 511 ms.
Built C files in :
/tmp/ltsmin6921241701041121503
[2024-05-29 20:44:30] [INFO ] Computing symmetric may disable matrix : 321 transitions.
[2024-05-29 20:44:30] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:44:30] [INFO ] Computing symmetric may enable matrix : 321 transitions.
[2024-05-29 20:44:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:44:30] [INFO ] Computing Do-Not-Accords matrix : 321 transitions.
[2024-05-29 20:44:30] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:44:30] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6921241701041121503
Running compilation step : cd /tmp/ltsmin6921241701041121503;'/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 760 ms.
Running link step : cd /tmp/ltsmin6921241701041121503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 142 ms.
Running LTSmin : cd /tmp/ltsmin6921241701041121503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6853651470156794095.hoa' '--buchi-type=spotba'
LTSmin run took 1088 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-08 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040A-LTLFireability-08 finished in 7525 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)) U (p1 U p2)))'
Support contains 3 out of 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 12 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-29 20:44:32] [INFO ] Computed 160 invariants in 3 ms
[2024-05-29 20:44:33] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-05-29 20:44:33] [INFO ] Invariant cache hit.
[2024-05-29 20:44:33] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2024-05-29 20:44:33] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:44:33] [INFO ] Invariant cache hit.
[2024-05-29 20:44:33] [INFO ] Dead Transitions using invariants and state equation in 195 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 685 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p2), p0]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(EQ s36 1), p1:(EQ s302 1), p0:(OR (EQ s36 1) (EQ s218 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Stack based approach found an accepted trace after 8211 steps with 0 reset with depth 8212 and stack size 2515 in 40 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-09 finished in 1228 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' '!(((p0 U p1)||X(F(p1))))'
Support contains 1 out of 323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /323 variables (removed 1) and now considering 321/322 (removed 1) transitions.
// Phase 1: matrix 321 rows 322 cols
[2024-05-29 20:44:34] [INFO ] Computed 161 invariants in 3 ms
[2024-05-29 20:44:34] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-05-29 20:44:34] [INFO ] Invariant cache hit.
[2024-05-29 20:44:34] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2024-05-29 20:44:34] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-29 20:44:34] [INFO ] Invariant cache hit.
[2024-05-29 20:44:34] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 651 ms. Remains : 322/323 places, 321/322 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 409 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-13 finished in 1130 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 323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 323/323 places, 322/322 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 320 transition count 320
Applied a total of 3 rules in 20 ms. Remains 320 /323 variables (removed 3) and now considering 320/322 (removed 2) transitions.
// Phase 1: matrix 320 rows 320 cols
[2024-05-29 20:44:35] [INFO ] Computed 160 invariants in 1 ms
[2024-05-29 20:44:35] [INFO ] Implicit Places using invariants in 150 ms returned []
[2024-05-29 20:44:35] [INFO ] Invariant cache hit.
[2024-05-29 20:44:35] [INFO ] Implicit Places using invariants and state equation in 291 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-05-29 20:44:35] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:44:35] [INFO ] Invariant cache hit.
[2024-05-29 20:44:35] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/323 places, 320/322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 662 ms. Remains : 320/323 places, 320/322 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040A-LTLFireability-14 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 s224 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 14 reset in 405 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ShieldRVt-PT-040A-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-040A-LTLFireability-14 finished in 1154 ms.
All properties solved by simple procedures.
Total runtime 33620 ms.

BK_STOP 1717015477500

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

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