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 1.4M
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.3K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 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 16K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 1.2M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-18b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-blw7-152650007100206
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527603044961


BK_STOP 1527604123113

--------------------
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 FlexibleBarrier-PT-18b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3539199, 'Memory': 4504.23, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola FlexibleBarrier-PT-18b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-18b: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ FlexibleBarrier-PT-18b @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 9407/65536 symbol table entries, 2286 collisions
lola: preprocessing...
lola: finding significant places
lola: 4370 places, 5037 transitions, 4350 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 5075 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-18b-CTLCardinality.task
lola: NOT((E (G (((1 <= p117) OR (p2033 <= p2490)))) AND ((p2160 + 1 <= p3872) OR (p4220 + 1 <= p3376) OR (p3142 <= p4133)))) : NOT(A (X (E (F ((3 <= p1953)))))) : NOT(E (F ((((p724 <= p1678) OR (p2228 <= p3491)) AND ((3 <= p1660) OR (3 <= p4275)))))) : E ((((p4307 <= p3676) AND (3 <= p3709) AND (1 <= p801) AND (p1275 <= p209)) U E (F ((3 <= p3236))))) : A (F (((1 <= p86) AND (p4049 <= p4074)))) : A (F (A (X (((p2715 <= p1799) AND (3 <= p4288)))))) : NOT(E (G ((p1321 <= 2)))) : NOT(((((p3767 <= p3711) OR (p1708 <= p1152) OR (p3163 <= 1)) AND (1 <= p3104)) OR NOT(E (F ((3 <= p778)))))) : A (G ((p458 <= 0))) : ((((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159))) AND ((E (F ((3 <= p365))) AND E (G ((p20 <= p388)))) AND (p870 <= p1926))) : A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629))))) : E (G (NOT(E (G ((2 <= p4334)))))) : E (G ((p4016 <= 0))) : NOT(A (F (A (X ((3 <= p3862)))))) : A (G ((p361 <= p4151))) : ((3 <= p668) OR E (G ((p1411 <= p3689))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G (((1 <= p117) OR (p2033 <= p2490)))) AND ((p2160 + 1 <= p3872) OR (p4220 + 1 <= p3376) OR (p3142 <= p4133))))
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 (((p117 <= 0) AND (p2490 + 1 <= p2033))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p117 <= 0) AND (p2490 + 1 <= p2033))))
lola: processed formula: A (F (((p117 <= 0) AND (p2490 + 1 <= p2033))))
lola: processed formula length: 46
lola: 5 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 1 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 118 markings, 118 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p3872 <= p2160) AND (p3376 <= p4220) AND (p4133 + 1 <= p3142))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3872 <= p2160) AND (p3376 <= p4220) AND (p4133 + 1 <= p3142))
lola: processed formula length: 64
lola: 5 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 3 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (X (E (F ((3 <= p1953))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (3 <= p1953))))
lola: processed formula length: 31
lola: 8 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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: 158548 markings, 488199 edges, 3096157398730014720 markings/sec, 0 secs
lola: 329435 markings, 1001371 edges, 34177 markings/sec, 5 secs
lola: 508311 markings, 1490706 edges, 35775 markings/sec, 10 secs
lola: 649919 markings, 1969099 edges, 28322 markings/sec, 15 secs
lola: 751252 markings, 2483148 edges, 20267 markings/sec, 20 secs
lola: 849421 markings, 2965810 edges, 19634 markings/sec, 25 secs
lola: 1000735 markings, 3443160 edges, 30263 markings/sec, 30 secs
lola: 1153581 markings, 3908240 edges, 30569 markings/sec, 35 secs
lola: 1286014 markings, 4357183 edges, 26487 markings/sec, 40 secs
lola: 1396623 markings, 4878620 edges, 22122 markings/sec, 45 secs
lola: 1473881 markings, 5371982 edges, 15452 markings/sec, 50 secs
lola: 1555607 markings, 5827751 edges, 16345 markings/sec, 55 secs
lola: 1674209 markings, 6284846 edges, 23720 markings/sec, 60 secs
lola: 1792268 markings, 6727074 edges, 23612 markings/sec, 65 secs
lola: 1895837 markings, 7163836 edges, 20714 markings/sec, 70 secs
lola: 1986670 markings, 7662892 edges, 18167 markings/sec, 75 secs
lola: 2045268 markings, 8096723 edges, 11720 markings/sec, 80 secs
lola: 2169695 markings, 8544764 edges, 24885 markings/sec, 85 secs
lola: 2341079 markings, 9018510 edges, 34277 markings/sec, 90 secs
lola: 2479317 markings, 9485539 edges, 27648 markings/sec, 95 secs
lola: 2578241 markings, 9990179 edges, 19785 markings/sec, 100 secs
lola: 2666887 markings, 10424515 edges, 17729 markings/sec, 105 secs
lola: 2837768 markings, 10906329 edges, 34176 markings/sec, 110 secs
lola: 2988687 markings, 11330612 edges, 30184 markings/sec, 115 secs
lola: 3100423 markings, 11819711 edges, 22347 markings/sec, 120 secs
lola: 3165195 markings, 12277902 edges, 12954 markings/sec, 125 secs
lola: 3296710 markings, 12694742 edges, 26303 markings/sec, 130 secs
lola: 3446323 markings, 13107816 edges, 29923 markings/sec, 135 secs
lola: 3572510 markings, 13498241 edges, 25237 markings/sec, 140 secs
lola: 3671605 markings, 13954819 edges, 19819 markings/sec, 145 secs
lola: 3725511 markings, 14364187 edges, 10781 markings/sec, 150 secs
lola: 3865575 markings, 14785818 edges, 28013 markings/sec, 155 secs
lola: 4018824 markings, 15206965 edges, 30650 markings/sec, 160 secs
lola: 4146592 markings, 15626369 edges, 25554 markings/sec, 165 secs
lola: 4245964 markings, 16110065 edges, 19874 markings/sec, 170 secs
lola: 4321759 markings, 16545953 edges, 15159 markings/sec, 175 secs
lola: 4469948 markings, 16975522 edges, 29638 markings/sec, 180 secs
lola: 4615275 markings, 17375985 edges, 29065 markings/sec, 185 secs
lola: 4733326 markings, 17811364 edges, 23610 markings/sec, 190 secs
lola: 4823982 markings, 18287653 edges, 18131 markings/sec, 195 secs
lola: 4907020 markings, 18689439 edges, 16608 markings/sec, 200 secs
lola: 5062190 markings, 19128449 edges, 31034 markings/sec, 205 secs
lola: 5204129 markings, 19517490 edges, 28388 markings/sec, 210 secs
lola: 5314502 markings, 19970366 edges, 22075 markings/sec, 215 secs
lola: 5398047 markings, 20428045 edges, 16709 markings/sec, 220 secs
lola: 5492666 markings, 20835074 edges, 18924 markings/sec, 225 secs
lola: 5647419 markings, 21263675 edges, 30951 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((p724 <= p1678) OR (p2228 <= p3491)) AND ((3 <= p1660) OR (3 <= p4275))))))
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 544 bytes per marking, with 2 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 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-2.sara.
lola: sara is running 0 secs || 53198 markings, 95266 edges, 10640 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 106045 markings, 192047 edges, 10569 markings/sec, 5 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((p4307 <= p3676) AND (3 <= p3709) AND (1 <= p801) AND (p1275 <= p209)) U E (F ((3 <= p3236)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((p4307 <= p3676) AND (3 <= p3709) AND (1 <= p801) AND (p1275 <= p209)) U E(TRUE U (3 <= p3236)))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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: 218363 markings, 460189 edges, 43660 markings/sec, 0 secs
lola: 387832 markings, 905577 edges, 33894 markings/sec, 5 secs
lola: 571096 markings, 1352099 edges, 36653 markings/sec, 10 secs
lola: 774765 markings, 1818632 edges, 40734 markings/sec, 15 secs
lola: 932946 markings, 2249099 edges, 31636 markings/sec, 20 secs
lola: 1138458 markings, 2710841 edges, 41102 markings/sec, 25 secs
lola: 1320974 markings, 3161530 edges, 36503 markings/sec, 30 secs
lola: 1488148 markings, 3606841 edges, 33435 markings/sec, 35 secs
lola: 1705022 markings, 4069372 edges, 43375 markings/sec, 40 secs
lola: 1871681 markings, 4515305 edges, 33332 markings/sec, 45 secs
lola: 2059125 markings, 4964580 edges, 37489 markings/sec, 50 secs
lola: 2258884 markings, 5427826 edges, 39952 markings/sec, 55 secs
lola: 2422728 markings, 5871924 edges, 32769 markings/sec, 60 secs
lola: 2629814 markings, 6335251 edges, 41417 markings/sec, 65 secs
lola: 2810587 markings, 6783468 edges, 36155 markings/sec, 70 secs
lola: 2979067 markings, 7227645 edges, 33696 markings/sec, 75 secs
lola: 3194704 markings, 7688967 edges, 43127 markings/sec, 80 secs
lola: 3359841 markings, 8134614 edges, 33027 markings/sec, 85 secs
lola: 3549922 markings, 8586900 edges, 38016 markings/sec, 90 secs
lola: 3747793 markings, 9047137 edges, 39574 markings/sec, 95 secs
lola: 3909581 markings, 9488912 edges, 32358 markings/sec, 100 secs
lola: 4118373 markings, 9950364 edges, 41758 markings/sec, 105 secs
lola: 4294867 markings, 10393823 edges, 35299 markings/sec, 110 secs
lola: 4467352 markings, 10838920 edges, 34497 markings/sec, 115 secs
lola: 4678065 markings, 11297363 edges, 42143 markings/sec, 120 secs
lola: 4840954 markings, 11736596 edges, 32578 markings/sec, 125 secs
lola: 5033879 markings, 12188250 edges, 38585 markings/sec, 130 secs
lola: 5222674 markings, 12638628 edges, 37759 markings/sec, 135 secs
lola: 5382288 markings, 13075108 edges, 31923 markings/sec, 140 secs
lola: 5595243 markings, 13530639 edges, 42591 markings/sec, 145 secs
lola: 5762216 markings, 13968848 edges, 33395 markings/sec, 150 secs
lola: 5942711 markings, 14406511 edges, 36099 markings/sec, 155 secs
lola: 6140151 markings, 14860441 edges, 39488 markings/sec, 160 secs
lola: 6298190 markings, 15293670 edges, 31608 markings/sec, 165 secs
lola: 6504181 markings, 15747679 edges, 41198 markings/sec, 170 secs
lola: 6676494 markings, 16184142 edges, 34463 markings/sec, 175 secs
lola: 6848778 markings, 16620012 edges, 34457 markings/sec, 180 secs
lola: 7050447 markings, 17067916 edges, 40334 markings/sec, 185 secs
lola: 7208232 markings, 17497257 edges, 31557 markings/sec, 190 secs
lola: 7406921 markings, 17946447 edges, 39738 markings/sec, 195 secs
lola: 7581287 markings, 18379996 edges, 34873 markings/sec, 200 secs
lola: 7749171 markings, 18812940 edges, 33577 markings/sec, 205 secs
lola: 7951806 markings, 19257259 edges, 40527 markings/sec, 210 secs
lola: 8108327 markings, 19683550 edges, 31304 markings/sec, 215 secs
lola: 8304427 markings, 20129307 edges, 39220 markings/sec, 220 secs
lola: 8478756 markings, 20560969 edges, 34866 markings/sec, 225 secs
lola: 8644963 markings, 20990801 edges, 33241 markings/sec, 230 secs
lola: 8846202 markings, 21430941 edges, 40248 markings/sec, 235 secs
lola: 9000615 markings, 21854159 edges, 30883 markings/sec, 240 secs
lola: 9196911 markings, 22296881 edges, 39259 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= p86) AND (p4049 <= p4074))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((1 <= p86) AND (p4049 <= p4074))))
lola: processed formula: A (F (((1 <= p86) AND (p4049 <= p4074))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 1 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: 128 markings, 128 edges
lola: ========================================
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (((p2715 <= p1799) AND (3 <= p4288))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(((p2715 <= p1799) AND (3 <= p4288))))
lola: processed formula length: 49
lola: 2 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((p1321 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= p1321)))
lola: processed formula: A (F ((3 <= p1321)))
lola: processed formula length: 20
lola: 3 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 1 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: 117 markings, 117 edges
lola: ========================================
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((((p3767 <= p3711) OR (p1708 <= p1152) OR (p3163 <= 1)) AND (1 <= p3104)) OR NOT(E (F ((3 <= p778))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 337 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((p3711 + 1 <= p3767) AND (p1152 + 1 <= p1708) AND (2 <= p3163)) OR (p3104 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((p3711 + 1 <= p3767) AND (p1152 + 1 <= p1708) AND (2 <= p3163)) OR (p3104 <= 0))
lola: processed formula length: 83
lola: 8 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-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 8 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p778)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 49949 markings, 97421 edges, 9990 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p458 <= 0)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-8.sara.
lola: sara is running 0 secs || 41417 markings, 107623 edges, 8283 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159))) AND ((E (F ((3 <= p365))) AND E (G ((p20 <= p388)))) AND (p870 <= p1926)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 431 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((2 <= p1209) OR (p1776 <= p1397)) AND (p3500 <= 1) AND ((3 <= p3407) OR (p280 <= p183) OR ((p3358 <= p2802) AND (3 <= p4070))) AND ((p2486 <= p825) OR (2 <= p4329) OR ((p687 <= p468) AND (3 <= p1866)) OR (3 <= p2159)))
lola: processed formula length: 226
lola: 1 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 12 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: subprocess 10 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p365)))
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 544 bytes per marking, with 2 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: ========================================
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-18b-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 41499 markings, 107598 edges, 8300 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629)))))
lola: processed formula: A ((((p2679 <= p3116) OR (p2900 <= p3882) OR ((2 <= p874) AND (3 <= p946))) U A (G ((p632 <= p1629)))))
lola: processed formula length: 105
lola: 0 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 548 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: 52926 markings, 110850 edges, 10585 markings/sec, 0 secs
lola: 108271 markings, 219469 edges, 11069 markings/sec, 5 secs
lola: 163598 markings, 324672 edges, 11065 markings/sec, 10 secs
lola: 218779 markings, 429917 edges, 11036 markings/sec, 15 secs
lola: 272990 markings, 533151 edges, 10842 markings/sec, 20 secs
lola: 326433 markings, 635141 edges, 10689 markings/sec, 25 secs
lola: 380088 markings, 737054 edges, 10731 markings/sec, 30 secs
lola: 432554 markings, 838204 edges, 10493 markings/sec, 35 secs
lola: 486691 markings, 940280 edges, 10827 markings/sec, 40 secs
lola: 540519 markings, 1044224 edges, 10766 markings/sec, 45 secs
lola: 594878 markings, 1149281 edges, 10872 markings/sec, 50 secs
lola: 646822 markings, 1246633 edges, 10389 markings/sec, 55 secs
lola: 681120 markings, 1337578 edges, 6860 markings/sec, 60 secs
lola: 719525 markings, 1421152 edges, 7681 markings/sec, 65 secs
lola: 762289 markings, 1511592 edges, 8553 markings/sec, 70 secs
lola: 796258 markings, 1588807 edges, 6794 markings/sec, 75 secs
lola: 827137 markings, 1661525 edges, 6176 markings/sec, 80 secs
lola: 867678 markings, 1748139 edges, 8108 markings/sec, 85 secs
lola: 904641 markings, 1832130 edges, 7393 markings/sec, 90 secs
lola: 959145 markings, 1943337 edges, 10901 markings/sec, 95 secs
lola: 1012170 markings, 2051945 edges, 10605 markings/sec, 100 secs
lola: 1064656 markings, 2160145 edges, 10497 markings/sec, 105 secs
lola: 1109202 markings, 2262532 edges, 8909 markings/sec, 110 secs
lola: 1159377 markings, 2365430 edges, 10035 markings/sec, 115 secs
lola: 1207101 markings, 2462834 edges, 9545 markings/sec, 120 secs
lola: 1252778 markings, 2556487 edges, 9135 markings/sec, 125 secs
lola: 1297886 markings, 2648634 edges, 9022 markings/sec, 130 secs
lola: 1351569 markings, 2758171 edges, 10737 markings/sec, 135 secs
lola: 1416034 markings, 2876841 edges, 12893 markings/sec, 140 secs
lola: 1462840 markings, 2973593 edges, 9361 markings/sec, 145 secs
lola: 1516931 markings, 3083638 edges, 10818 markings/sec, 150 secs
lola: 1572581 markings, 3197370 edges, 11130 markings/sec, 155 secs
lola: 1628325 markings, 3311404 edges, 11149 markings/sec, 160 secs
lola: 1685689 markings, 3428066 edges, 11473 markings/sec, 165 secs
lola: 1741980 markings, 3543260 edges, 11258 markings/sec, 170 secs
lola: 1797122 markings, 3655816 edges, 11028 markings/sec, 175 secs
lola: 1853059 markings, 3770153 edges, 11187 markings/sec, 180 secs
lola: 1892234 markings, 3881348 edges, 7835 markings/sec, 185 secs
lola: 1904513 markings, 3990364 edges, 2456 markings/sec, 190 secs
lola: 1916618 markings, 4099658 edges, 2421 markings/sec, 195 secs
lola: 1928961 markings, 4208589 edges, 2469 markings/sec, 200 secs
lola: 1941858 markings, 4316799 edges, 2579 markings/sec, 205 secs
lola: 1955249 markings, 4424247 edges, 2678 markings/sec, 210 secs
lola: 1980061 markings, 4546432 edges, 4962 markings/sec, 215 secs
lola: 2032366 markings, 4674144 edges, 10461 markings/sec, 220 secs
lola: 2052555 markings, 4798147 edges, 4038 markings/sec, 225 secs
lola: 2105916 markings, 4900912 edges, 10672 markings/sec, 230 secs
lola: 2159580 markings, 5004608 edges, 10733 markings/sec, 235 secs
lola: 2213543 markings, 5108995 edges, 10793 markings/sec, 240 secs
lola: 2259335 markings, 5210604 edges, 9158 markings/sec, 245 secs
lola: 2293400 markings, 5287678 edges, 6813 markings/sec, 250 secs
lola: 2324174 markings, 5359806 edges, 6155 markings/sec, 255 secs
lola: 2357363 markings, 5435610 edges, 6638 markings/sec, 260 secs
lola: 2402967 markings, 5527841 edges, 9121 markings/sec, 265 secs
lola: 2437483 markings, 5606528 edges, 6903 markings/sec, 270 secs
lola: 2467924 markings, 5678114 edges, 6088 markings/sec, 275 secs
lola: 2514196 markings, 5776799 edges, 9254 markings/sec, 280 secs
lola: 2567189 markings, 5885411 edges, 10599 markings/sec, 285 secs
lola: 2619129 markings, 5991330 edges, 10388 markings/sec, 290 secs
lola: 2668311 markings, 6094965 edges, 9836 markings/sec, 295 secs
lola: 2715405 markings, 6201190 edges, 9419 markings/sec, 300 secs
lola: 2763873 markings, 6300400 edges, 9694 markings/sec, 305 secs
lola: 2811049 markings, 6396456 edges, 9435 markings/sec, 310 secs
lola: 2856826 markings, 6489797 edges, 9155 markings/sec, 315 secs
lola: 2902752 markings, 6583716 edges, 9185 markings/sec, 320 secs
lola: 2961073 markings, 6700494 edges, 11664 markings/sec, 325 secs
lola: 3019793 markings, 6809641 edges, 11744 markings/sec, 330 secs
lola: 3067192 markings, 6907263 edges, 9480 markings/sec, 335 secs
lola: 3123268 markings, 7021802 edges, 11215 markings/sec, 340 secs
lola: 3178490 markings, 7134559 edges, 11044 markings/sec, 345 secs
lola: 3234316 markings, 7248692 edges, 11165 markings/sec, 350 secs
lola: 3290945 markings, 7364323 edges, 11326 markings/sec, 355 secs
lola: 3347283 markings, 7479046 edges, 11268 markings/sec, 360 secs
lola: 3402300 markings, 7591325 edges, 11003 markings/sec, 365 secs
lola: 3457996 markings, 7705164 edges, 11139 markings/sec, 370 secs
lola: 3480354 markings, 7813674 edges, 4472 markings/sec, 375 secs
lola: 3493813 markings, 7920969 edges, 2692 markings/sec, 380 secs
lola: 3505914 markings, 8028994 edges, 2420 markings/sec, 385 secs
lola: 3518014 markings, 8136827 edges, 2420 markings/sec, 390 secs
lola: 3530112 markings, 8244029 edges, 2420 markings/sec, 395 secs
lola: 3542211 markings, 8351499 edges, 2420 markings/sec, 400 secs
lola: 3584364 markings, 8480478 edges, 8431 markings/sec, 405 secs
lola: 3617328 markings, 8601016 edges, 6593 markings/sec, 410 secs
lola: 3651973 markings, 8720510 edges, 6929 markings/sec, 415 secs
lola: 3705290 markings, 8823394 edges, 10663 markings/sec, 420 secs
lola: 3759232 markings, 8927579 edges, 10788 markings/sec, 425 secs
lola: 3811395 markings, 9025894 edges, 10433 markings/sec, 430 secs
lola: 3848393 markings, 9119141 edges, 7400 markings/sec, 435 secs
lola: 3882551 markings, 9196468 edges, 6832 markings/sec, 440 secs
lola: 3923187 markings, 9282019 edges, 8127 markings/sec, 445 secs
lola: 3962819 markings, 9368246 edges, 7926 markings/sec, 450 secs
lola: 3993514 markings, 9440307 edges, 6139 markings/sec, 455 secs
lola: 4026982 markings, 9516684 edges, 6694 markings/sec, 460 secs
lola: 4062539 markings, 9596751 edges, 7111 markings/sec, 465 secs
lola: 4117350 markings, 9708596 edges, 10962 markings/sec, 470 secs
lola: 4170312 markings, 9817125 edges, 10592 markings/sec, 475 secs
lola: 4222718 markings, 9925154 edges, 10481 markings/sec, 480 secs
lola: 4268208 markings, 10029219 edges, 9098 markings/sec, 485 secs
lola: 4317899 markings, 10131495 edges, 9938 markings/sec, 490 secs
lola: 4365774 markings, 10229227 edges, 9575 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 502 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT(E (G ((2 <= p4334))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p4334 <= 1)))))
lola: processed formula length: 42
lola: 5 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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: 94 markings, 188 edges
lola: ========================================
lola: subprocess 12 will run for 628 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p4016 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= p4016)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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: 94 markings, 94 edges
lola: ========================================
lola: subprocess 13 will run for 838 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (A (X ((3 <= p3862))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((p3862 <= 2)))))
lola: processed formula length: 36
lola: 7 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 2 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: 20 markings, 20 edges
lola: ========================================
lola: subprocess 14 will run for 1257 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p361 <= p4151)))
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 544 bytes per marking, with 2 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 FlexibleBarrier-PT-18b-CTLCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-18b-CTLCardinality-14.sara.
lola: sara is running 0 secs || 48434 markings, 94306 edges, 9687 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p668) OR E (G ((p1411 <= p3689))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2506 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= p668)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p668)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 4370 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-18b-CTLCardinality.task
lola: processed formula with 1 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no unknown yes unknown no no no no no no unknown yes yes yes no unknown
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-18b-CTLCardinality-15 CANNOT_COMPUTE 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="FlexibleBarrier-PT-18b"
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/FlexibleBarrier-PT-18b.tgz
mv FlexibleBarrier-PT-18b 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 FlexibleBarrier-PT-18b, 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 r095-blw7-152650007100206"
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 ;