Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..........................................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.3K May 30 22:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 30 22:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 24 11:17 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.2K May 24 11:17 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 28 10:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 28 10:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 28 09:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 28 09:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 24 11:17 NewModel
-rw-r--r-- 1 mcc users 3.6K May 28 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 28 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 111 May 26 06:33 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 26 06:33 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 27 05:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 27 05:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 28 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 28 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 24 11:17 equiv_col
-rw-r--r-- 1 mcc users 7 May 24 11:17 instance
-rw-r--r-- 1 mcc users 6 May 24 11:17 iscolored
-rw-r--r-- 1 mcc users 18K May 24 11:17 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is RefineWMG-PT-007008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r280-csrt-152749170300670
=====================================================================

--------------------
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 RefineWMG-PT-007-008-CTLFireability-00
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-01
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-02
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-03
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-04
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-05
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-06
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-07
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-08
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-09
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-10
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-11
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-12
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-13
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-14
FORMULA_NAME RefineWMG-PT-007-008-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1527822882161

info: Time: 3600 - MCC
===========================================================================================
prep: translating RefineWMG-PT-007008 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating RefineWMG-PT-007008 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ RefineWMG-PT-007008 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 70/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1248
lola: finding significant places
lola: 39 places, 31 transitions, 23 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 39 transition conflict sets
lola: TASK
lola: reading formula from RefineWMG-PT-007-008-CTLFireability.task
lola: (NOT(A (X (E (F (FIREABLE(t6)))))) OR (A (((FIREABLE(t28) OR FIREABLE(t9)) U (FIREABLE(t2) OR FIREABLE(t25)))) OR (A (G ((FIREABLE(t10) OR FIREABLE(t20)))) OR (A (G (FIREABLE(t))) AND E (F (FIREABLE(t19))))))) : (E (F ((E (G (FIREABLE(t16))) AND (FIREABLE(t11) AND (FIREABLE(t2) OR FIREABLE(t5)))))) OR ((NOT FIREABLE(t11) OR NOT FIREABLE(t7) OR NOT FIREABLE(t7) OR NOT FIREABLE(t3)) AND NOT FIREABLE(t19) AND FIREABLE(t5))) : A (G (NOT(A (X ((FIREABLE(t21) AND FIREABLE(t19))))))) : A (F (A (X (A (G (FIREABLE(t12))))))) : A (G (FIREABLE(t12))) : (E (F (NOT(A (X (FIREABLE(t16)))))) AND FIREABLE(t12)) : A (G (E (G ((NOT FIREABLE(t3) OR NOT FIREABLE(t2)))))) : E ((NOT FIREABLE(tprime) U A (G (FIREABLE(t15))))) : NOT((A (G (FIREABLE(t16))) OR A (X (FIREABLE(t3))))) : E (G ((FIREABLE(t2) OR (A (G (FIREABLE(t8))) OR FIREABLE(t10))))) : E (F ((E (X ((FIREABLE(t) OR FIREABLE(t18)))) AND (A (G (FIREABLE(t23))) OR A (F (FIREABLE(t6))))))) : A (((FIREABLE(t27) AND (NOT FIREABLE(tsecond) OR (FIREABLE(t19) AND FIREABLE(t22)))) U (E (F (FIREABLE(t5))) OR (FIREABLE(t10) OR (FIREABLE(t1) AND FIREABLE(t9)))))) : (A (X (A (X (NOT FIREABLE(t27))))) OR NOT((((FIREABLE(t27) AND FIREABLE(t15) AND FIREABLE(t10)) OR FIREABLE(t23)) OR E (F ((FIREABLE(t1) OR FIREABLE(t6))))))) : NOT(A (F (NOT(A (G (FIREABLE(t12))))))) : E ((A (G (NOT FIREABLE(t5))) U A ((FIREABLE(t26) U FIREABLE(t25))))) : NOT(A (G (A (F (FIREABLE(t28))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:395
lola: rewrite Frontend/Parser/formula_rewrite.k:458
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:449
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (A (G (NOT FIREABLE(t6))))) OR (A (((FIREABLE(t28) OR FIREABLE(t9)) U (FIREABLE(t2) OR FIREABLE(t25)))) OR (A (G ((FIREABLE(t10) OR FIREABLE(t20)))) OR (A (G (FIREABLE(t))) AND E (F (FIREABLE(t19)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (G (NOT FIREABLE(t6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: EX(NOT(E(TRUE U FIREABLE(t6))))
lola: processed formula length: 31
lola: 40 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 80422 markings, 125663 edges
lola: ========================================
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(t28) OR FIREABLE(t9)) U (FIREABLE(t2) OR FIREABLE(t25))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((FIREABLE(t28) OR FIREABLE(t9)) U (FIREABLE(t2) OR FIREABLE(t25))))
lola: processed formula length: 73
lola: 41 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /ER
lola: Predicate Phi does not hild until Predicate Psi on all paths.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t19)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (FIREABLE(t19)))
lola: processed formula length: 21
lola: 38 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(t)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (FIREABLE(t)))
lola: processed formula length: 19
lola: 39 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t10) OR FIREABLE(t20))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(t10) OR FIREABLE(t20))))
lola: processed formula length: 41
lola: 39 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(t10) AND NOT FIREABLE(t20))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 9 markings, 8 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA RefineWMG-PT-007-008-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (X ((NOT FIREABLE(t21) OR NOT FIREABLE(t19))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: processed formula: NOT(E(TRUE U NOT(EX((NOT FIREABLE(t21) OR NOT FIREABLE(t19))))))
lola: processed formula length: 65
lola: 39 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3322058 markings, 5190722 edges, 664412 markings/sec, 0 secs
lola: 6643721 markings, 10380888 edges, 664333 markings/sec, 5 secs
lola: 9587794 markings, 14981009 edges, 588815 markings/sec, 10 secs
lola: 12688016 markings, 19825103 edges, 620044 markings/sec, 15 secs
lola: 15633253 markings, 24427033 edges, 589047 markings/sec, 20 secs
lola: 18608802 markings, 29076325 edges, 595110 markings/sec, 25 secs
lola: 21495293 markings, 33586472 edges, 577298 markings/sec, 30 secs
lola: 24424771 markings, 38163780 edges, 585896 markings/sec, 35 secs
lola: 26487877 markings, 41387380 edges, 412621 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 26487877 markings, 41387380 edges

FORMULA RefineWMG-PT-007-008-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (A (G (FIREABLE(t12)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U AX(NOT(E(TRUE U NOT FIREABLE(t12)))))
lola: processed formula length: 46
lola: 41 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10781 markings, 17351 edges

FORMULA RefineWMG-PT-007-008-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F (NOT FIREABLE(t16))))) AND FIREABLE(t12))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t12)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(t12)
lola: processed formula length: 13
lola: 37 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (NOT FIREABLE(t16)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: NOT FIREABLE(t16)
lola: processed formula length: 17
lola: 38 rewrites
lola: closed formula file RefineWMG-PT-007-008-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 9 markings, 8 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA RefineWMG-PT-007-008-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (NOT FIREABLE(t16))) AND E (X (NOT FIREABLE(t3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: local time limit reached - aborting
lola:
preliminary result: no unknown no no unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 14344 KB
lola: time consumption: 339 seconds
lola: time limit reached - aborting
lola:
preliminary result: no unknown no no unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola:
preliminary result: no unknown no no unknown yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 14344 KB
lola: time consumption: 3570 seconds

BK_TIME_CONFINEMENT_REACHED

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

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="RefineWMG-PT-007008"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007008.tgz
mv RefineWMG-PT-007008 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
echo " Input is RefineWMG-PT-007008, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r280-csrt-152749170300670"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;