Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r140-tall-162089127200052.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NQueens-PT-20, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r140-tall-162089127200052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 728K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 117K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 06:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 06:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Mar 25 07:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 07:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 349K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NQueens-PT-20-00
FORMULA_NAME NQueens-PT-20-01
FORMULA_NAME NQueens-PT-20-02
FORMULA_NAME NQueens-PT-20-03
FORMULA_NAME NQueens-PT-20-04
FORMULA_NAME NQueens-PT-20-05
FORMULA_NAME NQueens-PT-20-06
FORMULA_NAME NQueens-PT-20-07
FORMULA_NAME NQueens-PT-20-08
FORMULA_NAME NQueens-PT-20-09
FORMULA_NAME NQueens-PT-20-10
FORMULA_NAME NQueens-PT-20-11
FORMULA_NAME NQueens-PT-20-12
FORMULA_NAME NQueens-PT-20-13
FORMULA_NAME NQueens-PT-20-14
FORMULA_NAME NQueens-PT-20-15

=== Now, execution of the tool begins

BK_START 1620922422367

Running Version 0
[2021-05-13 16:14:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-13 16:14:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 16:14:08] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2021-05-13 16:14:08] [INFO ] Transformed 520 places.
[2021-05-13 16:14:08] [INFO ] Transformed 400 transitions.
[2021-05-13 16:14:08] [INFO ] Parsed PT model containing 520 places and 400 transitions in 166 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-13 16:14:08] [INFO ] Initial state test concluded for 4 properties.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-20-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 518 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 518/518 places, 400/400 transitions.
Reduce places removed 363 places and 0 transitions.
Iterating post reduction 0 with 363 rules applied. Total rules applied 363 place count 155 transition count 400
Applied a total of 363 rules in 27 ms. Remains 155 /518 variables (removed 363) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 155 cols
[2021-05-13 16:14:08] [INFO ] Invariants computation overflowed in 69 ms
[2021-05-13 16:14:09] [INFO ] Implicit Places using invariants in 307 ms returned []
// Phase 1: matrix 400 rows 155 cols
[2021-05-13 16:14:09] [INFO ] Invariants computation overflowed in 34 ms
[2021-05-13 16:14:09] [INFO ] Implicit Places using invariants and state equation in 515 ms returned [77, 116, 154]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 849 ms to find 3 implicit places.
// Phase 1: matrix 400 rows 152 cols
[2021-05-13 16:14:09] [INFO ] Invariants computation overflowed in 35 ms
[2021-05-13 16:14:09] [INFO ] Dead Transitions using invariants and state equation in 200 ms returned []
Starting structural reductions, iteration 1 : 152/518 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 152 cols
[2021-05-13 16:14:09] [INFO ] Invariants computation overflowed in 26 ms
[2021-05-13 16:14:09] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Finished structural reductions, in 2 iterations. Remains : 152/518 places, 400/400 transitions.
[2021-05-13 16:14:10] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-13 16:14:10] [INFO ] Flatten gal took : 80 ms
FORMULA NQueens-PT-20-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-20-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 16:14:10] [INFO ] Flatten gal took : 43 ms
[2021-05-13 16:14:10] [INFO ] Input system was already deterministic with 400 transitions.
Incomplete random walk after 100000 steps, including 5402 resets, run finished after 2843 ms. (steps per millisecond=35 ) properties (out of 21) seen :15
Running SMT prover for 6 properties.
// Phase 1: matrix 400 rows 152 cols
[2021-05-13 16:14:13] [INFO ] Invariants computation overflowed in 39 ms
[2021-05-13 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:14:13] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2021-05-13 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:14:13] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2021-05-13 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:14:13] [INFO ] [Real]Absence check using state equation in 53 ms returned unsat
[2021-05-13 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:14:13] [INFO ] [Real]Absence check using state equation in 99 ms returned unsat
[2021-05-13 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:14:13] [INFO ] [Real]Absence check using state equation in 59 ms returned unsat
[2021-05-13 16:14:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 16:14:13] [INFO ] [Real]Absence check using state equation in 59 ms returned unsat
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
[2021-05-13 16:14:13] [INFO ] Initial state test concluded for 1 properties.
FORMULA NQueens-PT-20-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 117 transition count 400
Applied a total of 35 rules in 9 ms. Remains 117 /152 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:37] [INFO ] Invariants computation overflowed in 69 ms
[2021-05-13 16:14:37] [INFO ] Implicit Places using invariants in 199 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:37] [INFO ] Invariants computation overflowed in 24 ms
[2021-05-13 16:14:38] [INFO ] Implicit Places using invariants and state equation in 520 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 727 ms to find 1 implicit places.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:38] [INFO ] Invariants computation overflowed in 22 ms
[2021-05-13 16:14:38] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Starting structural reductions, iteration 1 : 116/152 places, 400/400 transitions.
Applied a total of 0 rules in 7 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:38] [INFO ] Invariants computation overflowed in 31 ms
[2021-05-13 16:14:38] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 2 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-00 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 944 steps with 51 reset in 31 ms.
FORMULA NQueens-PT-20-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-00 finished in 25242 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Graph (complete) has 148 edges and 152 vertex of which 117 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.4 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 12 ms. Remains 117 /152 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:38] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:14:39] [INFO ] Implicit Places using invariants in 133 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:39] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:14:39] [INFO ] Implicit Places using invariants and state equation in 500 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 641 ms to find 1 implicit places.
[2021-05-13 16:14:39] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:39] [INFO ] Invariants computation overflowed in 35 ms
[2021-05-13 16:14:39] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Starting structural reductions, iteration 1 : 116/152 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-05-13 16:14:39] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:39] [INFO ] Invariants computation overflowed in 21 ms
[2021-05-13 16:14:40] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Finished structural reductions, in 2 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s1)], 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 293 steps with 15 reset in 9 ms.
FORMULA NQueens-PT-20-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-03 finished in 1167 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Graph (complete) has 148 edges and 152 vertex of which 117 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 117 /152 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:40] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:40] [INFO ] Implicit Places using invariants in 130 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:40] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:40] [INFO ] Implicit Places using invariants and state equation in 517 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 650 ms to find 1 implicit places.
[2021-05-13 16:14:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:40] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:40] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Starting structural reductions, iteration 1 : 116/152 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-05-13 16:14:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:40] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:41] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 2 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : NQueens-PT-20-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 684 steps with 37 reset in 20 ms.
FORMULA NQueens-PT-20-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-05 finished in 1075 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 7 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 120 transition count 400
Applied a total of 32 rules in 3 ms. Remains 120 /152 variables (removed 32) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 120 cols
[2021-05-13 16:14:41] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:14:41] [INFO ] Implicit Places using invariants in 166 ms returned []
// Phase 1: matrix 400 rows 120 cols
[2021-05-13 16:14:41] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:14:41] [INFO ] Implicit Places using invariants and state equation in 471 ms returned [82]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 638 ms to find 1 implicit places.
// Phase 1: matrix 400 rows 119 cols
[2021-05-13 16:14:41] [INFO ] Invariants computation overflowed in 22 ms
[2021-05-13 16:14:42] [INFO ] Dead Transitions using invariants and state equation in 177 ms returned []
Starting structural reductions, iteration 1 : 119/152 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 119 /119 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 119 cols
[2021-05-13 16:14:42] [INFO ] Invariants computation overflowed in 22 ms
[2021-05-13 16:14:42] [INFO ] Dead Transitions using invariants and state equation in 169 ms returned []
Finished structural reductions, in 2 iterations. Remains : 119/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-06 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LEQ 1 s2) (GT s4 s1) (OR (GT s22 s111) (LEQ s3 s0)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-06 finished in 1080 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)&&X(G(p1))))], workingDir=/home/mcc/execution]
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Reduce places removed 33 places and 0 transitions.
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 119 transition count 400
Applied a total of 33 rules in 2 ms. Remains 119 /152 variables (removed 33) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 119 cols
[2021-05-13 16:14:42] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:42] [INFO ] Implicit Places using invariants in 128 ms returned []
// Phase 1: matrix 400 rows 119 cols
[2021-05-13 16:14:42] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:51] [INFO ] Implicit Places using invariants and state equation in 8991 ms returned [81]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 9119 ms to find 1 implicit places.
// Phase 1: matrix 400 rows 118 cols
[2021-05-13 16:14:51] [INFO ] Invariants computation overflowed in 41 ms
[2021-05-13 16:14:51] [INFO ] Dead Transitions using invariants and state equation in 203 ms returned []
Starting structural reductions, iteration 1 : 118/152 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 118 /118 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 118 cols
[2021-05-13 16:14:51] [INFO ] Invariants computation overflowed in 28 ms
[2021-05-13 16:14:51] [INFO ] Dead Transitions using invariants and state equation in 183 ms returned []
Finished structural reductions, in 2 iterations. Remains : 118/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NQueens-PT-20-08 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ s3 s0), p1:(LEQ s1 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 685 steps with 37 reset in 20 ms.
FORMULA NQueens-PT-20-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-08 finished in 9615 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Graph (complete) has 148 edges and 152 vertex of which 117 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 117 /152 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:51] [INFO ] Computed 4 place invariants in 23 ms
[2021-05-13 16:14:52] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:52] [INFO ] Computed 4 place invariants in 24 ms
[2021-05-13 16:14:52] [INFO ] Implicit Places using invariants and state equation in 714 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 877 ms to find 1 implicit places.
[2021-05-13 16:14:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:52] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:14:52] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 116/152 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-05-13 16:14:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:52] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:14:53] [INFO ] Dead Transitions using invariants and state equation in 161 ms returned []
Finished structural reductions, in 2 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-09 automaton TGBA [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 17 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-09 finished in 1246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 117 transition count 400
Applied a total of 35 rules in 3 ms. Remains 117 /152 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:53] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:53] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:53] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:53] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 607 ms to find 1 implicit places.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:53] [INFO ] Invariants computation overflowed in 34 ms
[2021-05-13 16:14:53] [INFO ] Dead Transitions using invariants and state equation in 179 ms returned []
Starting structural reductions, iteration 1 : 116/152 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:53] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:54] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 2 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : NQueens-PT-20-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NQueens-PT-20-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-10 finished in 1037 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 116 transition count 400
Applied a total of 36 rules in 2 ms. Remains 116 /152 variables (removed 36) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:54] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:14:54] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:54] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:14:54] [INFO ] Implicit Places using invariants and state equation in 483 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 608 ms to find 1 implicit places.
// Phase 1: matrix 400 rows 115 cols
[2021-05-13 16:14:54] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:14:54] [INFO ] Dead Transitions using invariants and state equation in 171 ms returned []
Starting structural reductions, iteration 1 : 115/152 places, 400/400 transitions.
Applied a total of 0 rules in 2 ms. Remains 115 /115 variables (removed 0) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 115 cols
[2021-05-13 16:14:54] [INFO ] Invariants computation overflowed in 19 ms
[2021-05-13 16:14:55] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Finished structural reductions, in 2 iterations. Remains : 115/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NQueens-PT-20-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 102 steps with 42 reset in 6 ms.
FORMULA NQueens-PT-20-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-11 finished in 1017 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Graph (complete) has 148 edges and 152 vertex of which 116 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 116 /152 variables (removed 36) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:55] [INFO ] Invariants computation overflowed in 17 ms
[2021-05-13 16:14:55] [INFO ] Implicit Places using invariants in 125 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:55] [INFO ] Invariants computation overflowed in 18 ms
[2021-05-13 16:14:55] [INFO ] Implicit Places using invariants and state equation in 467 ms returned [78]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 595 ms to find 1 implicit places.
[2021-05-13 16:14:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 115 cols
[2021-05-13 16:14:55] [INFO ] Invariants computation overflowed in 21 ms
[2021-05-13 16:14:55] [INFO ] Dead Transitions using invariants and state equation in 148 ms returned []
Starting structural reductions, iteration 1 : 115/152 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 115 /115 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-05-13 16:14:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 115 cols
[2021-05-13 16:14:55] [INFO ] Invariants computation overflowed in 20 ms
[2021-05-13 16:14:56] [INFO ] Dead Transitions using invariants and state equation in 165 ms returned []
Finished structural reductions, in 2 iterations. Remains : 115/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-12 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 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 18 steps with 0 reset in 1 ms.
FORMULA NQueens-PT-20-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-12 finished in 969 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Graph (complete) has 148 edges and 152 vertex of which 116 are kept as prefixes of interest. Removing 36 places using SCC suffix rule.1 ms
Discarding 36 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 116 /152 variables (removed 36) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:56] [INFO ] Invariants computation overflowed in 16 ms
[2021-05-13 16:14:56] [INFO ] Implicit Places using invariants in 131 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:56] [INFO ] Invariants computation overflowed in 17 ms
[2021-05-13 16:14:56] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2021-05-13 16:14:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:56] [INFO ] Invariants computation overflowed in 16 ms
[2021-05-13 16:14:56] [INFO ] Dead Transitions using invariants and state equation in 140 ms returned []
Finished structural reductions, in 1 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Running random walk in product with property : NQueens-PT-20-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(LEQ s0 s78)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 2177 steps with 117 reset in 62 ms.
FORMULA NQueens-PT-20-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-13 finished in 902 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 152/152 places, 400/400 transitions.
Graph (complete) has 148 edges and 152 vertex of which 117 are kept as prefixes of interest. Removing 35 places using SCC suffix rule.1 ms
Discarding 35 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 117 /152 variables (removed 35) and now considering 400/400 (removed 0) transitions.
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:57] [INFO ] Computed 4 place invariants in 22 ms
[2021-05-13 16:14:57] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 400 rows 117 cols
[2021-05-13 16:14:57] [INFO ] Computed 4 place invariants in 23 ms
[2021-05-13 16:14:57] [INFO ] Implicit Places using invariants and state equation in 572 ms returned [79]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 724 ms to find 1 implicit places.
[2021-05-13 16:14:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:57] [INFO ] Computed 3 place invariants in 16 ms
[2021-05-13 16:14:57] [INFO ] Dead Transitions using invariants and state equation in 166 ms returned []
Starting structural reductions, iteration 1 : 116/152 places, 400/400 transitions.
Applied a total of 0 rules in 10 ms. Remains 116 /116 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2021-05-13 16:14:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 400 rows 116 cols
[2021-05-13 16:14:58] [INFO ] Computed 3 place invariants in 16 ms
[2021-05-13 16:14:58] [INFO ] Dead Transitions using invariants and state equation in 172 ms returned []
Finished structural reductions, in 2 iterations. Remains : 116/152 places, 400/400 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : NQueens-PT-20-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s0 s1)], 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 959 steps with 51 reset in 27 ms.
FORMULA NQueens-PT-20-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NQueens-PT-20-14 finished in 1161 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620922500112

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-20"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is NQueens-PT-20, 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 r140-tall-162089127200052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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