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-167863537600011.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537600011
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME NQueens-PT-05-LTLCardinality-01
FORMULA_NAME NQueens-PT-05-LTLCardinality-02
FORMULA_NAME NQueens-PT-05-LTLCardinality-03
FORMULA_NAME NQueens-PT-05-LTLCardinality-04
FORMULA_NAME NQueens-PT-05-LTLCardinality-05
FORMULA_NAME NQueens-PT-05-LTLCardinality-06
FORMULA_NAME NQueens-PT-05-LTLCardinality-07
FORMULA_NAME NQueens-PT-05-LTLCardinality-08
FORMULA_NAME NQueens-PT-05-LTLCardinality-09
FORMULA_NAME NQueens-PT-05-LTLCardinality-10
FORMULA_NAME NQueens-PT-05-LTLCardinality-11
FORMULA_NAME NQueens-PT-05-LTLCardinality-12
FORMULA_NAME NQueens-PT-05-LTLCardinality-13
FORMULA_NAME NQueens-PT-05-LTLCardinality-14
FORMULA_NAME NQueens-PT-05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678706402703

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=LTLCardinality
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:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 11:20:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:20:06] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2023-03-13 11:20:06] [INFO ] Transformed 55 places.
[2023-03-13 11:20:06] [INFO ] Transformed 25 transitions.
[2023-03-13 11:20:06] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 328 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 18 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-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 41 transition count 25
Applied a total of 12 rules in 24 ms. Remains 41 /53 variables (removed 12) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 41 cols
[2023-03-13 11:20:06] [INFO ] Computed 16 place invariants in 8 ms
[2023-03-13 11:20:06] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-13 11:20:06] [INFO ] Invariant cache hit.
[2023-03-13 11:20:06] [INFO ] Implicit Places using invariants and state equation in 109 ms returned [31]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 393 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 40/53 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 420 ms. Remains : 40/53 places, 25/25 transitions.
Support contains 31 out of 40 places after structural reductions.
[2023-03-13 11:20:07] [INFO ] Flatten gal took : 44 ms
[2023-03-13 11:20:07] [INFO ] Flatten gal took : 15 ms
[2023-03-13 11:20:07] [INFO ] Input system was already deterministic with 25 transitions.
Support contains 30 out of 40 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1870 resets, run finished after 737 ms. (steps per millisecond=13 ) properties (out of 28) seen :19
Incomplete Best-First random walk after 10001 steps, including 220 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 217 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 213 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 213 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 211 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 210 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 212 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 25 rows 40 cols
[2023-03-13 11:20:08] [INFO ] Computed 15 place invariants in 12 ms
[2023-03-13 11:20:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 11:20:08] [INFO ] [Real]Absence check using 3 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-13 11:20:08] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:8
[2023-03-13 11:20:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-13 11:20:08] [INFO ] [Nat]Absence check using 3 positive and 12 generalized place invariants in 4 ms returned sat
[2023-03-13 11:20:08] [INFO ] After 136ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :0
Fused 9 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 9 atomic propositions for a total of 14 simplifications.
FORMULA NQueens-PT-05-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 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' '!((G(p0)||F(p1)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Graph (complete) has 52 edges and 40 vertex of which 28 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.3 ms
Discarding 12 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 28 /40 variables (removed 12) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2023-03-13 11:20:08] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-13 11:20:09] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-13 11:20:09] [INFO ] Invariant cache hit.
[2023-03-13 11:20:09] [INFO ] Implicit Places using invariants and state equation in 126 ms returned [19, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 211 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/40 places, 25/25 transitions.
Applied a total of 0 rules in 4 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 224 ms. Remains : 26/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ 1 s0), p0:(GT 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 33 steps with 6 reset in 3 ms.
FORMULA NQueens-PT-05-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-00 finished in 593 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((p0&&F(p1))) U (p2||X((false U false))))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 28 transition count 25
Applied a total of 12 rules in 1 ms. Remains 28 /40 variables (removed 12) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2023-03-13 11:20:09] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 11:20:09] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-13 11:20:09] [INFO ] Invariant cache hit.
[2023-03-13 11:20:09] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [11, 27]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 156 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/40 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 158 ms. Remains : 26/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p2), (NOT p1), true, (NOT p2), (OR (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(NOT p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ 1 s18), p1:(GT s5 s21), p0:(LEQ s17 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 36 steps with 16 reset in 1 ms.
FORMULA NQueens-PT-05-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-02 finished in 440 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 (G(p1)||(p1&&F((!p1 U (p2||G(!p1)))))))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 29 transition count 25
Applied a total of 11 rules in 1 ms. Remains 29 /40 variables (removed 11) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 29 cols
[2023-03-13 11:20:09] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 11:20:09] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-13 11:20:09] [INFO ] Invariant cache hit.
[2023-03-13 11:20:10] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [12, 20, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 160 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/40 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 162 ms. Remains : 26/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 285 ms :[(NOT p1), (NOT p1), (NOT p0), false, (AND p1 (NOT p0) (NOT p2))]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p1:(GT s3 s1), p0:(LEQ s17 s0), p2:(AND (GT 2 s8) (LEQ s3 s1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 12 steps with 2 reset in 1 ms.
FORMULA NQueens-PT-05-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-03 finished in 485 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 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Graph (complete) has 52 edges and 40 vertex of which 29 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 29 /40 variables (removed 11) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 29 cols
[2023-03-13 11:20:10] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 11:20:10] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-13 11:20:10] [INFO ] Invariant cache hit.
[2023-03-13 11:20:10] [INFO ] Implicit Places using invariants and state equation in 100 ms returned [12, 20, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 193 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 26/40 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 197 ms. Remains : 26/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s1 s0)], 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]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-05 finished in 258 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(p0)))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 28 transition count 25
Applied a total of 12 rules in 0 ms. Remains 28 /40 variables (removed 12) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2023-03-13 11:20:10] [INFO ] Computed 6 place invariants in 2 ms
[2023-03-13 11:20:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-13 11:20:10] [INFO ] Invariant cache hit.
[2023-03-13 11:20:10] [INFO ] Implicit Places using invariants and state equation in 98 ms returned [11, 19, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 157 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/40 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 LTL mode , in 2 iterations and 159 ms. Remains : 25/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(AND (GT s0 s14) (GT 2 s3))], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-06 finished in 336 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)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Graph (complete) has 52 edges and 40 vertex of which 27 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 27 /40 variables (removed 13) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 27 cols
[2023-03-13 11:20:10] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 11:20:11] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-13 11:20:11] [INFO ] Invariant cache hit.
[2023-03-13 11:20:11] [INFO ] Implicit Places using invariants and state equation in 91 ms returned [18, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 143 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/40 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 148 ms. Remains : 25/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s10 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-07 finished in 311 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 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 27 transition count 25
Applied a total of 13 rules in 2 ms. Remains 27 /40 variables (removed 13) and now considering 25/25 (removed 0) transitions.
[2023-03-13 11:20:11] [INFO ] Invariant cache hit.
[2023-03-13 11:20:11] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-13 11:20:11] [INFO ] Invariant cache hit.
[2023-03-13 11:20:11] [INFO ] Implicit Places using invariants and state equation in 105 ms returned [18, 26]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 177 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/40 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 LTL mode , in 2 iterations and 182 ms. Remains : 25/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-08 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:(GT 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-05-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-08 finished in 297 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&&X(X(F(p0)))&&G(p1))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 29 transition count 25
Applied a total of 11 rules in 2 ms. Remains 29 /40 variables (removed 11) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 29 cols
[2023-03-13 11:20:11] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 11:20:11] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-13 11:20:11] [INFO ] Invariant cache hit.
[2023-03-13 11:20:11] [INFO ] Implicit Places using invariants and state equation in 112 ms returned [12, 20, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 166 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/40 places, 25/25 transitions.
Applied a total of 0 rules in 2 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 170 ms. Remains : 26/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT s1 s5), p1:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-05-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-13 finished in 380 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&&X((F(p1)&&(!p0 U (p2||G(!p0))))))||G((F(p1)&&(!p0 U (p2||G(!p0)))))))))'
Support contains 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 28 transition count 25
Applied a total of 12 rules in 2 ms. Remains 28 /40 variables (removed 12) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 28 cols
[2023-03-13 11:20:12] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-13 11:20:12] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-13 11:20:12] [INFO ] Invariant cache hit.
[2023-03-13 11:20:12] [INFO ] Implicit Places using invariants and state equation in 101 ms returned [11, 19, 27]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 158 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/40 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 LTL mode , in 2 iterations and 161 ms. Remains : 25/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 716 ms :[(OR (NOT p1) (AND p0 (NOT p2))), (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), (OR (NOT p1) (AND p0 (NOT p2))), (NOT p1), (AND p0 (NOT p2)), (NOT p1), (NOT p1), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 5}], [{ cond=(AND p0 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 2} source=1 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 1, 2} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1, 2} source=2 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=3 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=3 dest: 9}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=3 dest: 11}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=4 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=5 dest: 11}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={0, 1} source=6 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 6}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 2} source=6 dest: 8}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=7 dest: 7}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 2} source=8 dest: 8}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=9 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=9 dest: 9}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=9 dest: 11}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={0, 1, 2} source=11 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={2} source=11 dest: 11}]], initial=0, aps=[p0:(LEQ 1 s0), p1:(GT 1 s11), p2:(AND (GT 1 s0) (GT 1 s3))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-05-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-14 finished in 919 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) U X(G(p1))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 25/25 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 29 transition count 25
Applied a total of 11 rules in 1 ms. Remains 29 /40 variables (removed 11) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 29 cols
[2023-03-13 11:20:12] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-13 11:20:12] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-13 11:20:12] [INFO ] Invariant cache hit.
[2023-03-13 11:20:13] [INFO ] Implicit Places using invariants and state equation in 123 ms returned [12, 20, 28]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 200 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 26/40 places, 25/25 transitions.
Applied a total of 0 rules in 1 ms. Remains 26 /26 variables (removed 0) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 26/40 places, 25/25 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : NQueens-PT-05-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s0 s1), p1:(LEQ s15 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 6 reset in 2 ms.
FORMULA NQueens-PT-05-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-05-LTLCardinality-15 finished in 379 ms.
All properties solved by simple procedures.
Total runtime 7545 ms.
ITS solved all properties within timeout

BK_STOP 1678706414484

--------------------
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 LTLCardinality -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="LTLCardinality"
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 LTLCardinality"
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-167863537600011"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;