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 25M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K 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 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is Dekker-PT-200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r079-blw3-152649946600108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527081406914


BK_STOP 1527082444667

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Dekker-PT-200 as instance name.
Using Dekker 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 1849053, 'Memory': 15936.07, 'Tool': 'lola'}, {'Time': 2302877, 'Memory': 13010.23, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola Dekker-PT-200...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
Dekker-PT-200: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
Dekker-PT-200: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ Dekker-PT-200 @ 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: 41400/65536 symbol table entries, 18535 collisions
lola: preprocessing...
lola: finding significant places
lola: 1000 places, 40400 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80600 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-200-CTLCardinality.task
lola: (A (F (E (F ((p3_29 <= flag_1_97))))) AND A (G (((p0_75 <= p1_192) OR (flag_0_37 <= 1))))) : (((E (F ((1 <= p3_194))) AND A (X ((2 <= p0_97)))) OR (((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189))) OR E (G ((p0_95 <= flag_0_117))))) AND ((p0_145 <= flag_0_85) AND E (((1 <= p0_139) U (3 <= p3_154))))) : E (G (E (X (((1 <= p0_9) AND (flag_1_56 <= p3_65)))))) : E (F (E (F (((3 <= p0_39) AND (3 <= flag_0_41)))))) : (A (G (A (F ((flag_1_175 <= p0_16))))) OR (E (X (((3 <= flag_1_121) OR (3 <= flag_1_90)))) OR NOT(E (F ((2 <= flag_0_133)))))) : A (G (A (X (((1 <= flag_0_183) OR (flag_1_66 <= p0_172)))))) : A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22)))) : E (G ((((p1_120 <= 1) AND ((1 <= flag_0_50) OR (p1_22 <= p3_57))) OR (2 <= p0_40)))) : E (X (A (((1 <= flag_0_102) U (3 <= flag_1_46))))) : (A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1)))) AND E (G (E (G ((p1_111 <= p3_182)))))) : E (X (NOT(E (X ((p3_127 <= p0_135)))))) : E (F (E (G ((1 <= flag_0_5))))) : E (G (NOT(A (X ((2 <= p3_79)))))) : (A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8)))) AND (p1_53 <= flag_0_161)) : A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88)))))) : A (F (E (X ((p0_157 + 1 <= flag_1_197)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (E (F ((p3_29 <= flag_1_97))))) AND A (G (((p0_75 <= p1_192) OR (flag_0_37 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F ((p3_29 <= flag_1_97)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (p3_29 <= flag_1_97)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 1 markings, 1 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p0_75 <= p1_192) OR (flag_0_37 <= 1))))
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 52 bytes per marking, with 16 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 Dekker-PT-200-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-CTLCardinality.sara.
lola: sara is running 0 secs || 655 markings, 2309 edges, 131 markings/sec, 0 secs
lola: sara is running 5 secs || 1275 markings, 4891 edges, 124 markings/sec, 5 secs
lola: sara is running 10 secs || 1852 markings, 7289 edges, 115 markings/sec, 10 secs
lola: sara is running 15 secs || 2446 markings, 10099 edges, 119 markings/sec, 15 secs
lola: sara is running 20 secs || 3015 markings, 12683 edges, 114 markings/sec, 20 secs
lola: sara is running 25 secs || 3596 markings, 15291 edges, 116 markings/sec, 25 secs
lola: sara is running 30 secs || 4205 markings, 18080 edges, 122 markings/sec, 30 secs
lola: sara is running 35 secs || 4813 markings, 20984 edges, 122 markings/sec, 35 secs
lola: sara is running 40 secs || 5402 markings, 23574 edges, 118 markings/sec, 40 secs
lola: sara is running 45 secs || 6004 markings, 26282 edges, 120 markings/sec, 45 secs
lola: sara is running 50 secs || 6646 markings, 29209 edges, 128 markings/sec, 50 secs
lola: sara is running 55 secs || 7293 markings, 32503 edges, 129 markings/sec, 55 secs
lola: sara is running 60 secs || 7903 markings, 35794 edges, 122 markings/sec, 60 secs
lola: sara is running 65 secs || 8511 markings, 39026 edges, 122 markings/sec, 65 secs
lola: sara is running 70 secs || 9137 markings, 42476 edges, 125 markings/sec, 70 secs
lola: sara is running 75 secs || 9750 markings, 45780 edges, 123 markings/sec, 75 secs
lola: sara is running 80 secs || 10333 markings, 48522 edges, 117 markings/sec, 80 secs
lola: sara is running 85 secs || 10920 markings, 51584 edges, 117 markings/sec, 85 secs
lola: sara is running 90 secs || 11512 markings, 54928 edges, 118 markings/sec, 90 secs
lola: sara is running 95 secs || 12112 markings, 58405 edges, 120 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 100 secs || 12680 markings, 61625 edges, 114 markings/sec, 100 secs

lola: sara is running 105 secs || 13270 markings, 65010 edges, 118 markings/sec, 105 secs
lola: sara is running 110 secs || 13889 markings, 68393 edges, 124 markings/sec, 110 secs
lola: sara is running 115 secs || 14502 markings, 71526 edges, 123 markings/sec, 115 secs
lola: sara is running 120 secs || 15110 markings, 74720 edges, 122 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((1 <= p3_194))) AND A (X ((2 <= p0_97)))) OR (((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189))) OR E (G ((p0_95 <= flag_0_117))))) AND ((p0_145 <= flag_0_85) AND E (((1 <= p0_139) U (3 <= p3_154)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p3_194)))
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 52 bytes per marking, with 16 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 Dekker-PT-200-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-CTLCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((2 <= p0_97)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((2 <= p0_97)))
lola: processed formula: A (X ((2 <= p0_97)))
lola: processed formula length: 20
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 14 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p1_13 <= flag_0_34) OR (1 <= flag_0_157) OR ((1 <= p3_129) AND (p0_153 <= p3_189)))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p0_145 <= flag_0_85)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p0_145 <= flag_0_85)
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-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: subprocess 5 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((1 <= p0_139) U (3 <= p3_154)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((1 <= p0_139) U (3 <= p3_154))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 21852 markings, 3830157 edges, 3689329903141912576 markings/sec, 0 secs
lola: 38849 markings, 7867689 edges, 3399 markings/sec, 5 secs
lola: 55197 markings, 11911368 edges, 3270 markings/sec, 10 secs
lola: 70492 markings, 15980426 edges, 3059 markings/sec, 15 secs
lola: 84461 markings, 20145665 edges, 2794 markings/sec, 20 secs
lola: 98032 markings, 24324300 edges, 2714 markings/sec, 25 secs
lola: 111970 markings, 28487811 edges, 2788 markings/sec, 30 secs
lola: 126392 markings, 32658761 edges, 2884 markings/sec, 35 secs
lola: 139492 markings, 36937277 edges, 2620 markings/sec, 40 secs
lola: 153275 markings, 41139905 edges, 2757 markings/sec, 45 secs
lola: 166618 markings, 45273676 edges, 2669 markings/sec, 50 secs
lola: 180521 markings, 49421663 edges, 2781 markings/sec, 55 secs
lola: 192669 markings, 53645305 edges, 2430 markings/sec, 60 secs
lola: 205674 markings, 57822740 edges, 2601 markings/sec, 65 secs
lola: 218474 markings, 62028051 edges, 2560 markings/sec, 70 secs
lola: 230543 markings, 66312241 edges, 2414 markings/sec, 75 secs
lola: 243617 markings, 70502839 edges, 2615 markings/sec, 80 secs
lola: 256810 markings, 74707461 edges, 2639 markings/sec, 85 secs
lola: 268843 markings, 79012800 edges, 2407 markings/sec, 90 secs
lola: 279773 markings, 83332289 edges, 2186 markings/sec, 95 secs
lola: 293505 markings, 87429806 edges, 2746 markings/sec, 100 secs
lola: 305183 markings, 91672931 edges, 2336 markings/sec, 105 secs
lola: 316677 markings, 95906958 edges, 2299 markings/sec, 110 secs
lola: 328021 markings, 100115346 edges, 2269 markings/sec, 115 secs
lola: 338266 markings, 104458192 edges, 2049 markings/sec, 120 secs
lola: 350698 markings, 108609335 edges, 2486 markings/sec, 125 secs
lola: 363472 markings, 112742030 edges, 2555 markings/sec, 130 secs
lola: 375472 markings, 116931673 edges, 2400 markings/sec, 135 secs
lola: 386765 markings, 121126372 edges, 2259 markings/sec, 140 secs
lola: 397025 markings, 125415522 edges, 2052 markings/sec, 145 secs
lola: 410902 markings, 129498739 edges, 2775 markings/sec, 150 secs
lola: 423379 markings, 133647655 edges, 2495 markings/sec, 155 secs
lola: 434648 markings, 137876114 edges, 2254 markings/sec, 160 secs
lola: 445492 markings, 142153966 edges, 2169 markings/sec, 165 secs
lola: 458697 markings, 146206006 edges, 2641 markings/sec, 170 secs
lola: 471002 markings, 150334085 edges, 2461 markings/sec, 175 secs
lola: 484906 markings, 154347519 edges, 2781 markings/sec, 180 secs
lola: 497566 markings, 158457581 edges, 2532 markings/sec, 185 secs
lola: 509210 markings, 162614351 edges, 2329 markings/sec, 190 secs
lola: 520366 markings, 166807340 edges, 2231 markings/sec, 195 secs
lola: 532305 markings, 170998598 edges, 2388 markings/sec, 200 secs
lola: 545127 markings, 175119326 edges, 2564 markings/sec, 205 secs
lola: 556637 markings, 179376645 edges, 2302 markings/sec, 210 secs
lola: 568352 markings, 183606398 edges, 2343 markings/sec, 215 secs
lola: 578747 markings, 187897248 edges, 2079 markings/sec, 220 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((1 <= p0_9) AND (flag_1_56 <= p3_65))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX(((1 <= p0_9) AND (flag_1_56 <= p3_65))))))
lola: processed formula length: 62
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 3 will run for 244 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((3 <= p0_39) AND (3 <= flag_0_41))))))
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 52 bytes per marking, with 16 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 Dekker-PT-200-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-CTLCardinality-3.sara.
lola: sara is running 0 secs || 579 markings, 2162 edges, 116 markings/sec, 0 secs
lola: sara is running 5 secs || 1129 markings, 5663 edges, 110 markings/sec, 5 secs
lola: sara is running 10 secs || 1664 markings, 8350 edges, 107 markings/sec, 10 secs
lola: sara is running 15 secs || 2195 markings, 12014 edges, 106 markings/sec, 15 secs
lola: sara is running 20 secs || 2703 markings, 15197 edges, 102 markings/sec, 20 secs
lola: sara is running 25 secs || 3271 markings, 19444 edges, 114 markings/sec, 25 secs
lola: sara is running 30 secs || 3829 markings, 22528 edges, 112 markings/sec, 30 secs
lola: sara is running 35 secs || 4371 markings, 26353 edges, 108 markings/sec, 35 secs
lola: sara is running 40 secs || 4881 markings, 30021 edges, 102 markings/sec, 40 secs
lola: sara is running 45 secs || 5425 markings, 33987 edges, 109 markings/sec, 45 secs
lola: sara is running 50 secs || 5985 markings, 37970 edges, 112 markings/sec, 50 secs
lola: sara is running 55 secs || 6613 markings, 42259 edges, 126 markings/sec, 55 secs
lola: sara is running 60 secs || 7256 markings, 45147 edges, 129 markings/sec, 60 secs
lola: sara is running 65 secs || 7898 markings, 49989 edges, 128 markings/sec, 65 secs
lola: sara is running 70 secs || 8537 markings, 52950 edges, 128 markings/sec, 70 secs
lola: sara is running 75 secs || 9170 markings, 56975 edges, 127 markings/sec, 75 secs
lola: sara is running 80 secs || 9765 markings, 61693 edges, 119 markings/sec, 80 secs
lola: sara is running 85 secs || 10374 markings, 67123 edges, 122 markings/sec, 85 secs
lola: sara is running 90 secs || 11004 markings, 72095 edges, 126 markings/sec, 90 secs
lola: sara is running 95 secs || 11640 markings, 77534 edges, 127 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 100 secs || 12229 markings, 80622 edges, 118 markings/sec, 100 secs
lola: sara is running 105 secs || 12836 markings, 83305 edges, 121 markings/sec, 105 secs
lola: sara is running 110 secs || 13456 markings, 87831 edges, 124 markings/sec, 110 secs
lola: sara is running 115 secs || 14078 markings, 92705 edges, 124 markings/sec, 115 secs
lola: sara is running 120 secs || 14709 markings, 97286 edges, 126 markings/sec, 120 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G (A (F ((flag_1_175 <= p0_16))))) OR (E (X (((3 <= flag_1_121) OR (3 <= flag_1_90)))) OR NOT(E (F ((2 <= flag_0_133))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((flag_1_175 <= p0_16)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (flag_1_175 <= p0_16)))))
lola: processed formula length: 51
lola: 5 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 22000 markings, 3875414 edges, 3689329903141912576 markings/sec, 0 secs
lola: 39010 markings, 7954343 edges, 3402 markings/sec, 5 secs
lola: 55489 markings, 12033942 edges, 3296 markings/sec, 10 secs
lola: 70843 markings, 16155515 edges, 3071 markings/sec, 15 secs
lola: 84902 markings, 20393000 edges, 2812 markings/sec, 20 secs
lola: 98640 markings, 24601928 edges, 2748 markings/sec, 25 secs
lola: 112593 markings, 28811754 edges, 2791 markings/sec, 30 secs
lola: 126913 markings, 32944801 edges, 2864 markings/sec, 35 secs
lola: 139850 markings, 37190023 edges, 2587 markings/sec, 40 secs
lola: 153570 markings, 41381167 edges, 2744 markings/sec, 45 secs
lola: 167233 markings, 45577378 edges, 2733 markings/sec, 50 secs
lola: 181225 markings, 49797443 edges, 2798 markings/sec, 55 secs
lola: 193322 markings, 54099279 edges, 2419 markings/sec, 60 secs
lola: 206710 markings, 58322861 edges, 2678 markings/sec, 65 secs
lola: 219685 markings, 62597687 edges, 2595 markings/sec, 70 secs
lola: 231699 markings, 66947132 edges, 2403 markings/sec, 75 secs
lola: 244929 markings, 71181742 edges, 2646 markings/sec, 80 secs
lola: 258083 markings, 75467052 edges, 2631 markings/sec, 85 secs
lola: 270186 markings, 79780297 edges, 2421 markings/sec, 90 secs
lola: 281076 markings, 84171180 edges, 2178 markings/sec, 95 secs
lola: 295110 markings, 88291569 edges, 2807 markings/sec, 100 secs
lola: 306620 markings, 92623785 edges, 2302 markings/sec, 105 secs
lola: 318414 markings, 96897342 edges, 2359 markings/sec, 110 secs
lola: 329716 markings, 101154077 edges, 2260 markings/sec, 115 secs
lola: 340027 markings, 105495003 edges, 2062 markings/sec, 120 secs
lola: 351954 markings, 109383144 edges, 2385 markings/sec, 125 secs
lola: 364409 markings, 113426256 edges, 2491 markings/sec, 130 secs
lola: 375293 markings, 117252843 edges, 2177 markings/sec, 135 secs
lola: 386282 markings, 121338505 edges, 2198 markings/sec, 140 secs
lola: 396592 markings, 125653159 edges, 2062 markings/sec, 145 secs
lola: 410238 markings, 129674901 edges, 2729 markings/sec, 150 secs
lola: 422438 markings, 133797683 edges, 2440 markings/sec, 155 secs
lola: 433704 markings, 137941424 edges, 2253 markings/sec, 160 secs
lola: 444334 markings, 142155136 edges, 2126 markings/sec, 165 secs
lola: 456835 markings, 146177057 edges, 2500 markings/sec, 170 secs
lola: 469128 markings, 150170501 edges, 2459 markings/sec, 175 secs
lola: 482348 markings, 154105511 edges, 2644 markings/sec, 180 secs
lola: 495088 markings, 158104796 edges, 2548 markings/sec, 185 secs
lola: 506404 markings, 162184984 edges, 2263 markings/sec, 190 secs
lola: 517821 markings, 166246138 edges, 2283 markings/sec, 195 secs
lola: 528684 markings, 170412587 edges, 2173 markings/sec, 200 secs
lola: 541450 markings, 174435411 edges, 2553 markings/sec, 205 secs
lola: 552852 markings, 178590773 edges, 2280 markings/sec, 210 secs
lola: 564765 markings, 182824789 edges, 2383 markings/sec, 215 secs
lola: 575005 markings, 186908688 edges, 2048 markings/sec, 220 secs
lola: 585507 markings, 190844813 edges, 2100 markings/sec, 225 secs
lola: 598117 markings, 194886905 edges, 2522 markings/sec, 230 secs
lola: 610284 markings, 198866337 edges, 2433 markings/sec, 235 secs
lola: 621563 markings, 203026727 edges, 2256 markings/sec, 240 secs
lola: 634956 markings, 207059951 edges, 2679 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (((1 <= flag_0_183) OR (flag_1_66 <= p0_172))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(((1 <= flag_0_183) OR (flag_1_66 <= p0_172))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 294 markings, 7138 edges, 3689329903141912576 markings/sec, 0 secs
lola: 459 markings, 14973 edges, 33 markings/sec, 5 secs
lola: 597 markings, 22881 edges, 28 markings/sec, 10 secs
lola: 726 markings, 31263 edges, 26 markings/sec, 15 secs
lola: 851 markings, 40182 edges, 25 markings/sec, 20 secs
lola: 965 markings, 48458 edges, 23 markings/sec, 25 secs
lola: 1075 markings, 56841 edges, 22 markings/sec, 30 secs
lola: 1180 markings, 65392 edges, 21 markings/sec, 35 secs
lola: 1279 markings, 71995 edges, 20 markings/sec, 40 secs
lola: 1374 markings, 79604 edges, 19 markings/sec, 45 secs
lola: 1467 markings, 87945 edges, 19 markings/sec, 50 secs
lola: 1556 markings, 98296 edges, 18 markings/sec, 55 secs
lola: 1646 markings, 104901 edges, 18 markings/sec, 60 secs
lola: 1732 markings, 113540 edges, 17 markings/sec, 65 secs
lola: 1819 markings, 120532 edges, 17 markings/sec, 70 secs
lola: 1902 markings, 128060 edges, 17 markings/sec, 75 secs
lola: 1983 markings, 137779 edges, 16 markings/sec, 80 secs
lola: 2065 markings, 145061 edges, 16 markings/sec, 85 secs
lola: 2146 markings, 152508 edges, 16 markings/sec, 90 secs
lola: 2225 markings, 162054 edges, 16 markings/sec, 95 secs
lola: 2304 markings, 170101 edges, 16 markings/sec, 100 secs
lola: 2380 markings, 177240 edges, 15 markings/sec, 105 secs
lola: 2457 markings, 185112 edges, 15 markings/sec, 110 secs
lola: 2533 markings, 192732 edges, 15 markings/sec, 115 secs
lola: 2608 markings, 199880 edges, 15 markings/sec, 120 secs
lola: 2682 markings, 208257 edges, 15 markings/sec, 125 secs
lola: 2755 markings, 216106 edges, 15 markings/sec, 130 secs
lola: 2830 markings, 222834 edges, 15 markings/sec, 135 secs
lola: 2905 markings, 230724 edges, 15 markings/sec, 140 secs
lola: 2977 markings, 240992 edges, 14 markings/sec, 145 secs
lola: 3050 markings, 247167 edges, 15 markings/sec, 150 secs
lola: 3122 markings, 254339 edges, 14 markings/sec, 155 secs
lola: 3192 markings, 262885 edges, 14 markings/sec, 160 secs
lola: 3254 markings, 271149 edges, 12 markings/sec, 165 secs
lola: 3316 markings, 276742 edges, 12 markings/sec, 170 secs
lola: 3380 markings, 283445 edges, 13 markings/sec, 175 secs
lola: 3446 markings, 291963 edges, 13 markings/sec, 180 secs
lola: 3509 markings, 298746 edges, 13 markings/sec, 185 secs
lola: 3573 markings, 304740 edges, 13 markings/sec, 190 secs
lola: 3632 markings, 311280 edges, 12 markings/sec, 195 secs
lola: 3687 markings, 318560 edges, 11 markings/sec, 200 secs
lola: 3747 markings, 324762 edges, 12 markings/sec, 205 secs
lola: 3802 markings, 329942 edges, 11 markings/sec, 210 secs
lola: 3856 markings, 336249 edges, 11 markings/sec, 215 secs
lola: 3910 markings, 343493 edges, 11 markings/sec, 220 secs
lola: 3962 markings, 351241 edges, 10 markings/sec, 225 secs
lola: 4016 markings, 355755 edges, 11 markings/sec, 230 secs
lola: 4071 markings, 361924 edges, 11 markings/sec, 235 secs
lola: 4132 markings, 369087 edges, 12 markings/sec, 240 secs
lola: 4190 markings, 377418 edges, 12 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22))))
lola: processed formula: A (F (((flag_0_29 + 1 <= p0_32) OR (flag_0_123 + 1 <= p3_22))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 15 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 7 will run for 283 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p1_120 <= 1) AND ((1 <= flag_0_50) OR (p1_22 <= p3_57))) OR (2 <= p0_40))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((2 <= p1_120) OR ((flag_0_50 <= 0) AND (p3_57 + 1 <= p1_22))) AND (p0_40 <= 1))))
lola: processed formula length: 97
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 8 will run for 318 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (((1 <= flag_0_102) U (3 <= flag_1_46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A((1 <= flag_0_102) U (3 <= flag_1_46)))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 836 markings, 1034 edges
lola: ========================================
lola: subprocess 9 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1)))) AND E (G (E (G ((p1_111 <= p3_182))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 364 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1))))
lola: processed formula: A (F (((flag_1_178 <= 0) OR (flag_0_14 <= 1))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 15 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G ((p1_111 <= p3_182)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (p3_182 + 1 <= p1_111))))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 5 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 424 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (X ((p3_127 <= p0_135))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((p0_135 + 1 <= p3_127)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= flag_0_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (flag_0_5 <= 0))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 5 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (X ((2 <= p3_79))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p3_79 <= 1)))))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 13 will run for 849 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8)))) AND (p1_53 <= flag_0_161))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 849 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8))))
lola: processed formula: A (F (((flag_0_168 + 1 <= p1_36) AND (2 <= p0_8))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 15 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: 5 markings, 5 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88))))))
lola: processed formula: A (F (A (G (((p0_16 <= p1_158) AND (3 <= flag_1_88))))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 14 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: 6 markings, 7 edges
lola: ========================================
lola: subprocess 15 will run for 2545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((p0_157 + 1 <= flag_1_197)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((p0_157 + 1 <= flag_1_197)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 1000 places; total mentions: 0
lola: closed formula file Dekker-PT-200-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 16 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 5 markings, 5 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes unknown yes no unknown unknown no yes no yes no yes yes no no no
FORMULA Dekker-PT-200-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Dekker-PT-200-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="Dekker-PT-200"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is Dekker-PT-200, 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 r079-blw3-152649946600108"
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 ;