fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918800604
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for CSRepetitions-COL-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
310.100 13395.00 23980.00 389.10 TFTFFFFFTFFTFFFF normal

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.r024-tall-165251918800604.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 CSRepetitions-COL-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918800604
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 240K
-rw-r--r-- 1 mcc users 7.1K Apr 30 06:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 30 06:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Apr 30 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 30 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 9 07:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 9 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 5 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 16K May 10 09:33 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 CSRepetitions-COL-07-LTLFireability-00
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-01
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-02
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-03
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-04
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-05
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-06
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-07
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-08
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-09
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-10
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-11
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-12
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-13
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-14
FORMULA_NAME CSRepetitions-COL-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652666566910

Running Version 202205111006
[2022-05-16 02:02:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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 02:02:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 02:02:48] [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 02:02:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 02:02:48] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 515 ms
[2022-05-16 02:02:48] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 02:02:48] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 6 ms.
[2022-05-16 02:02:48] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 126 steps, including 1 resets, run visited all 7 properties in 9 ms. (steps per millisecond=14 )
[2022-05-16 02:02:48] [INFO ] Flatten gal took : 15 ms
[2022-05-16 02:02:48] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 7
[2022-05-16 02:02:49] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 15 ms.
[2022-05-16 02:02:49] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA CSRepetitions-COL-07-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 198 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:49] [INFO ] Computed 50 place invariants in 31 ms
[2022-05-16 02:02:49] [INFO ] Implicit Places using invariants in 174 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:49] [INFO ] Computed 50 place invariants in 4 ms
[2022-05-16 02:02:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:49] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:49] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-16 02:02:49] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Support contains 198 out of 198 places after structural reductions.
[2022-05-16 02:02:49] [INFO ] Flatten gal took : 27 ms
[2022-05-16 02:02:49] [INFO ] Flatten gal took : 36 ms
[2022-05-16 02:02:49] [INFO ] Input system was already deterministic with 245 transitions.
Finished random walk after 87 steps, including 0 resets, run visited all 11 properties in 12 ms. (steps per millisecond=7 )
FORMULA CSRepetitions-COL-07-LTLFireability-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CSRepetitions-COL-07-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(X((G(p0)||p1)))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:50] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:50] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:50] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:02:50] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:50] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:50] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-16 02:02:50] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 678 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}]], initial=1, aps=[p0:(AND (OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 533 ms.
Product exploration explored 100000 steps with 50000 reset in 485 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) p1), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 4 factoid took 134 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-07-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-00 finished in 2296 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((F(G(p0))&&X(F(G((X(p2)&&p1))))))))'
Support contains 149 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:52] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:02:52] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:52] [INFO ] Computed 50 place invariants in 7 ms
[2022-05-16 02:02:52] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:52] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2022-05-16 02:02:52] [INFO ] Redundant transitions in 12 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:52] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:52] [INFO ] Dead Transitions using invariants and state equation in 113 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 87 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-01 finished in 433 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1 U G(p2))))'
Support contains 196 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:52] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:52] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:52] [INFO ] Computed 50 place invariants in 9 ms
[2022-05-16 02:02:53] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:53] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-05-16 02:02:53] [INFO ] Redundant transitions in 16 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:53] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:53] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 575 ms :[(NOT p2), (NOT p0), (AND (NOT p0) (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s21 1) (GEQ s169 1)) (AND (GEQ s48 1) (GEQ s196 1)) (AND (GEQ s6 1) (GEQ s154 1)) (AND (GEQ s16 1) (GEQ s164 1)) (AND (GEQ s26 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 107 steps with 0 reset in 4 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-05 finished in 897 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 147 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:53] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:53] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:53] [INFO ] Computed 50 place invariants in 6 ms
[2022-05-16 02:02:53] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:53] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2022-05-16 02:02:53] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:54] [INFO ] Computed 50 place invariants in 5 ms
[2022-05-16 02:02:54] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s21 1) (GEQ s169 1)) (AND (GEQ s48 1) (GEQ s196 1)) (AND (GEQ s6 1) (GEQ s154 1)) (AND (GEQ s16 1) (GEQ s164 1)) (AND (GEQ s26 1) (GEQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 128 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-06 finished in 449 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 49 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 246 place count 50 transition count 147
Applied a total of 246 rules in 22 ms. Remains 50 /198 variables (removed 148) and now considering 147/245 (removed 98) transitions.
// Phase 1: matrix 147 rows 50 cols
[2022-05-16 02:02:54] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-16 02:02:54] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 147 rows 50 cols
[2022-05-16 02:02:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:02:54] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2022-05-16 02:02:54] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 147 rows 50 cols
[2022-05-16 02:02:54] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-16 02:02:54] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/198 places, 147/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/198 places, 147/245 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s15 1) (GEQ s17 1) (GEQ s19 1) (GEQ s21 1) (GEQ s23 1) (GEQ s25 1) (GEQ s27 1) (GEQ s29 1) (GEQ s31 1) (GEQ s33 1) (GEQ s35 1) (GEQ s37 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 1 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-07 finished in 272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(p0))||F(X(p1))))'
Support contains 100 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 13 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:54] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:54] [INFO ] Implicit Places using invariants in 64 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:54] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:54] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:54] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:54] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:54] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s21 1)) (AND (GEQ s0 1) (GEQ s23 1)) (AND (GEQ s0 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s0 1) (GEQ s29 1)) (A...], 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 666 ms.
Product exploration explored 100000 steps with 50000 reset in 681 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 p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-07-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-08 finished in 1910 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 11 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:56] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:56] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:56] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:02:56] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:56] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:56] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:56] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-11 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 (AND (GEQ s84 1) (GEQ s99 1)) (AND (GEQ s94 1) (GEQ s99 1)) (AND (GEQ s74 1) (GEQ s99 1)) (AND (GEQ s55 1) (GEQ s99 1)) (AND (GEQ s65 1) (GEQ s99 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 9558 reset in 462 ms.
Product exploration explored 100000 steps with 9542 reset in 557 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:58] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:58] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2022-05-16 02:02:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:58] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2022-05-16 02:02:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 02:02:58] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2022-05-16 02:02:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 02:02:58] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-16 02:02:58] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:59] [INFO ] [Nat]Added 49 Read/Feed constraints in 6 ms returned sat
[2022-05-16 02:02:59] [INFO ] Computed and/alt/rep : 196/245/196 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-16 02:02:59] [INFO ] Added : 0 causal constraints over 0 iterations in 45 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 50 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 147 rules applied. Total rules applied 147 place count 100 transition count 196
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 195 place count 52 transition count 148
Iterating global reduction 0 with 48 rules applied. Total rules applied 243 place count 52 transition count 148
Applied a total of 243 rules in 14 ms. Remains 52 /198 variables (removed 146) and now considering 148/245 (removed 97) transitions.
// Phase 1: matrix 148 rows 52 cols
[2022-05-16 02:02:59] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-16 02:02:59] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 148 rows 52 cols
[2022-05-16 02:02:59] [INFO ] Computed 1 place invariants in 7 ms
[2022-05-16 02:02:59] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-16 02:02:59] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 148 rows 52 cols
[2022-05-16 02:02:59] [INFO ] Computed 1 place invariants in 6 ms
[2022-05-16 02:02:59] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/198 places, 148/245 transitions.
Finished structural reductions, in 1 iterations. Remains : 52/198 places, 148/245 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA CSRepetitions-COL-07-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CSRepetitions-COL-07-LTLFireability-11 finished in 2884 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U F(p0))||(X(F(p1))&&(X(p0)||p2)))))'
Support contains 98 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 15 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:59] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:59] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:59] [INFO ] Computed 50 place invariants in 1 ms
[2022-05-16 02:02:59] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:02:59] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2022-05-16 02:02:59] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:59] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:59] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s64 1) (GEQ s66 1) (GEQ s68 1) (GEQ s70 1) (GEQ s72 1) (GEQ s74 1) (GEQ s76 1) (GEQ s78 1) (GEQ s80 1) (GEQ s82 1) (GEQ s84 1) (GEQ s86 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2748 steps with 258 reset in 20 ms.
FORMULA CSRepetitions-COL-07-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-12 finished in 533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!(p0 U p1)))&&X(G(p2))))'
Support contains 99 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:59] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:59] [INFO ] Implicit Places using invariants in 54 ms returned []
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:02:59] [INFO ] Computed 50 place invariants in 2 ms
[2022-05-16 02:02:59] [INFO ] State equation strengthened by 49 read => feed constraints.
[2022-05-16 02:03:00] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
// Phase 1: matrix 245 rows 198 cols
[2022-05-16 02:03:00] [INFO ] Computed 50 place invariants in 3 ms
[2022-05-16 02:03:00] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 198/198 places, 245/245 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (OR (NOT p2) p1), (OR (NOT p2) p1)]
Running random walk in product with property : CSRepetitions-COL-07-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s21 1) (GEQ s169 1)) (AND (GEQ s48 1) (GEQ s196 1)) (AND (GEQ s6 1) (GEQ s154 1)) (AND (GEQ s16 1) (GEQ s164 1)) (AND (GEQ s26 1) (GEQ s1...], 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 CSRepetitions-COL-07-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CSRepetitions-COL-07-LTLFireability-14 finished in 391 ms.
All properties solved by simple procedures.
Total runtime 12083 ms.

BK_STOP 1652666580305

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="CSRepetitions-COL-07"
export BK_EXAMINATION="LTLFireability"
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 CSRepetitions-COL-07, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918800604"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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