Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r351-tall-171679102400443.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is SharedMemory-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102400443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.5K Apr 12 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 15:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12K May 18 16:43 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 SharedMemory-COL-000010-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716899891778

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000010
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-28 12:38:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 12:38:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 12:38:13] [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.
[2024-05-28 12:38:13] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 12:38:14] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 666 ms
[2024-05-28 12:38:14] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 12:38:14] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 5 ms.
[2024-05-28 12:38:14] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA SharedMemory-COL-000010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 37 steps, including 0 resets, run visited all 3 properties in 8 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-28 12:38:14] [INFO ] Flatten gal took : 13 ms
[2024-05-28 12:38:14] [INFO ] Flatten gal took : 1 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2024-05-28 12:38:14] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 15 ms.
[2024-05-28 12:38:14] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
FORMULA SharedMemory-COL-000010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 7 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2024-05-28 12:38:14] [INFO ] Computed 21 invariants in 15 ms
[2024-05-28 12:38:14] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-28 12:38:14] [INFO ] Invariant cache hit.
[2024-05-28 12:38:14] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2024-05-28 12:38:14] [INFO ] Invariant cache hit.
[2024-05-28 12:38:14] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 413 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2024-05-28 12:38:14] [INFO ] Flatten gal took : 34 ms
[2024-05-28 12:38:14] [INFO ] Flatten gal took : 34 ms
[2024-05-28 12:38:15] [INFO ] Input system was already deterministic with 210 transitions.
Finished random walk after 26 steps, including 0 resets, run visited all 8 properties in 19 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 22 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:15] [INFO ] Invariant cache hit.
[2024-05-28 12:38:15] [INFO ] Implicit Places using invariants in 137 ms returned []
[2024-05-28 12:38:15] [INFO ] Invariant cache hit.
[2024-05-28 12:38:15] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2024-05-28 12:38:15] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-28 12:38:15] [INFO ] Invariant cache hit.
[2024-05-28 12:38:15] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 404 ms. Remains : 131/131 places, 210/210 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s30 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 741 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-01 finished in 1387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U X(G(!p0)))))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:16] [INFO ] Invariant cache hit.
[2024-05-28 12:38:16] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-28 12:38:16] [INFO ] Invariant cache hit.
[2024-05-28 12:38:17] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2024-05-28 12:38:17] [INFO ] Invariant cache hit.
[2024-05-28 12:38:17] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 145 ms :[p0, p0, true, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s30 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-02 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 16 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:17] [INFO ] Invariant cache hit.
[2024-05-28 12:38:17] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 12:38:17] [INFO ] Invariant cache hit.
[2024-05-28 12:38:17] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
[2024-05-28 12:38:17] [INFO ] Redundant transitions in 7 ms returned []
[2024-05-28 12:38:17] [INFO ] Invariant cache hit.
[2024-05-28 12:38:17] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s30 1) (LT s31 1)) (AND (GEQ s15 1) (GEQ s20 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 1747 ms.
Stack based approach found an accepted trace after 94 steps with 0 reset with depth 95 and stack size 90 in 7 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-03 finished in 2103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U !p2)||(X(!p3) U (X(G(!p3))||(X(!p3)&&G(!p4))))||p0)))'
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:19] [INFO ] Invariant cache hit.
[2024-05-28 12:38:19] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 12:38:19] [INFO ] Invariant cache hit.
[2024-05-28 12:38:19] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-28 12:38:19] [INFO ] Invariant cache hit.
[2024-05-28 12:38:19] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 211 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 529 ms :[true, (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND p4 p3), (AND p2 p3 p4), p4, (AND p2 p4), p3, p3, (AND p2 p3), (AND p2 p3), p2]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p2 (NOT p1) p4), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p4)), acceptance={} source=2 dest: 8}, { cond=(AND (NOT p0) p2 p1 (NOT p4)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p0) p2 p1 p4), acceptance={} source=2 dest: 10}], [{ cond=(AND p4 p3), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p4) p3), acceptance={} source=3 dest: 5}, { cond=(AND p4 (NOT p3)), acceptance={} source=3 dest: 7}], [{ cond=(AND p2 (NOT p1) p4 p3), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=4 dest: 3}, { cond=(AND p2 p1 (NOT p4) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1) (NOT p4) p3), acceptance={} source=4 dest: 5}, { cond=(AND p2 p1 (NOT p4) p3), acceptance={} source=4 dest: 6}, { cond=(AND p2 (NOT p1) p4 (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p2 p1 p4 (NOT p3)), acceptance={} source=4 dest: 10}, { cond=(AND p2 p1 p4 p3), acceptance={} source=4 dest: 11}], [{ cond=p4, acceptance={} source=5 dest: 0}, { cond=(NOT p4), acceptance={} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1) p4), acceptance={} source=6 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=6 dest: 5}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1 p4), acceptance={} source=6 dest: 11}], [{ cond=p3, acceptance={} source=7 dest: 0}, { cond=(AND p4 (NOT p3)), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=7 dest: 8}], [{ cond=p3, acceptance={} source=8 dest: 0}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=8 dest: 3}, { cond=(AND p4 (NOT p3)), acceptance={} source=8 dest: 7}], [{ cond=(AND p2 (NOT p1) p3), acceptance={} source=9 dest: 0}, { cond=(AND p2 (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=9 dest: 3}, { cond=(AND p2 p1 (NOT p4) (NOT p3)), acceptance={} source=9 dest: 4}, { cond=(AND p2 (NOT p1) p4 (NOT p3)), acceptance={} source=9 dest: 7}, { cond=(AND p2 p1 p4 (NOT p3)), acceptance={} source=9 dest: 10}, { cond=(AND p2 p1 p3), acceptance={} source=9 dest: 11}], [{ cond=(AND p2 (NOT p1) p3), acceptance={} source=10 dest: 0}, { cond=(AND p2 (NOT p1) p4 (NOT p3)), acceptance={} source=10 dest: 7}, { cond=(AND p2 (NOT p1) (NOT p4) (NOT p3)), acceptance={} source=10 dest: 8}, { cond=(AND p2 p1 (NOT p4) (NOT p3)), acceptance={} source=10 dest: 9}, { cond=(AND p2 p1 p4 (NOT p3)), acceptance={} source=10 dest: 10}, { cond=(AND p2 p1 p3), acceptance={} source=10 dest: 11}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=11 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=11 dest: 11}]], initial=1, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 511 ms.
Product exploration explored 100000 steps with 50000 reset in 503 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) (NOT p3)), (X (NOT (AND (NOT p0) p2 (NOT p1) p4))), (X (NOT (AND (NOT p0) p2 p1 (NOT p4)))), (X (NOT (AND (NOT p0) p2 p1 p4))), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p4)))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p4 (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND p2 p1 p4 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND p2 p1 p3))))]
False Knowledge obtained : [(X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 20 ms. Reduced automaton from 12 states, 44 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000010-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000010-LTLFireability-04 finished in 1820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 21 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:21] [INFO ] Invariant cache hit.
[2024-05-28 12:38:21] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-28 12:38:21] [INFO ] Invariant cache hit.
[2024-05-28 12:38:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-28 12:38:21] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 12:38:21] [INFO ] Invariant cache hit.
[2024-05-28 12:38:21] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 348 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s32 1) (LT s33 1) (LT s34 1) (LT s35 1) (LT s36 1) (LT s37 1) (LT s39 1) (LT s38 1) (LT s30 1) (LT s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 662 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-05 finished in 1072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G((F(p1)&&(p1 U !p0))))))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:22] [INFO ] Invariant cache hit.
[2024-05-28 12:38:22] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 12:38:22] [INFO ] Invariant cache hit.
[2024-05-28 12:38:22] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 121 ms to find 0 implicit places.
[2024-05-28 12:38:22] [INFO ] Invariant cache hit.
[2024-05-28 12:38:22] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), p0, true, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}, { cond=(AND p1 p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(AND p1 p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s9 1) (GEQ s29 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3839 steps with 170 reset in 24 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-06 finished in 542 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 90 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:22] [INFO ] Invariant cache hit.
[2024-05-28 12:38:22] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-05-28 12:38:22] [INFO ] Invariant cache hit.
[2024-05-28 12:38:22] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
[2024-05-28 12:38:22] [INFO ] Invariant cache hit.
[2024-05-28 12:38:23] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-12 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 (GEQ s122 1) (GEQ s63 1) (GEQ s126 1) (GEQ s67 1) (GEQ s70 1) (GEQ s74 1) (GEQ s78 1) (GEQ s81 1) (GEQ s85 1) (GEQ s89 1) (GEQ s92 1) (GEQ s96 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 18391 reset in 436 ms.
Stack based approach found an accepted trace after 208 steps with 35 reset with depth 7 and stack size 7 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-12 finished in 752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(F(!p0)))))))'
Support contains 110 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:23] [INFO ] Invariant cache hit.
[2024-05-28 12:38:23] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 12:38:23] [INFO ] Invariant cache hit.
[2024-05-28 12:38:23] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2024-05-28 12:38:23] [INFO ] Invariant cache hit.
[2024-05-28 12:38:23] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 241 ms :[p0, p0, p0, p0, p0, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s9 1) (GEQ s29 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, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9720 reset in 365 ms.
Stack based approach found an accepted trace after 105 steps with 10 reset with depth 12 and stack size 12 in 2 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-13 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0 U (G(p0)||(p0&&G((X(G(!p1))&&F(!p2)))))))))'
Support contains 121 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:24] [INFO ] Invariant cache hit.
[2024-05-28 12:38:24] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-28 12:38:24] [INFO ] Invariant cache hit.
[2024-05-28 12:38:24] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-05-28 12:38:24] [INFO ] Invariant cache hit.
[2024-05-28 12:38:24] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 276 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 232 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1, 2} source=1 dest: 1}, { cond=p0, acceptance={0, 2} source=1 dest: 2}, { cond=p0, acceptance={2} source=1 dest: 3}, { cond=(AND p2 p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={0, 1, 2} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={2} source=2 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0, 2} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1, 2} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={2} source=3 dest: 3}, { cond=(NOT p0), acceptance={1, 2} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0), acceptance={0, 2} source=4 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={0, 1, 2} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s122 1) (GEQ s63 1) (GEQ s126 1) (GEQ s67 1) (GEQ s70 1) (GEQ s74 1) (GEQ s78 1) (GEQ s81 1) (GEQ s85 1) (GEQ s89 1) (GEQ s92 1) (GEQ s96 1) (...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2163 reset in 1245 ms.
Stack based approach found an accepted trace after 103 steps with 3 reset with depth 5 and stack size 5 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-14 finished in 1798 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 20 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 12:38:26] [INFO ] Invariant cache hit.
[2024-05-28 12:38:26] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-28 12:38:26] [INFO ] Invariant cache hit.
[2024-05-28 12:38:26] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2024-05-28 12:38:26] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-28 12:38:26] [INFO ] Invariant cache hit.
[2024-05-28 12:38:26] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-15 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 (AND (GEQ s0 1) (GEQ s20 1)) (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s5 1) (GEQ s25 1)) (AND (GEQ s8 1) (GEQ s28 1)) (AND (GEQ s9 1) (GEQ s29 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5621 reset in 386 ms.
Stack based approach found an accepted trace after 10661 steps with 571 reset with depth 10 and stack size 10 in 46 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-15 finished in 923 ms.
All properties solved by simple procedures.
Total runtime 13831 ms.

BK_STOP 1716899908106

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="SharedMemory-COL-000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is SharedMemory-COL-000010, 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 r351-tall-171679102400443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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