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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 456K
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 101K 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.0K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Mar 25 07:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 25 07:18 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 96K 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-10-00
FORMULA_NAME NQueens-PT-10-01
FORMULA_NAME NQueens-PT-10-02
FORMULA_NAME NQueens-PT-10-03
FORMULA_NAME NQueens-PT-10-04
FORMULA_NAME NQueens-PT-10-05
FORMULA_NAME NQueens-PT-10-06
FORMULA_NAME NQueens-PT-10-07
FORMULA_NAME NQueens-PT-10-08
FORMULA_NAME NQueens-PT-10-09
FORMULA_NAME NQueens-PT-10-10
FORMULA_NAME NQueens-PT-10-11
FORMULA_NAME NQueens-PT-10-12
FORMULA_NAME NQueens-PT-10-13
FORMULA_NAME NQueens-PT-10-14
FORMULA_NAME NQueens-PT-10-15

=== Now, execution of the tool begins

BK_START 1620916255217

Running Version 0
[2021-05-13 14:30:57] [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:30:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 14:30:57] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2021-05-13 14:30:57] [INFO ] Transformed 160 places.
[2021-05-13 14:30:57] [INFO ] Transformed 100 transitions.
[2021-05-13 14:30:57] [INFO ] Parsed PT model containing 160 places and 100 transitions in 155 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 14:30:57] [INFO ] Initial state test concluded for 3 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-10-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 158 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 158/158 places, 100/100 transitions.
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 58 transition count 100
Applied a total of 100 rules in 19 ms. Remains 58 /158 variables (removed 100) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 58 cols
[2021-05-13 14:30:57] [INFO ] Computed 7 place invariants in 23 ms
[2021-05-13 14:30:57] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 100 rows 58 cols
[2021-05-13 14:30:57] [INFO ] Computed 7 place invariants in 47 ms
[2021-05-13 14:30:57] [INFO ] Implicit Places using invariants and state equation in 172 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 319 ms to find 1 implicit places.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:57] [INFO ] Computed 6 place invariants in 8 ms
[2021-05-13 14:30:57] [INFO ] Dead Transitions using invariants and state equation in 82 ms returned []
Starting structural reductions, iteration 1 : 57/158 places, 100/100 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:57] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-13 14:30:57] [INFO ] Dead Transitions using invariants and state equation in 78 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/158 places, 100/100 transitions.
[2021-05-13 14:30:58] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-13 14:30:58] [INFO ] Flatten gal took : 50 ms
FORMULA NQueens-PT-10-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-10-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 14:30:58] [INFO ] Flatten gal took : 16 ms
[2021-05-13 14:30:58] [INFO ] Input system was already deterministic with 100 transitions.
Finished random walk after 9 steps, including 0 resets, run visited all 28 properties in 2 ms. (steps per millisecond=4 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(p0) U X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:58] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-13 14:30:58] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:58] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 14:30:58] [INFO ] Implicit Places using invariants and state equation in 179 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 291 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:30:58] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:58] [INFO ] Dead Transitions using invariants and state equation in 75 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:30:58] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:30:58] [INFO ] Dead Transitions using invariants and state equation in 66 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-00 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s17 1) (GEQ s25 1) (GEQ s47 1)), p0:(AND (GEQ s2 1) (GEQ s18 1) (GEQ s22 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 2 ms.
FORMULA NQueens-PT-10-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-00 finished in 679 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X(X(F(p0))) U G((p1 U p2)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:58] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 14:30:58] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:58] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 14:30:59] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 187 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:30:59] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:30:59] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:30:59] [INFO ] Dead Transitions using invariants and state equation in 79 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-10-01 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s17 1) (GEQ s22 1) (GEQ s44 1)), p1:(AND (GEQ s2 1) (GEQ s15 1) (GEQ s25 1) (GEQ s43 1)), p0:(AND (GEQ s8 1) (GEQ s12 1) (GEQ s34 1) (GEQ s46 1) (GEQ s1 1) (GEQ s17 1) (GEQ s22 1) (GEQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-10-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-01 finished in 540 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1||F(p2)))))], workingDir=/home/mcc/execution]
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:59] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:30:59] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:59] [INFO ] Computed 6 place invariants in 3 ms
[2021-05-13 14:30:59] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [38, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 167 ms to find 2 implicit places.
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:30:59] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:30:59] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 55/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:30:59] [INFO ] Computed 4 place invariants in 6 ms
[2021-05-13 14:30:59] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NQueens-PT-10-02 automaton TGBA [mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p2:(AND (GEQ s3 1) (GEQ s12 1) (GEQ s30 1) (GEQ s42 1)), p1:(AND (OR (LT s3 1) (LT s12 1) (LT s30 1) (LT s42 1)) (GEQ s0 1) (GEQ s19 1) (GEQ s20 1) (GEQ s46 1)), p0:(AND (GEQ s1 1) (GEQ s15 1) (GEQ s25 1) (GEQ s43 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]]
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-10-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-02 finished in 401 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0&&X(G((X(p1) U (p2 U !p1)))))))], workingDir=/home/mcc/execution]
Support contains 12 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:59] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:30:59] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:30:59] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-13 14:30:59] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 150 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:30:59] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:00] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) p1), p1, p1, false, (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-10-03 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=p1, acceptance={0} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s17 1) (LT s23 1) (LT s45 1)), p1:(OR (LT s6 1) (LT s15 1) (LT s29 1) (LT s47 1)), p2:(OR (AND (GEQ s4 1) (GEQ s10 1) (GEQ s32 1) (GEQ s40 1)) (AND (GEQ s2 1) (GEQ s17 1) (GEQ s23 1) (GEQ s45 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 38 steps with 4 reset in 2 ms.
FORMULA NQueens-PT-10-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-03 finished in 392 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0) U X(p1)))], workingDir=/home/mcc/execution]
Support contains 11 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:00] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:00] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Implicit Places using invariants and state equation in 102 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 156 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:00] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:00] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NQueens-PT-10-04 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s18 1) (GEQ s21 1) (GEQ s45 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s31 1) (GEQ s47 1))), p1:(AND (GEQ s9 1) (GEQ s16 1) (GEQ s31 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 5 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-10-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-04 finished in 361 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:00] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:00] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 159 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:00] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 65 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:00] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-05 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: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s2 1) (LT s19 1) (LT s21 1) (LT s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 20 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-10-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-05 finished in 329 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0)&&(X(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 11 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:00] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:00] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:00] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 142 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:01] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:01] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : NQueens-PT-10-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s17 1) (GEQ s25 1) (GEQ s47 1)), p1:(OR (AND (GEQ s4 1) (GEQ s17 1) (GEQ s25 1) (GEQ s47 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s32 1) (GEQ s44 1))), p2:(AND (GEQ s5 1) (GEQ s13 1) (GEQ s30 1) (GEQ s44 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 0 ms.
FORMULA NQueens-PT-10-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-06 finished in 377 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:01] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 14:31:01] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:01] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Implicit Places using invariants and state equation in 111 ms returned [20, 56]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 191 ms to find 2 implicit places.
[2021-05-13 14:31:01] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:31:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms returned []
Starting structural reductions, iteration 1 : 55/57 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 55 /55 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-13 14:31:01] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:31:01] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-13 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-10-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:(AND (GEQ s0 1) (GEQ s10 1) (GEQ s28 1) (GEQ s37 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]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-07 finished in 451 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)||X(F(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:01] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Implicit Places using invariants in 48 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:01] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Implicit Places using invariants and state equation in 122 ms returned [20, 38]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 171 ms to find 2 implicit places.
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:31:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:31:01] [INFO ] Dead Transitions using invariants and state equation in 68 ms returned []
Starting structural reductions, iteration 1 : 55/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 55 cols
[2021-05-13 14:31:01] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-13 14:31:02] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-10-08 automaton TGBA [mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (LT s4 1) (LT s18 1) (LT s24 1) (LT s48 1)), p0:(OR (LT s9 1) (LT s19 1) (LT s28 1) (LT s54 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][false, false, false, false]]
Product exploration explored 100000 steps with 23944 reset in 1153 ms.
Product exploration explored 100000 steps with 23954 reset in 1169 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 55 transition count 100
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 p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA NQueens-PT-10-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-10-08 finished in 2800 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(p0)||G(p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:04] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:04] [INFO ] Implicit Places using invariants in 45 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:04] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:04] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 154 ms to find 3 implicit places.
[2021-05-13 14:31:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:04] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:31:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-13 14:31:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:04] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 23 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-10-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s15 1) (LT s28 1) (LT s46 1)), p1:(OR (LT s9 1) (LT s18 1) (LT s29 1) (LT s53 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 10683 reset in 783 ms.
Product exploration explored 100000 steps with 10689 reset in 781 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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)), (F (G p1)), (NOT p0), (NOT p1)]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA NQueens-PT-10-10 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-10-10 finished in 1948 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((p0 U p1)&&X(p2)))], workingDir=/home/mcc/execution]
Support contains 14 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:06] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:06] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-13 14:31:06] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 161 ms to find 3 implicit places.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:06] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:06] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-13 14:31:06] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : NQueens-PT-10-12 automaton TGBA [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={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s15 1) (GEQ s23 1) (GEQ s41 1) (GEQ s8 1) (GEQ s10 1) (GEQ s36 1) (GEQ s44 1) (GEQ s8 1) (GEQ s11 1) (GEQ s35 1) (GEQ s45 1)), p0:(AND (GEQ s0 1) (GEQ s16 1) (GEQ s22 1) (GEQ s42 1)), p2:(OR (LT s8 1) (LT s11 1) (LT s35 1) (LT s45 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-12 finished in 430 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p1)&&p0)))], workingDir=/home/mcc/execution]
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:06] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:06] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:07] [INFO ] Implicit Places using invariants and state equation in 110 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 166 ms to find 3 implicit places.
[2021-05-13 14:31:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:07] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-13 14:31:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-13 14:31:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:07] [INFO ] Computed 3 place invariants in 8 ms
[2021-05-13 14:31:07] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 53 ms :[(OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NQueens-PT-10-13 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s15 1) (GEQ s27 1) (GEQ s45 1)), p1:(AND (GEQ s4 1) (GEQ s15 1) (GEQ s27 1) (GEQ s45 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-10-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-10-13 finished in 349 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 57/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:07] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:07] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 100 rows 57 cols
[2021-05-13 14:31:07] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-13 14:31:07] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [20, 38, 56]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 157 ms to find 3 implicit places.
[2021-05-13 14:31:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:07] [INFO ] Computed 3 place invariants in 10 ms
[2021-05-13 14:31:07] [INFO ] Dead Transitions using invariants and state equation in 55 ms returned []
Starting structural reductions, iteration 1 : 54/57 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2021-05-13 14:31:07] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 54 cols
[2021-05-13 14:31:07] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-13 14:31:07] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Finished structural reductions, in 2 iterations. Remains : 54/57 places, 100/100 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-10-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s0 1) (LT s14 1) (LT s24 1) (LT s40 1)), p0:(OR (LT s1 1) (LT s15 1) (LT s24 1) (LT s42 1) (LT s0 1) (LT s14 1) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 19121 reset in 875 ms.
Product exploration explored 100000 steps with 19070 reset in 888 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 54 transition count 100
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 p1)), (F (G p0)), (NOT p1), (NOT p0)]
Property proved to be true thanks to knowledge :(F (G p1))
FORMULA NQueens-PT-10-15 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property NQueens-PT-10-15 finished in 2150 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620916270765

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

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