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 216K
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 101 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 339 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 57K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is DES-PT-20a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385700227
=====================================================================

--------------------
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 DES-PT-20a-CTLCardinality-00
FORMULA_NAME DES-PT-20a-CTLCardinality-01
FORMULA_NAME DES-PT-20a-CTLCardinality-02
FORMULA_NAME DES-PT-20a-CTLCardinality-03
FORMULA_NAME DES-PT-20a-CTLCardinality-04
FORMULA_NAME DES-PT-20a-CTLCardinality-05
FORMULA_NAME DES-PT-20a-CTLCardinality-06
FORMULA_NAME DES-PT-20a-CTLCardinality-07
FORMULA_NAME DES-PT-20a-CTLCardinality-08
FORMULA_NAME DES-PT-20a-CTLCardinality-09
FORMULA_NAME DES-PT-20a-CTLCardinality-10
FORMULA_NAME DES-PT-20a-CTLCardinality-11
FORMULA_NAME DES-PT-20a-CTLCardinality-12
FORMULA_NAME DES-PT-20a-CTLCardinality-13
FORMULA_NAME DES-PT-20a-CTLCardinality-14
FORMULA_NAME DES-PT-20a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1526537433223


BK_STOP 1526537675311

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-20a as instance name.
Using DES as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': None, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 524746, 'Memory': 2423, 'Tool': 'lola'}, {'Time': 525883, 'Memory': 2420.09, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-20a...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DES-PT-20a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DES-PT-20a: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-20a @ 3540 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 347/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 195 places, 152 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 177 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20a-CTLCardinality.task
lola: (NOT(A (((1 <= p25) U (p113 <= p176)))) OR ((A (X ((p26 <= p125))) AND E (F ((2 <= p175)))) OR E (G ((p129 <= 1))))) : E (F (((p182 <= 1) AND (p170 + 1 <= p21) AND ((p125 <= 0) OR (p131 + 1 <= p187))))) : E (G (A (X (((p71 <= p87) OR (p33 <= p30)))))) : E (G (NOT(E (G ((3 <= p193)))))) : (((p58 + 1 <= p167) AND A (X (((p135 <= p40) OR (1 <= p91))))) OR E (F ((1 <= p157)))) : E (F (E (F ((3 <= p72))))) : NOT(A (F (A (X ((3 <= p112)))))) : A (((p94 <= p27) U E (G ((p150 <= p16))))) : E (X (NOT(E (G ((p175 <= p161)))))) : ((((p81 <= p149) AND ((p81 <= 2) OR (p82 <= 2))) AND E (G ((p82 <= p108)))) AND ((p127 <= p179) OR ((((1 <= p44) OR (3 <= p70)) AND ((p23 <= p40) OR (3 <= p155))) AND E (F ((3 <= p82)))))) : A (G (E (G ((p126 <= 2))))) : (NOT(E (X (((3 <= p155) OR (3 <= p66))))) AND A (F (A (F ((3 <= p181)))))) : E (F (A (F ((3 <= p53))))) : A (X (A (G (((p94 <= p7) OR (2 <= p141)))))) : NOT((A (F ((2 <= p170))) AND A (((p84 <= p128) U (3 <= p70))))) : E (G ((p50 <= p46)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (((1 <= p25) U (p113 <= p176)))) OR ((A (X ((p26 <= p125))) AND E (F ((2 <= p175)))) OR E (G ((p129 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p25 <= 0) R (p176 + 1 <= p113)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((1 <= p25) U (p113 <= p176)))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p26 <= p125)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p26 <= p125)))
lola: processed formula: A (X ((p26 <= p125)))
lola: processed formula length: 21
lola: 4 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 22 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p175)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20a-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20a-CTLCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p129 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (2 <= p129)))
lola: processed formula length: 26
lola: 6 rewrites
lola: formula mentions 0 of 195 places; total mentions: 0
lola: closed formula file DES-PT-20a-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 46 markings, 45 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p182 <= 1) AND (p170 + 1 <= p21) AND ((p125 <= 0) OR (p131 + 1 <= p187)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 20 bytes per marking, with 24 unused bits
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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-20a-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20a-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1574602 markings, 3754239 edges, 314920 markings/sec, 0 secs
lola: sara is running 5 secs || 3023535 markings, 7490289 edges, 289787 markings/sec, 5 secs
lola: sara is running 10 secs || 4435047 markings, 11119972 edges, 282302 markings/sec, 10 secs
lola: sara is running 15 secs || 5755569 markings, 14752494 edges, 264104 markings/sec, 15 secs
lola: sara is running 20 secs || 7162848 markings, 18268649 edges, 281456 markings/sec, 20 secs
lola: sara is running 25 secs || 8436153 markings, 21798349 edges, 254661 markings/sec, 25 secs
lola: sara is running 30 secs || 9754833 markings, 25395192 edges, 263736 markings/sec, 30 secs
lola: sara is running 35 secs || 11074681 markings, 28928269 edges, 263970 markings/sec, 35 secs
lola: sara is running 40 secs || 12325125 markings, 32447755 edges, 250089 markings/sec, 40 secs
lola: sara is running 45 secs || 13695651 markings, 35904586 edges, 274105 markings/sec, 45 secs
lola: sara is running 50 secs || 14969142 markings, 39448307 edges, 254698 markings/sec, 50 secs
lola: sara is running 55 secs || 16281762 markings, 43063277 edges, 262524 markings/sec, 55 secs
lola: sara is running 60 secs || 17633912 markings, 46541634 edges, 270430 markings/sec, 60 secs
lola: sara is running 65 secs || 18889605 markings, 50057513 edges, 251139 markings/sec, 65 secs
lola: sara is running 70 secs || 20179093 markings, 53499031 edges, 257898 markings/sec, 70 secs
lola: sara is running 75 secs || 21422613 markings, 56862934 edges, 248704 markings/sec, 75 secs
lola: sara is running 80 secs || 22610215 markings, 60188591 edges, 237520 markings/sec, 80 secs
lola: sara is running 85 secs || 23867544 markings, 63404470 edges, 251466 markings/sec, 85 secs
lola: sara is running 90 secs || 25081051 markings, 66744765 edges, 242701 markings/sec, 90 secs
lola: sara is running 95 secs || 26257847 markings, 70028204 edges, 235359 markings/sec, 95 secs
lola: sara is running 100 secs || 27494311 markings, 73129182 edges, 247293 markings/sec, 100 secs
lola: sara is running 105 secs || 28652161 markings, 76366947 edges, 231570 markings/sec, 105 secs
lola: sara is running 110 secs || 29839669 markings, 79680692 edges, 237502 markings/sec, 110 secs
lola: sara is running 115 secs || 31124791 markings, 82885297 edges, 257024 markings/sec, 115 secs
lola: sara is running 120 secs || 32284970 markings, 86158727 edges, 232036 markings/sec, 120 secs
lola: sara is running 125 secs || 33516402 markings, 89554891 edges, 246286 markings/sec, 125 secs
lola: sara is running 130 secs || 34773210 markings, 92778833 edges, 251362 markings/sec, 130 secs
lola: sara is running 135 secs || 35963482 markings, 96063005 edges, 238054 markings/sec, 135 secs
lola: sara is running 140 secs || 37193865 markings, 99435387 edges, 246077 markings/sec, 140 secs
lola: sara is running 145 secs || 38429517 markings, 102673606 edges, 247130 markings/sec, 145 secs
lola: sara is running 150 secs || 39612871 markings, 105992811 edges, 236671 markings/sec, 150 secs
lola: sara is running 155 secs || 40845767 markings, 109248861 edges, 246579 markings/sec, 155 secs
lola: sara is running 160 secs || 42068766 markings, 112571616 edges, 244600 markings/sec, 160 secs
lola: sara is running 165 secs || 43253329 markings, 115889909 edges, 236913 markings/sec, 165 secs
lola: sara is running 170 secs || 44531124 markings, 119149635 edges, 255559 markings/sec, 170 secs
lola: sara is running 175 secs || 45763398 markings, 122540704 edges, 246455 markings/sec, 175 secs
lola: sara is running 180 secs || 46973260 markings, 125915624 edges, 241972 markings/sec, 180 secs
lola: sara is running 185 secs || 48281764 markings, 129179042 edges, 261701 markings/sec, 185 secs
lola: sara is running 190 secs || 49466715 markings, 132514765 edges, 236990 markings/sec, 190 secs
lola: sara is running 195 secs || 50724667 markings, 135982098 edges, 251590 markings/sec, 195 secs
lola: sara is running 200 secs || 51994064 markings, 139243459 edges, 253879 markings/sec, 200 secs
lola: sara is running 205 secs || 53192701 markings, 142558272 edges, 239727 markings/sec, 205 secs
lola: sara is running 210 secs || 54477619 markings, 146020173 edges, 256984 markings/sec, 210 secs
lola: sara is running 215 secs || 55832063 markings, 149316489 edges, 270889 markings/sec, 215 secs
lola: sara is running 220 secs || 57297467 markings, 152924391 edges, 293081 markings/sec, 220 secs
lola: sara is running 225 secs || 58696593 markings, 156478907 edges, 279825 markings/sec, 225 secs
lola: sara is running 230 secs || 60081579 markings, 159889983 edges, 276997 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA DES-PT-20a-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20a-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished 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="DES-PT-20a"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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/DES-PT-20a.tgz
mv DES-PT-20a 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 mcc4mcc-full"
echo " Input is DES-PT-20a, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-152646385700227"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;