fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r263-tall-171654372200177
Last Updated
July 7, 2024

About the Execution of 2023-gold for Murphy-COL-D4N050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
890.220 11900.00 21514.00 347.10 TFFTFTFTFTFTFFFF normal

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.r263-tall-171654372200177.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 Murphy-COL-D4N050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372200177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 5.6K Apr 11 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Apr 11 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 22:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 22:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 11 22:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Apr 11 22:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 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 20K 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 Murphy-COL-D4N050-LTLCardinality-00
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-01
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-02
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-03
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-04
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-05
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-06
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-07
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-08
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-09
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-10
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-11
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-12
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-13
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-14
FORMULA_NAME Murphy-COL-D4N050-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716675015930

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N050
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202304061127
[2024-05-25 22:10:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 22:10:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 22:10:17] [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-25 22:10:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 22:10:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 636 ms
[2024-05-25 22:10:18] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 22:10:18] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 4 ms.
[2024-05-25 22:10:18] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 5 formulas.
FORMULA Murphy-COL-D4N050-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10054 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=201 ) properties (out of 22) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 22:10:18] [INFO ] Computed 2 invariants in 4 ms
[2024-05-25 22:10:18] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 22:10:18] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-25 22:10:18] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 22:10:18] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :2
[2024-05-25 22:10:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 22:10:18] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :4 sat :2
[2024-05-25 22:10:18] [INFO ] Deduced a trap composed of 1 places in 19 ms of which 3 ms to minimize.
[2024-05-25 22:10:18] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
[2024-05-25 22:10:18] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :0
[2024-05-25 22:10:18] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
FORMULA Murphy-COL-D4N050-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N050-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-25 22:10:18] [INFO ] Flatten gal took : 11 ms
[2024-05-25 22:10:18] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2024-05-25 22:10:18] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 5 ms.
[2024-05-25 22:10:18] [INFO ] Unfolded 8 HLPN properties in 0 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 22:10:18] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2024-05-25 22:10:19] [INFO ] Invariant cache hit.
[2024-05-25 22:10:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 22:10:19] [INFO ] Invariant cache hit.
[2024-05-25 22:10:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:19] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-25 22:10:19] [INFO ] Invariant cache hit.
[2024-05-25 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2024-05-25 22:10:19] [INFO ] Flatten gal took : 6 ms
[2024-05-25 22:10:19] [INFO ] Flatten gal took : 4 ms
[2024-05-25 22:10:19] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-25 22:10:19] [INFO ] Invariant cache hit.
[2024-05-25 22:10:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 22:10:19] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 22:10:19] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-25 22:10:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 22:10:19] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 22:10:19] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-25 22:10:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:19] [INFO ] After 106ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-25 22:10:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-25 22:10:19] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-25 22:10:19] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 105 ms
[2024-05-25 22:10:19] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-25 22:10:19] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:19] [INFO ] Invariant cache hit.
[2024-05-25 22:10:19] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10017 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1252 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1954857 steps, run timeout after 3001 ms. (steps per millisecond=651 ) properties seen :{}
Probabilistic random walk after 1954857 steps, saw 1360955 distinct states, run finished after 3002 ms. (steps per millisecond=651 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-25 22:10:22] [INFO ] Invariant cache hit.
[2024-05-25 22:10:22] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 22:10:22] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 22:10:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 22:10:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 22:10:22] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 22:10:22] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 22:10:22] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:22] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-25 22:10:22] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-25 22:10:22] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 671 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=223 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 3 atomic propositions for a total of 8 simplifications.
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(p1)&&p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:23] [INFO ] Invariant cache hit.
[2024-05-25 22:10:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 22:10:23] [INFO ] Invariant cache hit.
[2024-05-25 22:10:23] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 22:10:23] [INFO ] Invariant cache hit.
[2024-05-25 22:10:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:23] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 22:10:23] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:10:23] [INFO ] Invariant cache hit.
[2024-05-25 22:10:23] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 30/30 places, 35/35 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 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GT 1 (ADD s15 s16 s17 s18 s19)) (GT (ADD s20 s21 s22 s23 s24) (ADD s10 s11 s12 s13 s14))), p1:(LEQ 1 (ADD s20 s21 s22 s23 s24))], 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 376 ms.
Stack based approach found an accepted trace after 24 steps with 0 reset with depth 25 and stack size 25 in 4 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-01 finished in 756 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)||X(X((p1&&G(p0))))))'
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:23] [INFO ] Invariant cache hit.
[2024-05-25 22:10:23] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
[2024-05-25 22:10:23] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] Implicit Places using invariants in 96 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 97 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 134 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 194 ms :[true, (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=3, aps=[p0:(GT 2 (ADD s15 s16 s17 s18 s19)), p1:(OR (GT 2 (ADD s15 s16 s17 s18 s19)) (GT 1 (ADD s0 s1 s2 s3 s4)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-04 finished in 349 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((G(p0)&&X(p1))))'
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:24] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-25 22:10:24] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 22:10:24] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:24] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 22:10:24] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 131 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 2}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(LEQ 1 (ADD s20 s21 s22 s23 s24)), p1:(GT (ADD s10 s11 s12 s13 s14) (ADD s20 s21 s22 s23 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 742 steps with 0 reset in 6 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-08 finished in 307 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 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:24] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 22:10:24] [INFO ] Invariant cache hit.
[2024-05-25 22:10:24] [INFO ] Implicit Places using invariants in 82 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 83 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 129 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4))], 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 144 ms.
Product exploration explored 100000 steps with 50000 reset in 143 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Murphy-COL-D4N050-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Murphy-COL-D4N050-LTLCardinality-09 finished in 588 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 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] Implicit Places using invariants in 29 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 30 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 65 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 2 (ADD s15 s16 s17 s18 s19))], 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 178 ms.
Stack based approach found an accepted trace after 1385 steps with 0 reset with depth 1386 and stack size 1355 in 3 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-12 finished in 287 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((p0&&(p1||G(F(p2))))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] Implicit Places using invariants in 23 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 23 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60 ms. Remains : 25/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 2 (ADD s20 s21 s22 s23 s24)), p1:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s10 s11 s12 s13 s14)), p2:(LEQ (ADD s0 s1 s2 s3 s4) (ADD s20 s21 s22 s23 s24))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 234 ms.
Stack based approach found an accepted trace after 146 steps with 7 reset with depth 10 and stack size 10 in 0 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-13 finished in 427 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)&&(p1||F(!p2)))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 22:10:25] [INFO ] Invariant cache hit.
[2024-05-25 22:10:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 22:10:26] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 22:10:26] [INFO ] Invariant cache hit.
[2024-05-25 22:10:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 121 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), p2]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 3 (ADD s15 s16 s17 s18 s19)), p1:(AND (LEQ 3 (ADD s15 s16 s17 s18 s19)) (LEQ 2 (ADD s10 s11 s12 s13 s14))), p2:(GT 2 (ADD s20 s21 s22 s23 s24))], 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]]
Product exploration explored 100000 steps with 6080 reset in 175 ms.
Stack based approach found an accepted trace after 23 steps with 1 reset with depth 18 and stack size 18 in 0 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-14 finished in 434 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&&X(F((!p1 U (G(!p1)||(!p1&&G(!p0)))))))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 22:10:26] [INFO ] Invariant cache hit.
[2024-05-25 22:10:26] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
[2024-05-25 22:10:26] [INFO ] Invariant cache hit.
[2024-05-25 22:10:26] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 22:10:26] [INFO ] Invariant cache hit.
[2024-05-25 22:10:26] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 22:10:26] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 22:10:26] [INFO ] Invariant cache hit.
[2024-05-25 22:10:26] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 30/30 places, 35/35 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, (AND p0 p1)]
Running random walk in product with property : Murphy-COL-D4N050-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p1), acceptance={0, 1} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(GT 2 (ADD s15 s16 s17 s18 s19)), p1:(AND (LEQ 2 (ADD s25 s26 s27 s28 s29)) (LEQ (ADD s15 s16 s17 s18 s19) (ADD s10 s11 s12 s13 s14)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 269 ms.
Stack based approach found an accepted trace after 52 steps with 0 reset with depth 53 and stack size 53 in 0 ms.
FORMULA Murphy-COL-D4N050-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Murphy-COL-D4N050-LTLCardinality-15 finished in 572 ms.
All properties solved by simple procedures.
Total runtime 9536 ms.

BK_STOP 1716675027830

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="Murphy-COL-D4N050"
export BK_EXAMINATION="LTLCardinality"
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 Murphy-COL-D4N050, 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 r263-tall-171654372200177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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