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.r417-tall-171690555600023.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 Solitaire-PT-SqrCT5x5, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690555600023
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K 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.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 23 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 14:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Apr 12 14:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 12 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 9 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 76K 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 Solitaire-PT-SqrCT5x5-LTLFireability-00
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-01
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-02
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-03
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-04
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-05
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-06
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-07
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-08
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-09
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-10
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-11
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-12
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-13
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-14
FORMULA_NAME Solitaire-PT-SqrCT5x5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717106600126

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=Solitaire-PT-SqrCT5x5
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 22:03:21] [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-30 22:03:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:03:21] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-30 22:03:21] [INFO ] Transformed 51 places.
[2024-05-30 22:03:21] [INFO ] Transformed 84 transitions.
[2024-05-30 22:03:22] [INFO ] Parsed PT model containing 51 places and 84 transitions and 540 arcs in 351 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 10 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-30 22:03:22] [INFO ] Computed 25 invariants in 9 ms
[2024-05-30 22:03:22] [INFO ] Implicit Places using invariants in 142 ms returned []
[2024-05-30 22:03:22] [INFO ] Invariant cache hit.
[2024-05-30 22:03:22] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-30 22:03:22] [INFO ] Invariant cache hit.
[2024-05-30 22:03:22] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 51/51 places, 84/84 transitions.
Support contains 40 out of 51 places after structural reductions.
[2024-05-30 22:03:22] [INFO ] Flatten gal took : 33 ms
[2024-05-30 22:03:22] [INFO ] Flatten gal took : 21 ms
[2024-05-30 22:03:22] [INFO ] Input system was already deterministic with 84 transitions.
Support contains 39 out of 51 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 459 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 26) seen :25
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-30 22:03:22] [INFO ] Invariant cache hit.
[2024-05-30 22:03:22] [INFO ] [Real]Absence check using 25 positive place invariants in 5 ms returned sat
[2024-05-30 22:03:22] [INFO ] After 41ms 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 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:23] [INFO ] Invariant cache hit.
[2024-05-30 22:03:23] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 22:03:23] [INFO ] Invariant cache hit.
[2024-05-30 22:03:23] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-30 22:03:23] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:23] [INFO ] Invariant cache hit.
[2024-05-30 22:03:23] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 51/51 places, 84/84 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 393 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s27 1) (GEQ s42 1) (GEQ s50 1)), p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s7 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 2 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-00 finished in 704 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) U X(p1)))'
Support contains 5 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:24] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:24] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:24] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 215 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s11 1) (GEQ s14 1) (GEQ s50 1)), p1:(AND (GEQ s34 1) (GEQ s38 1) (GEQ s50 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][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-01 finished in 416 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)||G(!p0))&&(G(p2)||X(p1))))'
Support contains 8 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:24] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:24] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 219 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 304 ms :[(OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p1), (OR (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1)), true, p0, (NOT p2)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=p2, acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s15 1) (GEQ s50 1)), p1:(AND (GEQ s19 1) (GEQ s20 1) (GEQ s27 1) (GEQ s50 1)), p0:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s50 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-02 finished in 549 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 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 10 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:24] [INFO ] Invariant cache hit.
[2024-05-30 22:03:25] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-30 22:03:25] [INFO ] Invariant cache hit.
[2024-05-30 22:03:25] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-30 22:03:25] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:25] [INFO ] Invariant cache hit.
[2024-05-30 22:03:25] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 234 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s29 1) (LT s35 1) (LT s38 1) (LT s50 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 4612 reset in 401 ms.
Product exploration explored 100000 steps with 4614 reset in 389 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G p0))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 13 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-03 finished in 1141 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))'
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 9 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-30 22:03:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 51/51 places, 84/84 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 37 ms :[true, (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s40 1) (GEQ s46 1) (GEQ s49 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-04 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 7 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-30 22:03:26] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:26] [INFO ] Invariant cache hit.
[2024-05-30 22:03:26] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 209 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s5 1) (LT s7 1) (LT s50 1) (AND (GEQ s3 1) (GEQ s30 1) (GEQ s35 1) (GEQ s50 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4713 reset in 358 ms.
Product exploration explored 100000 steps with 4729 reset in 346 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-05 finished in 1068 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 U (G(!p0)||p1)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))'
Support contains 12 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:27] [INFO ] Invariant cache hit.
[2024-05-30 22:03:27] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 22:03:27] [INFO ] Invariant cache hit.
[2024-05-30 22:03:27] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
[2024-05-30 22:03:27] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:27] [INFO ] Invariant cache hit.
[2024-05-30 22:03:27] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 217 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND p1 p2)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s30 1) (GEQ s35 1) (GEQ s47 1) (GEQ s50 1)) (AND (GEQ s4 1) (GEQ s32 1) (GEQ s36 1) (GEQ s50 1))), p2:(AND (GEQ s8 1) (GEQ s14 1) (GEQ s2...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4683 reset in 482 ms.
Product exploration explored 100000 steps with 4662 reset in 433 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (NOT (AND p0 (NOT p1) p2))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (OR (AND (NOT p0) p2) (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2)))))), (X (X (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-06 finished in 1423 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 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 11 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:28] [INFO ] Invariant cache hit.
[2024-05-30 22:03:28] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 22:03:28] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-30 22:03:29] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 225 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s13 1) (LT s21 1) (LT s27 1) (LT s50 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 4609 reset in 308 ms.
Product exploration explored 100000 steps with 4602 reset in 312 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 20 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-07 finished in 954 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (G(!p0)||(!p0&&G(!p1)))) U (G(!p0)||((!p0 U (G(!p0)||(!p0&&G(!p1))))&&X(X(!p2))))))'
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:29] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2024-05-30 22:03:29] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 407 ms :[true, p1, (OR p2 p1), (OR (AND p0 p2) (AND p0 p1)), (OR (AND p0 p2) (AND p0 p1)), (AND p1 p0), p0, p0, p0, p0]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=4 dest: 9}], [{ cond=(AND p0 p1), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 8}], [{ cond=p0, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=p0, acceptance={} source=9 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=9 dest: 9}]], initial=7, aps=[p1:(AND (GEQ s1 1) (GEQ s11 1) (GEQ s12 1) (GEQ s50 1)), p2:(AND (GEQ s41 1) (GEQ s46 1) (GEQ s48 1) (GEQ s50 1)), p0:(AND (GEQ s16 1) (GEQ s25 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-09 finished in 621 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 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 210 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s30 1) (GEQ s35 1) (GEQ s47 1) (GEQ s50 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]]
Stuttering criterion allowed to conclude after 31 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-11 finished in 300 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 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
[2024-05-30 22:03:30] [INFO ] Invariant cache hit.
[2024-05-30 22:03:30] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s28 1) (GEQ s35 1) (GEQ s50 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]]
Stuttering criterion allowed to conclude after 87 steps with 6 reset in 1 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-12 finished in 303 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(F(p0))))'
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:31] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-30 22:03:31] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-30 22:03:31] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 204 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s34 1) (GEQ s38 1) (GEQ s50 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][false, false, false]]
Stuttering criterion allowed to conclude after 23 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-13 finished in 345 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!p1&&G(F(!p2)))))'
Support contains 10 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:31] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 22:03:31] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
[2024-05-30 22:03:31] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:03:31] [INFO ] Invariant cache hit.
[2024-05-30 22:03:31] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 186 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR p1 p2), true, p2, p2]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s41 1) (GEQ s44 1) (GEQ s47 1) (GEQ s50 1)), p0:(AND (GEQ s11 1) (GEQ s14 1) (GEQ s16 1) (GEQ s50 1)), p2:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5407 reset in 300 ms.
Product exploration explored 100000 steps with 5414 reset in 316 ms.
Computed a total of 51 stabilizing places and 84 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 84
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND p1 p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), true, (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X p1), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 20 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-14 finished in 1012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F((G(!p2)||p1))))'
Support contains 8 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 84/84 transitions.
Applied a total of 0 rules in 7 ms. Remains 51 /51 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-30 22:03:32] [INFO ] Invariant cache hit.
[2024-05-30 22:03:32] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 22:03:32] [INFO ] Invariant cache hit.
[2024-05-30 22:03:32] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-30 22:03:32] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:03:32] [INFO ] Invariant cache hit.
[2024-05-30 22:03:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 51/51 places, 84/84 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1) p2), (AND (NOT p1) p2)]
Running random walk in product with property : Solitaire-PT-SqrCT5x5-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s14 1) (GEQ s20 1) (GEQ s50 1)), p1:(OR (AND (GEQ s29 1) (GEQ s41 1) (GEQ s50 1)) (AND (GEQ s29 1) (GEQ s35 1) (GEQ s38 1) (GEQ s5...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-SqrCT5x5-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-SqrCT5x5-LTLFireability-15 finished in 297 ms.
All properties solved by simple procedures.
Total runtime 11079 ms.

BK_STOP 1717106613912

--------------------
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="Solitaire-PT-SqrCT5x5"
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 Solitaire-PT-SqrCT5x5, 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 r417-tall-171690555600023"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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