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-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 r054-smll-152646382200164
=====================================================================

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


BK_STOP 1526496709632

--------------------
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 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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: 637476 markings, 3483388 edges, 127495 markings/sec, 0 secs
lola: 1223479 markings, 7222181 edges, 117201 markings/sec, 5 secs
lola: 1784497 markings, 10870103 edges, 112204 markings/sec, 10 secs
lola: 2374557 markings, 14544325 edges, 118012 markings/sec, 15 secs
lola: 2906792 markings, 18064209 edges, 106447 markings/sec, 20 secs
lola: 3462223 markings, 21661492 edges, 111086 markings/sec, 25 secs
lola: 3995658 markings, 25131193 edges, 106687 markings/sec, 30 secs
lola: 4482487 markings, 28503950 edges, 97366 markings/sec, 35 secs
lola: 4961009 markings, 31852637 edges, 95704 markings/sec, 40 secs
lola: 5477132 markings, 35102178 edges, 103225 markings/sec, 45 secs
lola: 5928438 markings, 38115769 edges, 90261 markings/sec, 50 secs
lola: 6446672 markings, 41420958 edges, 103647 markings/sec, 55 secs
lola: 6911802 markings, 44628533 edges, 93026 markings/sec, 60 secs
lola: 7384778 markings, 47676603 edges, 94595 markings/sec, 65 secs
lola: 7804677 markings, 50734110 edges, 83980 markings/sec, 70 secs
lola: 8307373 markings, 53935435 edges, 100539 markings/sec, 75 secs
lola: 8797717 markings, 57153437 edges, 98069 markings/sec, 80 secs
lola: 9274193 markings, 60345812 edges, 95295 markings/sec, 85 secs
lola: 9783207 markings, 63602877 edges, 101803 markings/sec, 90 secs
lola: 10256861 markings, 66749223 edges, 94731 markings/sec, 95 secs
lola: 10715863 markings, 69813864 edges, 91800 markings/sec, 100 secs
lola: 11109899 markings, 72862919 edges, 78807 markings/sec, 105 secs
lola: 11488287 markings, 76043234 edges, 75678 markings/sec, 110 secs
lola: 11817853 markings, 79033557 edges, 65913 markings/sec, 115 secs
lola: 12175355 markings, 82197097 edges, 71500 markings/sec, 120 secs
lola: 12522911 markings, 85278636 edges, 69511 markings/sec, 125 secs
lola: 12814812 markings, 88233239 edges, 58380 markings/sec, 130 secs
lola: 13312344 markings, 91277840 edges, 99506 markings/sec, 135 secs
lola: 13827676 markings, 94376903 edges, 103066 markings/sec, 140 secs
lola: 14295020 markings, 97436733 edges, 93469 markings/sec, 145 secs
lola: 14761652 markings, 100461969 edges, 93326 markings/sec, 150 secs
lola: 15266658 markings, 103556502 edges, 101001 markings/sec, 155 secs
lola: 15718453 markings, 106593941 edges, 90359 markings/sec, 160 secs
lola: 16170038 markings, 109599180 edges, 90317 markings/sec, 165 secs
lola: 16648131 markings, 112524358 edges, 95619 markings/sec, 170 secs
lola: 17077189 markings, 115457110 edges, 85812 markings/sec, 175 secs
lola: 17466841 markings, 118371107 edges, 77930 markings/sec, 180 secs
lola: 17925990 markings, 121292737 edges, 91830 markings/sec, 185 secs
lola: 18340040 markings, 123947337 edges, 82810 markings/sec, 190 secs
lola: 18746583 markings, 126659602 edges, 81309 markings/sec, 195 secs
lola: 19187722 markings, 129461518 edges, 88228 markings/sec, 200 secs
lola: 19592880 markings, 132235405 edges, 81032 markings/sec, 205 secs
lola: 20026345 markings, 135000904 edges, 86693 markings/sec, 210 secs
lola: 20403459 markings, 137598038 edges, 75423 markings/sec, 215 secs
lola: 20735980 markings, 140172550 edges, 66504 markings/sec, 220 secs
lola: 21230429 markings, 143160906 edges, 98890 markings/sec, 225 secs
lola: 21674249 markings, 146094430 edges, 88764 markings/sec, 230 secs
lola: 22112835 markings, 149012186 edges, 87717 markings/sec, 235 secs
lola: 22581234 markings, 151998396 edges, 93680 markings/sec, 240 secs
lola: 23006204 markings, 154916010 edges, 84994 markings/sec, 245 secs
lola: 23443281 markings, 157726012 edges, 87415 markings/sec, 250 secs
lola: 23844830 markings, 160575707 edges, 80310 markings/sec, 255 secs
lola: 24156706 markings, 163198112 edges, 62375 markings/sec, 260 secs
lola: 24485457 markings, 166082456 edges, 65750 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: 1167311 markings, 2795561 edges, 233449 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: 739495 markings, 3166169 edges, 147886 markings/sec, 0 secs
lola: 1435614 markings, 6225448 edges, 139224 markings/sec, 5 secs
lola: 2369644 markings, 9558380 edges, 186806 markings/sec, 10 secs
lola: 3056717 markings, 12685883 edges, 137415 markings/sec, 15 secs
lola: 3676075 markings, 15727478 edges, 123872 markings/sec, 20 secs
lola: 4110884 markings, 18257576 edges, 86962 markings/sec, 25 secs
lola: 4657469 markings, 21105306 edges, 109317 markings/sec, 30 secs
lola: 5092137 markings, 23673892 edges, 86934 markings/sec, 35 secs
lola: 5643017 markings, 26384373 edges, 110176 markings/sec, 40 secs
lola: 6164022 markings, 29024002 edges, 104201 markings/sec, 45 secs
lola: 6672399 markings, 31659858 edges, 101675 markings/sec, 50 secs
lola: 7159629 markings, 34387060 edges, 97446 markings/sec, 55 secs
lola: 7705004 markings, 37409321 edges, 109075 markings/sec, 60 secs
lola: 8263628 markings, 40279355 edges, 111725 markings/sec, 65 secs
lola: 8761555 markings, 43066649 edges, 99585 markings/sec, 70 secs
lola: 9188925 markings, 45715963 edges, 85474 markings/sec, 75 secs
lola: 9633962 markings, 48605567 edges, 89007 markings/sec, 80 secs
lola: 9996160 markings, 51127852 edges, 72440 markings/sec, 85 secs
lola: 10385140 markings, 53755015 edges, 77796 markings/sec, 90 secs
lola: 10869243 markings, 56654935 edges, 96821 markings/sec, 95 secs
lola: 11234774 markings, 59149719 edges, 73106 markings/sec, 100 secs
lola: 11571217 markings, 61515708 edges, 67289 markings/sec, 105 secs
lola: 12015695 markings, 64196109 edges, 88896 markings/sec, 110 secs
lola: 12464002 markings, 67030797 edges, 89661 markings/sec, 115 secs
lola: 12820348 markings, 69514984 edges, 71269 markings/sec, 120 secs
lola: 13220239 markings, 72115847 edges, 79978 markings/sec, 125 secs
lola: 13610911 markings, 74842088 edges, 78134 markings/sec, 130 secs
lola: 14047219 markings, 77898334 edges, 87262 markings/sec, 135 secs
lola: 14392654 markings, 80464266 edges, 69087 markings/sec, 140 secs
lola: 14746350 markings, 83224133 edges, 70739 markings/sec, 145 secs
lola: 15063663 markings, 85651654 edges, 63463 markings/sec, 150 secs
lola: 15460671 markings, 88508391 edges, 79402 markings/sec, 155 secs
lola: 15879557 markings, 91543998 edges, 83777 markings/sec, 160 secs
lola: 16222861 markings, 94078599 edges, 68661 markings/sec, 165 secs
lola: 16561089 markings, 96698386 edges, 67646 markings/sec, 170 secs
lola: 16871084 markings, 99124440 edges, 61999 markings/sec, 175 secs
lola: 17333224 markings, 101959837 edges, 92428 markings/sec, 180 secs
lola: 17764235 markings, 104583659 edges, 86202 markings/sec, 185 secs
lola: 18201886 markings, 107242647 edges, 87530 markings/sec, 190 secs
lola: 18600478 markings, 109846358 edges, 79718 markings/sec, 195 secs
lola: 18925007 markings, 112143405 edges, 64906 markings/sec, 200 secs
lola: 19306693 markings, 114653557 edges, 76337 markings/sec, 205 secs
lola: 19705206 markings, 117343803 edges, 79703 markings/sec, 210 secs
lola: 20118290 markings, 120132697 edges, 82617 markings/sec, 215 secs
lola: 20498922 markings, 123062116 edges, 76126 markings/sec, 220 secs
lola: 20851665 markings, 125502389 edges, 70549 markings/sec, 225 secs
lola: 21155915 markings, 127703981 edges, 60850 markings/sec, 230 secs
lola: 21472070 markings, 130124323 edges, 63231 markings/sec, 235 secs
lola: 21798091 markings, 132625051 edges, 65204 markings/sec, 240 secs
lola: 22122373 markings, 135039789 edges, 64856 markings/sec, 245 secs
lola: 22395117 markings, 137103333 edges, 54549 markings/sec, 250 secs
lola: 22669990 markings, 139378774 edges, 54975 markings/sec, 255 secs
lola: 22929026 markings, 141686583 edges, 51807 markings/sec, 260 secs
lola: 23256292 markings, 144146929 edges, 65453 markings/sec, 265 secs
lola: 23577828 markings, 146671267 edges, 64307 markings/sec, 270 secs
lola: 23897284 markings, 149212915 edges, 63891 markings/sec, 275 secs
lola: 24242491 markings, 151910341 edges, 69041 markings/sec, 280 secs
lola: 24536188 markings, 154384899 edges, 58739 markings/sec, 285 secs
lola: 24793026 markings, 156590335 edges, 51368 markings/sec, 290 secs
lola: 25030508 markings, 158466211 edges, 47496 markings/sec, 295 secs
lola: 25307426 markings, 160808268 edges, 55384 markings/sec, 300 secs
lola: 25550369 markings, 163079913 edges, 48589 markings/sec, 305 secs
lola: 25853660 markings, 165609075 edges, 60658 markings/sec, 310 secs
lola: 26113531 markings, 167761039 edges, 51974 markings/sec, 315 secs
lola: 26367144 markings, 169883510 edges, 50723 markings/sec, 320 secs
lola: 26596829 markings, 172113231 edges, 45937 markings/sec, 325 secs
lola: 26808352 markings, 174218875 edges, 42305 markings/sec, 330 secs
lola: 27154935 markings, 176649328 edges, 69317 markings/sec, 335 secs
lola: 27538736 markings, 179453300 edges, 76760 markings/sec, 340 secs
lola: 27849937 markings, 181700062 edges, 62240 markings/sec, 345 secs
lola: 28110349 markings, 183767431 edges, 52082 markings/sec, 350 secs
lola: 28420657 markings, 186107464 edges, 62062 markings/sec, 355 secs
lola: 28676837 markings, 188152721 edges, 51236 markings/sec, 360 secs
lola: 28987402 markings, 190535135 edges, 62113 markings/sec, 365 secs
lola: 29333976 markings, 193162580 edges, 69315 markings/sec, 370 secs
lola: 29640721 markings, 195739983 edges, 61349 markings/sec, 375 secs
lola: 29877310 markings, 197799794 edges, 47318 markings/sec, 380 secs
lola: 30135183 markings, 200100853 edges, 51575 markings/sec, 385 secs
lola: 30410587 markings, 202445408 edges, 55081 markings/sec, 390 secs
lola: 30653588 markings, 204581583 edges, 48600 markings/sec, 395 secs
lola: 30988896 markings, 207050644 edges, 67062 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 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: 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 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="irma4mcc-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 irma4mcc-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 r054-smll-152646382200164"
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 ;