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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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 4.0K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 02:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 02:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 12 01:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 12 01:27 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 136K 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-050A-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-050A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717015744311

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-050A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-29 20:49:06] [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:49:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:49:06] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2024-05-29 20:49:06] [INFO ] Transformed 403 places.
[2024-05-29 20:49:06] [INFO ] Transformed 403 transitions.
[2024-05-29 20:49:06] [INFO ] Found NUPN structural information;
[2024-05-29 20:49:06] [INFO ] Parsed PT model containing 403 places and 403 transitions and 1706 arcs in 181 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 3 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-050A-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-050A-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 60 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 48 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-29 20:49:06] [INFO ] Computed 201 invariants in 17 ms
[2024-05-29 20:49:07] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-05-29 20:49:07] [INFO ] Invariant cache hit.
[2024-05-29 20:49:07] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 799 ms to find 0 implicit places.
[2024-05-29 20:49:07] [INFO ] Invariant cache hit.
[2024-05-29 20:49:07] [INFO ] Dead Transitions using invariants and state equation in 258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1108 ms. Remains : 403/403 places, 402/402 transitions.
Support contains 60 out of 403 places after structural reductions.
[2024-05-29 20:49:08] [INFO ] Flatten gal took : 78 ms
[2024-05-29 20:49:08] [INFO ] Flatten gal took : 38 ms
[2024-05-29 20:49:08] [INFO ] Input system was already deterministic with 402 transitions.
Support contains 58 out of 403 places (down from 60) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 34) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) 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 20) 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 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2024-05-29 20:49:08] [INFO ] Invariant cache hit.
[2024-05-29 20:49:09] [INFO ] [Real]Absence check using 201 positive place invariants in 35 ms returned sat
[2024-05-29 20:49:10] [INFO ] After 1179ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2024-05-29 20:49:10] [INFO ] [Nat]Absence check using 201 positive place invariants in 42 ms returned sat
[2024-05-29 20:49:11] [INFO ] After 744ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2024-05-29 20:49:12] [INFO ] After 1853ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :20
Attempting to minimize the solution found.
Minimization took 621 ms.
[2024-05-29 20:49:12] [INFO ] After 2876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :20
Parikh walk visited 0 properties in 652 ms.
Support contains 37 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 43 place count 402 transition count 401
Drop transitions removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 0 with 41 rules applied. Total rules applied 84 place count 402 transition count 360
Applied a total of 84 rules in 111 ms. Remains 402 /403 variables (removed 1) and now considering 360/402 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 402/403 places, 360/402 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Finished probabilistic random walk after 21187 steps, run visited all 20 properties in 228 ms. (steps per millisecond=92 )
Probabilistic random walk after 21187 steps, saw 20616 distinct states, run finished after 231 ms. (steps per millisecond=91 ) properties seen :20
Parikh walk visited 0 properties in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(F((G(p0)||G(F(p1)))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 36 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-05-29 20:49:14] [INFO ] Computed 201 invariants in 10 ms
[2024-05-29 20:49:15] [INFO ] Implicit Places using invariants in 229 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 232 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 28 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 299 ms. Remains : 401/403 places, 401/402 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 192 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s188 1) (EQ s189 1) (EQ s192 1)), p1:(EQ s117 0)], 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 571 ms.
Product exploration explored 100000 steps with 0 reset in 609 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 p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 34987 steps, run visited all 2 properties in 242 ms. (steps per millisecond=144 )
Probabilistic random walk after 34987 steps, saw 34043 distinct states, run finished after 243 ms. (steps per millisecond=143 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 14 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-29 20:49:17] [INFO ] Computed 200 invariants in 2 ms
[2024-05-29 20:49:17] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-29 20:49:17] [INFO ] Invariant cache hit.
[2024-05-29 20:49:18] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2024-05-29 20:49:18] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-29 20:49:18] [INFO ] Invariant cache hit.
[2024-05-29 20:49:18] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1016 ms. Remains : 401/401 places, 401/401 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 p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 68 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) 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 2) 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 2) seen :0
Finished probabilistic random walk after 34987 steps, run visited all 2 properties in 227 ms. (steps per millisecond=154 )
Probabilistic random walk after 34987 steps, saw 34043 distinct states, run finished after 229 ms. (steps per millisecond=152 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 478 ms.
Product exploration explored 100000 steps with 0 reset in 558 ms.
Built C files in :
/tmp/ltsmin15190823101864466434
[2024-05-29 20:49:20] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-29 20:49:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:49:20] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-29 20:49:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:49:20] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-29 20:49:20] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:49:20] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15190823101864466434
Running compilation step : cd /tmp/ltsmin15190823101864466434;'/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 963 ms.
Running link step : cd /tmp/ltsmin15190823101864466434;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin15190823101864466434;'/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/stateBased323634300239024673.hoa' '--buchi-type=spotba'
LTSmin run took 7551 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050A-LTLFireability-00 finished in 14454 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0 U p1))))'
Support contains 4 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-29 20:49:29] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 20:49:29] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-05-29 20:49:29] [INFO ] Invariant cache hit.
[2024-05-29 20:49:29] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
[2024-05-29 20:49:29] [INFO ] Invariant cache hit.
[2024-05-29 20:49:30] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p1:(AND (EQ s228 1) (EQ s229 1) (EQ s232 1)), p0:(EQ s383 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-02 finished in 971 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(p1)&&(p2 U p3))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-05-29 20:49:30] [INFO ] Invariant cache hit.
[2024-05-29 20:49:30] [INFO ] Implicit Places using invariants in 196 ms returned []
[2024-05-29 20:49:30] [INFO ] Invariant cache hit.
[2024-05-29 20:49:30] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
[2024-05-29 20:49:30] [INFO ] Invariant cache hit.
[2024-05-29 20:49:31] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 210 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (EQ s372 0) (EQ s373 0) (EQ s376 0)), p3:(AND (EQ s372 1) (EQ s373 1) (EQ s376 1)), p2:(AND (EQ s270 1) (EQ s273 1)), p1:(OR (EQ s270 0) (EQ s273 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-03 finished in 1073 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||(p0 U p1))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 21 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-05-29 20:49:31] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 20:49:31] [INFO ] Implicit Places using invariants in 190 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 192 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 225 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 30 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s67 1) (EQ s76 1) (EQ s82 1)), p1:(AND (EQ s198 1) (EQ s201 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 476 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-050A-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-04 finished in 743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-29 20:49:32] [INFO ] Computed 201 invariants in 2 ms
[2024-05-29 20:49:32] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-29 20:49:32] [INFO ] Invariant cache hit.
[2024-05-29 20:49:32] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-05-29 20:49:32] [INFO ] Invariant cache hit.
[2024-05-29 20:49:32] [INFO ] Dead Transitions using invariants and state equation in 255 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 814 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s285 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 3 reset in 478 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-07 finished in 1371 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||(p1&&G(p2))))||((p0||(p1&&G(p2)))&&F(p3))))'
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 22 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-05-29 20:49:33] [INFO ] Computed 201 invariants in 3 ms
[2024-05-29 20:49:33] [INFO ] Implicit Places using invariants in 200 ms returned [395]
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 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 10 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 237 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 410 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2 (NOT p3)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s5 1), p1:(NEQ s173 1), p2:(EQ s181 1), p3:(AND (EQ s32 1) (EQ s34 1) (EQ s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 477 ms.
Product exploration explored 100000 steps with 0 reset in 561 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 p0 p1 (NOT p2) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 104 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 482 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 14) seen :0
Finished probabilistic random walk after 252156 steps, run visited all 14 properties in 1975 ms. (steps per millisecond=127 )
Probabilistic random walk after 252156 steps, saw 247560 distinct states, run finished after 1976 ms. (steps per millisecond=127 ) properties seen :14
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2) (NOT p3)), (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))))), (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3)))), (X (NOT p2)), (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3)))))), (X (X (OR (AND p0 (NOT p3)) (AND p1 p2 (NOT p3))))), (X (X (NOT p3))), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 p2 (NOT p3)))))]
False Knowledge obtained : [(F (AND p0 p3 p1 p2)), (F (AND p0 p3 p1 (NOT p2))), (F (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) p3 p1 p2)), (F (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2))), (F (AND p0 p3 (NOT p1) p2)), (F (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (F (AND p0 p3 (NOT p1) (NOT p2))), (F (AND (NOT p0) p3 (NOT p1) (NOT p2))), (F (AND (NOT p0) p3 p1 (NOT p2))), (F (AND (NOT p0) p3 (NOT p1) p2)), (F p3), (F (AND (NOT p0) (NOT p3) p1 p2))]
Knowledge based reduction with 13 factoid took 495 ms. Reduced automaton from 12 states, 49 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 528 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 490 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 16 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-29 20:49:40] [INFO ] Computed 200 invariants in 4 ms
[2024-05-29 20:49:40] [INFO ] Implicit Places using invariants in 210 ms returned []
[2024-05-29 20:49:40] [INFO ] Invariant cache hit.
[2024-05-29 20:49:41] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 616 ms to find 0 implicit places.
[2024-05-29 20:49:41] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-29 20:49:41] [INFO ] Invariant cache hit.
[2024-05-29 20:49:41] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 401/401 places, 401/401 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 p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 p2))), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p3 p1 p2))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p1) p2))), (X (NOT (AND (NOT p0) p3 p1 p2))), (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2)))), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 p2)))), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 p1 p2)))), (X (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 29 factoid took 147 ms. Reduced automaton from 12 states, 49 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 515 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 319 ms. (steps per millisecond=31 ) properties (out of 14) 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 14) 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 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 14) seen :0
Finished probabilistic random walk after 252156 steps, run visited all 14 properties in 1963 ms. (steps per millisecond=128 )
Probabilistic random walk after 252156 steps, saw 247560 distinct states, run finished after 1963 ms. (steps per millisecond=128 ) properties seen :14
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p3) p1 (NOT p2)), (X (NOT (AND p0 p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p3) p1 p2))), (X (NOT (AND p0 p3 (NOT p1) p2))), (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))))), (X (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (X (AND p0 (NOT p3))), (X (NOT (AND p0 p3 p1 p2))), (X (NOT p3)), (X (NOT (AND (NOT p0) p3 (NOT p1) p2))), (X (NOT (AND (NOT p0) p3 p1 p2))), (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2)))), (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2)))), (X (NOT (AND p0 p3 p1 (NOT p2)))), (X (X (NOT (AND p0 p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3) p1 p2)))), (X (X (NOT (AND p0 p3 (NOT p1) p2)))), (X (X (NOT (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2)))))), (X (X (NOT (AND (NOT p0) p3 p1 (NOT p2))))), (X (X (AND p0 (NOT p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 p3 p1 p2)))), (X (X (NOT (AND (NOT p0) p3 (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p3 p1 p2)))), (X (X (NOT (OR (AND p0 (NOT p3) p2) (AND (NOT p3) p1 p2))))), (X (X (OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND p0 p3 p1 (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 p3 p2)), (F (AND p0 p1 p3 (NOT p2))), (F (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3) (NOT p2)))), (F (NOT (AND p0 (NOT p3)))), (F (AND (NOT p0) p1 p3 p2)), (F (OR (AND p0 (NOT p3) p2) (AND p1 (NOT p3) p2))), (F (AND p0 (NOT p1) p3 p2)), (F (NOT (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p3) (NOT p2))))), (F (AND p0 (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3 (NOT p2))), (F (AND (NOT p0) p1 p3 (NOT p2))), (F (AND (NOT p0) (NOT p1) p3 p2)), (F p3), (F (AND (NOT p0) p1 (NOT p3) p2))]
Knowledge based reduction with 29 factoid took 675 ms. Reduced automaton from 12 states, 49 edges and 4 AP (stutter insensitive) to 12 states, 49 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 499 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 527 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Stuttering acceptance computed with spot in 486 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p3))), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3)))]
Product exploration explored 100000 steps with 0 reset in 483 ms.
Product exploration explored 100000 steps with 0 reset in 591 ms.
Built C files in :
/tmp/ltsmin8366273903132479280
[2024-05-29 20:49:48] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-29 20:49:48] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:49:48] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-29 20:49:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:49:48] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-29 20:49:48] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:49:48] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8366273903132479280
Running compilation step : cd /tmp/ltsmin8366273903132479280;'/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 823 ms.
Running link step : cd /tmp/ltsmin8366273903132479280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin8366273903132479280;'/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/stateBased9058366848406359014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 19 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-29 20:50:03] [INFO ] Invariant cache hit.
[2024-05-29 20:50:03] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-29 20:50:03] [INFO ] Invariant cache hit.
[2024-05-29 20:50:04] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2024-05-29 20:50:04] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-29 20:50:04] [INFO ] Invariant cache hit.
[2024-05-29 20:50:04] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 838 ms. Remains : 401/401 places, 401/401 transitions.
Built C files in :
/tmp/ltsmin16048082341205782413
[2024-05-29 20:50:04] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-29 20:50:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:04] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-29 20:50:04] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:04] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-29 20:50:04] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:04] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16048082341205782413
Running compilation step : cd /tmp/ltsmin16048082341205782413;'/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 789 ms.
Running link step : cd /tmp/ltsmin16048082341205782413;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16048082341205782413;'/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/stateBased1714948628462189724.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-29 20:50:19] [INFO ] Flatten gal took : 35 ms
[2024-05-29 20:50:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:50:19] [INFO ] Time to serialize gal into /tmp/LTL10766390779341323674.gal : 7 ms
[2024-05-29 20:50:19] [INFO ] Time to serialize properties into /tmp/LTL12201949124868578408.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10766390779341323674.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1509548115717746472.hoa' '-atoms' '/tmp/LTL12201949124868578408.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12201949124868578408.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1509548115717746472.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:50:34] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:50:34] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:50:34] [INFO ] Time to serialize gal into /tmp/LTL5030904408490722391.gal : 4 ms
[2024-05-29 20:50:34] [INFO ] Time to serialize properties into /tmp/LTL2256311336179921999.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5030904408490722391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2256311336179921999.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((G(("(p5==0)")||(("(p173==0)")&&(G("(p181==1)")))))||(F("(((p32==1)&&(p34==1))&&(p39==1))"))))
Formula 0 simplified : F(!"(p5==0)" & (!"(p173==0)" | F!"(p181==1)")) & G!"(((p32==1)&&(p34==1))&&(p39==1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-29 20:50:49] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:50:49] [INFO ] Applying decomposition
[2024-05-29 20:50:49] [INFO ] Flatten gal took : 23 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1136246370564422440.txt' '-o' '/tmp/graph1136246370564422440.bin' '-w' '/tmp/graph1136246370564422440.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1136246370564422440.bin' '-l' '-1' '-v' '-w' '/tmp/graph1136246370564422440.weights' '-q' '0' '-e' '0.001'
[2024-05-29 20:50:50] [INFO ] Decomposing Gal with order
[2024-05-29 20:50:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-29 20:50:50] [INFO ] Removed a total of 149 redundant transitions.
[2024-05-29 20:50:50] [INFO ] Flatten gal took : 73 ms
[2024-05-29 20:50:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 20 ms.
[2024-05-29 20:50:50] [INFO ] Time to serialize gal into /tmp/LTL11239532387378496753.gal : 11 ms
[2024-05-29 20:50:50] [INFO ] Time to serialize properties into /tmp/LTL10000023000743015466.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11239532387378496753.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10000023000743015466.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(("(i0.i0.u2.p5==0)")||(("(i10.i0.u86.p173==0)")&&(G("(i10.i1.u90.p181==1)")))))||(F("(((i1.i1.u15.p32==1)&&(i1.i1.u16.p34==1))&&...179
Formula 0 simplified : F(!"(i0.i0.u2.p5==0)" & (!"(i10.i0.u86.p173==0)" | F!"(i10.i1.u90.p181==1)")) & G!"(((i1.i1.u15.p32==1)&&(i1.i1.u16.p34==1))&&(i2.i0...169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.153253,21152,1,0,4644,97,1342,6125,67,157,10685
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ShieldRVt-PT-050A-LTLFireability-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ShieldRVt-PT-050A-LTLFireability-08 finished in 77185 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 U p1)) U p1)||(G(p2) U p0)))'
Support contains 6 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 5 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-29 20:50:50] [INFO ] Computed 201 invariants in 5 ms
[2024-05-29 20:50:50] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-29 20:50:50] [INFO ] Invariant cache hit.
[2024-05-29 20:50:51] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2024-05-29 20:50:51] [INFO ] Invariant cache hit.
[2024-05-29 20:50:51] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 872 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 324 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 6}]], initial=1, aps=[p1:(AND (EQ s195 1) (EQ s204 1) (EQ s210 1)), p0:(AND (EQ s374 1) (EQ s377 1)), p2:(EQ s399 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, 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-050A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-10 finished in 1218 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||X(p1)) U (G((p0||X(p1)))||(!p2&&(p0||X(p1)))))&&G(F(p3))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
[2024-05-29 20:50:51] [INFO ] Invariant cache hit.
[2024-05-29 20:50:51] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-29 20:50:51] [INFO ] Invariant cache hit.
[2024-05-29 20:50:52] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2024-05-29 20:50:52] [INFO ] Invariant cache hit.
[2024-05-29 20:50:52] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 815 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p3), (NOT p3), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s345 1), p3:(OR (EQ s280 0) (EQ s282 0) (EQ s287 0)), p2:(AND (EQ s280 1) (EQ s282 1) (EQ s287 1)), p1:(EQ s107 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 498 ms.
Product exploration explored 100000 steps with 9 reset in 556 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 p0 p3 (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X p3)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 73 ms. Reduced automaton from 6 states, 11 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 689 steps, run visited all 1 properties in 8 ms. (steps per millisecond=86 )
Probabilistic random walk after 689 steps, saw 638 distinct states, run finished after 9 ms. (steps per millisecond=76 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p3 (NOT p2) (NOT p1)), (X (NOT p2)), (X p3), (X (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X p3)), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 10 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p3), (NOT p3)]
Support contains 3 out of 403 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 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 25 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-05-29 20:50:54] [INFO ] Computed 201 invariants in 1 ms
[2024-05-29 20:50:54] [INFO ] Implicit Places using invariants in 214 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 215 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 248 ms. Remains : 401/403 places, 401/402 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 : [p3, (X p3), (X (X p3))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) 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 1) seen :0
Finished probabilistic random walk after 698 steps, run visited all 1 properties in 9 ms. (steps per millisecond=77 )
Probabilistic random walk after 698 steps, saw 642 distinct states, run finished after 9 ms. (steps per millisecond=77 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p3, (X p3), (X (X p3))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 9 reset in 458 ms.
Product exploration explored 100000 steps with 3 reset in 529 ms.
Built C files in :
/tmp/ltsmin11571256853186140691
[2024-05-29 20:50:56] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-29 20:50:56] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:56] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-29 20:50:56] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:56] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-29 20:50:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:50:56] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11571256853186140691
Running compilation step : cd /tmp/ltsmin11571256853186140691;'/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 814 ms.
Running link step : cd /tmp/ltsmin11571256853186140691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin11571256853186140691;'/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/stateBased5826182091579327623.hoa' '--buchi-type=spotba'
LTSmin run took 2477 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050A-LTLFireability-11 finished in 7819 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||(p1&&X(p2)))))'
Support contains 5 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 6 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-29 20:50:59] [INFO ] Computed 201 invariants in 2 ms
[2024-05-29 20:50:59] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 20:50:59] [INFO ] Invariant cache hit.
[2024-05-29 20:51:00] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-29 20:51:00] [INFO ] Invariant cache hit.
[2024-05-29 20:51:00] [INFO ] Dead Transitions using invariants and state equation in 240 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 796 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s179 0), p1:(EQ s15 0), p2:(OR (EQ s84 0) (EQ s85 0) (EQ s88 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 455 ms.
Product exploration explored 100000 steps with 0 reset in 530 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 p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 235 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 89 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 6) 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 6) 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 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Finished probabilistic random walk after 7285 steps, run visited all 6 properties in 119 ms. (steps per millisecond=61 )
Probabilistic random walk after 7285 steps, saw 7098 distinct states, run finished after 120 ms. (steps per millisecond=60 ) properties seen :6
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2)))), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 p2))), (X p0), true, (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p0))]
False Knowledge obtained : [(F (NOT (AND p0 p2))), (F (OR (AND (NOT p0) (NOT p1)) (NOT p2))), (F (AND (NOT p0) p2 p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 14 factoid took 295 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050A-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050A-LTLFireability-12 finished in 3132 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 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 17 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
// Phase 1: matrix 401 rows 402 cols
[2024-05-29 20:51:02] [INFO ] Computed 201 invariants in 2 ms
[2024-05-29 20:51:02] [INFO ] Implicit Places using invariants in 184 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 185 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 211 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s51 1) (EQ s60 1) (EQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 437 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 9 in 0 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ShieldRVt-PT-050A-LTLFireability-13 finished in 692 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(p1)||p0))))'
Support contains 7 out of 403 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 403/403 places, 402/402 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 402 transition count 401
Applied a total of 2 rules in 11 ms. Remains 402 /403 variables (removed 1) and now considering 401/402 (removed 1) transitions.
[2024-05-29 20:51:03] [INFO ] Invariant cache hit.
[2024-05-29 20:51:03] [INFO ] Implicit Places using invariants in 210 ms returned [395]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 212 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/403 places, 401/402 transitions.
Applied a total of 0 rules in 7 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 231 ms. Remains : 401/403 places, 401/402 transitions.
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s293 1) (EQ s3 1) (EQ s12 1) (EQ s18 1)), p0:(OR (EQ s324 0) (EQ s325 0) (EQ s328 0))], 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 30 reset in 451 ms.
Product exploration explored 100000 steps with 24 reset in 522 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 (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 71 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 401 rows 401 cols
[2024-05-29 20:51:04] [INFO ] Computed 200 invariants in 3 ms
[2024-05-29 20:51:05] [INFO ] [Real]Absence check using 200 positive place invariants in 27 ms returned sat
[2024-05-29 20:51:05] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:51:05] [INFO ] [Nat]Absence check using 200 positive place invariants in 28 ms returned sat
[2024-05-29 20:51:05] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:51:05] [INFO ] After 232ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-29 20:51:05] [INFO ] After 373ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 7 out of 401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 401/401 places, 401/401 transitions.
Partial Free-agglomeration rule applied 48 times.
Drop transitions removed 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 401 transition count 401
Drop transitions removed 48 transitions
Redundant transition composition rules discarded 48 transitions
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 401 transition count 353
Applied a total of 96 rules in 23 ms. Remains 401 /401 variables (removed 0) and now considering 353/401 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 401/401 places, 353/401 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 559489 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :{}
Probabilistic random walk after 559489 steps, saw 547522 distinct states, run finished after 3004 ms. (steps per millisecond=186 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 353 rows 401 cols
[2024-05-29 20:51:08] [INFO ] Computed 200 invariants in 6 ms
[2024-05-29 20:51:08] [INFO ] [Real]Absence check using 200 positive place invariants in 26 ms returned sat
[2024-05-29 20:51:09] [INFO ] After 261ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:51:09] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2024-05-29 20:51:09] [INFO ] After 183ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:51:09] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 20:51:09] [INFO ] After 356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 277 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=55 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 110 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 7 out of 401 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 401/401 places, 401/401 transitions.
Applied a total of 0 rules in 8 ms. Remains 401 /401 variables (removed 0) and now considering 401/401 (removed 0) transitions.
// Phase 1: matrix 401 rows 401 cols
[2024-05-29 20:51:09] [INFO ] Computed 200 invariants in 1 ms
[2024-05-29 20:51:09] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-29 20:51:09] [INFO ] Invariant cache hit.
[2024-05-29 20:51:10] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-29 20:51:10] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-29 20:51:10] [INFO ] Invariant cache hit.
[2024-05-29 20:51:10] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 802 ms. Remains : 401/401 places, 401/401 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 p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 69 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-29 20:51:10] [INFO ] Invariant cache hit.
[2024-05-29 20:51:10] [INFO ] [Real]Absence check using 200 positive place invariants in 33 ms returned sat
[2024-05-29 20:51:11] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 20:51:11] [INFO ] [Nat]Absence check using 200 positive place invariants in 30 ms returned sat
[2024-05-29 20:51:11] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 20:51:11] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-29 20:51:11] [INFO ] After 366ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 438 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=36 )
Parikh walk visited 1 properties in 12 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 123 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 30 reset in 445 ms.
Product exploration explored 100000 steps with 30 reset in 513 ms.
Built C files in :
/tmp/ltsmin17294465337221536063
[2024-05-29 20:51:12] [INFO ] Computing symmetric may disable matrix : 401 transitions.
[2024-05-29 20:51:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:51:12] [INFO ] Computing symmetric may enable matrix : 401 transitions.
[2024-05-29 20:51:12] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:51:12] [INFO ] Computing Do-Not-Accords matrix : 401 transitions.
[2024-05-29 20:51:12] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-29 20:51:12] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17294465337221536063
Running compilation step : cd /tmp/ltsmin17294465337221536063;'/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 830 ms.
Running link step : cd /tmp/ltsmin17294465337221536063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin17294465337221536063;'/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/stateBased16890435272777666644.hoa' '--buchi-type=spotba'
LTSmin run took 2302 ms.
FORMULA ShieldRVt-PT-050A-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-050A-LTLFireability-14 finished in 12497 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(X(X(F(p1))))))'
Support contains 1 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 402/402 transitions.
Applied a total of 0 rules in 7 ms. Remains 403 /403 variables (removed 0) and now considering 402/402 (removed 0) transitions.
// Phase 1: matrix 402 rows 403 cols
[2024-05-29 20:51:15] [INFO ] Computed 201 invariants in 1 ms
[2024-05-29 20:51:16] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-05-29 20:51:16] [INFO ] Invariant cache hit.
[2024-05-29 20:51:16] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 542 ms to find 0 implicit places.
[2024-05-29 20:51:16] [INFO ] Invariant cache hit.
[2024-05-29 20:51:16] [INFO ] Dead Transitions using invariants and state equation in 229 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 780 ms. Remains : 403/403 places, 402/402 transitions.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-050A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(EQ s49 1), p0:(EQ s49 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 461 ms.
Product exploration explored 100000 steps with 0 reset in 554 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), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 62 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 545020 steps, run timeout after 3001 ms. (steps per millisecond=181 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 545020 steps, saw 534579 distinct states, run finished after 3002 ms. (steps per millisecond=181 ) properties seen :2
Running SMT prover for 1 properties.
[2024-05-29 20:51:21] [INFO ] Invariant cache hit.
[2024-05-29 20:51:21] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X p0), true, (X (X p0)), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ShieldRVt-PT-050A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ShieldRVt-PT-050A-LTLFireability-15 finished in 5636 ms.
All properties solved by simple procedures.
Total runtime 135262 ms.

BK_STOP 1717015882508

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

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