Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821600940.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-25, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821600940
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.6K Apr 30 00:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 30 00:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 30 00:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 00:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 534K May 10 09:34 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-25-LTLFireability-00
FORMULA_NAME NQueens-PT-25-LTLFireability-01
FORMULA_NAME NQueens-PT-25-LTLFireability-02
FORMULA_NAME NQueens-PT-25-LTLFireability-03
FORMULA_NAME NQueens-PT-25-LTLFireability-04
FORMULA_NAME NQueens-PT-25-LTLFireability-05
FORMULA_NAME NQueens-PT-25-LTLFireability-06
FORMULA_NAME NQueens-PT-25-LTLFireability-07
FORMULA_NAME NQueens-PT-25-LTLFireability-08
FORMULA_NAME NQueens-PT-25-LTLFireability-09
FORMULA_NAME NQueens-PT-25-LTLFireability-10
FORMULA_NAME NQueens-PT-25-LTLFireability-11
FORMULA_NAME NQueens-PT-25-LTLFireability-12
FORMULA_NAME NQueens-PT-25-LTLFireability-13
FORMULA_NAME NQueens-PT-25-LTLFireability-14
FORMULA_NAME NQueens-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652905446453

Running Version 202205111006
[2022-05-18 20:24:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 20:24:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 20:24:07] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-18 20:24:07] [INFO ] Transformed 775 places.
[2022-05-18 20:24:07] [INFO ] Transformed 625 transitions.
[2022-05-18 20:24:07] [INFO ] Parsed PT model containing 775 places and 625 transitions in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-25-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 81 out of 773 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 773/773 places, 625/625 transitions.
Reduce places removed 625 places and 0 transitions.
Iterating post reduction 0 with 625 rules applied. Total rules applied 625 place count 148 transition count 625
Applied a total of 625 rules in 24 ms. Remains 148 /773 variables (removed 625) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 148 cols
[2022-05-18 20:24:08] [INFO ] Invariants computation overflowed in 101 ms
[2022-05-18 20:24:08] [INFO ] Implicit Places using invariants in 335 ms returned []
// Phase 1: matrix 625 rows 148 cols
[2022-05-18 20:24:08] [INFO ] Invariants computation overflowed in 82 ms
[2022-05-18 20:24:09] [INFO ] Implicit Places using invariants and state equation in 564 ms returned [50, 98, 99, 147]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 929 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 144/773 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 144/773 places, 625/625 transitions.
Support contains 81 out of 144 places after structural reductions.
[2022-05-18 20:24:09] [INFO ] Flatten gal took : 92 ms
[2022-05-18 20:24:09] [INFO ] Flatten gal took : 67 ms
[2022-05-18 20:24:09] [INFO ] Input system was already deterministic with 625 transitions.
Support contains 77 out of 144 places (down from 81) after GAL structural reductions.
Finished random walk after 18 steps, including 0 resets, run visited all 30 properties in 39 ms. (steps per millisecond=0 )
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(X(G(p1)))||p0))))'
Support contains 7 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 18 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:10] [INFO ] Invariants computation overflowed in 73 ms
[2022-05-18 20:24:10] [INFO ] Implicit Places using invariants in 302 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:10] [INFO ] Invariants computation overflowed in 52 ms
[2022-05-18 20:24:11] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2022-05-18 20:24:11] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:11] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-18 20:24:11] [INFO ] Dead Transitions using invariants and state equation in 391 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s45 1) (LT s53 1) (LT s116 1)), p0:(OR (LT s11 1) (LT s34 1) (LT s75 1) (LT s116 1))], nbAcceptance=2, 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 4315 reset in 3497 ms.
Product exploration explored 100000 steps with 4314 reset in 3530 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 388 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-25-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-00 finished in 10235 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(p1))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 15 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:20] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-18 20:24:20] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:20] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-18 20:24:21] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:21] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:24:21] [INFO ] Dead Transitions using invariants and state equation in 254 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 1}, { cond=(NOT p0), acceptance={} source=5 dest: 3}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=5, aps=[p1:(OR (LT s4 1) (LT s47 1) (LT s55 1) (LT s122 1)), p0:(AND (GEQ s9 1) (GEQ s33 1) (GEQ s74 1) (GEQ s113 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-25-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-01 finished in 1616 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((F(p0)||X(p0)))))&&G(p1))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:22] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-18 20:24:22] [INFO ] Implicit Places using invariants in 210 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:22] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-18 20:24:22] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1022 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:23] [INFO ] Invariants computation overflowed in 46 ms
[2022-05-18 20:24:23] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 2141 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NQueens-PT-25-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 6}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s16 1) (GEQ s45 1) (GEQ s69 1) (GEQ s132 1)), p0:(OR (LT s15 1) (LT s37 1) (LT s76 1) (LT s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-02 finished in 3647 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:25] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-18 20:24:25] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:25] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:24:26] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1080 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:26] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-18 20:24:26] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s12 1) (GEQ s35 1) (GEQ s75 1) (GEQ s118 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 3 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-25-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-03 finished in 1467 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:26] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-18 20:24:27] [INFO ] Implicit Places using invariants in 216 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:27] [INFO ] Invariants computation overflowed in 50 ms
[2022-05-18 20:24:27] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 1100 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:28] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:24:28] [INFO ] Dead Transitions using invariants and state equation in 248 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 902 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-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: 2}]], initial=1, aps=[p0:(OR (LT s18 1) (LT s44 1) (LT s72 1) (LT s133 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-25-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-04 finished in 2274 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(X((p0 U G(!(F(p1)||p2))))))) U !p1))'
Support contains 11 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 5 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:29] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-18 20:24:29] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:29] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-18 20:24:30] [INFO ] Implicit Places using invariants and state equation in 832 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:30] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-18 20:24:30] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 177 ms :[p1, (OR p2 p1), (OR p2 p1), true, (OR p2 p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p1 (NOT p0)) (AND p2 (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s14 1) (GEQ s42 1) (GEQ s70 1) (GEQ s127 1)), p2:(AND (GEQ s24 1) (GEQ s34 1) (GEQ s88 1) (GEQ s129 1)), p0:(AND (GEQ s14 1) (GEQ s36 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-25-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-05 finished in 1500 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X(X(!(!p1 U !p0)))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:30] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:24:30] [INFO ] Implicit Places using invariants in 220 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:30] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:24:31] [INFO ] Implicit Places using invariants and state equation in 903 ms returned []
Implicit Place search using SMT with State Equation took 1125 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:31] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:24:32] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p1) (NOT p0)), true, (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s26 1) (GEQ s76 1) (GEQ s101 1)), p0:(AND (GEQ s9 1) (GEQ s44 1) (GEQ s63 1) (GEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-25-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-07 finished in 1529 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((X(p0)||p1)))))'
Support contains 7 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:32] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-18 20:24:32] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:32] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-18 20:24:33] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1089 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:33] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-18 20:24:33] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s5 1) (GEQ s42 1) (GEQ s61 1) (GEQ s118 1)), p0:(AND (GEQ s5 1) (GEQ s27 1) (GEQ s76 1) (GEQ s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 84 steps with 28 reset in 8 ms.
FORMULA NQueens-PT-25-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-08 finished in 1474 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F((F(G(X(p0)))||!(F(p1) U p1)))))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:33] [INFO ] Invariants computation overflowed in 48 ms
[2022-05-18 20:24:34] [INFO ] Implicit Places using invariants in 213 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:34] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-18 20:24:34] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1116 ms to find 0 implicit places.
[2022-05-18 20:24:34] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:35] [INFO ] Invariants computation overflowed in 54 ms
[2022-05-18 20:24:35] [INFO ] Dead Transitions using invariants and state equation in 256 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s45 1) (LT s56 1) (LT s119 1)), p1:(AND (GEQ s18 1) (GEQ s33 1) (GEQ s83 1) (GEQ s122 1))], nbAcceptance=2, 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 4315 reset in 3554 ms.
Product exploration explored 100000 steps with 4313 reset in 3495 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 325 ms. Reduced automaton from 1 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-25-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-09 finished in 9783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 3 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:43] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-18 20:24:43] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:43] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-18 20:24:44] [INFO ] Implicit Places using invariants and state equation in 896 ms returned []
Implicit Place search using SMT with State Equation took 1128 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:44] [INFO ] Invariants computation overflowed in 37 ms
[2022-05-18 20:24:44] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s30 1) (GEQ s74 1) (GEQ s107 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-25-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-10 finished in 1572 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (G(!p0)||p1)))))'
Support contains 8 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 11 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:45] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-18 20:24:45] [INFO ] Implicit Places using invariants in 217 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:45] [INFO ] Invariants computation overflowed in 43 ms
[2022-05-18 20:24:46] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1117 ms to find 0 implicit places.
[2022-05-18 20:24:46] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:46] [INFO ] Invariants computation overflowed in 51 ms
[2022-05-18 20:24:46] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (GEQ s12 1) (GEQ s44 1) (GEQ s66 1) (GEQ s127 1))) (NOT (AND (GEQ s15 1) (GEQ s30 1) (GEQ s83 1) (GEQ s116 1)))), p0:(AND (GEQ s15 1) (G...], 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 8417 reset in 5313 ms.
Product exploration explored 100000 steps with 8562 reset in 5371 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-25-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-11 finished in 13141 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)&&(G(X(F(p2)))||X(!p2))&&p0))))'
Support contains 12 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 12 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:58] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-18 20:24:58] [INFO ] Implicit Places using invariants in 207 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:58] [INFO ] Invariants computation overflowed in 47 ms
[2022-05-18 20:24:59] [INFO ] Implicit Places using invariants and state equation in 868 ms returned []
Implicit Place search using SMT with State Equation took 1076 ms to find 0 implicit places.
[2022-05-18 20:24:59] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:24:59] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-18 20:24:59] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 559 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), false, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-25-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 p1 p2), acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={} source=4 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=4 dest: 6}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s14 1) (GEQ s27 1) (GEQ s85 1) (GEQ s112 1)), p1:(AND (GEQ s3 1) (GEQ s32 1) (GEQ s69 1) (GEQ s106 1)), p2:(OR (LT s16 1) (LT s43 1) (LT s71 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 22 steps with 0 reset in 3 ms.
FORMULA NQueens-PT-25-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-12 finished in 1918 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F(X(p0)))&&F(!p0))))'
Support contains 4 out of 144 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 8 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:00] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-18 20:25:00] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:00] [INFO ] Invariants computation overflowed in 45 ms
[2022-05-18 20:25:01] [INFO ] Implicit Places using invariants and state equation in 902 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2022-05-18 20:25:01] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:01] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-18 20:25:01] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, p0, (NOT p0)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s48 1) (GEQ s72 1) (GEQ s141 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 31 steps with 1 reset in 4 ms.
FORMULA NQueens-PT-25-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-13 finished in 1519 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((!F(p0) U X(p1)))&&G(X(F(G(F(p2)))))))'
Support contains 11 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:01] [INFO ] Invariants computation overflowed in 41 ms
[2022-05-18 20:25:01] [INFO ] Implicit Places using invariants in 206 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:01] [INFO ] Invariants computation overflowed in 40 ms
[2022-05-18 20:25:02] [INFO ] Implicit Places using invariants and state equation in 835 ms returned []
Implicit Place search using SMT with State Equation took 1043 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:02] [INFO ] Invariants computation overflowed in 38 ms
[2022-05-18 20:25:02] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p2), (NOT p1), true, p0]
Running random walk in product with property : NQueens-PT-25-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}, { cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=p0, acceptance={} source=7 dest: 6}, { cond=(NOT p0), acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s21 1) (GEQ s44 1) (GEQ s75 1) (GEQ s136 1)), p2:(OR (LT s8 1) (LT s41 1) (LT s65 1) (LT s120 1)), p1:(AND (GEQ s20 1) (GEQ s43 1) (GEQ s75 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 168 steps with 18 reset in 13 ms.
FORMULA NQueens-PT-25-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-25-LTLFireability-14 finished in 1618 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U X((p0 U p1)))||F(X(F(p2)))))'
Support contains 12 out of 144 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 144/144 places, 625/625 transitions.
Applied a total of 0 rules in 4 ms. Remains 144 /144 variables (removed 0) and now considering 625/625 (removed 0) transitions.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:03] [INFO ] Invariants computation overflowed in 44 ms
[2022-05-18 20:25:03] [INFO ] Implicit Places using invariants in 208 ms returned []
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:03] [INFO ] Invariants computation overflowed in 42 ms
[2022-05-18 20:25:04] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
// Phase 1: matrix 625 rows 144 cols
[2022-05-18 20:25:04] [INFO ] Invariants computation overflowed in 49 ms
[2022-05-18 20:25:04] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 144/144 places, 625/625 transitions.
Stuttering acceptance computed with spot in 439 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : NQueens-PT-25-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s23 1) (GEQ s26 1) (GEQ s95 1) (GEQ s120 1)), p1:(AND (GEQ s3 1) (GEQ s38 1) (GEQ s63 1) (GEQ s112 1)), p2:(OR (LT s24 1) (LT s43 1) (LT s79 ...], 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]]
Product exploration explored 100000 steps with 13399 reset in 6320 ms.
Product exploration explored 100000 steps with 13506 reset in 6372 ms.
Computed a total of 144 stabilizing places and 625 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 625
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 p1 (NOT p2)), (F (G (NOT p0))), (F (G (NOT p1))), (F (G p2))]
False Knowledge obtained : [(X (AND p1 (NOT p2))), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(F (G p2))
Knowledge based reduction with 4 factoid took 578 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA NQueens-PT-25-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-25-LTLFireability-15 finished in 15870 ms.
All properties solved by simple procedures.
Total runtime 71360 ms.

BK_STOP 1652905519481

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-25"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-25, 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 r132-tall-165271821600940"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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