About the Execution of 2023-gold for NQueens-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 460.067 | 84536.00 | 94455.00 | 595.50 | TFFTFTTTTFFFFFTT | normal |
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.r263-tall-171654372300228.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 NQueens-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372300228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 19 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 03:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 03:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 12 03:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 12 03:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 134K 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 NQueens-PT-12-LTLFireability-00
FORMULA_NAME NQueens-PT-12-LTLFireability-01
FORMULA_NAME NQueens-PT-12-LTLFireability-02
FORMULA_NAME NQueens-PT-12-LTLFireability-03
FORMULA_NAME NQueens-PT-12-LTLFireability-04
FORMULA_NAME NQueens-PT-12-LTLFireability-05
FORMULA_NAME NQueens-PT-12-LTLFireability-06
FORMULA_NAME NQueens-PT-12-LTLFireability-07
FORMULA_NAME NQueens-PT-12-LTLFireability-08
FORMULA_NAME NQueens-PT-12-LTLFireability-09
FORMULA_NAME NQueens-PT-12-LTLFireability-10
FORMULA_NAME NQueens-PT-12-LTLFireability-11
FORMULA_NAME NQueens-PT-12-LTLFireability-12
FORMULA_NAME NQueens-PT-12-LTLFireability-13
FORMULA_NAME NQueens-PT-12-LTLFireability-14
FORMULA_NAME NQueens-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716682335889
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=NQueens-PT-12
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-26 00:12:17] [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-26 00:12:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 00:12:17] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-26 00:12:17] [INFO ] Transformed 216 places.
[2024-05-26 00:12:17] [INFO ] Transformed 144 transitions.
[2024-05-26 00:12:17] [INFO ] Found NUPN structural information;
[2024-05-26 00:12:17] [INFO ] Parsed PT model containing 216 places and 144 transitions and 720 arcs in 123 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 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-12-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 144/144 transitions.
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 70 transition count 144
Applied a total of 144 rules in 12 ms. Remains 70 /214 variables (removed 144) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 70 cols
[2024-05-26 00:12:17] [INFO ] Computed 7 invariants in 29 ms
[2024-05-26 00:12:18] [INFO ] Implicit Places using invariants in 437 ms returned []
[2024-05-26 00:12:18] [INFO ] Invariant cache hit.
[2024-05-26 00:12:20] [INFO ] Implicit Places using invariants and state equation in 2682 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3145 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 69/214 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3159 ms. Remains : 69/214 places, 144/144 transitions.
Support contains 53 out of 69 places after structural reductions.
[2024-05-26 00:12:21] [INFO ] Flatten gal took : 40 ms
[2024-05-26 00:12:21] [INFO ] Flatten gal took : 19 ms
[2024-05-26 00:12:21] [INFO ] Input system was already deterministic with 144 transitions.
Finished random walk after 13 steps, including 1 resets, run visited all 33 properties in 10 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 69 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 69 transition count 144
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((p0 U (p1||F(G(!p1))))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 69 cols
[2024-05-26 00:12:21] [INFO ] Computed 6 invariants in 14 ms
[2024-05-26 00:12:21] [INFO ] Implicit Places using invariants in 278 ms returned []
[2024-05-26 00:12:21] [INFO ] Invariant cache hit.
[2024-05-26 00:12:24] [INFO ] Implicit Places using invariants and state equation in 2706 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2988 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2999 ms. Remains : 67/69 places, 144/144 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 201 ms :[false, p1]
Running random walk in product with property : NQueens-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s11 1) (EQ s19 1) (EQ s38 1) (EQ s62 1)), p0:(AND (EQ s0 1) (EQ s18 1) (EQ s28 1) (EQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8980 reset in 1073 ms.
Product exploration explored 100000 steps with 8978 reset in 1026 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (X (X p1)), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-00 finished in 5489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(p1)&&X(X(G(p2))))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:27] [INFO ] Invariant cache hit.
[2024-05-26 00:12:27] [INFO ] Implicit Places using invariants in 246 ms returned []
[2024-05-26 00:12:27] [INFO ] Invariant cache hit.
[2024-05-26 00:12:29] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2086 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2094 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s8 1) (EQ s21 1) (EQ s33 1) (EQ s61 1)), p0:(AND (EQ s6 1) (EQ s18 1) (EQ s34 1) (EQ s56 1)), p2:(OR (EQ s8 0) (EQ s21 0) (EQ s33 0) (EQ s61 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-01 finished in 2303 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 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:29] [INFO ] Invariant cache hit.
[2024-05-26 00:12:29] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-26 00:12:29] [INFO ] Invariant cache hit.
[2024-05-26 00:12:32] [INFO ] Implicit Places using invariants and state equation in 2645 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2922 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2932 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s15 1) (EQ s41 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-02 finished in 3002 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)||((!p1||G(!p0))&&X(X(F(!p2))))||G(!p1))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:32] [INFO ] Invariant cache hit.
[2024-05-26 00:12:32] [INFO ] Implicit Places using invariants in 228 ms returned []
[2024-05-26 00:12:32] [INFO ] Invariant cache hit.
[2024-05-26 00:12:36] [INFO ] Implicit Places using invariants and state equation in 3669 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3898 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3904 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 274 ms :[(AND p0 p1), (AND p1 p0 p2), (AND p0 p1), (AND p1 p0 p2), (AND p1 p0 p2), (AND p1 p0 p2)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (EQ s9 1) (EQ s15 1) (EQ s40 1) (EQ s56 1)), p0:(AND (EQ s1 1) (EQ s20 1) (EQ s27 1) (EQ s53 1)), p2:(AND (EQ s10 1) (EQ s12 1) (EQ s44 1) (EQ s54...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 15936 reset in 1482 ms.
Product exploration explored 100000 steps with 15936 reset in 1497 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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 p2), true, (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR (NOT p1) (NOT p0))), (X (NOT (OR (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND p1 p0 p2))), (X (X (NOT (AND p1 p0 p2)))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR (NOT p1) (NOT p0)))), (X (X (NOT (OR (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0 p2))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (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 5 factoid took 17 ms. Reduced automaton from 6 states, 16 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-03 finished in 7281 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&&X(p1)))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:39] [INFO ] Invariant cache hit.
[2024-05-26 00:12:39] [INFO ] Implicit Places using invariants in 237 ms returned []
[2024-05-26 00:12:39] [INFO ] Invariant cache hit.
[2024-05-26 00:12:42] [INFO ] Implicit Places using invariants and state equation in 3085 ms returned [24]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 3325 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/69 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3329 ms. Remains : 68/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-04 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) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (EQ s7 1) (EQ s23 1) (EQ s30 1) (EQ s63 1)) (AND (EQ s0 1) (EQ s12 1) (EQ s34 1) (EQ s45 1))), p1:(AND (EQ s0 1) (EQ s12 1) (EQ s34 1) (EQ s45...], 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 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-04 finished in 3467 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||F(!p1)))'
Support contains 7 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 8 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:43] [INFO ] Invariant cache hit.
[2024-05-26 00:12:43] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-05-26 00:12:43] [INFO ] Invariant cache hit.
[2024-05-26 00:12:47] [INFO ] Implicit Places using invariants and state equation in 4032 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4298 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4309 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 83 ms :[p1, (AND p1 p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (EQ s8 1) (EQ s16 1) (EQ s38 1) (EQ s56 1)), p0:(AND (EQ s8 1) (EQ s14 1) (EQ s40 1) (EQ s54 1))], 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][true, true]]
Product exploration explored 100000 steps with 24047 reset in 1550 ms.
Product exploration explored 100000 steps with 24097 reset in 1560 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-05 finished in 7615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (p1 U G(p0)))||F(p2)))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:50] [INFO ] Invariant cache hit.
[2024-05-26 00:12:50] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-26 00:12:50] [INFO ] Invariant cache hit.
[2024-05-26 00:12:54] [INFO ] Implicit Places using invariants and state equation in 3315 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3586 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 10 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3602 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s21 1) (EQ s34 1) (EQ s62 1)), p2:(OR (EQ s11 0) (EQ s18 0) (EQ s39 0) (EQ s61 0)), p1:(AND (EQ s11 1) (EQ s18 1) (EQ s39 1) (EQ s61...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22362 reset in 1569 ms.
Product exploration explored 100000 steps with 22206 reset in 1598 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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 p2) p1), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (F (G (NOT p0))), (F (G p2)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (NOT p2)), (X p2), (X (AND p0 p1 (NOT p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 18 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-06 finished in 7086 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||F(p1)))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:12:57] [INFO ] Invariant cache hit.
[2024-05-26 00:12:58] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-26 00:12:58] [INFO ] Invariant cache hit.
[2024-05-26 00:13:02] [INFO ] Implicit Places using invariants and state equation in 4153 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4436 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 4443 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s12 1) (EQ s38 1) (EQ s48 1)), p1:(OR (NEQ s0 1) (NEQ s13 1) (NEQ s33 1) (NEQ s45 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 10443 reset in 1067 ms.
Product exploration explored 100000 steps with 10462 reset in 1084 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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)), (F (G (NOT p0))), (F (G p1))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (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 3 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-07 finished in 6784 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((((X(!p0)&&G(!p1)&&F(!p2))||G((!p1&&X(!p0)))) U X(!p2)))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:13:04] [INFO ] Invariant cache hit.
[2024-05-26 00:13:04] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-26 00:13:04] [INFO ] Invariant cache hit.
[2024-05-26 00:13:07] [INFO ] Implicit Places using invariants and state equation in 2219 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2455 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2470 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 247 ms :[p2, p2, (AND p1 p2), p2, false]
Running random walk in product with property : NQueens-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0, 1} source=0 dest: 1}, { cond=(NOT p1), acceptance={1} source=0 dest: 2}, { cond=p1, acceptance={0, 1} source=0 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={1} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=2 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s19 1) (EQ s27 1) (EQ s51 1)), p2:(AND (EQ s9 1) (EQ s16 1) (EQ s39 1) (EQ s57 1)), p0:(AND (EQ s6 1) (EQ s15 1) (EQ s37 1) (EQ s53 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 20967 reset in 1586 ms.
Product exploration explored 100000 steps with 20836 reset in 1606 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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 p2 p0), true, (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 p2)), (X (NOT (AND p1 p2))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (AND p2 p0)), (X (NOT (AND p2 p0))), (X (X (NOT p1))), (X (X p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND p2 p0))), (X (X (NOT (AND p2 p0))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 5 states, 20 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-08 finished in 6031 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U X(G(p1)))))'
Support contains 10 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:13:10] [INFO ] Invariant cache hit.
[2024-05-26 00:13:10] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-26 00:13:10] [INFO ] Invariant cache hit.
[2024-05-26 00:13:17] [INFO ] Implicit Places using invariants and state equation in 6219 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6481 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 6489 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s21 1) (EQ s32 1) (EQ s60 1)), p0:(AND (EQ s11 1) (EQ s17 1) (EQ s40 1) (EQ s60 1) (EQ s16 1) (EQ s41 1) (EQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-09 finished in 6663 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||(F(p1)&&X(p2))))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:13:17] [INFO ] Invariant cache hit.
[2024-05-26 00:13:17] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-26 00:13:17] [INFO ] Invariant cache hit.
[2024-05-26 00:13:23] [INFO ] Implicit Places using invariants and state equation in 6017 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6275 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6288 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s4 1) (EQ s17 1) (EQ s33 1) (EQ s53 1) (OR (EQ s9 0) (EQ s15 0) (EQ s40 0) (EQ s56 0))), p1:(AND (EQ s9 1) (EQ s15 1) (EQ s40 1) (EQ s56 1)), ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 2 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-10 finished in 6443 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||X(G(p1)))))'
Support contains 8 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:13:23] [INFO ] Invariant cache hit.
[2024-05-26 00:13:23] [INFO ] Implicit Places using invariants in 254 ms returned []
[2024-05-26 00:13:23] [INFO ] Invariant cache hit.
[2024-05-26 00:13:26] [INFO ] Implicit Places using invariants and state equation in 2970 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3228 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3233 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-12 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s2 1) (EQ s12 1) (EQ s36 1) (EQ s46 1)), p1:(AND (EQ s3 1) (EQ s19 1) (EQ s30 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 8 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-12 finished in 3392 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(X(p1))||G(p2))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:13:27] [INFO ] Invariant cache hit.
[2024-05-26 00:13:27] [INFO ] Implicit Places using invariants in 218 ms returned []
[2024-05-26 00:13:27] [INFO ] Invariant cache hit.
[2024-05-26 00:13:29] [INFO ] Implicit Places using invariants and state equation in 2049 ms returned [46]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 2271 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 68/69 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 68 /68 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2279 ms. Remains : 68/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 283 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p1), true, (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 6}], [{ cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 5}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s21 1) (EQ s27 1) (EQ s55 1)), p2:(OR (EQ s11 0) (EQ s17 0) (EQ s41 0) (EQ s61 0)), p1:(AND (EQ s0 1) (EQ s23 1) (EQ s24 1) (EQ s56 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-13 finished in 2583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((X(p0)||G(p1)))&&F(p2))))'
Support contains 12 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 144/144 (removed 0) transitions.
[2024-05-26 00:13:29] [INFO ] Invariant cache hit.
[2024-05-26 00:13:29] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-26 00:13:29] [INFO ] Invariant cache hit.
[2024-05-26 00:13:35] [INFO ] Implicit Places using invariants and state equation in 6027 ms returned [24, 46]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 6262 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/69 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6272 ms. Remains : 67/69 places, 144/144 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s3 0) (EQ s21 0) (EQ s28 0) (EQ s56 0)), p1:(OR (EQ s0 0) (EQ s20 0) (EQ s26 0) (EQ s52 0)), p0:(OR (EQ s7 0) (EQ s15 0) (EQ s38 0) (EQ s54 0))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 20622 reset in 1453 ms.
Product exploration explored 100000 steps with 20558 reset in 1487 ms.
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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 p1) (NOT p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p2)), (X p2), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p2))), (X (X p2)), (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 4 factoid took 16 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-14 finished in 9445 ms.
All properties solved by simple procedures.
Total runtime 81745 ms.
BK_STOP 1716682420425
--------------------
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="NQueens-PT-12"
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 NQueens-PT-12, 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 r263-tall-171654372300228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-12.tgz
mv NQueens-PT-12 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 '
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 ;