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 224K
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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 8.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K 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.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K 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:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 66K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is DES-PT-00b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r055-smll-152646382800164
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526496272424


BK_STOP 1526497003448

--------------------
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-00b 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': 1542904, 'Memory': 6181.34, 'Tool': 'lola'}, {'Time': 1543149, 'Memory': 5954.46, 'Tool': 'lola'}, {'Time': 3512561, 'Memory': 12294.9, 'Tool': 'itstools'}, {'Time': 3512941, 'Memory': 12247, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DES-PT-00b...

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


checking for too many tokens
===========================================================================================
DES-PT-00b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ DES-PT-00b @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
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: 501/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 271 places, 230 transitions, 212 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 319 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-00b-CTLCardinality.task
lola: E (G ((p160 <= p64))) : E (G (E (((1 <= p159) U (p217 <= p212))))) : A (F ((A (G ((p253 <= p71))) AND (((p131 <= p135) OR (p66 <= p121)) AND (p31 <= p268))))) : A (X (NOT(E (F ((2 <= p197)))))) : NOT(E (G (((p114 <= 2) OR (p157 <= p71))))) : (E (G (((2 <= p30) OR (p132 <= p30) OR ((3 <= p33) AND (2 <= p193))))) AND (p217 <= p147)) : (A (G ((p224 <= p158))) OR (E (G ((p123 <= p154))) OR A (((3 <= p138) U (3 <= p229))))) : A (X (NOT(A (F ((2 <= p229)))))) : E (G (((3 <= p155) OR E (F ((3 <= p70)))))) : (E (F ((((p10 <= p135) AND (3 <= p158)) OR (3 <= p165)))) AND (p91 <= p269)) : (E (F ((2 <= p151))) AND A (((p189 <= p254) U (1 <= p27)))) : A (F (((p8 <= p102) AND (p187 <= p51) AND (1 <= p145) AND ((p265 <= 1) OR (p109 + 1 <= p122))))) : (E (((p269 <= 0) U (p236 <= 1))) AND E (F (((p80 + 1 <= p40) AND (p233 <= 1))))) : E (G ((((3 <= p144) AND (3 <= p237) AND ((2 <= p124) OR (p20 <= p66))) OR A (X ((p244 <= p188)))))) : ((NOT(E (X ((3 <= p253)))) AND E (((p188 <= p140) U (p191 <= p206)))) AND A (F ((2 <= p43)))) : A (F ((3 <= p164)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p160 <= p64)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p64 + 1 <= p160)))
lola: processed formula length: 32
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 81 markings, 80 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((1 <= p159) U (p217 <= p212)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((1 <= p159) U (p217 <= p212)))))
lola: processed formula length: 51
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 81 markings, 161 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (G ((p253 <= p71))) AND (((p131 <= p135) OR (p66 <= p121)) AND (p31 <= p268)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((A (G ((p253 <= p71))) AND (((p131 <= p135) OR (p66 <= p121)) AND (p31 <= p268)))))
lola: processed formula: A (F ((A (G ((p253 <= p71))) AND (((p131 <= p135) OR (p66 <= p121)) AND (p31 <= p268)))))
lola: processed formula length: 90
lola: 0 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 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: 118 markings, 118 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (F ((2 <= p197))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (A (G ((p197 <= 1)))))
lola: processed formula: A (X (A (G ((p197 <= 1)))))
lola: processed formula length: 27
lola: 3 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 675172 markings, 3711134 edges, 135034 markings/sec, 0 secs
lola: 1265612 markings, 7479802 edges, 118088 markings/sec, 5 secs
lola: 1824800 markings, 11130059 edges, 111838 markings/sec, 10 secs
lola: 2430091 markings, 14871287 edges, 121058 markings/sec, 15 secs
lola: 2977344 markings, 18550971 edges, 109451 markings/sec, 20 secs
lola: 3546372 markings, 22158932 edges, 113806 markings/sec, 25 secs
lola: 4069672 markings, 25621865 edges, 104660 markings/sec, 30 secs
lola: 4547659 markings, 29045273 edges, 95597 markings/sec, 35 secs
lola: 5046733 markings, 32342727 edges, 99815 markings/sec, 40 secs
lola: 5555392 markings, 35619992 edges, 101732 markings/sec, 45 secs
lola: 6011901 markings, 38667838 edges, 91302 markings/sec, 50 secs
lola: 6534366 markings, 42035441 edges, 104493 markings/sec, 55 secs
lola: 7028093 markings, 45325574 edges, 98745 markings/sec, 60 secs
lola: 7494731 markings, 48433956 edges, 93328 markings/sec, 65 secs
lola: 7884566 markings, 51442961 edges, 77967 markings/sec, 70 secs
lola: 8437106 markings, 54720189 edges, 110508 markings/sec, 75 secs
lola: 8923646 markings, 57974800 edges, 97308 markings/sec, 80 secs
lola: 9410510 markings, 61172249 edges, 97373 markings/sec, 85 secs
lola: 9895928 markings, 64381208 edges, 97084 markings/sec, 90 secs
lola: 10385201 markings, 67525148 edges, 97855 markings/sec, 95 secs
lola: 10797123 markings, 70383809 edges, 82384 markings/sec, 100 secs
lola: 11184948 markings, 73484747 edges, 77565 markings/sec, 105 secs
lola: 11569120 markings, 76777430 edges, 76834 markings/sec, 110 secs
lola: 11932422 markings, 79982918 edges, 72660 markings/sec, 115 secs
lola: 12256375 markings, 82959238 edges, 64791 markings/sec, 120 secs
lola: 12612888 markings, 86113405 edges, 71303 markings/sec, 125 secs
lola: 12927383 markings, 89156300 edges, 62899 markings/sec, 130 secs
lola: 13506599 markings, 92373110 edges, 115843 markings/sec, 135 secs
lola: 13996168 markings, 95475455 edges, 97914 markings/sec, 140 secs
lola: 14471388 markings, 98558784 edges, 95044 markings/sec, 145 secs
lola: 14934692 markings, 101635243 edges, 92661 markings/sec, 150 secs
lola: 15461442 markings, 104809243 edges, 105350 markings/sec, 155 secs
lola: 15912627 markings, 107897417 edges, 90237 markings/sec, 160 secs
lola: 16405870 markings, 110991178 edges, 98649 markings/sec, 165 secs
lola: 16858314 markings, 113971250 edges, 90489 markings/sec, 170 secs
lola: 17286187 markings, 116909529 edges, 85575 markings/sec, 175 secs
lola: 17651377 markings, 119720070 edges, 73038 markings/sec, 180 secs
lola: 18154396 markings, 122698356 edges, 100604 markings/sec, 185 secs
lola: 18578965 markings, 125533891 edges, 84914 markings/sec, 190 secs
lola: 19006154 markings, 128372942 edges, 85438 markings/sec, 195 secs
lola: 19456147 markings, 131289916 edges, 89999 markings/sec, 200 secs
lola: 19885653 markings, 134147203 edges, 85901 markings/sec, 205 secs
lola: 20301037 markings, 136899743 edges, 83077 markings/sec, 210 secs
lola: 20670961 markings, 139592477 edges, 73985 markings/sec, 215 secs
lola: 21121117 markings, 142516382 edges, 90031 markings/sec, 220 secs
lola: 21588220 markings, 145505875 edges, 93421 markings/sec, 225 secs
lola: 22025846 markings, 148431359 edges, 87525 markings/sec, 230 secs
lola: 22504149 markings, 151456480 edges, 95661 markings/sec, 235 secs
lola: 22927296 markings, 154400881 edges, 84629 markings/sec, 240 secs
lola: 23387217 markings, 157331461 edges, 91984 markings/sec, 245 secs
lola: 23793633 markings, 160173123 edges, 81283 markings/sec, 250 secs
lola: 24145528 markings, 163107223 edges, 70379 markings/sec, 255 secs
lola: 24485821 markings, 166085356 edges, 68059 markings/sec, 260 secs
lola: 24822178 markings, 169038507 edges, 67271 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((p114 <= 2) OR (p157 <= p71)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((3 <= p114) AND (p71 + 1 <= p157))))
lola: processed formula: A (F (((3 <= p114) AND (p71 + 1 <= p157))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 11 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: 116 markings, 116 edges
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((2 <= p30) OR (p132 <= p30) OR ((3 <= p33) AND (2 <= p193))))) AND (p217 <= p147))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= p30) OR (p132 <= p30) OR ((3 <= p33) AND (2 <= p193)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p30 <= 1) AND (p30 + 1 <= p132) AND ((p33 <= 2) OR (p193 <= 1)))))
lola: processed formula length: 82
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 81 markings, 80 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p217 <= p147)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p217 <= p147)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: processed formula with 1 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((p224 <= p158))) OR (E (G ((p123 <= p154))) OR A (((3 <= p138) U (3 <= p229)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p224 <= p158)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 10 markings, 9 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p123 <= p154)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p154 + 1 <= p123)))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 1238837 markings, 2970094 edges, 247755 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1285844 markings, 3131515 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (F ((2 <= p229))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (2 <= p229))))
lola: processed formula length: 30
lola: 6 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 80 markings, 79 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((3 <= p155) OR E (F ((3 <= p70))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p155 <= 2) AND NOT(E(TRUE U (3 <= p70))))))
lola: processed formula length: 58
lola: 4 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
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: 732206 markings, 3130547 edges, 146428 markings/sec, 0 secs
lola: 1460690 markings, 6362863 edges, 145697 markings/sec, 5 secs
lola: 2377997 markings, 9586871 edges, 183461 markings/sec, 10 secs
lola: 3072141 markings, 12756582 edges, 138829 markings/sec, 15 secs
lola: 3689879 markings, 15806109 edges, 123548 markings/sec, 20 secs
lola: 4143476 markings, 18438165 edges, 90719 markings/sec, 25 secs
lola: 4733907 markings, 21558081 edges, 118086 markings/sec, 30 secs
lola: 5209660 markings, 24408171 edges, 95151 markings/sec, 35 secs
lola: 5897482 markings, 27688844 edges, 137564 markings/sec, 40 secs
lola: 6450801 markings, 30431315 edges, 110664 markings/sec, 45 secs
lola: 6915958 markings, 33121151 edges, 93031 markings/sec, 50 secs
lola: 7503488 markings, 36206533 edges, 117506 markings/sec, 55 secs
lola: 7969171 markings, 38965735 edges, 93137 markings/sec, 60 secs
lola: 8576023 markings, 41991236 edges, 121370 markings/sec, 65 secs
lola: 9010641 markings, 44612491 edges, 86924 markings/sec, 70 secs
lola: 9428348 markings, 47239777 edges, 83541 markings/sec, 75 secs
lola: 9843490 markings, 50003124 edges, 83028 markings/sec, 80 secs
lola: 10224577 markings, 52691229 edges, 76217 markings/sec, 85 secs
lola: 10721140 markings, 55681400 edges, 99313 markings/sec, 90 secs
lola: 11149658 markings, 58531056 edges, 85704 markings/sec, 95 secs
lola: 11541849 markings, 61306227 edges, 78438 markings/sec, 100 secs
lola: 12047051 markings, 64409412 edges, 101040 markings/sec, 105 secs
lola: 12536579 markings, 67545200 edges, 97906 markings/sec, 110 secs
lola: 12959808 markings, 70419845 edges, 84646 markings/sec, 115 secs
lola: 13354148 markings, 73144490 edges, 78868 markings/sec, 120 secs
lola: 13777372 markings, 75958852 edges, 84645 markings/sec, 125 secs
lola: 14192475 markings, 78935680 edges, 83021 markings/sec, 130 secs
lola: 14523823 markings, 81463504 edges, 66270 markings/sec, 135 secs
lola: 14863305 markings, 84090602 edges, 67896 markings/sec, 140 secs
lola: 15162941 markings, 86490951 edges, 59927 markings/sec, 145 secs
lola: 15566416 markings, 89233512 edges, 80695 markings/sec, 150 secs
lola: 15974165 markings, 92159318 edges, 81550 markings/sec, 155 secs
lola: 16308215 markings, 94756124 edges, 66810 markings/sec, 160 secs
lola: 16663587 markings, 97453048 edges, 71074 markings/sec, 165 secs
lola: 16978158 markings, 100031851 edges, 62914 markings/sec, 170 secs
lola: 17542524 markings, 103202213 edges, 112873 markings/sec, 175 secs
lola: 17987156 markings, 105952042 edges, 88926 markings/sec, 180 secs
lola: 18466999 markings, 108950372 edges, 95969 markings/sec, 185 secs
lola: 18845976 markings, 111590602 edges, 75795 markings/sec, 190 secs
lola: 19247397 markings, 114328896 edges, 80284 markings/sec, 195 secs
lola: 19714208 markings, 117425188 edges, 93362 markings/sec, 200 secs
lola: 20173673 markings, 120544422 edges, 91893 markings/sec, 205 secs
lola: 20581142 markings, 123558469 edges, 81494 markings/sec, 210 secs
lola: 20896716 markings, 125923530 edges, 63115 markings/sec, 215 secs
lola: 21198590 markings, 128040593 edges, 60375 markings/sec, 220 secs
lola: 21506805 markings, 130425141 edges, 61643 markings/sec, 225 secs
lola: 21857072 markings, 133021158 edges, 70053 markings/sec, 230 secs
lola: 22138344 markings, 135172789 edges, 56254 markings/sec, 235 secs
lola: 22433016 markings, 137358579 edges, 58934 markings/sec, 240 secs
lola: 22718230 markings, 139776593 edges, 57043 markings/sec, 245 secs
lola: 22975184 markings, 142128978 edges, 51391 markings/sec, 250 secs
lola: 23332667 markings, 144709035 edges, 71497 markings/sec, 255 secs
lola: 23652042 markings, 147252108 edges, 63875 markings/sec, 260 secs
lola: 24036823 markings, 150224882 edges, 76956 markings/sec, 265 secs
lola: 24352720 markings, 153017934 edges, 63179 markings/sec, 270 secs
lola: 24664708 markings, 155425218 edges, 62398 markings/sec, 275 secs
lola: 24933399 markings, 157655271 edges, 53738 markings/sec, 280 secs
lola: 25218565 markings, 160060654 edges, 57033 markings/sec, 285 secs
lola: 25443504 markings, 162204431 edges, 44988 markings/sec, 290 secs
lola: 25776029 markings, 164908979 edges, 66505 markings/sec, 295 secs
lola: 26055307 markings, 167259768 edges, 55856 markings/sec, 300 secs
lola: 26314683 markings, 169434644 edges, 51875 markings/sec, 305 secs
lola: 26556958 markings, 171732137 edges, 48455 markings/sec, 310 secs
lola: 26791336 markings, 174039670 edges, 46876 markings/sec, 315 secs
lola: 27142516 markings, 176550291 edges, 70236 markings/sec, 320 secs
lola: 27523939 markings, 179285175 edges, 76285 markings/sec, 325 secs
lola: 27834553 markings, 181579741 edges, 62123 markings/sec, 330 secs
lola: 28115003 markings, 183818567 edges, 56090 markings/sec, 335 secs
lola: 28445197 markings, 186323441 edges, 66039 markings/sec, 340 secs
lola: 28683753 markings, 188201145 edges, 47711 markings/sec, 345 secs
lola: 28984645 markings, 190511843 edges, 60178 markings/sec, 350 secs
lola: 29315680 markings, 193037142 edges, 66207 markings/sec, 355 secs
lola: 29617390 markings, 195571745 edges, 60342 markings/sec, 360 secs
lola: 29856903 markings, 197581605 edges, 47903 markings/sec, 365 secs
lola: 30088606 markings, 199729595 edges, 46341 markings/sec, 370 secs
lola: 30367926 markings, 202042331 edges, 55864 markings/sec, 375 secs
lola: 30588654 markings, 203950686 edges, 44146 markings/sec, 380 secs
lola: 30801522 markings, 205993715 edges, 42574 markings/sec, 385 secs
lola: 31232797 markings, 208659629 edges, 86255 markings/sec, 390 secs
lola: 31550510 markings, 210880272 edges, 63543 markings/sec, 395 secs
lola: 31848916 markings, 213041743 edges, 59681 markings/sec, 400 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((((p10 <= p135) AND (3 <= p158)) OR (3 <= p165)))) AND (p91 <= p269))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p10 <= p135) AND (3 <= p158)) OR (3 <= p165))))
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 28 bytes per marking, with 12 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-CTLCardinality-9.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= p151))) AND A (((p189 <= p254) U (1 <= p27))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p151)))
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 28 bytes per marking, with 12 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-00b-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-00b-CTLCardinality-10.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 571 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((p8 <= p102) AND (p187 <= p51) AND (1 <= p145) AND ((p265 <= 1) OR (p109 + 1 <= p122)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p8 <= p102) AND (p187 <= p51) AND (1 <= p145) AND ((p265 <= 1) OR (p109 + 1 <= p122)))))
lola: processed formula: A (F (((p8 <= p102) AND (p187 <= p51) AND (1 <= p145) AND ((p265 <= 1) OR (p109 + 1 <= p122)))))
lola: processed formula length: 97
lola: 0 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 11 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: 104 markings, 104 edges
lola: ========================================
lola: subprocess 12 will run for 713 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((p269 <= 0) U (p236 <= 1))) AND E (F (((p80 + 1 <= p40) AND (p233 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 713 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p269 <= 0) U (p236 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p269 <= 0) U (p236 <= 1))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 951 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p80 + 1 <= p40) AND (p233 <= 1))))
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 28 bytes per marking, with 12 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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-00b-CTLCardinality-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 951 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((3 <= p144) AND (3 <= p237) AND ((2 <= p124) OR (p20 <= p66))) OR A (X ((p244 <= p188))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p144 <= 2) OR (p237 <= 2) OR ((p124 <= 1) AND (p66 + 1 <= p20))) AND NOT(AX((p244 <= p188))))))
lola: processed formula length: 113
lola: 4 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
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: 81 markings, 80 edges
lola: ========================================
lola: subprocess 14 will run for 1427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (X ((3 <= p253)))) AND E (((p188 <= p140) U (p191 <= p206)))) AND A (F ((2 <= p43))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1427 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p253 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p253 <= 2)))
lola: processed formula: A (X ((p253 <= 2)))
lola: processed formula length: 19
lola: 4 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 10 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 15 will run for 2855 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p188 <= p140) U (p191 <= p206)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p188 <= p140) U (p191 <= p206))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 12 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: 1 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2855 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= p164)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p164)))
lola: processed formula: A (F ((3 <= p164)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 271 places; total mentions: 0
lola: closed formula file DES-PT-00b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 28 bytes per marking, with 11 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: 116 markings, 116 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no unknown no yes yes yes unknown no no no yes yes unknown no
FORMULA DES-PT-00b-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-00b-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
----- Finished stdout -----

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-00b"
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-00b.tgz
mv DES-PT-00b 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-00b, 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-152646382800164"
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 ;