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.r121-tall-162075406900412.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 JoinFreeModules-PT-0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r121-tall-162075406900412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 16K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 159K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.1K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 90K 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.1K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 16:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Mar 26 06:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 26 06:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 24 10:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 9.3K Mar 24 10:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 5 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 57K 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 JoinFreeModules-PT-0010-00
FORMULA_NAME JoinFreeModules-PT-0010-01
FORMULA_NAME JoinFreeModules-PT-0010-02
FORMULA_NAME JoinFreeModules-PT-0010-03
FORMULA_NAME JoinFreeModules-PT-0010-04
FORMULA_NAME JoinFreeModules-PT-0010-05
FORMULA_NAME JoinFreeModules-PT-0010-06
FORMULA_NAME JoinFreeModules-PT-0010-07
FORMULA_NAME JoinFreeModules-PT-0010-08
FORMULA_NAME JoinFreeModules-PT-0010-09
FORMULA_NAME JoinFreeModules-PT-0010-10
FORMULA_NAME JoinFreeModules-PT-0010-11
FORMULA_NAME JoinFreeModules-PT-0010-12
FORMULA_NAME JoinFreeModules-PT-0010-13
FORMULA_NAME JoinFreeModules-PT-0010-14
FORMULA_NAME JoinFreeModules-PT-0010-15

=== Now, execution of the tool begins

BK_START 1620841495213

Running Version 0
[2021-05-12 17:44:56] [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-12 17:44:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-12 17:44:56] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2021-05-12 17:44:56] [INFO ] Transformed 51 places.
[2021-05-12 17:44:56] [INFO ] Transformed 81 transitions.
[2021-05-12 17:44:56] [INFO ] Parsed PT model containing 51 places and 81 transitions in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-12 17:44:56] [INFO ] Initial state test concluded for 5 properties.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 9 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:56] [INFO ] Computed 10 place invariants in 7 ms
[2021-05-12 17:44:57] [INFO ] Dead Transitions using invariants and state equation in 131 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-12 17:44:57] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-12 17:44:57] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-12 17:44:57] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
[2021-05-12 17:44:57] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2021-05-12 17:44:57] [INFO ] Flatten gal took : 30 ms
FORMULA JoinFreeModules-PT-0010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0010-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-12 17:44:57] [INFO ] Flatten gal took : 10 ms
[2021-05-12 17:44:57] [INFO ] Input system was already deterministic with 81 transitions.
Incomplete random walk after 100001 steps, including 2 resets, run finished after 353 ms. (steps per millisecond=283 ) properties (out of 20) seen :19
Running SMT prover for 1 properties.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 2 ms
Successfully simplified 1 atomic propositions for a total of 10 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((G(p0) U (p1 U (G(p1)||(p1&&G(p2))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-12 17:44:57] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-12 17:44:57] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:57] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:57] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 398 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : JoinFreeModules-PT-0010-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 p1 p0), acceptance={} source=2 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND p2 p1), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=6 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=6 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={1} source=6 dest: 6}, { cond=(AND p2 p1 p0), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=6 dest: 9}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=7 dest: 5}, { cond=(AND p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND p2 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(NOT p2), acceptance={} source=8 dest: 3}, { cond=p2, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=9 dest: 4}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p2 p1 p0), acceptance={} source=9 dest: 9}]], initial=0, aps=[p2:(GT s43 s7), p1:(GT 1 s33), p0:(GT s18 s1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 107 steps with 0 reset in 3 ms.
FORMULA JoinFreeModules-PT-0010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-00 finished in 605 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 53 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-02 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 1 s27)], 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 80 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-02 finished in 201 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-12 17:44:58] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 4 ms
[2021-05-12 17:44:58] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-03 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:(GT s44 s13)], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-03 finished in 215 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 9 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:44:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:58] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2021-05-12 17:44:58] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:44:58] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 31 ms :[true, (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-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}]], initial=1, aps=[p0:(LEQ 1 s16)], 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 257 steps with 0 reset in 5 ms.
FORMULA JoinFreeModules-PT-0010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-06 finished in 184 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:58] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:59] [INFO ] Implicit Places using invariants in 18 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:44:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2021-05-12 17:44:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-07 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s19)], 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 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-07 finished in 194 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(F(p0))||(F(p0)&&X(!p0)))))], workingDir=/home/mcc/execution]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 3 ms
[2021-05-12 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:59] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-12 17:44:59] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s32 s46)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null][false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-09 finished in 158 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G((p1||X((G(p2) U (p1&&G(p2)))))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:59] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:44:59] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-12 17:44:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0010-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 s46), p1:(LEQ s39 s27), p2:(GT 2 s18)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1104 reset in 418 ms.
Stack based approach found an accepted trace after 199 steps with 1 reset with depth 164 and stack size 163 in 1 ms.
FORMULA JoinFreeModules-PT-0010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-10 finished in 639 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((X(X(p0))&&F(p1)) U (G(((X(X(p0))&&F(p1))||X(X(G(p0)))))||((p0||G(p2))&&((X(X(p0))&&F(p1))||X(X(G(p0))))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:44:59] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:45:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-12 17:45:00] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:45:00] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:45:00] [INFO ] Dead Transitions using invariants and state equation in 38 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 325 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), true, (NOT p1), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0010-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={} source=3 dest: 6}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 7}], [{ cond=(NOT p0), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 9}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 11}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=9 dest: 9}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 8}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 12}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=11 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=11 dest: 11}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=11 dest: 13}], [{ cond=(NOT p2), acceptance={} source=12 dest: 8}, { cond=p2, acceptance={} source=12 dest: 12}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=13 dest: 9}, { cond=(AND (NOT p1) p2), acceptance={} source=13 dest: 13}]], initial=0, aps=[p0:(GT s38 s15), p2:(LEQ s16 s4), p1:(LEQ s11 s29)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-12 finished in 492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((!p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:45:00] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:45:00] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:45:00] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2021-05-12 17:45:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:45:00] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 50 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : JoinFreeModules-PT-0010-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s16 s3), p0:(LEQ 1 s27)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-14 finished in 200 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((G(p0)||X((p1&&G(F(p2))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 50 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 50/50 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 81/81 (removed 0) transitions.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:45:00] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:45:00] [INFO ] Implicit Places using invariants in 13 ms returned []
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 0 ms
[2021-05-12 17:45:00] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
// Phase 1: matrix 81 rows 50 cols
[2021-05-12 17:45:00] [INFO ] Computed 10 place invariants in 1 ms
[2021-05-12 17:45:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 81/81 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), true, (NOT p2), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-0010-15 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND p0 p1), acceptance={} source=2 dest: 7}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(LEQ s48 s23), p1:(LEQ 1 s29), p2:(GT s8 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 83 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0010-15 finished in 318 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620841501881

--------------------
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="JoinFreeModules-PT-0010"
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 JoinFreeModules-PT-0010, 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 r121-tall-162075406900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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