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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Apr 12 14:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 40K Apr 12 14:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 14:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K 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 92K 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-FrnCT7x7-LTLFireability-00
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-01
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-02
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-03
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-04
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-05
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-06
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-07
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-08
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-09
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-10
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-11
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-12
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-13
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-14
FORMULA_NAME Solitaire-PT-FrnCT7x7-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717106561023

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-FrnCT7x7
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-30 22:02:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-30 22:02:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 22:02:42] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2024-05-30 22:02:42] [INFO ] Transformed 75 places.
[2024-05-30 22:02:42] [INFO ] Transformed 92 transitions.
[2024-05-30 22:02:42] [INFO ] Parsed PT model containing 75 places and 92 transitions and 644 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 10 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 75 cols
[2024-05-30 22:02:42] [INFO ] Computed 38 invariants in 14 ms
[2024-05-30 22:02:43] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-30 22:02:43] [INFO ] Invariant cache hit.
[2024-05-30 22:02:43] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 463 ms to find 0 implicit places.
[2024-05-30 22:02:43] [INFO ] Invariant cache hit.
[2024-05-30 22:02:43] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 547 ms. Remains : 75/75 places, 92/92 transitions.
Support contains 56 out of 75 places after structural reductions.
[2024-05-30 22:02:43] [INFO ] Flatten gal took : 39 ms
[2024-05-30 22:02:43] [INFO ] Flatten gal took : 23 ms
[2024-05-30 22:02:43] [INFO ] Input system was already deterministic with 92 transitions.
Finished random walk after 273 steps, including 10 resets, run visited all 34 properties in 35 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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' '!(X(F((G(p1)||p0))))'
Support contains 6 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:43] [INFO ] Invariant cache hit.
[2024-05-30 22:02:44] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 22:02:44] [INFO ] Invariant cache hit.
[2024-05-30 22:02:44] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-30 22:02:44] [INFO ] Invariant cache hit.
[2024-05-30 22:02:44] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 255 ms. Remains : 75/75 places, 92/92 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 204 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s3 1) (LT s6 1) (LT s11 1) (LT s74 1)), p0:(OR (LT s4 1) (LT s9 1) (LT s11 1) (LT s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 284 ms.
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-00 finished in 1073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(((p1 U p2)&&p0))||G(p3))))'
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 11 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-30 22:02:45] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [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 242 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s18 1) (GEQ s29 1) (GEQ s38 1) (GEQ s74 1)), p3:(AND (GEQ s42 1) (GEQ s51 1) (GEQ s69 1) (GEQ s74 1)), p2:(AND (GEQ s37 1) (GEQ s40 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 28 steps with 1 reset in 2 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-02 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((F(G(p1))||p0)))'
Support contains 9 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s5 1) (LT s8 1) (LT s11 1) (LT s74 1) (AND (GEQ s59 1) (GEQ s65 1) (GEQ s68 1) (GEQ s74 1))), p1:(AND (GEQ s6 1) (GEQ s11 1) (GEQ s43 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 31 steps with 4 reset in 2 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-03 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((p0 U X(G(!p1)))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:45] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-30 22:02:45] [INFO ] Invariant cache hit.
[2024-05-30 22:02:46] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-30 22:02:46] [INFO ] Invariant cache hit.
[2024-05-30 22:02:46] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 312 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, p1, p1, true]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s3 1) (GEQ s17 1) (GEQ s74 1)), p0:(AND (GEQ s6 1) (GEQ s45 1) (GEQ s52 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 276 steps with 10 reset in 7 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-04 finished in 475 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||G(p1)||(F(p3)&&p2))))'
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:46] [INFO ] Invariant cache hit.
[2024-05-30 22:02:46] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-30 22:02:46] [INFO ] Invariant cache hit.
[2024-05-30 22:02:46] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-30 22:02:46] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:02:46] [INFO ] Invariant cache hit.
[2024-05-30 22:02:46] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 252 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 78 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s59 1) (LT s62 1) (LT s64 1) (LT s74 1)), p0:(AND (GEQ s42 1) (GEQ s49 1) (GEQ s57 1) (GEQ s74 1)), p2:(AND (GEQ s21 1) (GEQ s29 1) (GEQ s30 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 6264 reset in 486 ms.
Product exploration explored 100000 steps with 6206 reset in 528 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p1 (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2 (NOT p3)))), (X (AND p1 (NOT p0) (NOT p2))), (X (AND p1 (NOT p0) (NOT p3))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) p2 (NOT p3))))), (F (G p1)), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p3)))]
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 p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p0) (NOT p3))))), (X (X (AND (NOT p1) (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 14 ms. Reduced automaton from 2 states, 5 edges and 4 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-05 finished in 1408 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)&&(G(!p1) U !p2)))'
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 5 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:47] [INFO ] Invariant cache hit.
[2024-05-30 22:02:47] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-30 22:02:47] [INFO ] Invariant cache hit.
[2024-05-30 22:02:47] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-30 22:02:47] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:02:47] [INFO ] Invariant cache hit.
[2024-05-30 22:02:47] [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 255 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) p2), true, (NOT p0), p1, p2]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=4 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (GEQ s23 1) (GEQ s35 1) (GEQ s38 1) (GEQ s74 1)), p1:(AND (GEQ s9 1) (GEQ s49 1) (GEQ s52 1) (GEQ s74 1)), p0:(OR (AND (GEQ s37 1) (GEQ s60 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 34 steps with 1 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-06 finished in 424 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((X(!p1)&&p0))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:48] [INFO ] Invariant cache hit.
[2024-05-30 22:02:48] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-30 22:02:48] [INFO ] Invariant cache hit.
[2024-05-30 22:02:48] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-30 22:02:48] [INFO ] Invariant cache hit.
[2024-05-30 22:02:48] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 240 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s4 1) (GEQ s13 1) (GEQ s34 1) (GEQ s74 1)), p1:(AND (GEQ s6 1) (GEQ s45 1) (GEQ s52 1) (GEQ s74 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-08 finished in 389 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)))&&(G(p1)||G(p2))))'
Support contains 10 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:48] [INFO ] Invariant cache hit.
[2024-05-30 22:02:48] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 22:02:48] [INFO ] Invariant cache hit.
[2024-05-30 22:02:48] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2024-05-30 22:02:48] [INFO ] Invariant cache hit.
[2024-05-30 22:02:48] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 235 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p2), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 6}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (LT s58 1) (LT s63 1) (LT s64 1) (LT s74 1)), p2:(OR (LT s25 1) (LT s32 1) (LT s36 1) (LT s74 1)), p0:(OR (LT s4 1) (LT s13 1) (LT s16 1) (LT s74 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 242 steps with 17 reset in 2 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-09 finished in 602 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||X(!p1))) U (G(F((!p0||X(!p1))))||(F((!p0||X(!p1)))&&p2))))'
Support contains 11 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:49] [INFO ] Invariant cache hit.
[2024-05-30 22:02:49] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-30 22:02:49] [INFO ] Invariant cache hit.
[2024-05-30 22:02:49] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2024-05-30 22:02:49] [INFO ] Invariant cache hit.
[2024-05-30 22:02:49] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 0}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(AND (GEQ s6 1) (GEQ s13 1) (GEQ s21 1) (GEQ s74 1)), p0:(OR (AND (GEQ s13 1) (GEQ s20 1) (GEQ s28 1) (GEQ s74 1)) (AND (GEQ s6 1) (GEQ s11 1) (GEQ s43...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9444 reset in 386 ms.
Product exploration explored 100000 steps with 9425 reset in 414 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p2) (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (OR (AND p0 p1) (AND p0 p2)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 22 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-10 finished in 1261 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((X(p1) U p2))&&X((p3 U p4))&&p0)))'
Support contains 13 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:50] [INFO ] Invariant cache hit.
[2024-05-30 22:02:50] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-30 22:02:50] [INFO ] Invariant cache hit.
[2024-05-30 22:02:50] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-30 22:02:50] [INFO ] Invariant cache hit.
[2024-05-30 22:02:50] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 261 ms :[(OR (NOT p4) (NOT p2) (NOT p0)), (OR (NOT p4) (NOT p2) (NOT p0)), true, (NOT p4), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s45 1) (GEQ s46 1) (GEQ s56 1) (GEQ s74 1)), p2:(AND (GEQ s42 1) (GEQ s51 1) (GEQ s69 1) (GEQ s74 1)), p4:(OR (AND (GEQ s45 1) (GEQ s46 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-11 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 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 8 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:50] [INFO ] Invariant cache hit.
[2024-05-30 22:02:50] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 22:02:50] [INFO ] Invariant cache hit.
[2024-05-30 22:02:51] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-05-30 22:02:51] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:02:51] [INFO ] Invariant cache hit.
[2024-05-30 22:02:51] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s8 1) (LT s48 1) (LT s52 1) (LT s74 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 3875 reset in 347 ms.
Product exploration explored 100000 steps with 3882 reset in 363 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 18 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-FrnCT7x7-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-13 finished in 1088 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(p2))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:51] [INFO ] Invariant cache hit.
[2024-05-30 22:02:52] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-30 22:02:52] [INFO ] Invariant cache hit.
[2024-05-30 22:02:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-30 22:02:52] [INFO ] Invariant cache hit.
[2024-05-30 22:02:52] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 238 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p2) p1), p1, (NOT p2)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND p2 p1) (AND p1 p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(AND (OR (LT s37 1) (LT s60 1) (LT s64 1) (LT s74 1)) (OR (LT s22 1) (LT s27 1) (LT s39 1) (LT s74 1))), p1:(AND (GEQ s37 1) (GEQ s60 1) (GEQ s64 1) (G...], 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 8366 reset in 336 ms.
Product exploration explored 100000 steps with 8359 reset in 368 ms.
Computed a total of 75 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 75 transition count 92
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 p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X p2), (X (NOT (OR (AND p2 p1) (AND p1 p0)))), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (OR (AND p2 p1) (AND p1 p0))))), (X (X (NOT (AND p2 p1 (NOT p0))))), (F (G p2)), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 289 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-14 finished in 1421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 7 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 92/92 transitions.
Applied a total of 0 rules in 12 ms. Remains 75 /75 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-30 22:02:53] [INFO ] Invariant cache hit.
[2024-05-30 22:02:53] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-30 22:02:53] [INFO ] Invariant cache hit.
[2024-05-30 22:02:53] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-30 22:02:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-30 22:02:53] [INFO ] Invariant cache hit.
[2024-05-30 22:02:53] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 75/75 places, 92/92 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Solitaire-PT-FrnCT7x7-LTLFireability-15 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s35 1) (LT s40 1) (LT s58 1) (LT s74 1)), p1:(AND (GEQ s6 1) (GEQ s13 1) (GEQ s53 1) (GEQ s74 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 0 ms.
FORMULA Solitaire-PT-FrnCT7x7-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Solitaire-PT-FrnCT7x7-LTLFireability-15 finished in 385 ms.
All properties solved by simple procedures.
Total runtime 11390 ms.

BK_STOP 1717106574973

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

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