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 264K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.2K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K 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 19K 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.5K 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 91K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-20b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-smll-152646382900234
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526499763349


BK_STOP 1526500057621

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using DES-PT-20b 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': 1550911, 'Memory': 4937.11, 'Tool': 'lola'}, {'Time': 1550986, 'Memory': 4981, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-20b...

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


checking for too many tokens
===========================================================================================
DES-PT-20b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DES-PT-20b @ 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: 671/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 360 places, 311 transitions, 295 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 408 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-20b-CTLCardinality.task
lola: NOT(((A (G ((p20 <= p309))) AND (p83 <= p36)) AND E (X ((p141 <= 0))))) : NOT((((p319 + 1 <= p162) AND ((p261 <= 1) OR (p284 <= 1))) OR A (F ((p303 + 1 <= p95))))) : ((A (((p176 <= p84) U (2 <= p265))) OR (3 <= p79)) OR ((p23 <= 2) AND (p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151)))) : E (G (((2 <= p137) OR (p250 <= p89)))) : NOT(E (G (((p358 <= 2) AND (p208 <= 0))))) : A ((E (G ((p120 <= p301))) U ((p284 + 1 <= p27) AND (p205 <= 0)))) : NOT(((E (F ((2 <= p170))) AND E (X ((p144 <= p354)))) AND (A (F ((p143 <= p186))) AND ((p210 <= 0) OR (p45 + 1 <= p255))))) : E ((E (X ((3 <= p163))) U E (F ((1 <= p264))))) : E ((E (X ((2 <= p171))) U E (G ((p31 <= p272))))) : A (F (NOT(A (F ((p241 <= p355)))))) : (A (F (((p23 + 1 <= p102) AND (p244 <= 0)))) AND (((p265 <= 2) AND (p356 <= 1)) OR (p272 <= p39) OR (p210 <= p49))) : (((p120 + 1 <= p240) OR ((p213 <= p31) AND E (G ((3 <= p65))))) OR ((p20 + 1 <= p336) OR E (G (((p35 <= p222) OR (p196 <= p243)))))) : (((E (X ((p183 <= p100))) OR A (X ((1 <= p119)))) AND E (X (((2 <= p236) AND (p163 <= p17))))) OR NOT(A (((p341 <= p227) U (3 <= p66))))) : (A (G (((p55 <= p257) OR (2 <= p171) OR (p249 + 1 <= p204)))) AND A (G (((p79 <= 1) OR (1 <= p27))))) : E ((((p66 + 1 <= p124) AND (p296 + 1 <= p56)) U E (F ((1 <= p57))))) : E (G ((((p18 <= 0) OR ((2 <= p262) AND (p0 <= p191))) AND (p13 <= 0))))
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 (G ((p20 <= p309))) AND (p83 <= p36)) AND E (X ((p141 <= 0)))))
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 (F ((p309 + 1 <= p20)))
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 40 bytes per marking, with 25 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-20b-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-20b-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1045990 markings, 2248797 edges, 209198 markings/sec, 0 secs
lola: sara is running 5 secs || 2001454 markings, 4499312 edges, 191093 markings/sec, 5 secs
lola: sara is running 10 secs || 2929501 markings, 6676370 edges, 185609 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3627238 markings, 8300331 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((p319 + 1 <= p162) AND ((p261 <= 1) OR (p284 <= 1))) OR A (F ((p303 + 1 <= p95)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p162 <= p319) OR ((2 <= p261) AND (2 <= p284)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p162 <= p319) OR ((2 <= p261) AND (2 <= p284)))
lola: processed formula length: 50
lola: 5 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: processed formula with 3 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 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p95 <= p303)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p303 + 1 <= p95)))
lola: processed formula length: 32
lola: 7 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 54 markings, 54 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((p176 <= p84) U (2 <= p265))) OR (3 <= p79)) OR ((p23 <= 2) AND (p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p176 <= p84) U (2 <= p265)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p176 <= p84) U (2 <= p265)))
lola: processed formula: A (((p176 <= p84) U (2 <= p265)))
lola: processed formula length: 33
lola: 1 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 23 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 87 markings, 87 edges
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p79) OR ((p23 <= 2) AND (p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p79) OR ((p23 <= 2) AND (p103 + 1 <= p62) AND (p69 + 1 <= p222) AND ((p78 + 1 <= p155) OR (p191 <= 0)) AND ((p144 + 1 <= p123) OR (p81 + 1 <= p151))))
lola: processed formula length: 159
lola: 2 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: processed formula with 8 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p137) OR (p250 <= p89))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p137 <= 1) AND (p89 + 1 <= p250))))
lola: processed formula length: 50
lola: 2 rewrites
lola: formula mentions 0 of 360 places; total mentions: 0
lola: closed formula file DES-PT-20b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 40 bytes per marking, with 25 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: 997284 markings, 3163021 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1830759 markings, 6200728 edges, 166695 markings/sec, 5 secs
lola: 2685425 markings, 9313182 edges, 170933 markings/sec, 10 secs
lola: 3338581 markings, 12285761 edges, 130631 markings/sec, 15 secs
lola: 4044395 markings, 15295714 edges, 141163 markings/sec, 20 secs
lola: 4884021 markings, 18359873 edges, 167925 markings/sec, 25 secs
lola: 5724961 markings, 21429796 edges, 168188 markings/sec, 30 secs
lola: 6459068 markings, 24444167 edges, 146821 markings/sec, 35 secs
lola: 7059699 markings, 27374199 edges, 120126 markings/sec, 40 secs
lola: 7890633 markings, 30398910 edges, 166187 markings/sec, 45 secs
lola: 8720458 markings, 33417879 edges, 165965 markings/sec, 50 secs
lola: 9525825 markings, 36414654 edges, 161073 markings/sec, 55 secs
lola: 10137480 markings, 39468940 edges, 122331 markings/sec, 60 secs
lola: 10737969 markings, 42423704 edges, 120098 markings/sec, 65 secs
lola: 11343631 markings, 45372605 edges, 121132 markings/sec, 70 secs
lola: 11929473 markings, 48322520 edges, 117168 markings/sec, 75 secs
lola: 12535296 markings, 51337722 edges, 121165 markings/sec, 80 secs
lola: 13055561 markings, 54210430 edges, 104053 markings/sec, 85 secs
lola: 13511021 markings, 57117240 edges, 91092 markings/sec, 90 secs
lola: 14250473 markings, 60050012 edges, 147890 markings/sec, 95 secs
lola: 15048842 markings, 62949832 edges, 159674 markings/sec, 100 secs
lola: 15831843 markings, 65968388 edges, 156600 markings/sec, 105 secs
lola: 16468620 markings, 68973260 edges, 127355 markings/sec, 110 secs
lola: 17330201 markings, 72106367 edges, 172316 markings/sec, 115 secs
lola: 18144417 markings, 75081618 edges, 162843 markings/sec, 120 secs
lola: 18833835 markings, 78139408 edges, 137884 markings/sec, 125 secs
lola: 19581649 markings, 81198063 edges, 149563 markings/sec, 130 secs
lola: 20427981 markings, 84269331 edges, 169266 markings/sec, 135 secs
lola: 21241390 markings, 87332036 edges, 162682 markings/sec, 140 secs
lola: 21854243 markings, 90341905 edges, 122571 markings/sec, 145 secs
lola: 22477393 markings, 93414301 edges, 124630 markings/sec, 150 secs
lola: 23094867 markings, 96452642 edges, 123495 markings/sec, 155 secs
lola: 23704887 markings, 99459840 edges, 122004 markings/sec, 160 secs
lola: 24224619 markings, 102420666 edges, 103946 markings/sec, 165 secs
lola: 24805145 markings, 105408925 edges, 116105 markings/sec, 170 secs
lola: 25676018 markings, 108606849 edges, 174175 markings/sec, 175 secs
lola: 26538119 markings, 111756775 edges, 172420 markings/sec, 180 secs
lola: 27198102 markings, 114873063 edges, 131997 markings/sec, 185 secs
lola: 28006993 markings, 117977396 edges, 161778 markings/sec, 190 secs
lola: 28894524 markings, 121159407 edges, 177506 markings/sec, 195 secs
lola: 29660002 markings, 124300311 edges, 153096 markings/sec, 200 secs
lola: 30366294 markings, 127407357 edges, 141258 markings/sec, 205 secs
lola: 31221913 markings, 130555011 edges, 171124 markings/sec, 210 secs
lola: 32074384 markings, 133648338 edges, 170494 markings/sec, 215 secs
lola: 32714205 markings, 136711332 edges, 127964 markings/sec, 220 secs
lola: 33339072 markings, 139797183 edges, 124973 markings/sec, 225 secs
lola: 33958923 markings, 142848896 edges, 123970 markings/sec, 230 secs
lola: 34573235 markings, 145836732 edges, 122862 markings/sec, 235 secs
lola: 35127077 markings, 148849537 edges, 110768 markings/sec, 240 secs
lola: 35604650 markings, 151771394 edges, 95515 markings/sec, 245 secs
lola: 36261801 markings, 154854582 edges, 131430 markings/sec, 250 secs
lola: 36903699 markings, 157918214 edges, 128380 markings/sec, 255 secs
lola: 37476285 markings, 160947722 edges, 114517 markings/sec, 260 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-20b-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-20b-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- 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-20b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
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-20b.tgz
mv DES-PT-20b 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 irma4mcc-structural"
echo " Input is DES-PT-20b, 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 r055-smll-152646382900234"
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 ;