Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.2K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 17:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30K Mar 5 18:22 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-05-LTLFireability-00
FORMULA_NAME NQueens-PT-05-LTLFireability-01
FORMULA_NAME NQueens-PT-05-LTLFireability-02
FORMULA_NAME NQueens-PT-05-LTLFireability-03
FORMULA_NAME NQueens-PT-05-LTLFireability-04
FORMULA_NAME NQueens-PT-05-LTLFireability-05
FORMULA_NAME NQueens-PT-05-LTLFireability-06
FORMULA_NAME NQueens-PT-05-LTLFireability-07
FORMULA_NAME NQueens-PT-05-LTLFireability-08
FORMULA_NAME NQueens-PT-05-LTLFireability-09
FORMULA_NAME NQueens-PT-05-LTLFireability-10
FORMULA_NAME NQueens-PT-05-LTLFireability-11
FORMULA_NAME NQueens-PT-05-LTLFireability-12
FORMULA_NAME NQueens-PT-05-LTLFireability-13
FORMULA_NAME NQueens-PT-05-LTLFireability-14
FORMULA_NAME NQueens-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678706424923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-05
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 11:20:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:20:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:20:28] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-13 11:20:28] [INFO ] Transformed 55 places.
[2023-03-13 11:20:28] [INFO ] Transformed 25 transitions.
[2023-03-13 11:20:28] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 28 transition count 25
Applied a total of 25 rules in 20 ms. Remains 28 /53 variables (removed 25) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2023-03-13 11:20:28] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-13 11:20:28] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-13 11:20:28] [INFO ] Invariant cache hit.
[2023-03-13 11:20:29] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-13 11:20:29] [INFO ] Invariant cache hit.
[2023-03-13 11:20:29] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 28/53 places, 25/25 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 28/53 places, 25/25 transitions.
Support contains 28 out of 28 places after structural reductions.
[2023-03-13 11:20:29] [INFO ] Flatten gal took : 47 ms
[2023-03-13 11:20:29] [INFO ] Flatten gal took : 17 ms
[2023-03-13 11:20:29] [INFO ] Input system was already deterministic with 25 transitions.
Finished random walk after 11 steps, including 2 resets, run visited all 24 properties in 21 ms. (steps per millisecond=0 )
FORMULA NQueens-PT-05-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 28 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 28 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 8 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:30] [INFO ] Invariant cache hit.
[2023-03-13 11:20:30] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-13 11:20:30] [INFO ] Invariant cache hit.
[2023-03-13 11:20:30] [INFO ] Implicit Places using invariants and state equation in 115 ms returned [10, 18, 19, 27]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 198 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 24/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 351 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s4 1) (LT s8 1) (LT s14 1) (LT s23 1) (LT s3 1) (LT s5 1) (LT s16 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 32717 reset in 745 ms.
Product exploration explored 100000 steps with 32716 reset in 396 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-00 finished in 1928 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(p1||X((G(p1)||G(p2)))))))'
Support contains 11 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:32] [INFO ] Invariant cache hit.
[2023-03-13 11:20:32] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-13 11:20:32] [INFO ] Invariant cache hit.
[2023-03-13 11:20:32] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [10, 18, 19, 27]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 186 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 188 ms. Remains : 24/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=1, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s5 1) (GEQ s15 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s10 1) (GEQ s19 1))), p1:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s12 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 3 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-01 finished in 486 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 12 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:32] [INFO ] Invariant cache hit.
[2023-03-13 11:20:32] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-13 11:20:32] [INFO ] Invariant cache hit.
[2023-03-13 11:20:32] [INFO ] Implicit Places using invariants and state equation in 104 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 171 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 173 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s7 1) (GEQ s11 1) (GEQ s18 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s13 1) (GEQ s24 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s12 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 8 steps with 1 reset in 4 ms.
FORMULA NQueens-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-02 finished in 343 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(G(p1)))))'
Support contains 8 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:32] [INFO ] Invariant cache hit.
[2023-03-13 11:20:32] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-13 11:20:32] [INFO ] Invariant cache hit.
[2023-03-13 11:20:33] [INFO ] Implicit Places using invariants and state equation in 107 ms returned [10, 19, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 193 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 200 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(OR (LT s4 1) (LT s5 1) (LT s17 1) (LT s21 1)), p0:(OR (LT s3 1) (LT s7 1) (LT s14 1) (LT s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 39 steps with 7 reset in 1 ms.
FORMULA NQueens-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-04 finished in 499 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:33] [INFO ] Invariant cache hit.
[2023-03-13 11:20:33] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-13 11:20:33] [INFO ] Invariant cache hit.
[2023-03-13 11:20:33] [INFO ] Implicit Places using invariants and state equation in 118 ms returned [10, 18, 19, 27]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 198 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 201 ms. Remains : 24/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s3 1) (LT s5 1) (LT s16 1) (LT s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-05 finished in 331 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p1))||p0)))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:33] [INFO ] Invariant cache hit.
[2023-03-13 11:20:33] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-13 11:20:33] [INFO ] Invariant cache hit.
[2023-03-13 11:20:33] [INFO ] Implicit Places using invariants and state equation in 106 ms returned [10, 18, 19, 27]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 206 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 209 ms. Remains : 24/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s9 1) (LT s10 1) (LT s21 1)), p1:(AND (GEQ s1 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 4 reset in 3 ms.
FORMULA NQueens-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-06 finished in 434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 8 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 6 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:34] [INFO ] Invariant cache hit.
[2023-03-13 11:20:34] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-13 11:20:34] [INFO ] Invariant cache hit.
[2023-03-13 11:20:34] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [10, 18, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 166 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 176 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s2 1) (LT s6 1) (LT s14 1) (LT s20 1)), p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s13 1) (GEQ s17 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 18784 reset in 617 ms.
Product exploration explored 100000 steps with 18762 reset in 488 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-07 finished in 1664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 7 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:35] [INFO ] Invariant cache hit.
[2023-03-13 11:20:35] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-13 11:20:35] [INFO ] Invariant cache hit.
[2023-03-13 11:20:35] [INFO ] Implicit Places using invariants and state equation in 59 ms returned [10, 18, 19]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 107 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 109 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s9 1) (GEQ s13 1) (GEQ s24 1)), p1:(AND (GEQ s1 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-08 finished in 269 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(!p1)||G((X(p3)&&p2)))))'
Support contains 13 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:36] [INFO ] Invariant cache hit.
[2023-03-13 11:20:36] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-13 11:20:36] [INFO ] Invariant cache hit.
[2023-03-13 11:20:36] [INFO ] Implicit Places using invariants and state equation in 89 ms returned [18, 19, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 150 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 151 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), p1, (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), (AND p1 (NOT p3))]
Running random walk in product with property : NQueens-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 p2 p0), acceptance={0} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p1 (NOT p2)) (AND p1 (NOT p3))), acceptance={} source=2 dest: 1}, { cond=(AND p1 p2 p3), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p2 p0 (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p0) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND p1 p2 (NOT p0) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p2 p0 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s6 1) (GEQ s13 1) (GEQ s18 1)), p2:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1) (GEQ s2 1) (GEQ s9 1) (GEQ s12 1) (GEQ s23 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 37693 reset in 922 ms.
Product exploration explored 100000 steps with 37814 reset in 700 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p2 p0 p3), (X (NOT (AND p1 p2 (NOT p0) (NOT p3)))), (X (NOT (AND p1 p2 p0 (NOT p3)))), (X (X (NOT (AND p1 p2 (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 p2 p0 (NOT p3))))), (X (X (NOT (AND p1 p2 p0)))), (F (G (NOT p1))), (F (G (NOT p2))), (F (G (NOT p0))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))), (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (AND p1 (NOT p2) p0 (NOT p3))), (X (NOT (AND p1 (NOT p2) p0 (NOT p3)))), (X (AND p1 (NOT p2) p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND p1 p2 (NOT p0))), (X (NOT (AND p1 p2 (NOT p0)))), (X (AND p1 (NOT p2) (NOT p0) (NOT p3))), (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (AND p1 (NOT p2) (NOT p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (AND p1 p2 p3)), (X (NOT (AND p1 p2 p3))), (X (AND p1 p2 p0)), (X (NOT (AND p1 p2 p0))), (X p1), (X (NOT p1)), (X (X (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3)))))), (X (X (AND p1 (NOT p2) p0 (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) p0 (NOT p3))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND p1 p2 (NOT p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) (NOT p0) (NOT p3)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0) (NOT p3))))), (X (X (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (AND p1 p2 p3))), (X (X (NOT (AND p1 p2 p3)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 10 factoid took 1476 ms. Reduced automaton from 4 states, 13 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-09 finished in 3569 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 4 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:39] [INFO ] Invariant cache hit.
[2023-03-13 11:20:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-13 11:20:39] [INFO ] Invariant cache hit.
[2023-03-13 11:20:39] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [10, 18, 19, 27]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 208 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 24/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 69 ms :[p0]
Running random walk in product with property : NQueens-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s11 1) (GEQ s22 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 36293 reset in 478 ms.
Product exploration explored 100000 steps with 36264 reset in 500 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (F (G (NOT p0)))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-10 finished in 1522 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((!p1||X((p2||G(F(p1))))))||p0)))'
Support contains 12 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:41] [INFO ] Invariant cache hit.
[2023-03-13 11:20:41] [INFO ] Implicit Places using invariants in 64 ms returned []
[2023-03-13 11:20:41] [INFO ] Invariant cache hit.
[2023-03-13 11:20:41] [INFO ] Implicit Places using invariants and state equation in 73 ms returned [18, 19, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 151 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 152 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 260 ms :[false, false, (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s6 1) (LT s14 1) (LT s19 1)), p1:(OR (LT s3 1) (LT s7 1) (LT s15 1) (LT s22 1)), p2:(AND (GEQ s0 1) (GEQ s9 1) (GEQ s10 1) (GEQ s21 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 22385 reset in 386 ms.
Product exploration explored 100000 steps with 22415 reset in 403 ms.
Computed a total of 25 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 4 factoid took 338 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-11 finished in 1620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 8 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:42] [INFO ] Invariant cache hit.
[2023-03-13 11:20:42] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-13 11:20:42] [INFO ] Invariant cache hit.
[2023-03-13 11:20:42] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [10, 18, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 166 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/28 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 25/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s9 1) (GEQ s11 1) (GEQ s23 1) (OR (LT s0 1) (LT s5 1) (LT s13 1) (LT s17 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLFireability-13 finished in 249 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((!p1 U (p0||X(G(p2)))))))'
Support contains 10 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:42] [INFO ] Invariant cache hit.
[2023-03-13 11:20:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-13 11:20:43] [INFO ] Invariant cache hit.
[2023-03-13 11:20:43] [INFO ] Implicit Places using invariants and state equation in 97 ms returned [10, 18, 19, 27]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 172 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/28 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 175 ms. Remains : 24/28 places, 25/25 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s3 1) (LT s6 1) (LT s15 1) (LT s20 1)), p1:(OR (LT s2 1) (LT s6 1) (LT s14 1) (LT s19 1)), p2:(AND (GEQ s3 1) (GEQ s8 1) (GEQ s13 1) (GEQ s22 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 38205 reset in 590 ms.
Product exploration explored 100000 steps with 38152 reset in 496 ms.
Computed a total of 24 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (F (G p0)), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X p0), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 881 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-05-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-05-LTLFireability-14 finished in 2492 ms.
All properties solved by simple procedures.
Total runtime 17276 ms.
ITS solved all properties within timeout

BK_STOP 1678706446811

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML

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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is NQueens-PT-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863537600012"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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