Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127200037.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r140-tall-162089127200037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 25 07:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 25 07:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 134K May 5 16:51 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-00
FORMULA_NAME NQueens-PT-12-01
FORMULA_NAME NQueens-PT-12-02
FORMULA_NAME NQueens-PT-12-03
FORMULA_NAME NQueens-PT-12-04
FORMULA_NAME NQueens-PT-12-05
FORMULA_NAME NQueens-PT-12-06
FORMULA_NAME NQueens-PT-12-07
FORMULA_NAME NQueens-PT-12-08
FORMULA_NAME NQueens-PT-12-09
FORMULA_NAME NQueens-PT-12-10
FORMULA_NAME NQueens-PT-12-11
FORMULA_NAME NQueens-PT-12-12
FORMULA_NAME NQueens-PT-12-13
FORMULA_NAME NQueens-PT-12-14
FORMULA_NAME NQueens-PT-12-15

=== Now, execution of the tool begins

BK_START 1620917137295

Running Version 0
[2021-05-13 14:45:38] [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]
[2021-05-13 14:45:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:45:39] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2021-05-13 14:45:39] [INFO ] Transformed 216 places.
[2021-05-13 14:45:39] [INFO ] Transformed 144 transitions.
[2021-05-13 14:45:39] [INFO ] Parsed PT model containing 216 places and 144 transitions in 119 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 14:45:39] [INFO ] Initial state test concluded for 2 properties.
Reduce places removed 2 places and 0 transitions.
Support contains 54 out of 214 places. Attempting structural reductions.
Starting structural reductions, 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 14 ms. Remains 70 /214 variables (removed 144) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 70 cols
[2021-05-13 14:45:39] [INFO ] Computed 7 place invariants in 27 ms
[2021-05-13 14:45:39] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 144 rows 70 cols
[2021-05-13 14:45:39] [INFO ] Computed 7 place invariants in 10 ms
[2021-05-13 14:45:39] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [24, 46, 47, 69]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 290 ms to find 4 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:39] [INFO ] Computed 3 place invariants in 16 ms
[2021-05-13 14:45:39] [INFO ] Dead Transitions using invariants and state equation in 91 ms returned []
Starting structural reductions, iteration 1 : 66/214 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:39] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 14:45:39] [INFO ] Dead Transitions using invariants and state equation in 106 ms returned []
Finished structural reductions, in 2 iterations. Remains : 66/214 places, 144/144 transitions.
[2021-05-13 14:45:39] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-13 14:45:39] [INFO ] Flatten gal took : 47 ms
FORMULA NQueens-PT-12-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:45:39] [INFO ] Flatten gal took : 22 ms
[2021-05-13 14:45:40] [INFO ] Input system was already deterministic with 144 transitions.
Finished random walk after 17 steps, including 1 resets, run visited all 20 properties in 3 ms. (steps per millisecond=5 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 15 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:40] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 14:45:40] [INFO ] Implicit Places using invariants in 72 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:40] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 14:45:40] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2021-05-13 14:45:40] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:40] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:45:40] [INFO ] Dead Transitions using invariants and state equation in 77 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s15 1) (GEQ s35 1) (GEQ s51 1) (OR (LT s0 1) (LT s22 1) (LT s24 1) (LT s54 1))), p0:(AND (OR (LT s7 1) (LT s21 1) (LT s32 1) (LT s60 1)) (OR (LT s0 1) (LT s22 1) (LT s24 1) (LT s54 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 17916 reset in 1751 ms.
Product exploration explored 100000 steps with 17914 reset in 1739 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 : [(F (G (NOT p1))), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-12-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-12-00 finished in 4229 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:44] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:45:44] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:44] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 14:45:44] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:44] [INFO ] Computed 3 place invariants in 28 ms
[2021-05-13 14:45:44] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s12 1) (GEQ s39 1) (GEQ s49 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-01 finished in 573 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(F(p0))&&F((p1||(p2&&G(F(p0)))||G(p2))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:44] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 14:45:44] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:44] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 14:45:45] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:45] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 14:45:45] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s8 1) (GEQ s13 1) (GEQ s41 1) (GEQ s53 1)), p2:(OR (LT s7 1) (LT s23 1) (LT s30 1) (LT s62 1)), p0:(OR (LT s1 1) (LT s21 1) (LT s26 1) (LT s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 18519 reset in 1488 ms.
Product exploration explored 100000 steps with 18522 reset in 1529 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 : [(F (G (NOT p1))), (F (G p2)), (F (G p0)), p1, (NOT p2), (NOT p0)]
Adopting property with smaller alphabet thanks to knowledge :(F (G p2))
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-12-03 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-12-03 finished in 3639 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(((G(p0) U G(p1))&&X(G(p2)))))], workingDir=/home/mcc/execution]
Support contains 11 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:48] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 14:45:48] [INFO ] Implicit Places using invariants in 60 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:48] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:45:48] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:48] [INFO ] Computed 3 place invariants in 6 ms
[2021-05-13 14:45:48] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-12-04 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={1, 2} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={0, 1, 2} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=0 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=0 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={2} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=1 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={1, 2} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1, 2} source=3 dest: 2}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=p2, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1, 2} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={2} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=4 dest: 5}, { cond=(AND p1 p0), acceptance={0, 2} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 2}, { cond=(AND p1 p0), acceptance={1, 2} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0, 2} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={1, 2} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={1, 2} source=5 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={2} source=6 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={0, 1} source=6 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=6 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1, 2} source=6 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0, 2} source=6 dest: 6}, { cond=(AND p0 p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1, 2} source=7 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 2}, { cond=(AND p1 p0 (NOT p2)), acceptance={1, 2} source=7 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1, 2} source=7 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0, 1} source=7 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 2} source=7 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1, 2} source=7 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={1, 2} source=7 dest: 7}, { cond=(AND p1 p2), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s42 1) (GEQ s54 1)), p0:(AND (GEQ s2 1) (GEQ s13 1) (GEQ s35 1) (GEQ s47 1)), p2:(AND (GEQ s10 1) (GEQ s20 1) (GEQ s36 1) (GEQ s62 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-04 finished in 578 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 7 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:49] [INFO ] Computed 3 place invariants in 7 ms
[2021-05-13 14:45:49] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:49] [INFO ] Computed 3 place invariants in 9 ms
[2021-05-13 14:45:49] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2021-05-13 14:45:49] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:49] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:49] [INFO ] Dead Transitions using invariants and state equation in 73 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s21 1) (LT s30 1) (LT s58 1) (LT s6 1) (LT s22 1) (LT s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17216 reset in 1307 ms.
Product exploration explored 100000 steps with 17308 reset in 1329 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-12-07 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-12-07 finished in 3132 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||(p0&&F(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:52] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:52] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:52] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:52] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:52] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:52] [INFO ] Dead Transitions using invariants and state equation in 100 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s4 1) (LT s20 1) (LT s30 1) (LT s56 1)), p0:(OR (LT s2 1) (LT s21 1) (LT s27 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-08 finished in 443 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:52] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:52] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:52] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:52] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2021-05-13 14:45:52] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:52] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:53] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-12-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s22 1) (LT s29 1) (LT s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22831 reset in 1548 ms.
Product exploration explored 100000 steps with 22856 reset in 1599 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-12-09 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-12-09 finished in 3590 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(!p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:56] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:56] [INFO ] Implicit Places using invariants in 73 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:56] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:56] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2021-05-13 14:45:56] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:45:56] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:45:56] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : NQueens-PT-12-10 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s13 1) (GEQ s35 1) (GEQ s47 1)), p1:(OR (LT s0 1) (LT s18 1) (LT s28 1) (LT s50 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]]
Product exploration explored 100000 steps with 19617 reset in 1497 ms.
Product exploration explored 100000 steps with 19517 reset in 1536 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 : [(F (G (NOT p0))), (F (G p1)), p0, (NOT p1)]
Stuttering acceptance computed with spot in 68 ms :[(OR (NOT p1) p0), p0, (NOT p1)]
Product exploration explored 100000 steps with 19656 reset in 1482 ms.
Product exploration explored 100000 steps with 19590 reset in 1508 ms.
[2021-05-13 14:46:02] [INFO ] Flatten gal took : 15 ms
[2021-05-13 14:46:02] [INFO ] Flatten gal took : 14 ms
[2021-05-13 14:46:02] [INFO ] Time to serialize gal into /tmp/LTL6757250455376514383.gal : 6 ms
[2021-05-13 14:46:02] [INFO ] Time to serialize properties into /tmp/LTL11950333855468458731.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6757250455376514383.gal, -t, CGAL, -LTL, /tmp/LTL11950333855468458731.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6757250455376514383.gal -t CGAL -LTL /tmp/LTL11950333855468458731.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F("((((cX_2<1)||(cY_1<1))||(L_12<1))||(R_4<1))"))&&(F("((((cX_0<1)||(cY_6<1))||(L_5<1))||(R_7<1))")))))
Formula 0 simplified : !G(F"((((cX_2<1)||(cY_1<1))||(L_12<1))||(R_4<1))" & F"((((cX_0<1)||(cY_6<1))||(L_5<1))||(R_7<1))")
Detected timeout of ITS tools.
[2021-05-13 14:46:18] [INFO ] Flatten gal took : 14 ms
[2021-05-13 14:46:18] [INFO ] Applying decomposition
[2021-05-13 14:46:18] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4980434219064592280.txt, -o, /tmp/graph4980434219064592280.bin, -w, /tmp/graph4980434219064592280.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4980434219064592280.bin, -l, -1, -v, -w, /tmp/graph4980434219064592280.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 14:46:18] [INFO ] Decomposing Gal with order
[2021-05-13 14:46:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 14:46:18] [INFO ] Removed a total of 506 redundant transitions.
[2021-05-13 14:46:18] [INFO ] Flatten gal took : 46 ms
[2021-05-13 14:46:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 4 ms.
[2021-05-13 14:46:18] [INFO ] Time to serialize gal into /tmp/LTL18211616257779802210.gal : 3 ms
[2021-05-13 14:46:18] [INFO ] Time to serialize properties into /tmp/LTL8908943214602707177.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL18211616257779802210.gal, -t, CGAL, -LTL, /tmp/LTL8908943214602707177.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL18211616257779802210.gal -t CGAL -LTL /tmp/LTL8908943214602707177.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F("((((u2.cX_2<1)||(u13.cY_1<1))||(u35.L_12<1))||(u47.R_4<1))"))&&(F("((((u0.cX_0<1)||(u18.cY_6<1))||(u28.L_5<1))||(u50.R_7<1))")))))
Formula 0 simplified : !G(F"((((u2.cX_2<1)||(u13.cY_1<1))||(u35.L_12<1))||(u47.R_4<1))" & F"((((u0.cX_0<1)||(u18.cY_6<1))||(u28.L_5<1))||(u50.R_7<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1080143268811658187
[2021-05-13 14:46:33] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1080143268811658187
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin1080143268811658187]
Compilation finished in 782 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin1080143268811658187]
Link finished in 38 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, []((<>((LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin1080143268811658187]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NQueens-PT-12-10 finished in 51977 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(G(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:48] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:46:48] [INFO ] Implicit Places using invariants in 62 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:48] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:46:48] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:48] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:46:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-12-12 automaton TGBA [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 (GEQ s9 1) (GEQ s12 1) (GEQ s43 1) (GEQ s53 1) (GEQ s1 1) (GEQ s22 1) (GEQ s25 1) (GEQ s55 1)), p1:(AND (GEQ s1 1) (GEQ s22 1) (GEQ s25 1) (GEQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-12-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-12 finished in 393 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:48] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:46:48] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:48] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:46:48] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2021-05-13 14:46:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:48] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:46:48] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-12-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s21 1) (LT s28 1) (LT s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 8985 reset in 993 ms.
Product exploration explored 100000 steps with 8984 reset in 1014 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
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 : [(F (G p0)), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-12-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-12-14 finished in 2444 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G((F(p0) U X(p1)))||G(p2))))], workingDir=/home/mcc/execution]
Support contains 14 out of 66 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 66/66 places, 144/144 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:51] [INFO ] Computed 3 place invariants in 5 ms
[2021-05-13 14:46:51] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:51] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:46:51] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 66 cols
[2021-05-13 14:46:51] [INFO ] Computed 3 place invariants in 4 ms
[2021-05-13 14:46:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Finished structural reductions, in 1 iterations. Remains : 66/66 places, 144/144 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), false]
Running random walk in product with property : NQueens-PT-12-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=2 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s22 1) (GEQ s26 1) (GEQ s56 1)), p2:(AND (GEQ s8 1) (GEQ s17 1) (GEQ s37 1) (GEQ s57 1)), p1:(AND (OR (LT s4 1) (LT s22 1) (LT s28 1) (LT s58 1)) (GEQ s4 1) (GEQ s19 1) (GEQ s31 1) (GEQ s55 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 16 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-12-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-15 finished in 595 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7233727155071845358
[2021-05-13 14:46:51] [INFO ] Computing symmetric may disable matrix : 144 transitions.
[2021-05-13 14:46:51] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 14:46:51] [INFO ] Computing symmetric may enable matrix : 144 transitions.
[2021-05-13 14:46:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 14:46:51] [INFO ] Applying decomposition
[2021-05-13 14:46:51] [INFO ] Computing Do-Not-Accords matrix : 144 transitions.
[2021-05-13 14:46:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-13 14:46:51] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7233727155071845358
[2021-05-13 14:46:51] [INFO ] Flatten gal took : 13 ms
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin7233727155071845358]
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph4581277889907022077.txt, -o, /tmp/graph4581277889907022077.bin, -w, /tmp/graph4581277889907022077.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph4581277889907022077.bin, -l, -1, -v, -w, /tmp/graph4581277889907022077.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-13 14:46:51] [INFO ] Decomposing Gal with order
[2021-05-13 14:46:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-13 14:46:51] [INFO ] Removed a total of 506 redundant transitions.
[2021-05-13 14:46:51] [INFO ] Flatten gal took : 34 ms
[2021-05-13 14:46:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2021-05-13 14:46:51] [INFO ] Time to serialize gal into /tmp/LTLFireability10454396866890372330.gal : 3 ms
[2021-05-13 14:46:51] [INFO ] Time to serialize properties into /tmp/LTLFireability7000088359999099881.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10454396866890372330.gal, -t, CGAL, -LTL, /tmp/LTLFireability7000088359999099881.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10454396866890372330.gal -t CGAL -LTL /tmp/LTLFireability7000088359999099881.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((G((F(!("((((u2.cX_2>=1)&&(u13.cY_1>=1))&&(u35.L_12>=1))&&(u47.R_4>=1))")))&&(F(!("((((u0.cX_0>=1)&&(u18.cY_6>=1))&&(u28.L_5>=1))&&(u50.R_7>=1))"))))))
Formula 0 simplified : !G(F!"((((u2.cX_2>=1)&&(u13.cY_1>=1))&&(u35.L_12>=1))&&(u47.R_4>=1))" & F!"((((u0.cX_0>=1)&&(u18.cY_6>=1))&&(u28.L_5>=1))&&(u50.R_7>=1))")
Compilation finished in 832 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin7233727155071845358]
Link finished in 37 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7233727155071845358]
WARNING : LTSmin timed out (>327 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7233727155071845358]
Retrying LTSmin with larger timeout 2616 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7233727155071845358]
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.017: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.049: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.223: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.228: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.230: Initializing POR dependencies: labels 146, guards 144
pins2lts-mc-linux64( 2/ 8), 0.229: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.239: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.251: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.250: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.285: LTL layer: formula: []((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 7/ 8), 0.286: "[]((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.286: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.298: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.474: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.503: There are 148 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.504: State length is 67, there are 149 groups
pins2lts-mc-linux64( 0/ 8), 0.504: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.504: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.504: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.504: Visible groups: 63 / 149, labels: 2 / 148
pins2lts-mc-linux64( 0/ 8), 0.504: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.504: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.688: [Blue] ~12 levels ~960 states ~8144 transitions
pins2lts-mc-linux64( 3/ 8), 0.703: [Blue] ~12 levels ~1920 states ~8320 transitions
pins2lts-mc-linux64( 1/ 8), 0.714: [Blue] ~12 levels ~3840 states ~17200 transitions
pins2lts-mc-linux64( 1/ 8), 0.757: [Blue] ~13 levels ~7680 states ~30568 transitions
pins2lts-mc-linux64( 1/ 8), 0.851: [Blue] ~13 levels ~15360 states ~60544 transitions
pins2lts-mc-linux64( 1/ 8), 1.016: [Blue] ~13 levels ~30720 states ~117464 transitions
pins2lts-mc-linux64( 1/ 8), 1.430: [Blue] ~13 levels ~61440 states ~241696 transitions
pins2lts-mc-linux64( 1/ 8), 2.331: [Blue] ~13 levels ~122880 states ~530736 transitions
pins2lts-mc-linux64( 1/ 8), 4.070: [Blue] ~13 levels ~245760 states ~1084248 transitions
pins2lts-mc-linux64( 1/ 8), 7.938: [Blue] ~13 levels ~491520 states ~2251992 transitions
pins2lts-mc-linux64( 1/ 8), 17.297: [Blue] ~13 levels ~983040 states ~4951320 transitions
pins2lts-mc-linux64( 1/ 8), 32.861: [Blue] ~13 levels ~1966080 states ~9634944 transitions
pins2lts-mc-linux64( 1/ 8), 66.826: [Blue] ~13 levels ~3932160 states ~20319368 transitions
pins2lts-mc-linux64( 1/ 8), 138.844: [Blue] ~13 levels ~7864320 states ~42191608 transitions
pins2lts-mc-linux64( 1/ 8), 304.407: [Blue] ~13 levels ~15728640 states ~91733280 transitions
pins2lts-mc-linux64( 2/ 8), 576.327: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 576.568:
pins2lts-mc-linux64( 0/ 8), 576.568: Explored 26936098 states 62849906 transitions, fanout: 2.333
pins2lts-mc-linux64( 0/ 8), 576.568: Total exploration time 576.050 sec (575.810 sec minimum, 575.867 sec on average)
pins2lts-mc-linux64( 0/ 8), 576.568: States per second: 46760, Transitions per second: 109105
pins2lts-mc-linux64( 0/ 8), 576.568:
pins2lts-mc-linux64( 0/ 8), 576.568: State space has 26938026 states, 23231741 are accepting
pins2lts-mc-linux64( 0/ 8), 576.568: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 576.568: blue states: 26936098 (99.99%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 576.568: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 576.568: all-red states: 23231741 (86.24%), bogus 60 (0.00%)
pins2lts-mc-linux64( 0/ 8), 576.568:
pins2lts-mc-linux64( 0/ 8), 576.568: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 576.568:
pins2lts-mc-linux64( 0/ 8), 576.568: Queue width: 8B, total height: 104, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 576.568: Tree memory: 461.5MB, 18.0 B/state, compr.: 6.7%
pins2lts-mc-linux64( 0/ 8), 576.568: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 576.568: Stored 208 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 576.568: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 576.568: Est. total memory use: 461.5MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7233727155071845358]
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, []((<>(!(LTLAPp0==true))&&<>((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin7233727155071845358]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:214)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:165)
at fr.lip6.move.gal.application.LTSminRunner$1.checkProperties(LTSminRunner.java:154)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:102)
at java.base/java.lang.Thread.run(Thread.java:834)
Detected timeout of ITS tools.
[2021-05-13 15:07:19] [INFO ] Flatten gal took : 390 ms
[2021-05-13 15:07:19] [INFO ] Time to serialize gal into /tmp/LTLFireability5785546268982427595.gal : 43 ms
[2021-05-13 15:07:19] [INFO ] Time to serialize properties into /tmp/LTLFireability2189437658742461287.ltl : 18 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability5785546268982427595.gal, -t, CGAL, -LTL, /tmp/LTLFireability2189437658742461287.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability5785546268982427595.gal -t CGAL -LTL /tmp/LTLFireability2189437658742461287.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((G((F(!("((((cX_2>=1)&&(cY_1>=1))&&(L_12>=1))&&(R_4>=1))")))&&(F(!("((((cX_0>=1)&&(cY_6>=1))&&(L_5>=1))&&(R_7>=1))"))))))
Formula 0 simplified : !G(F!"((((cX_2>=1)&&(cY_1>=1))&&(L_12>=1))&&(R_4>=1))" & F!"((((cX_0>=1)&&(cY_6>=1))&&(L_5>=1))&&(R_7>=1))")
Detected timeout of ITS tools.
[2021-05-13 15:27:50] [INFO ] Flatten gal took : 141 ms
[2021-05-13 15:27:50] [INFO ] Input system was already deterministic with 144 transitions.
[2021-05-13 15:27:50] [INFO ] Transformed 66 places.
[2021-05-13 15:27:50] [INFO ] Transformed 144 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
java.lang.NullPointerException
at fr.lip6.move.gal.application.Application.computeOrderWithGreatSPN(Application.java:889)
at fr.lip6.move.gal.application.Application.runMultiITS(Application.java:835)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:515)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2021-05-13 15:27:51] [INFO ] Time to serialize gal into /tmp/LTLFireability2383558373931877752.gal : 4 ms
[2021-05-13 15:27:51] [INFO ] Time to serialize properties into /tmp/LTLFireability5285034493402871905.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability2383558373931877752.gal, -t, CGAL, -LTL, /tmp/LTLFireability5285034493402871905.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability2383558373931877752.gal -t CGAL -LTL /tmp/LTLFireability5285034493402871905.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G((F(!("((((cX_2>=1)&&(cY_1>=1))&&(L_12>=1))&&(R_4>=1))")))&&(F(!("((((cX_0>=1)&&(cY_6>=1))&&(L_5>=1))&&(R_7>=1))"))))))
Formula 0 simplified : !G(F!"((((cX_2>=1)&&(cY_1>=1))&&(L_12>=1))&&(R_4>=1))" & F!"((((cX_0>=1)&&(cY_6>=1))&&(L_5>=1))&&(R_7>=1))")

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="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-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 r140-tall-162089127200037"
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 '' 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 ;