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.r294-smll-165463872300003.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 CANInsertWithFailure-PT-005, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r294-smll-165463872300003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 8.8K May 30 15:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 30 15:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 30 15:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 30 15:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.9K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 14K May 30 15:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 116K May 30 15:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 30 15:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K May 30 15:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 202K May 29 12:20 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 CANInsertWithFailure-PT-005-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-005-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1654639554598

Running Version 202205111006
[2022-06-07 22:05: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]
[2022-06-07 22:05:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-07 22:05:56] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2022-06-07 22:05:56] [INFO ] Transformed 114 places.
[2022-06-07 22:05:56] [INFO ] Transformed 180 transitions.
[2022-06-07 22:05:56] [INFO ] Parsed PT model containing 114 places and 180 transitions in 353 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 114 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 114/114 places, 180/180 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 113 transition count 180
Applied a total of 1 rules in 20 ms. Remains 113 /114 variables (removed 1) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:05:57] [INFO ] Computed 7 place invariants in 15 ms
[2022-06-07 22:05:57] [INFO ] Implicit Places using invariants in 282 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:05:57] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-07 22:05:57] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:05:57] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:05:57] [INFO ] Computed 7 place invariants in 14 ms
[2022-06-07 22:05:57] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/114 places, 180/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/114 places, 180/180 transitions.
Support contains 34 out of 113 places after structural reductions.
[2022-06-07 22:05:58] [INFO ] Flatten gal took : 122 ms
[2022-06-07 22:05:58] [INFO ] Flatten gal took : 28 ms
[2022-06-07 22:05:58] [INFO ] Input system was already deterministic with 180 transitions.
Support contains 33 out of 113 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 111 resets, run finished after 616 ms. (steps per millisecond=16 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 27 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:05:59] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:05:59] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:05:59] [INFO ] [Real]Absence check using 5 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-07 22:05:59] [INFO ] After 88ms SMT Verify possible using state equation in real domain returned unsat :3 sat :2
[2022-06-07 22:05:59] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:05:59] [INFO ] After 43ms SMT Verify possible using 45 Read/Feed constraints in real domain returned unsat :3 sat :0 real:2
[2022-06-07 22:05:59] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2022-06-07 22:05:59] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2022-06-07 22:05:59] [INFO ] [Nat]Absence check using 5 positive and 2 generalized place invariants in 4 ms returned sat
[2022-06-07 22:05:59] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2022-06-07 22:05:59] [INFO ] After 58ms SMT Verify possible using 45 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2022-06-07 22:05:59] [INFO ] After 144ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2022-06-07 22:05:59] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 22 ms.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 110 place count 58 transition count 125
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 122 place count 58 transition count 113
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 123 place count 58 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 57 transition count 112
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 3 with 29 rules applied. Total rules applied 153 place count 57 transition count 112
Applied a total of 153 rules in 70 ms. Remains 57 /113 variables (removed 56) and now considering 112/180 (removed 68) transitions.
Finished structural reductions, in 1 iterations. Remains : 57/113 places, 112/180 transitions.
Incomplete random walk after 10000 steps, including 376 resets, run finished after 244 ms. (steps per millisecond=40 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 73 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Probably explored full state space saw : 12249 states, properties seen :0
Probabilistic random walk after 67705 steps, saw 12249 distinct states, run finished after 324 ms. (steps per millisecond=208 ) properties seen :0
Explored full state space saw : 12249 states, properties seen :0
Exhaustive walk after 67705 steps, saw 12249 distinct states, run finished after 304 ms. (steps per millisecond=222 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 10 simplifications.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 22 stabilizing places and 35 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(F(X(F(G(p0)))))||p1))))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 8 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:01] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:01] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:01] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:01] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:01] [INFO ] Implicit Places using invariants and state equation in 289 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:01] [INFO ] Computed 7 place invariants in 4 ms
[2022-06-07 22:06:01] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GT s57 s48), p0:(GT s19 s36)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-00 finished in 1021 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 113 transition count 150
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 83 transition count 150
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 100 place count 63 transition count 130
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 112 place count 63 transition count 118
Applied a total of 112 rules in 24 ms. Remains 63 /113 variables (removed 50) and now considering 118/180 (removed 62) transitions.
// Phase 1: matrix 118 rows 63 cols
[2022-06-07 22:06:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:02] [INFO ] Implicit Places using invariants in 61 ms returned []
// Phase 1: matrix 118 rows 63 cols
[2022-06-07 22:06:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:02] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-07 22:06:02] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2022-06-07 22:06:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 118 rows 63 cols
[2022-06-07 22:06:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:02] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/113 places, 118/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 63/113 places, 118/180 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 571 steps with 23 reset in 6 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-02 finished in 370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((p0||(!(p1 U p0)&&X(p2))))))'
Support contains 6 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:02] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:02] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:02] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:02] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:02] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:02] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:03] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 304 ms :[true, (NOT p2), (OR (NOT p2) p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR p0 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=3, aps=[p2:(GT s64 s5), p0:(LEQ s34 s8), p1:(LEQ s71 s65)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 545 steps with 6 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-04 finished in 707 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:03] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:03] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:03] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:03] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:03] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:03] [INFO ] Computed 7 place invariants in 3 ms
[2022-06-07 22:06:03] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LEQ s55 s64) (LEQ s108 s37))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 545 ms.
Product exploration explored 100000 steps with 50000 reset in 415 ms.
Computed a total of 22 stabilizing places and 35 stable transitions
Computed a total of 22 stabilizing places and 35 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-05 finished in 1668 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(p0))))'
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 102 place count 62 transition count 129
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 2 with 9 rules applied. Total rules applied 111 place count 62 transition count 120
Partial Post-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 119 place count 62 transition count 120
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 122 place count 59 transition count 117
Iterating global reduction 2 with 3 rules applied. Total rules applied 125 place count 59 transition count 117
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 128 place count 59 transition count 114
Applied a total of 128 rules in 47 ms. Remains 59 /113 variables (removed 54) and now considering 114/180 (removed 66) transitions.
// Phase 1: matrix 114 rows 59 cols
[2022-06-07 22:06:05] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:05] [INFO ] Implicit Places using invariants in 85 ms returned []
// Phase 1: matrix 114 rows 59 cols
[2022-06-07 22:06:05] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-06-07 22:06:05] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 292 ms to find 0 implicit places.
[2022-06-07 22:06:05] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 114 rows 59 cols
[2022-06-07 22:06:05] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:05] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 114/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/113 places, 114/180 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-06 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 s34 s7)], 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 18 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-06 finished in 554 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U G(!X(!p0))))))'
Support contains 1 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 108 place count 59 transition count 126
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 119 place count 59 transition count 115
Applied a total of 119 rules in 26 ms. Remains 59 /113 variables (removed 54) and now considering 115/180 (removed 65) transitions.
// Phase 1: matrix 115 rows 59 cols
[2022-06-07 22:06:05] [INFO ] Computed 7 place invariants in 7 ms
[2022-06-07 22:06:05] [INFO ] Implicit Places using invariants in 94 ms returned []
// Phase 1: matrix 115 rows 59 cols
[2022-06-07 22:06:05] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-06-07 22:06:05] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2022-06-07 22:06:05] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 115 rows 59 cols
[2022-06-07 22:06:05] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:06] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/113 places, 115/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/113 places, 115/180 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-07 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 1 s44)], 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 3508 reset in 330 ms.
Stack based approach found an accepted trace after 2006 steps with 74 reset with depth 22 and stack size 22 in 9 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-07 finished in 904 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F((F((F(p0)&&p1))&&p2)))))'
Support contains 5 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 113 transition count 145
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 78 transition count 145
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 100 place count 63 transition count 130
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 108 place count 63 transition count 122
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 63 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 116 place count 61 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 61 transition count 120
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 121 place count 61 transition count 117
Applied a total of 121 rules in 30 ms. Remains 61 /113 variables (removed 52) and now considering 117/180 (removed 63) transitions.
// Phase 1: matrix 117 rows 61 cols
[2022-06-07 22:06:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:06] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 117 rows 61 cols
[2022-06-07 22:06:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:06] [INFO ] State equation strengthened by 65 read => feed constraints.
[2022-06-07 22:06:06] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-06-07 22:06:06] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 117 rows 61 cols
[2022-06-07 22:06:06] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:06] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/113 places, 117/180 transitions.
Finished structural reductions, in 1 iterations. Remains : 61/113 places, 117/180 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (NOT p2), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GT 1 s60), p2:(GT s40 s58), p1:(GT s25 s52)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-11 finished in 498 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U X(p1))))'
Support contains 3 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 180/180 transitions.
Applied a total of 0 rules in 2 ms. Remains 113 /113 variables (removed 0) and now considering 180/180 (removed 0) transitions.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:07] [INFO ] Computed 7 place invariants in 1 ms
[2022-06-07 22:06:07] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:07] [INFO ] Computed 7 place invariants in 2 ms
[2022-06-07 22:06:07] [INFO ] State equation strengthened by 45 read => feed constraints.
[2022-06-07 22:06:07] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
// Phase 1: matrix 180 rows 113 cols
[2022-06-07 22:06:07] [INFO ] Computed 7 place invariants in 5 ms
[2022-06-07 22:06:07] [INFO ] Dead Transitions using invariants and state equation in 177 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 180/180 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-005-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s66 s28), p1:(LEQ 1 s40)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 4674 steps with 211 reset in 8 ms.
FORMULA CANInsertWithFailure-PT-005-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-005-LTLCardinality-14 finished in 616 ms.
All properties solved by simple procedures.
Total runtime 11304 ms.

BK_STOP 1654639567729

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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="CANInsertWithFailure-PT-005"
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 CANInsertWithFailure-PT-005, 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 r294-smll-165463872300003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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