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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 12 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Apr 12 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 14:22 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 77K 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-EngCT7x7-LTLFireability-00
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-01
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-02
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-03
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-04
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-05
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-06
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-07
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-08
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-09
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-10
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-11
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-12
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-13
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-14
FORMULA_NAME Solitaire-PT-EngCT7x7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717106532846

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-EngCT7x7
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 22:02:14] [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:02:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:02:14] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-30 22:02:14] [INFO ] Transformed 67 places.
[2024-05-30 22:02:14] [INFO ] Transformed 76 transitions.
[2024-05-30 22:02:14] [INFO ] Parsed PT model containing 67 places and 76 transitions and 532 arcs in 121 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 4 formulas.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
// Phase 1: matrix 76 rows 67 cols
[2024-05-30 22:02:14] [INFO ] Computed 34 invariants in 13 ms
[2024-05-30 22:02:15] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-05-30 22:02:15] [INFO ] Invariant cache hit.
[2024-05-30 22:02:15] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2024-05-30 22:02:15] [INFO ] Invariant cache hit.
[2024-05-30 22:02:15] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 67/67 places, 76/76 transitions.
Support contains 49 out of 67 places after structural reductions.
[2024-05-30 22:02:15] [INFO ] Flatten gal took : 35 ms
[2024-05-30 22:02:15] [INFO ] Flatten gal took : 21 ms
[2024-05-30 22:02:15] [INFO ] Input system was already deterministic with 76 transitions.
Support contains 47 out of 67 places (down from 49) after GAL structural reductions.
Finished random walk after 307 steps, including 11 resets, run visited all 26 properties in 23 ms. (steps per millisecond=13 )
Parikh walk visited 0 properties in 1 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:15] [INFO ] Invariant cache hit.
[2024-05-30 22:02:16] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-30 22:02:16] [INFO ] Invariant cache hit.
[2024-05-30 22:02:16] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-30 22:02:16] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:02:16] [INFO ] Invariant cache hit.
[2024-05-30 22:02:16] [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 253 ms. Remains : 67/67 places, 76/76 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 291 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-00 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 s10 1) (LT s14 1) (LT s17 1) (LT s66 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 4822 reset in 434 ms.
Product exploration explored 100000 steps with 4790 reset in 354 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 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-EngCT7x7-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-00 finished in 1442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||(!p1&&X((!p1 U X(!p1))))))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:17] [INFO ] Invariant cache hit.
[2024-05-30 22:02:17] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-30 22:02:17] [INFO ] Invariant cache hit.
[2024-05-30 22:02:17] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2024-05-30 22:02:17] [INFO ] Invariant cache hit.
[2024-05-30 22:02:17] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 286 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 1}]], initial=0, aps=[p0:(OR (LT s43 1) (LT s46 1) (LT s49 1) (LT s66 1)), p1:(AND (GEQ s21 1) (GEQ s24 1) (GEQ s27 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 4635 reset in 405 ms.
Product exploration explored 100000 steps with 4650 reset in 330 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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 p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 5 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-04 finished in 1300 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:18] [INFO ] Invariant cache hit.
[2024-05-30 22:02:18] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-30 22:02:18] [INFO ] Invariant cache hit.
[2024-05-30 22:02:18] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-05-30 22:02:18] [INFO ] Invariant cache hit.
[2024-05-30 22:02:18] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 224 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 149 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s5 1) (GEQ s9 1) (GEQ s14 1) (GEQ s66 1)), p1:(OR (LT s11 1) (LT s14 1) (LT s16 1) (LT s66 1) (AND (OR (LT s19 1) (LT s26 1) (LT s30 1) (LT s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-05 finished in 386 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((G(p1)||X(p2)||p0)))))'
Support contains 10 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:19] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:19] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:19] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 225 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=5, aps=[p2:(AND (GEQ s18 1) (GEQ s31 1) (GEQ s34 1) (GEQ s66 1)), p0:(OR (LT s15 1) (LT s23 1) (LT s24 1) (LT s66 1)), p1:(AND (GEQ s11 1) (GEQ s14 1) (GEQ s16 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-06 finished in 492 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((G(F((p0||G(F(p1))))) U p2)))'
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 13 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:19] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:19] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2024-05-30 22:02:19] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:19] [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 210 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(NOT p2), acceptance={0} source=3 dest: 2}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s17 1) (GEQ s20 1) (GEQ s33 1) (GEQ s66 1)), p0:(AND (GEQ s35 1) (GEQ s58 1) (GEQ s64 1) (GEQ s66 1)), p1:(AND (GEQ s17 1) (GEQ s29 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 55 steps with 5 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-08 finished in 379 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(G(!p0)) U p1)))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:19] [INFO ] Invariant cache hit.
[2024-05-30 22:02:20] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 22:02:20] [INFO ] Invariant cache hit.
[2024-05-30 22:02:20] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2024-05-30 22:02:20] [INFO ] Invariant cache hit.
[2024-05-30 22:02:20] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), p0]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s14 1) (GEQ s23 1) (GEQ s66 1)), p0:(AND (GEQ s16 1) (GEQ s29 1) (GEQ s36 1) (GEQ s66 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 5551 reset in 316 ms.
Product exploration explored 100000 steps with 5517 reset in 317 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 192 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 10 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=5 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 4 factoid took 296 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
[2024-05-30 22:02:21] [INFO ] Invariant cache hit.
[2024-05-30 22:02:21] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-30 22:02:21] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 22:02:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:02:21] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-30 22:02:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:02:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2024-05-30 22:02:21] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 22:02:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:02:22] [INFO ] [Nat]Absence check using state equation in 309 ms returned sat
[2024-05-30 22:02:22] [INFO ] Computed and/alt/rep : 68/368/68 causal constraints (skipped 4 transitions) in 12 ms.
[2024-05-30 22:02:22] [INFO ] Added : 26 causal constraints over 6 iterations in 273 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 67 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 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:22] [INFO ] Invariant cache hit.
[2024-05-30 22:02:22] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-30 22:02:22] [INFO ] Invariant cache hit.
[2024-05-30 22:02:22] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2024-05-30 22:02:22] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:02:22] [INFO ] Invariant cache hit.
[2024-05-30 22:02:22] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 236 ms. Remains : 67/67 places, 76/76 transitions.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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 : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 26 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
[2024-05-30 22:02:23] [INFO ] Invariant cache hit.
[2024-05-30 22:02:23] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2024-05-30 22:02:23] [INFO ] [Real]Absence check using 33 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 22:02:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-30 22:02:23] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-30 22:02:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 22:02:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-30 22:02:23] [INFO ] [Nat]Absence check using 33 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 22:02:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-30 22:02:23] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2024-05-30 22:02:23] [INFO ] Computed and/alt/rep : 68/368/68 causal constraints (skipped 4 transitions) in 6 ms.
[2024-05-30 22:02:23] [INFO ] Added : 26 causal constraints over 6 iterations in 241 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering criterion allowed to conclude after 55 steps with 3 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-09 finished in 3873 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 (F(p2)||G((p1 U p0)))))'
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:23] [INFO ] Invariant cache hit.
[2024-05-30 22:02:23] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-30 22:02:23] [INFO ] Invariant cache hit.
[2024-05-30 22:02:23] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2024-05-30 22:02:23] [INFO ] Invariant cache hit.
[2024-05-30 22:02:24] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p2) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0) p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 7}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=7 dest: 6}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s34 1) (GEQ s59 1) (GEQ s64 1) (GEQ s66 1)), p0:(AND (GEQ s29 1) (GEQ s34 1) (GEQ s65 1) (GEQ s66 1)), p1:(AND (GEQ s4 1) (GEQ s7 1) (GEQ s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-10 finished in 525 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) U p1))||X(F(p2))))'
Support contains 9 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:24] [INFO ] Invariant cache hit.
[2024-05-30 22:02:24] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-30 22:02:24] [INFO ] Invariant cache hit.
[2024-05-30 22:02:24] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-30 22:02:24] [INFO ] Invariant cache hit.
[2024-05-30 22:02:24] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s16 1) (GEQ s29 1) (GEQ s36 1) (GEQ s66 1)), p0:(AND (GEQ s36 1) (GEQ s43 1) (GEQ s51 1) (GEQ s66 1)), p2:(OR (LT s40 1) (LT s44 1) (LT s48 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][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 162 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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) p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p2), (F (G (NOT p1))), (F (G (NOT p0))), (F (G p2))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 11 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-11 finished in 718 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(X(p0)) U p1)||G((G(p2)||p1))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:25] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-30 22:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:25] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
[2024-05-30 22:02:25] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:25] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 204 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p2 (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s34 1) (GEQ s45 1) (GEQ s49 1) (GEQ s66 1)), p2:(OR (AND (GEQ s45 1) (GEQ s60 1) (GEQ s62 1) (GEQ s66 1)) (AND (GEQ s11 1) (GEQ s14 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 42 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-12 finished in 400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||(p1 U (!p0 U (F(!p0)&&p2)))))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:25] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 22:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:25] [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:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 281 ms :[true, (AND (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p2) p0), (OR (NOT p2) p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), p0]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 p0), acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p2 p0), acceptance={0} source=4 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=6 dest: 6}], [{ cond=p0, acceptance={0} source=7 dest: 7}]], initial=1, aps=[p2:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s36 1) (GEQ s66 1)), p0:(OR (LT s40 1) (LT s44 1) (LT s48 1) (LT s66 1)), p1:(AND (GEQ s4 1) (GEQ s6 1) (GEQ s36 1) (GE...], 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, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 1 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-13 finished in 490 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 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:25] [INFO ] Invariant cache hit.
[2024-05-30 22:02:26] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 22:02:26] [INFO ] Invariant cache hit.
[2024-05-30 22:02:26] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2024-05-30 22:02:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-30 22:02:26] [INFO ] Invariant cache hit.
[2024-05-30 22:02:26] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-14 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 s19 1) (LT s22 1) (LT s33 1) (LT 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 3952 reset in 273 ms.
Product exploration explored 100000 steps with 3948 reset in 279 ms.
Computed a total of 67 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 76
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-EngCT7x7-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-14 finished in 858 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U X((G(p1)&&X(p2)))))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 76/76 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-05-30 22:02:26] [INFO ] Invariant cache hit.
[2024-05-30 22:02:26] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-30 22:02:26] [INFO ] Invariant cache hit.
[2024-05-30 22:02:26] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-30 22:02:26] [INFO ] Invariant cache hit.
[2024-05-30 22:02:27] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 162 ms. Remains : 67/67 places, 76/76 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : Solitaire-PT-EngCT7x7-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 7}, { cond=p1, acceptance={} source=3 dest: 8}, { cond=p1, acceptance={0} source=3 dest: 9}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=7 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(NOT p1), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 7}, { cond=(AND p1 (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s40 1) (GEQ s50 1) (GEQ s66 1)), p1:(AND (GEQ s5 1) (GEQ s9 1) (GEQ s14 1) (GEQ s66 1)), p2:(OR (NOT (AND (GEQ s9 1) (GEQ s29 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 2 reset in 0 ms.
FORMULA Solitaire-PT-EngCT7x7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-EngCT7x7-LTLFireability-15 finished in 620 ms.
All properties solved by simple procedures.
Total runtime 12813 ms.

BK_STOP 1717106548916

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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-EngCT7x7"
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-EngCT7x7, 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-171690555500003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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