Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477100051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GlobalResAllocation-COL-11, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 252K
-rw-r--r-- 1 mcc users 7.0K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 GlobalResAllocation-COL-11-LTLCardinality-00
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-01
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-02
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-03
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-04
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-05
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-06
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-07
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-08
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-09
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652686300111

Running Version 202205111006
[2022-05-16 07:31:42] [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]
[2022-05-16 07:31:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:31:42] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 07:31:43] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 07:31:43] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 891 ms
[2022-05-16 07:31:43] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 297 PT places and 2705087.0 transition bindings in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 31 ms.
Working with output stream class java.io.PrintStream
FORMULA GlobalResAllocation-COL-11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-16 07:31:43] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 11 ms.
[2022-05-16 07:31:43] [INFO ] Skeletonized 14 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-11-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10007 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2022-05-16 07:31:44] [INFO ] Computed 3 place invariants in 10 ms
[2022-05-16 07:31:44] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 07:31:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2022-05-16 07:31:44] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-16 07:31:44] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 5 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2022-05-16 07:31:44] [INFO ] Flatten gal took : 30 ms
[2022-05-16 07:31:44] [INFO ] Flatten gal took : 5 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 22
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 07:31:44] [INFO ] Unfolded HLPN to a Petri net with 45 places and 77 transitions 319 arcs in 25 ms.
[2022-05-16 07:31:44] [INFO ] Unfolded 9 HLPN properties in 15 ms.
Support contains 45 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 77/77 transitions.
Reduce isomorphic (modulo) transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 45 transition count 66
Applied a total of 22 rules in 15 ms. Remains 45 /45 variables (removed 0) and now considering 66/77 (removed 11) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:44] [INFO ] Computed 23 place invariants in 9 ms
[2022-05-16 07:31:44] [INFO ] Dead Transitions using invariants and state equation in 199 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:44] [INFO ] Computed 23 place invariants in 8 ms
[2022-05-16 07:31:44] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:44] [INFO ] Computed 23 place invariants in 11 ms
[2022-05-16 07:31:45] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:45] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 07:31:45] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 45/45 places, 66/77 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/77 transitions.
Support contains 45 out of 45 places after structural reductions.
[2022-05-16 07:31:45] [INFO ] Flatten gal took : 17 ms
[2022-05-16 07:31:45] [INFO ] Flatten gal took : 15 ms
[2022-05-16 07:31:45] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 16) seen :15
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:45] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 07:31:45] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 07:31:45] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2022-05-16 07:31:45] [INFO ] [Nat]Absence check using 12 positive and 11 generalized place invariants in 3 ms returned sat
[2022-05-16 07:31:45] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G((G(p0)||X(X(p0)))))))))'
Support contains 11 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 9 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:45] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:45] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:45] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:46] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:46] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 07:31:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 142 ms to find 0 implicit places.
[2022-05-16 07:31:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:46] [INFO ] Computed 12 place invariants in 8 ms
[2022-05-16 07:31:46] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 576 ms.
Stack based approach found an accepted trace after 348 steps with 0 reset with depth 349 and stack size 349 in 2 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-00 finished in 1251 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U !X(!(!G(p1)||p2))))'
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:47] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:31:47] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:47] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 07:31:47] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:47] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-16 07:31:47] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:47] [INFO ] Computed 23 place invariants in 4 ms
[2022-05-16 07:31:47] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 300 ms :[(AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1, (AND p1 (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 1 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22)), p2:(LEQ 1 (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33)), p1:(LEQ 1 (ADD s34 s35 s36 s37...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Product exploration explored 100000 steps with 50000 reset in 382 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1)))
Knowledge based reduction with 5 factoid took 419 ms. Reduced automaton from 5 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-01 finished in 1926 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(X(p1)))))'
Support contains 33 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Applied a total of 0 rules in 2 ms. Remains 45 /45 variables (removed 0) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:48] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:31:49] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 07:31:49] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:49] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-16 07:31:49] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 45 cols
[2022-05-16 07:31:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-16 07:31:49] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 45/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), 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: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p0:(AND (GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)) (LEQ (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 412 ms.
Product exploration explored 100000 steps with 33333 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-02 finished in 1518 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(p0) U F(!X(p1))))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:50] [INFO ] Computed 12 place invariants in 15 ms
[2022-05-16 07:31:50] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:50] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:50] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:50] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p1), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (LEQ 3 (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33)) (LEQ s11 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-03 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(true U (F(p0)&&p1))))'
Support contains 12 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:50] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:50] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:50] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:31:51] [INFO ] Implicit Places using invariants in 44 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:51] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:31:51] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:51] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 07:31:51] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (AND p0 p1), p0, (AND p0 p1)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 1 s11), p1:(LEQ 2 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-07 finished in 402 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(X((F(G(p0))&&F(!p0))) U p1)))'
Support contains 23 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:51] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:51] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:51] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:31:51] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:51] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 07:31:51] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-16 07:31:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:51] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:31:51] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 190 ms :[p1, false, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 1 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22)), p0:(LEQ s11 (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 10 reset in 392 ms.
Stack based approach found an accepted trace after 377 steps with 0 reset with depth 378 and stack size 378 in 2 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-09 finished in 905 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(F(!(G(p0) U p1)))))'
Support contains 22 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:52] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:52] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
[2022-05-16 07:31:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:52] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:52] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 134 ms :[p1, p1, (AND p1 p0)]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 3 (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22)), p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10) (ADD s12 s13 s14 s15 s16 s17 s18 s19 s20 s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 11 reset in 321 ms.
Stack based approach found an accepted trace after 414 steps with 0 reset with depth 415 and stack size 415 in 2 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-10 finished in 729 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(F(G(p1))&&X(!p1)))))'
Support contains 22 out of 45 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 34 transition count 66
Applied a total of 11 rules in 2 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:52] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:31:53] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:53] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:31:53] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:53] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:53] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:53] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:31:53] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 34/45 places, 66/66 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10)), p1:(LEQ 1 (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 7862 reset in 632 ms.
Stack based approach found an accepted trace after 109 steps with 7 reset with depth 12 and stack size 12 in 1 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-11 finished in 1031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(F(p0) U p1))'
Support contains 22 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 66/66 transitions.
Ensure Unique test removed 11 places
Applied a total of 0 rules in 3 ms. Remains 34 /45 variables (removed 11) and now considering 66/66 (removed 0) transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:53] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:54] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:54] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-16 07:31:54] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:54] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:54] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2022-05-16 07:31:54] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 66 rows 34 cols
[2022-05-16 07:31:54] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 07:31:54] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 34/45 places, 66/66 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, p1, (AND p1 p0), p0]
Running random walk in product with property : GlobalResAllocation-COL-11-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33)), p0:(LEQ (ADD s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33) (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-11-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-11-LTLCardinality-13 finished in 339 ms.
All properties solved by simple procedures.
Total runtime 11924 ms.

BK_STOP 1652686314424

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

+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m

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="GlobalResAllocation-COL-11"
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 GlobalResAllocation-COL-11, 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 r114-smll-165264477100051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-11.tgz
mv GlobalResAllocation-COL-11 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 ;