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 mcc4mcc-full
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 r058-smll-152646385600164
=====================================================================

--------------------
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 1526531990406


BK_STOP 1526532721142

--------------------
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-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 @ 3539 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3539 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 235 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: 652875 markings, 3577035 edges, 130575 markings/sec, 0 secs
lola: 1249949 markings, 7382857 edges, 119415 markings/sec, 5 secs
lola: 1824205 markings, 11126110 edges, 114851 markings/sec, 10 secs
lola: 2435328 markings, 14904623 edges, 122225 markings/sec, 15 secs
lola: 2988758 markings, 18630483 edges, 110686 markings/sec, 20 secs
lola: 3570733 markings, 22289180 edges, 116395 markings/sec, 25 secs
lola: 4099161 markings, 25819228 edges, 105686 markings/sec, 30 secs
lola: 4578661 markings, 29309753 edges, 95900 markings/sec, 35 secs
lola: 5120951 markings, 32774765 edges, 108458 markings/sec, 40 secs
lola: 5612114 markings, 36030409 edges, 98233 markings/sec, 45 secs
lola: 6111920 markings, 39330044 edges, 99961 markings/sec, 50 secs
lola: 6636349 markings, 42742635 edges, 104886 markings/sec, 55 secs
lola: 7147209 markings, 46048200 edges, 102172 markings/sec, 60 secs
lola: 7602799 markings, 49193826 edges, 91118 markings/sec, 65 secs
lola: 8034755 markings, 52383362 edges, 86391 markings/sec, 70 secs
lola: 8589904 markings, 55750261 edges, 111030 markings/sec, 75 secs
lola: 9086253 markings, 59066475 edges, 99270 markings/sec, 80 secs
lola: 9612885 markings, 62414461 edges, 105326 markings/sec, 85 secs
lola: 10072135 markings, 65616764 edges, 91850 markings/sec, 90 secs
lola: 10577161 markings, 68860648 edges, 101005 markings/sec, 95 secs
lola: 11020953 markings, 72076582 edges, 88758 markings/sec, 100 secs
lola: 11417806 markings, 75403724 edges, 79371 markings/sec, 105 secs
lola: 11782210 markings, 78693636 edges, 72881 markings/sec, 110 secs
lola: 12152837 markings, 81987222 edges, 74125 markings/sec, 115 secs
lola: 12518885 markings, 85239639 edges, 73210 markings/sec, 120 secs
lola: 12825640 markings, 88356033 edges, 61351 markings/sec, 125 secs
lola: 13368980 markings, 91590213 edges, 108668 markings/sec, 130 secs
lola: 13895150 markings, 94818453 edges, 105234 markings/sec, 135 secs
lola: 14387555 markings, 98016108 edges, 98481 markings/sec, 140 secs
lola: 14867600 markings, 101159979 edges, 96009 markings/sec, 145 secs
lola: 15402278 markings, 104403233 edges, 106936 markings/sec, 150 secs
lola: 15865877 markings, 107573867 edges, 92720 markings/sec, 155 secs
lola: 16361320 markings, 110727447 edges, 99089 markings/sec, 160 secs
lola: 16837401 markings, 113819478 edges, 95216 markings/sec, 165 secs
lola: 17278547 markings, 116853192 edges, 88229 markings/sec, 170 secs
lola: 17674184 markings, 119847680 edges, 79127 markings/sec, 175 secs
lola: 18184418 markings, 122898050 edges, 102047 markings/sec, 180 secs
lola: 18627433 markings, 125860572 edges, 88603 markings/sec, 185 secs
lola: 19080312 markings, 128819662 edges, 90576 markings/sec, 190 secs
lola: 19530925 markings, 131798592 edges, 90123 markings/sec, 195 secs
lola: 19982650 markings, 134724132 edges, 90345 markings/sec, 200 secs
lola: 20395088 markings, 137541386 edges, 82488 markings/sec, 205 secs
lola: 20753884 markings, 140327951 edges, 71759 markings/sec, 210 secs
lola: 21283520 markings, 143472981 edges, 105927 markings/sec, 215 secs
lola: 21744806 markings, 146553995 edges, 92257 markings/sec, 220 secs
lola: 22201579 markings, 149592938 edges, 91355 markings/sec, 225 secs
lola: 22681977 markings, 152704816 edges, 96080 markings/sec, 230 secs
lola: 23144768 markings, 155751235 edges, 92558 markings/sec, 235 secs
lola: 23589475 markings, 158733040 edges, 88941 markings/sec, 240 secs
lola: 23967455 markings, 161646795 edges, 75596 markings/sec, 245 secs
lola: 24337206 markings, 164741858 edges, 73950 markings/sec, 250 secs
lola: 24670806 markings, 167758742 edges, 66720 markings/sec, 255 secs
lola: 25015173 markings, 170803728 edges, 68873 markings/sec, 260 secs
lola: 25353614 markings, 173804216 edges, 67688 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: 1249587 markings, 3004581 edges, 249905 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: 763734 markings, 3295598 edges, 152734 markings/sec, 0 secs
lola: 1524701 markings, 6703635 edges, 152193 markings/sec, 5 secs
lola: 2506110 markings, 10040937 edges, 196282 markings/sec, 10 secs
lola: 3192598 markings, 13327598 edges, 137298 markings/sec, 15 secs
lola: 3802204 markings, 16427727 edges, 121921 markings/sec, 20 secs
lola: 4307641 markings, 19353332 edges, 101087 markings/sec, 25 secs
lola: 4896011 markings, 22468334 edges, 117674 markings/sec, 30 secs
lola: 5478372 markings, 25563130 edges, 116472 markings/sec, 35 secs
lola: 6087078 markings, 28638204 edges, 121741 markings/sec, 40 secs
lola: 6678996 markings, 31694437 edges, 118384 markings/sec, 45 secs
lola: 7218347 markings, 34639774 edges, 107870 markings/sec, 50 secs
lola: 7738236 markings, 37646271 edges, 103978 markings/sec, 55 secs
lola: 8352880 markings, 40699843 edges, 122929 markings/sec, 60 secs
lola: 8862256 markings, 43673970 edges, 101875 markings/sec, 65 secs
lola: 9308556 markings, 46502782 edges, 89260 markings/sec, 70 secs
lola: 9760241 markings, 49441747 edges, 90337 markings/sec, 75 secs
lola: 10135016 markings, 52058567 edges, 74955 markings/sec, 80 secs
lola: 10570353 markings, 54829401 edges, 87067 markings/sec, 85 secs
lola: 11043299 markings, 57840520 edges, 94589 markings/sec, 90 secs
lola: 11437396 markings, 60593671 edges, 78819 markings/sec, 95 secs
lola: 11869027 markings, 63340519 edges, 86326 markings/sec, 100 secs
lola: 12376629 markings, 66488364 edges, 101520 markings/sec, 105 secs
lola: 12774098 markings, 69156267 edges, 79494 markings/sec, 110 secs
lola: 13184477 markings, 71877824 edges, 82076 markings/sec, 115 secs
lola: 13575884 markings, 74622132 edges, 78281 markings/sec, 120 secs
lola: 14014284 markings, 77607203 edges, 87680 markings/sec, 125 secs
lola: 14360476 markings, 80207425 edges, 69238 markings/sec, 130 secs
lola: 14698563 markings, 82828528 edges, 67617 markings/sec, 135 secs
lola: 15021227 markings, 85269371 edges, 64533 markings/sec, 140 secs
lola: 15363408 markings, 87901726 edges, 68436 markings/sec, 145 secs
lola: 15799032 markings, 90837616 edges, 87125 markings/sec, 150 secs
lola: 16143439 markings, 93457011 edges, 68881 markings/sec, 155 secs
lola: 16485806 markings, 96116386 edges, 68473 markings/sec, 160 secs
lola: 16801156 markings, 98523713 edges, 63070 markings/sec, 165 secs
lola: 17224943 markings, 101356335 edges, 84757 markings/sec, 170 secs
lola: 17700791 markings, 104209779 edges, 95170 markings/sec, 175 secs
lola: 18160401 markings, 107001864 edges, 91922 markings/sec, 180 secs
lola: 18600084 markings, 109843769 edges, 87937 markings/sec, 185 secs
lola: 18969383 markings, 112450719 edges, 73860 markings/sec, 190 secs
lola: 19418501 markings, 115355010 edges, 89824 markings/sec, 195 secs
lola: 19838596 markings, 118304684 edges, 84019 markings/sec, 200 secs
lola: 20331973 markings, 121618004 edges, 98675 markings/sec, 205 secs
lola: 20738832 markings, 124610024 edges, 81372 markings/sec, 210 secs
lola: 21093091 markings, 127234718 edges, 70852 markings/sec, 215 secs
lola: 21445932 markings, 129914227 edges, 70568 markings/sec, 220 secs
lola: 21818288 markings, 132748298 edges, 74471 markings/sec, 225 secs
lola: 22186785 markings, 135552087 edges, 73699 markings/sec, 230 secs
lola: 22523079 markings, 138047259 edges, 67259 markings/sec, 235 secs
lola: 22829559 markings, 140795346 edges, 61296 markings/sec, 240 secs
lola: 23172714 markings, 143544843 edges, 68631 markings/sec, 245 secs
lola: 23546885 markings, 146394730 edges, 74834 markings/sec, 250 secs
lola: 23912121 markings, 149303492 edges, 73047 markings/sec, 255 secs
lola: 24295605 markings, 152417643 edges, 76697 markings/sec, 260 secs
lola: 24629213 markings, 155106468 edges, 66722 markings/sec, 265 secs
lola: 24923067 markings, 157581898 edges, 58771 markings/sec, 270 secs
lola: 25239195 markings, 160206938 edges, 63226 markings/sec, 275 secs
lola: 25506735 markings, 162701108 edges, 53508 markings/sec, 280 secs
lola: 25853702 markings, 165609298 edges, 69393 markings/sec, 285 secs
lola: 26145757 markings, 168001367 edges, 58411 markings/sec, 290 secs
lola: 26420511 markings, 170377404 edges, 54951 markings/sec, 295 secs
lola: 26690373 markings, 173041420 edges, 53972 markings/sec, 300 secs
lola: 26999361 markings, 175617743 edges, 61798 markings/sec, 305 secs
lola: 27452455 markings, 178648610 edges, 90619 markings/sec, 310 secs
lola: 27813289 markings, 181423363 edges, 72167 markings/sec, 315 secs
lola: 28125992 markings, 183949927 edges, 62541 markings/sec, 320 secs
lola: 28490842 markings, 186644450 edges, 72970 markings/sec, 325 secs
lola: 28800100 markings, 189186724 edges, 61852 markings/sec, 330 secs
lola: 29170785 markings, 191915753 edges, 74137 markings/sec, 335 secs
lola: 29531734 markings, 194917291 edges, 72190 markings/sec, 340 secs
lola: 29825871 markings, 197341569 edges, 58827 markings/sec, 345 secs
lola: 30090993 markings, 199766313 edges, 53024 markings/sec, 350 secs
lola: 30404633 markings, 202378215 edges, 62728 markings/sec, 355 secs
lola: 30666817 markings, 204693977 edges, 52437 markings/sec, 360 secs
lola: 31048014 markings, 207412371 edges, 76239 markings/sec, 365 secs
lola: 31438677 markings, 210087430 edges, 78133 markings/sec, 370 secs
lola: 31797514 markings, 212664406 edges, 71767 markings/sec, 375 secs
lola: 32208321 markings, 215556591 edges, 82161 markings/sec, 380 secs
lola: 32558954 markings, 218339251 edges, 70127 markings/sec, 385 secs
lola: 32975960 markings, 221507411 edges, 83401 markings/sec, 390 secs
lola: 33319012 markings, 224481888 edges, 68610 markings/sec, 395 secs
lola: 33627394 markings, 227085370 edges, 61676 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 407 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 407 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 570 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: 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 2854 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 2854 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 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-00b"
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-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 mcc4mcc-full"
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 r058-smll-152646385600164"
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 ;