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.r265-smll-167863539500068.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 ltsminxred
Input is NQueens-PT-30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r265-smll-167863539500068
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.1K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 17:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 17:12 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.8K Feb 25 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 176K Feb 26 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 17:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 759K 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-30-LTLFireability-00
FORMULA_NAME NQueens-PT-30-LTLFireability-01
FORMULA_NAME NQueens-PT-30-LTLFireability-02
FORMULA_NAME NQueens-PT-30-LTLFireability-03
FORMULA_NAME NQueens-PT-30-LTLFireability-04
FORMULA_NAME NQueens-PT-30-LTLFireability-05
FORMULA_NAME NQueens-PT-30-LTLFireability-06
FORMULA_NAME NQueens-PT-30-LTLFireability-07
FORMULA_NAME NQueens-PT-30-LTLFireability-08
FORMULA_NAME NQueens-PT-30-LTLFireability-09
FORMULA_NAME NQueens-PT-30-LTLFireability-10
FORMULA_NAME NQueens-PT-30-LTLFireability-11
FORMULA_NAME NQueens-PT-30-LTLFireability-12
FORMULA_NAME NQueens-PT-30-LTLFireability-13
FORMULA_NAME NQueens-PT-30-LTLFireability-14
FORMULA_NAME NQueens-PT-30-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678753301664

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NQueens-PT-30
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-14 00:21:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 00:21:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 00:21:44] [INFO ] Load time of PNML (sax parser for PT used): 219 ms
[2023-03-14 00:21:44] [INFO ] Transformed 1080 places.
[2023-03-14 00:21:44] [INFO ] Transformed 900 transitions.
[2023-03-14 00:21:44] [INFO ] Parsed PT model containing 1080 places and 900 transitions and 4500 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 10 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-30-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-30-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 49 out of 1078 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1078/1078 places, 900/900 transitions.
Reduce places removed 900 places and 0 transitions.
Iterating post reduction 0 with 900 rules applied. Total rules applied 900 place count 178 transition count 900
Applied a total of 900 rules in 48 ms. Remains 178 /1078 variables (removed 900) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 178 cols
[2023-03-14 00:21:45] [INFO ] Invariants computation overflowed in 267 ms
[2023-03-14 00:21:46] [INFO ] Implicit Places using invariants in 825 ms returned []
// Phase 1: matrix 900 rows 178 cols
[2023-03-14 00:21:46] [INFO ] Invariants computation overflowed in 212 ms
[2023-03-14 00:21:48] [INFO ] Implicit Places using invariants and state equation in 2091 ms returned [60, 118, 119, 177]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 2967 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 174/1078 places, 900/900 transitions.
Applied a total of 0 rules in 15 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3030 ms. Remains : 174/1078 places, 900/900 transitions.
Support contains 49 out of 174 places after structural reductions.
[2023-03-14 00:21:48] [INFO ] Flatten gal took : 171 ms
[2023-03-14 00:21:48] [INFO ] Flatten gal took : 102 ms
[2023-03-14 00:21:49] [INFO ] Input system was already deterministic with 900 transitions.
Finished random walk after 20 steps, including 0 resets, run visited all 14 properties in 23 ms. (steps per millisecond=0 )
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
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' '!(F((G(F(p0))||G((p1&&X(!p0))))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 33 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:21:49] [INFO ] Invariants computation overflowed in 114 ms
[2023-03-14 00:21:49] [INFO ] Implicit Places using invariants in 553 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:21:50] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-14 00:21:52] [INFO ] Implicit Places using invariants and state equation in 2456 ms returned []
Implicit Place search using SMT with State Equation took 3013 ms to find 0 implicit places.
[2023-03-14 00:21:52] [INFO ] Redundant transitions in 67 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:21:52] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-14 00:21:53] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3841 ms. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s28 1) (LT s41 1) (LT s105 1) (LT s155 1)), p0:(AND (GEQ s20 1) (GEQ s30 1) (GEQ s108 1) (GEQ s136 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 3584 reset in 5802 ms.
Product exploration explored 100000 steps with 3585 reset in 5724 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 3 factoid took 258 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-30-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-00 finished in 18538 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) U p1)&&G(X(F(!p1)))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:07] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-14 00:22:08] [INFO ] Implicit Places using invariants in 523 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:08] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-14 00:22:10] [INFO ] Implicit Places using invariants and state equation in 2393 ms returned []
Implicit Place search using SMT with State Equation took 2929 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:10] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-14 00:22:11] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3533 ms. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 213 ms :[true, p1, (OR (NOT p0) (NOT p1)), p1, true]
Running random walk in product with property : NQueens-PT-30-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s29 1) (GEQ s51 1) (GEQ s96 1) (GEQ s166 1)), p0:(AND (GEQ s23 1) (GEQ s31 1) (GEQ s110 1) (GEQ s140 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 8922 reset in 9310 ms.
Product exploration explored 100000 steps with 8913 reset in 9306 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), true, (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT p1)), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 4 factoid took 389 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-03 finished in 25349 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(X((F(G(p0))||(F(!p0)&&p1))))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 6 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:33] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-14 00:22:33] [INFO ] Implicit Places using invariants in 514 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:33] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-14 00:22:36] [INFO ] Implicit Places using invariants and state equation in 2485 ms returned []
Implicit Place search using SMT with State Equation took 3004 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:36] [INFO ] Invariants computation overflowed in 105 ms
[2023-03-14 00:22:36] [INFO ] Dead Transitions using invariants and state equation in 664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3675 ms. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (GEQ s14 1) (GEQ s33 1) (GEQ s99 1) (GEQ s133 1)), p0:(OR (LT s10 1) (LT s45 1) (LT s83 1) (LT s141 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 9169 reset in 7464 ms.
Product exploration explored 100000 steps with 9034 reset in 7550 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
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 (NOT p0)), true, (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 4 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-08 finished in 21594 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)&&(F(p1)||G(p2))))'
Support contains 12 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 13 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:54] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-14 00:22:55] [INFO ] Implicit Places using invariants in 497 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:55] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-14 00:22:57] [INFO ] Implicit Places using invariants and state equation in 2394 ms returned []
Implicit Place search using SMT with State Equation took 2901 ms to find 0 implicit places.
[2023-03-14 00:22:57] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:22:57] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-14 00:22:58] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3617 ms. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s40 1) (LT s79 1) (LT s127 1)), p1:(AND (GEQ s8 1) (GEQ s44 1) (GEQ s82 1) (GEQ s138 1)), p2:(AND (GEQ s19 1) (GEQ s37 1) (GEQ s100 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 97030 steps with 10939 reset in 10001 ms.
Product exploration timeout after 96130 steps with 10731 reset in 10001 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
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 p2), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p0)), (X p0), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (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 442 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-10 finished in 26830 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((G(p1)||p0))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 4 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:23:21] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-14 00:23:22] [INFO ] Implicit Places using invariants in 461 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:23:22] [INFO ] Invariants computation overflowed in 104 ms
[2023-03-14 00:23:24] [INFO ] Implicit Places using invariants and state equation in 2405 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:23:24] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-14 00:23:25] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3538 ms. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s27 1) (GEQ s52 1) (GEQ s93 1) (GEQ s165 1)), p0:(OR (LT s14 1) (LT s36 1) (LT s96 1) (LT s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration timeout after 94800 steps with 11348 reset in 10001 ms.
Product exploration timeout after 93830 steps with 11142 reset in 10001 ms.
Computed a total of 174 stabilizing places and 900 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 174 transition count 900
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 (NOT p0)), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 269 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-30-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-30-LTLFireability-13 finished in 26919 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 U p1)||X(p2)))))'
Support contains 8 out of 174 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 900/900 transitions.
Applied a total of 0 rules in 5 ms. Remains 174 /174 variables (removed 0) and now considering 900/900 (removed 0) transitions.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:23:48] [INFO ] Invariants computation overflowed in 101 ms
[2023-03-14 00:23:49] [INFO ] Implicit Places using invariants in 441 ms returned []
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:23:49] [INFO ] Invariants computation overflowed in 103 ms
[2023-03-14 00:23:51] [INFO ] Implicit Places using invariants and state equation in 2478 ms returned []
Implicit Place search using SMT with State Equation took 2923 ms to find 0 implicit places.
// Phase 1: matrix 900 rows 174 cols
[2023-03-14 00:23:51] [INFO ] Invariants computation overflowed in 102 ms
[2023-03-14 00:23:52] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3462 ms. Remains : 174/174 places, 900/900 transitions.
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NQueens-PT-30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s4 1) (GEQ s41 1) (GEQ s81 1) (GEQ s131 1)), p2:(AND (GEQ s25 1) (GEQ s46 1) (GEQ s97 1) (GEQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 180 steps with 72 reset in 17 ms.
FORMULA NQueens-PT-30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-30-LTLFireability-14 finished in 3617 ms.
All properties solved by simple procedures.
Total runtime 127555 ms.
ITS solved all properties within timeout

BK_STOP 1678753433655

--------------------
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-30"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NQueens-PT-30, 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 r265-smll-167863539500068"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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