fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r071-smll-152649744200332
Last Updated
June 26, 2018

About the Execution of M4M.struct for DNAwalker-PT-16redondantChoiceR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7546.450 1095783.00 2152804.00 2851.50 TTT?TFF?T?FTFFTT normal

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 372K
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K 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 5.6K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K 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 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.6K 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 122 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 360 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 211K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is DNAwalker-PT-16redondantChoiceR, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-152649744200332
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526769425804


BK_STOP 1526770521587

--------------------
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 DNAwalker-PT-16redondantChoiceR as instance name.
Using DNAwalker 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': False, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': None, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': True, 'Reversible': False, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 722, 'Memory': 111.47, 'Tool': 'lola'}, {'Time': 828, 'Memory': 111.84, 'Tool': 'lola'}, {'Time': 947309, 'Memory': 15934.26, 'Tool': 'itstools'}, {'Time': 1082163, 'Memory': 15944.11, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola DNAwalker-PT-16redondantChoiceR...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
DNAwalker-PT-16redondantChoiceR: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
DNAwalker-PT-16redondantChoiceR: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ DNAwalker-PT-16redondantChoiceR @ 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: 533/65536 symbol table entries, 8 collisions
lola: preprocessing...
lola: finding significant places
lola: 43 places, 490 transitions, 43 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 284 transition conflict sets
lola: TASK
lola: reading formula from DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: E (G ((B30 <= A19))) : E ((((A9 <= 2) OR (B16 <= 0)) U A (G ((A8 <= A33))))) : (((A2 + 1 <= B14) AND (A17 + 1 <= B16) AND (B5 <= 0) AND (A31 <= 1) AND (A2 <= 0)) OR E (G ((A16 <= A26)))) : (NOT(NOT(A (F ((3 <= B6))))) OR E (F ((3 <= A1)))) : E (F ((A23 <= 0))) : A (F (E (G (((A20 <= A7) AND (3 <= B28)))))) : A (G (E (F ((2 <= A21))))) : E (((A30 <= A24) U ((2 <= A24) AND (2 <= B6) AND ((A5 <= B13) OR (3 <= A25))))) : A (X (NOT(A (G ((1 <= A25)))))) : E (((A32 <= A7) U ((3 <= A30) AND ((3 <= A18) OR (2 <= B28))))) : A (F ((1 <= A31))) : E ((((A24 <= 0) OR (A5 <= 2)) U A (X ((2 <= B28))))) : E (X (((2 <= A10) OR A (F ((2 <= A29)))))) : A (F (A (G (((2 <= A9)))))) : E (G (NOT(A (F ((3 <= A15)))))) : E ((((A12 <= B30) AND (A23 <= A24) AND (A30 + 1 <= A29)) U E (G ((A29 <= A28)))))
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 ((B30 <= A19)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A19 + 1 <= B30)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((A9 <= 2) OR (B16 <= 0)) U A (G ((A8 <= A33)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((A9 <= 2) OR (B16 <= 0)) U NOT(E(TRUE U (A33 + 1 <= A8))))
lola: processed formula length: 62
lola: 3 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 20 markings, 50 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((A2 + 1 <= B14) AND (A17 + 1 <= B16) AND (B5 <= 0) AND (A31 <= 1) AND (A2 <= 0)) OR E (G ((A16 <= A26))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A2 + 1 <= B14) AND (A17 + 1 <= B16) AND (B5 <= 0) AND (A31 <= 1) AND (A2 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((A2 + 1 <= B14) AND (A17 + 1 <= B16) AND (B5 <= 0) AND (A31 <= 1) AND (A2 <= 0))
lola: processed formula length: 81
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A16 <= A26)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (A26 + 1 <= A16)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 15 markings, 15 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(NOT(A (F ((3 <= B6))))) OR E (F ((3 <= A1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= B6)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= B6)))
lola: processed formula: A (F ((3 <= B6)))
lola: processed formula length: 17
lola: 6 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= A1)))
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 172 bytes per marking, with 0 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 DNAwalker-PT-16redondantChoiceR-CTLCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DNAwalker-PT-16redondantChoiceR-CTLCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 208943 markings, 908532 edges, 41789 markings/sec, 0 secs
lola: sara is running 5 secs || 433700 markings, 1936715 edges, 44951 markings/sec, 5 secs
lola: sara is running 10 secs || 652751 markings, 2967426 edges, 43810 markings/sec, 10 secs
lola: sara is running 15 secs || 871487 markings, 4068464 edges, 43747 markings/sec, 15 secs
lola: sara is running 20 secs || 1075656 markings, 5274616 edges, 40834 markings/sec, 20 secs
lola: sara is running 25 secs || 1280058 markings, 6457958 edges, 40880 markings/sec, 25 secs
lola: sara is running 30 secs || 1475046 markings, 7727071 edges, 38998 markings/sec, 30 secs
lola: sara is running 35 secs || 1674719 markings, 8933436 edges, 39935 markings/sec, 35 secs
lola: sara is running 40 secs || 1890157 markings, 10016028 edges, 43088 markings/sec, 40 secs
lola: sara is running 45 secs || 2105836 markings, 11054331 edges, 43136 markings/sec, 45 secs
lola: sara is running 50 secs || 2308887 markings, 12249532 edges, 40610 markings/sec, 50 secs
lola: sara is running 55 secs || 2505211 markings, 13470745 edges, 39265 markings/sec, 55 secs
lola: sara is running 60 secs || 2709994 markings, 14626167 edges, 40957 markings/sec, 60 secs
lola: sara is running 65 secs || 2919075 markings, 15739817 edges, 41816 markings/sec, 65 secs
lola: sara is running 70 secs || 3109896 markings, 16990466 edges, 38164 markings/sec, 70 secs
lola: sara is running 75 secs || 3305442 markings, 18076110 edges, 39109 markings/sec, 75 secs
lola: sara is running 80 secs || 3493857 markings, 19245716 edges, 37683 markings/sec, 80 secs
lola: sara is running 85 secs || 3692431 markings, 20401277 edges, 39715 markings/sec, 85 secs
lola: sara is running 90 secs || 3883870 markings, 21424566 edges, 38288 markings/sec, 90 secs
lola: sara is running 95 secs || 4065183 markings, 22524319 edges, 36263 markings/sec, 95 secs
lola: sara is running 100 secs || 4236476 markings, 23702009 edges, 34259 markings/sec, 100 secs
lola: sara is running 105 secs || 4402184 markings, 24935318 edges, 33142 markings/sec, 105 secs
lola: sara is running 110 secs || 4586904 markings, 26021621 edges, 36944 markings/sec, 110 secs
lola: sara is running 115 secs || 4756082 markings, 27244194 edges, 33836 markings/sec, 115 secs
lola: sara is running 120 secs || 4930981 markings, 28434433 edges, 34980 markings/sec, 120 secs
lola: sara is running 125 secs || 5099624 markings, 29675849 edges, 33729 markings/sec, 125 secs
lola: sara is running 130 secs || 5265596 markings, 30920657 edges, 33194 markings/sec, 130 secs
lola: sara is running 135 secs || 5432946 markings, 32157082 edges, 33470 markings/sec, 135 secs
lola: sara is running 140 secs || 5639295 markings, 33336800 edges, 41270 markings/sec, 140 secs
lola: sara is running 145 secs || 5838227 markings, 34544020 edges, 39786 markings/sec, 145 secs
lola: sara is running 150 secs || 6032119 markings, 35813449 edges, 38778 markings/sec, 150 secs
lola: sara is running 155 secs || 6211158 markings, 37144365 edges, 35808 markings/sec, 155 secs
lola: sara is running 160 secs || 6387821 markings, 38516130 edges, 35333 markings/sec, 160 secs
lola: sara is running 165 secs || 6556221 markings, 39898185 edges, 33680 markings/sec, 165 secs
lola: sara is running 170 secs || 6750096 markings, 41146123 edges, 38775 markings/sec, 170 secs
lola: sara is running 175 secs || 6936049 markings, 42418339 edges, 37191 markings/sec, 175 secs
lola: sara is running 180 secs || 7100746 markings, 43739745 edges, 32939 markings/sec, 180 secs
lola: sara is running 185 secs || 7274255 markings, 45022479 edges, 34702 markings/sec, 185 secs
lola: sara is running 190 secs || 7440046 markings, 46319050 edges, 33158 markings/sec, 190 secs
lola: sara is running 195 secs || 7611083 markings, 47621995 edges, 34207 markings/sec, 195 secs
lola: sara is running 200 secs || 7770160 markings, 48958618 edges, 31815 markings/sec, 200 secs
lola: sara is running 205 secs || 7954864 markings, 50205097 edges, 36941 markings/sec, 205 secs
lola: sara is running 210 secs || 8141565 markings, 51439476 edges, 37340 markings/sec, 210 secs
lola: sara is running 215 secs || 8329425 markings, 52713430 edges, 37572 markings/sec, 215 secs
lola: sara is running 220 secs || 8513269 markings, 54004849 edges, 36769 markings/sec, 220 secs
lola: sara is running 225 secs || 8700560 markings, 55322793 edges, 37458 markings/sec, 225 secs
lola: sara is running 230 secs || 8885187 markings, 56640976 edges, 36925 markings/sec, 230 secs
lola: sara is running 235 secs || 9073531 markings, 57937297 edges, 37669 markings/sec, 235 secs
lola: sara is running 240 secs || 9260445 markings, 59282752 edges, 37383 markings/sec, 240 secs
lola: sara is running 245 secs || 9442130 markings, 60602721 edges, 36337 markings/sec, 245 secs
lola: sara is running 250 secs || 9625206 markings, 61956312 edges, 36615 markings/sec, 250 secs
lola: sara is running 255 secs || 9802338 markings, 63309385 edges, 35426 markings/sec, 255 secs
lola: sara is running 260 secs || 9987355 markings, 64584848 edges, 37003 markings/sec, 260 secs
lola: sara is running 265 secs || 10181472 markings, 65869516 edges, 38823 markings/sec, 265 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 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A23 <= 0)))
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 172 bytes per marking, with 0 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 DNAwalker-PT-16redondantChoiceR-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: calling and running sara
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((A20 <= A7) AND (3 <= B28))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
sara: try reading problem file DNAwalker-PT-16redondantChoiceR-CTLCardinality-4.sara.
lola: processed formula: A(TRUE U NOT(A(TRUE U ((A7 + 1 <= A20) OR (B28 <= 2)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 15 markings, 30 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= A21)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (2 <= A21)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 47 markings, 85 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A30 <= A24) U ((2 <= A24) AND (2 <= B6) AND ((A5 <= B13) OR (3 <= A25)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A30 <= A24) U ((2 <= A24) AND (2 <= B6) AND ((A5 <= B13) OR (3 <= A25))))
lola: processed formula length: 77
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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).
sara: place or transition ordering is non-deterministic
lola: 1094138 markings, 2484288 edges, 218828 markings/sec, 0 secs
lola: 2021749 markings, 5091127 edges, 185522 markings/sec, 5 secs
lola: 2957122 markings, 7617612 edges, 187075 markings/sec, 10 secs
lola: 3924785 markings, 10070665 edges, 193533 markings/sec, 15 secs
lola: 4887049 markings, 12507789 edges, 192453 markings/sec, 20 secs
lola: 5797078 markings, 15122206 edges, 182006 markings/sec, 25 secs
lola: 6712829 markings, 17714287 edges, 183150 markings/sec, 30 secs
lola: 7653448 markings, 20235285 edges, 188124 markings/sec, 35 secs
lola: 8562573 markings, 22799225 edges, 181825 markings/sec, 40 secs
lola: 9519610 markings, 25314285 edges, 191407 markings/sec, 45 secs
lola: 10423424 markings, 27794155 edges, 180763 markings/sec, 50 secs
lola: 11222586 markings, 30470078 edges, 159832 markings/sec, 55 secs
lola: 11987640 markings, 33192615 edges, 153011 markings/sec, 60 secs
lola: 12953894 markings, 35635166 edges, 193251 markings/sec, 65 secs
lola: 13858771 markings, 38032436 edges, 180975 markings/sec, 70 secs
lola: 14679641 markings, 40491292 edges, 164174 markings/sec, 75 secs
lola: 15458984 markings, 42951056 edges, 155869 markings/sec, 80 secs
lola: 16201290 markings, 45578766 edges, 148461 markings/sec, 85 secs
lola: 16962248 markings, 48135703 edges, 152192 markings/sec, 90 secs
lola: 17772721 markings, 50651450 edges, 162095 markings/sec, 95 secs
lola: 18575203 markings, 53109070 edges, 160496 markings/sec, 100 secs
lola: 19368242 markings, 55545089 edges, 158608 markings/sec, 105 secs
lola: 20138280 markings, 57836917 edges, 154008 markings/sec, 110 secs
lola: 20898548 markings, 60438003 edges, 152054 markings/sec, 115 secs
lola: 21657907 markings, 62939029 edges, 151872 markings/sec, 120 secs
lola: 22439979 markings, 65371078 edges, 156414 markings/sec, 125 secs
lola: 23173329 markings, 67842542 edges, 146670 markings/sec, 130 secs
lola: 23912353 markings, 70286400 edges, 147805 markings/sec, 135 secs
lola: 24622466 markings, 72810882 edges, 142023 markings/sec, 140 secs
lola: 25458742 markings, 75234835 edges, 167255 markings/sec, 145 secs
lola: 26386522 markings, 77477849 edges, 185556 markings/sec, 150 secs
lola: 27308223 markings, 79555285 edges, 184340 markings/sec, 155 secs
lola: 28183870 markings, 81655849 edges, 175129 markings/sec, 160 secs
lola: 28874911 markings, 84389054 edges, 138208 markings/sec, 165 secs
lola: 29649661 markings, 86848074 edges, 154950 markings/sec, 170 secs
lola: 30431859 markings, 89218354 edges, 156440 markings/sec, 175 secs
lola: 31210295 markings, 91552658 edges, 155687 markings/sec, 180 secs
lola: 31958903 markings, 93817575 edges, 149722 markings/sec, 185 secs
lola: 32732762 markings, 96041970 edges, 154772 markings/sec, 190 secs
lola: 33503659 markings, 98236279 edges, 154179 markings/sec, 195 secs
lola: 34245306 markings, 100443982 edges, 148329 markings/sec, 200 secs
lola: 34990544 markings, 102644795 edges, 149048 markings/sec, 205 secs
lola: 35688195 markings, 104934694 edges, 139530 markings/sec, 210 secs
lola: 36296109 markings, 107716470 edges, 121583 markings/sec, 215 secs
lola: 36941641 markings, 110378808 edges, 129106 markings/sec, 220 secs
lola: 37767314 markings, 112923440 edges, 165135 markings/sec, 225 secs
lola: 38584813 markings, 115314389 edges, 163500 markings/sec, 230 secs
lola: 39421516 markings, 117531234 edges, 167341 markings/sec, 235 secs
lola: 40218499 markings, 119783056 edges, 159397 markings/sec, 240 secs
lola: 40866747 markings, 122504767 edges, 129650 markings/sec, 245 secs
lola: 41500758 markings, 125182503 edges, 126802 markings/sec, 250 secs
lola: 42141476 markings, 127533141 edges, 128144 markings/sec, 255 secs
lola: 42842137 markings, 129859795 edges, 140132 markings/sec, 260 secs
lola: 43613714 markings, 132242078 edges, 154315 markings/sec, 265 secs
lola: 44369510 markings, 134586030 edges, 151159 markings/sec, 270 secs
lola: 45080226 markings, 136878766 edges, 142143 markings/sec, 275 secs
lola: 45828649 markings, 139266308 edges, 149685 markings/sec, 280 secs
lola: 46554414 markings, 141589767 edges, 145153 markings/sec, 285 secs
lola: 47272128 markings, 143915956 edges, 143543 markings/sec, 290 secs
lola: 47937957 markings, 146214243 edges, 133166 markings/sec, 295 secs
lola: 48679931 markings, 148574795 edges, 148395 markings/sec, 300 secs
lola: 49410155 markings, 150906911 edges, 146045 markings/sec, 305 secs
lola: 50107405 markings, 153200489 edges, 139450 markings/sec, 310 secs
lola: 50809663 markings, 155529437 edges, 140452 markings/sec, 315 secs
lola: 51515152 markings, 157851014 edges, 141098 markings/sec, 320 secs
lola: 52221757 markings, 160157918 edges, 141321 markings/sec, 325 secs
lola: 53026680 markings, 162536557 edges, 160985 markings/sec, 330 secs
lola: 53926191 markings, 164796541 edges, 179902 markings/sec, 335 secs
lola: 54806697 markings, 166974087 edges, 176101 markings/sec, 340 secs
lola: 55709600 markings, 169146462 edges, 180581 markings/sec, 345 secs
lola: 56526914 markings, 171443171 edges, 163463 markings/sec, 350 secs
lola: 57303888 markings, 173845645 edges, 155395 markings/sec, 355 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(A (G ((1 <= A25))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (A25 <= 0)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 348 markings, 390 edges
lola: ========================================
lola: subprocess 9 will run for 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((A32 <= A7) U ((3 <= A30) AND ((3 <= A18) OR (2 <= B28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((A32 <= A7) U ((3 <= A30) AND ((3 <= A18) OR (2 <= B28))))
lola: processed formula length: 61
lola: 1 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 1049903 markings, 2456155 edges, 3689339798746562560 markings/sec, 0 secs
lola: 1940064 markings, 4969008 edges, 178032 markings/sec, 5 secs
lola: 2827008 markings, 7469696 edges, 177389 markings/sec, 10 secs
lola: 3649324 markings, 10103600 edges, 164463 markings/sec, 15 secs
lola: 4397655 markings, 12901059 edges, 149666 markings/sec, 20 secs
lola: 5157446 markings, 15655738 edges, 151958 markings/sec, 25 secs
lola: 5980982 markings, 18461017 edges, 164707 markings/sec, 30 secs
lola: 6703924 markings, 21348114 edges, 144588 markings/sec, 35 secs
lola: 7503764 markings, 24118477 edges, 159968 markings/sec, 40 secs
lola: 8244025 markings, 26899948 edges, 148052 markings/sec, 45 secs
lola: 8939735 markings, 29548922 edges, 139142 markings/sec, 50 secs
lola: 9690199 markings, 32261284 edges, 150093 markings/sec, 55 secs
lola: 10404425 markings, 35018941 edges, 142845 markings/sec, 60 secs
lola: 11211352 markings, 37708750 edges, 161385 markings/sec, 65 secs
lola: 12074736 markings, 40346388 edges, 172677 markings/sec, 70 secs
lola: 12929305 markings, 42939039 edges, 170914 markings/sec, 75 secs
lola: 13718573 markings, 45579833 edges, 157854 markings/sec, 80 secs
lola: 14487811 markings, 48218606 edges, 153848 markings/sec, 85 secs
lola: 15388422 markings, 50708337 edges, 180122 markings/sec, 90 secs
lola: 16145171 markings, 53310825 edges, 151350 markings/sec, 95 secs
lola: 16855284 markings, 56022948 edges, 142023 markings/sec, 100 secs
lola: 17637596 markings, 58656471 edges, 156462 markings/sec, 105 secs
lola: 18483367 markings, 61067171 edges, 169154 markings/sec, 110 secs
lola: 19355163 markings, 63479577 edges, 174359 markings/sec, 115 secs
lola: 20304497 markings, 65795732 edges, 189867 markings/sec, 120 secs
lola: 21144578 markings, 68247818 edges, 168016 markings/sec, 125 secs
lola: 22014612 markings, 70680163 edges, 174007 markings/sec, 130 secs
lola: 22811611 markings, 73063793 edges, 159400 markings/sec, 135 secs
lola: 23594180 markings, 75308762 edges, 156514 markings/sec, 140 secs
lola: 24278368 markings, 77705721 edges, 136838 markings/sec, 145 secs
lola: 25026086 markings, 80237401 edges, 149544 markings/sec, 150 secs
lola: 25762045 markings, 82803028 edges, 147192 markings/sec, 155 secs
lola: 26484520 markings, 85321482 edges, 144495 markings/sec, 160 secs
lola: 27193915 markings, 87892523 edges, 141879 markings/sec, 165 secs
lola: 27937417 markings, 90296328 edges, 148700 markings/sec, 170 secs
lola: 28712198 markings, 92314628 edges, 154956 markings/sec, 175 secs
lola: 29405596 markings, 94718911 edges, 138680 markings/sec, 180 secs
lola: 30154920 markings, 96901720 edges, 149865 markings/sec, 185 secs
lola: 30898130 markings, 99149956 edges, 148642 markings/sec, 190 secs
lola: 31573149 markings, 101583776 edges, 135004 markings/sec, 195 secs
lola: 32283703 markings, 103788272 edges, 142111 markings/sec, 200 secs
lola: 32884141 markings, 106364598 edges, 120088 markings/sec, 205 secs
lola: 33536391 markings, 109019231 edges, 130450 markings/sec, 210 secs
lola: 34176717 markings, 111635275 edges, 128065 markings/sec, 215 secs
lola: 34817397 markings, 114213443 edges, 128136 markings/sec, 220 secs
lola: 35442650 markings, 116722685 edges, 125051 markings/sec, 225 secs
lola: 36124127 markings, 119026323 edges, 136295 markings/sec, 230 secs
lola: 36826332 markings, 121413788 edges, 140441 markings/sec, 235 secs
lola: 37500009 markings, 123708172 edges, 134735 markings/sec, 240 secs
lola: 38186659 markings, 126086751 edges, 137330 markings/sec, 245 secs
lola: 38853242 markings, 128563971 edges, 133317 markings/sec, 250 secs
lola: 39680455 markings, 130779212 edges, 165443 markings/sec, 255 secs
lola: 40417488 markings, 132933243 edges, 147407 markings/sec, 260 secs
lola: 41180167 markings, 134876133 edges, 152536 markings/sec, 265 secs
lola: 41890976 markings, 137027259 edges, 142162 markings/sec, 270 secs
lola: 42554457 markings, 139329625 edges, 132696 markings/sec, 275 secs
lola: 43133960 markings, 141392508 edges, 115901 markings/sec, 280 secs
lola: 43695072 markings, 143445981 edges, 112222 markings/sec, 285 secs
lola: 44215361 markings, 145448987 edges, 104058 markings/sec, 290 secs
lola: 44849480 markings, 147371803 edges, 126824 markings/sec, 295 secs
lola: 45464539 markings, 149272662 edges, 123012 markings/sec, 300 secs
lola: 46072148 markings, 151150093 edges, 121522 markings/sec, 305 secs
lola: 46670160 markings, 153039756 edges, 119602 markings/sec, 310 secs
lola: 47259192 markings, 155140102 edges, 117806 markings/sec, 315 secs
lola: 47813943 markings, 157290487 edges, 110950 markings/sec, 320 secs
lola: 48444714 markings, 159365704 edges, 126154 markings/sec, 325 secs
lola: 49019463 markings, 161660522 edges, 114950 markings/sec, 330 secs
lola: 49596184 markings, 163716705 edges, 115344 markings/sec, 335 secs
lola: 50190551 markings, 165589804 edges, 118873 markings/sec, 340 secs
lola: 50768608 markings, 167458789 edges, 115611 markings/sec, 345 secs
lola: 51320326 markings, 169723967 edges, 110344 markings/sec, 350 secs
lola: 51838953 markings, 172021416 edges, 103725 markings/sec, 355 secs
lola: 52385317 markings, 174181191 edges, 109273 markings/sec, 360 secs
lola: 52870419 markings, 176385885 edges, 97020 markings/sec, 365 secs
lola: 53395293 markings, 178320646 edges, 104975 markings/sec, 370 secs
lola: 53973298 markings, 180468787 edges, 115601 markings/sec, 375 secs
lola: 54514073 markings, 182514569 edges, 108155 markings/sec, 380 secs
lola: 55067797 markings, 184621365 edges, 110745 markings/sec, 385 secs
lola: 55595926 markings, 186681709 edges, 105626 markings/sec, 390 secs
lola: 56133837 markings, 188712021 edges, 107582 markings/sec, 395 secs
lola: 56672997 markings, 190802340 edges, 107832 markings/sec, 400 secs
lola: 57195353 markings, 192864659 edges, 104471 markings/sec, 405 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= A31)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= A31)))
lola: processed formula: A (F ((1 <= A31)))
lola: processed formula length: 18
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 31 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: 15 markings, 15 edges
lola: ========================================
lola: subprocess 11 will run for 498 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((A24 <= 0) OR (A5 <= 2)) U A (X ((2 <= B28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((A24 <= 0) OR (A5 <= 2)) U AX((2 <= B28)))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 36 markings, 42 edges
lola: ========================================
lola: subprocess 12 will run for 622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((2 <= A10) OR A (F ((2 <= A29))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((2 <= A10)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((2 <= A10))
lola: processed formula length: 14
lola: 2 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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 13 will run for 830 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F ((2 <= A29)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U (2 <= A29)))
lola: processed formula length: 24
lola: 3 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 290 markings, 313 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 830 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((2 <= A9))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((2 <= A9))))))
lola: processed formula: A (F (A (G (((2 <= A9))))))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 30 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: 17 markings, 18 edges
lola: ========================================
lola: subprocess 14 will run for 1245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(A (F ((3 <= A15))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U (3 <= A15))))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 15 markings, 45 edges
lola: ========================================
lola: subprocess 15 will run for 2490 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((A12 <= B30) AND (A23 <= A24) AND (A30 + 1 <= A29)) U E (G ((A29 <= A28)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((A12 <= B30) AND (A23 <= A24) AND (A30 + 1 <= A29)) U NOT(A(TRUE U (A28 + 1 <= A29))))
lola: processed formula length: 89
lola: 3 rewrites
lola: formula mentions 0 of 43 places; total mentions: 0
lola: closed formula file DNAwalker-PT-16redondantChoiceR-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 172 bytes per marking, with 0 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: 34 markings, 35 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes unknown yes no no unknown yes unknown no yes no no yes yes
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DNAwalker-PT-16redondantChoiceR-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-16redondantChoiceR"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-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/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is DNAwalker-PT-16redondantChoiceR, 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 r071-smll-152649744200332"
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 ;