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-167863537600036.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863537600036
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 660K
-rw-r--r-- 1 mcc users 6.7K Feb 26 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 17:09 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.4K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 26 17:10 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 134K 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-12-LTLFireability-00
FORMULA_NAME NQueens-PT-12-LTLFireability-01
FORMULA_NAME NQueens-PT-12-LTLFireability-02
FORMULA_NAME NQueens-PT-12-LTLFireability-03
FORMULA_NAME NQueens-PT-12-LTLFireability-04
FORMULA_NAME NQueens-PT-12-LTLFireability-05
FORMULA_NAME NQueens-PT-12-LTLFireability-06
FORMULA_NAME NQueens-PT-12-LTLFireability-07
FORMULA_NAME NQueens-PT-12-LTLFireability-08
FORMULA_NAME NQueens-PT-12-LTLFireability-09
FORMULA_NAME NQueens-PT-12-LTLFireability-10
FORMULA_NAME NQueens-PT-12-LTLFireability-11
FORMULA_NAME NQueens-PT-12-LTLFireability-12
FORMULA_NAME NQueens-PT-12-LTLFireability-13
FORMULA_NAME NQueens-PT-12-LTLFireability-14
FORMULA_NAME NQueens-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678707375135

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-12
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-13 11:36:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 11:36:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 11:36:19] [INFO ] Load time of PNML (sax parser for PT used): 136 ms
[2023-03-13 11:36:19] [INFO ] Transformed 216 places.
[2023-03-13 11:36:19] [INFO ] Transformed 144 transitions.
[2023-03-13 11:36:19] [INFO ] Parsed PT model containing 216 places and 144 transitions and 720 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-12-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-12-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 214 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 214/214 places, 144/144 transitions.
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 70 transition count 144
Applied a total of 144 rules in 28 ms. Remains 70 /214 variables (removed 144) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 70 cols
[2023-03-13 11:36:19] [INFO ] Computed 7 place invariants in 34 ms
[2023-03-13 11:36:19] [INFO ] Implicit Places using invariants in 368 ms returned []
[2023-03-13 11:36:19] [INFO ] Invariant cache hit.
[2023-03-13 11:36:20] [INFO ] Implicit Places using invariants and state equation in 288 ms returned [24, 47, 69]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 721 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 67/214 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 753 ms. Remains : 67/214 places, 144/144 transitions.
Support contains 53 out of 67 places after structural reductions.
[2023-03-13 11:36:20] [INFO ] Flatten gal took : 96 ms
[2023-03-13 11:36:20] [INFO ] Flatten gal took : 51 ms
[2023-03-13 11:36:20] [INFO ] Input system was already deterministic with 144 transitions.
Finished random walk after 8 steps, including 0 resets, run visited all 24 properties in 19 ms. (steps per millisecond=0 )
FORMULA NQueens-PT-12-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA NQueens-PT-12-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 67 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 67 transition count 144
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 U (p1||F(G(!p1))))))'
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 15 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:21] [INFO ] Invariants computation overflowed in 24 ms
[2023-03-13 11:36:21] [INFO ] Implicit Places using invariants in 223 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:21] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-13 11:36:21] [INFO ] Implicit Places using invariants and state equation in 378 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 604 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 9 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 628 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 325 ms :[false, p1]
Running random walk in product with property : NQueens-PT-12-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s11 1) (GEQ s19 1) (GEQ s38 1) (GEQ s62 1)), p0:(AND (GEQ s0 1) (GEQ s18 1) (GEQ s28 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8982 reset in 1468 ms.
Product exploration explored 100000 steps with 8984 reset in 1178 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (OR p1 p0)), (X (NOT (OR p1 p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (OR p1 p0))), (X (X (NOT (OR p1 p0))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 336 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-12-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-00 finished in 4196 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(G(!p0)) U p1)))'
Support contains 16 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:25] [INFO ] Invariants computation overflowed in 17 ms
[2023-03-13 11:36:25] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:25] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-13 11:36:25] [INFO ] Implicit Places using invariants and state equation in 336 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 517 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 532 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), p0, (NOT p1)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1 1) (GEQ s23 1) (GEQ s24 1) (GEQ s56 1)) (AND (GEQ s3 1) (GEQ s19 1) (GEQ s30 1) (GEQ s54 1))), p0:(AND (GEQ s8 1) (GEQ s13 1) (GEQ s41...], 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 179 steps with 15 reset in 5 ms.
FORMULA NQueens-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-02 finished in 756 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)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:26] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-13 11:36:26] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:26] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-13 11:36:26] [INFO ] Implicit Places using invariants and state equation in 360 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 567 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 576 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s6 1) (GEQ s22 1) (GEQ s30 1) (GEQ s60 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][false, false]]
Stuttering criterion allowed to conclude after 22 steps with 6 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-04 finished in 702 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||F(!p1)))'
Support contains 7 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:26] [INFO ] Invariants computation overflowed in 9 ms
[2023-03-13 11:36:27] [INFO ] Implicit Places using invariants in 251 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:27] [INFO ] Invariants computation overflowed in 11 ms
[2023-03-13 11:36:27] [INFO ] Implicit Places using invariants and state equation in 342 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 614 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 4 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 627 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 80 ms :[p1, (AND p1 p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s8 1) (GEQ s16 1) (GEQ s38 1) (GEQ s56 1)), p0:(AND (GEQ s8 1) (GEQ s14 1) (GEQ s40 1) (GEQ s54 1))], 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]]
Product exploration explored 100000 steps with 24057 reset in 1963 ms.
Product exploration explored 100000 steps with 24081 reset in 1863 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-05 finished in 4825 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 (p1 U G(p0)))||F(!p1)))'
Support contains 8 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:31] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-13 11:36:31] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:31] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-13 11:36:32] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 413 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 7 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 428 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) p1)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s21 1) (GEQ s34 1) (GEQ s62 1)), p1:(AND (GEQ s11 1) (GEQ s18 1) (GEQ s39 1) (GEQ s61 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22267 reset in 2093 ms.
Product exploration explored 100000 steps with 22206 reset in 2239 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p0 p1), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Property proved to be true thanks to knowledge :(F (G (NOT p1)))
Knowledge based reduction with 3 factoid took 270 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-06 finished in 5243 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)||(X(p1)&&F(p2)))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:36] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-13 11:36:37] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:37] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-13 11:36:37] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:37] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-13 11:36:37] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 566 ms. Remains : 67/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 457 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s20 1) (GEQ s35 1) (GEQ s62 1)), p2:(AND (GEQ s11 1) (GEQ s12 1) (GEQ s45 1) (GEQ s56 1)), p1:(OR (LT s1 1) (LT s21 1) (LT s26 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, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-08 finished in 1048 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||F(p1)) U G(p1)))'
Support contains 4 out of 67 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:38] [INFO ] Invariants computation overflowed in 12 ms
[2023-03-13 11:36:38] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:38] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-13 11:36:38] [INFO ] Implicit Places using invariants and state equation in 329 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 539 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 6 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 553 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p1)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s19 1) (GEQ s27 1) (GEQ s51 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 10 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-11 finished in 628 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&&X(F(p1))&&G(p2))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:38] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-13 11:36:38] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:38] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-13 11:36:39] [INFO ] Implicit Places using invariants and state equation in 318 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 492 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 499 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 338 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : NQueens-PT-12-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s7 1) (GEQ s21 1) (GEQ s32 1) (GEQ s60 1)), p1:(AND (GEQ s0 1) (GEQ s13 1) (GEQ s33 1) (GEQ s45 1)), p0:(OR (LT s7 1) (LT s21 1) (LT s32 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 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-12 finished in 863 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(p0)))))'
Support contains 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:39] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-13 11:36:39] [INFO ] Implicit Places using invariants in 165 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:39] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-13 11:36:40] [INFO ] Implicit Places using invariants and state equation in 321 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 507 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 13 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 535 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 273 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-13 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s9 1) (GEQ s14 1) (GEQ s41 1) (GEQ s55 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, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA NQueens-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-13 finished in 830 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((X(p0)||G(p1)))&&F(p2))))'
Support contains 12 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 9 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:40] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-13 11:36:40] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:40] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-13 11:36:40] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 477 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 493 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NQueens-PT-12-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (LT s3 1) (LT s21 1) (LT s28 1) (LT s56 1)), p1:(OR (LT s0 1) (LT s20 1) (LT s26 1) (LT s52 1)), p0:(OR (LT s7 1) (LT s15 1) (LT s38 1) (LT s54 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 20716 reset in 1880 ms.
Product exploration explored 100000 steps with 20513 reset in 1754 ms.
Computed a total of 66 stabilizing places and 144 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 66 transition count 144
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (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 p2) (NOT p1) (NOT p0)), (F (G p2)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (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 (NOT p2))), (X (X p2)), (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 4 factoid took 569 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NQueens-PT-12-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NQueens-PT-12-LTLFireability-14 finished in 4988 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 4 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:45] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-13 11:36:45] [INFO ] Implicit Places using invariants in 179 ms returned []
// Phase 1: matrix 144 rows 67 cols
[2023-03-13 11:36:45] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-13 11:36:45] [INFO ] Implicit Places using invariants and state equation in 354 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 537 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/67 places, 144/144 transitions.
Applied a total of 0 rules in 5 ms. Remains 66 /66 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 549 ms. Remains : 66/67 places, 144/144 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-12-LTLFireability-15 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:(AND (GEQ s4 1) (GEQ s14 1) (GEQ s36 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-12-LTLFireability-15 finished in 678 ms.
All properties solved by simple procedures.
Total runtime 27290 ms.
ITS solved all properties within timeout

BK_STOP 1678707407360

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-12"
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-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863537600036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-12.tgz
mv NQueens-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;