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-full
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 r094-blw7-152650006200206
=====================================================================

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


BK_STOP 1527512808488

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using 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 stderr -----
----- Start make prepare stdout -----
===========================================================================================
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 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: 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: 161917 markings, 499698 edges, 3096157398730014720 markings/sec, 0 secs
lola: 333865 markings, 1011645 edges, 34390 markings/sec, 5 secs
lola: 511669 markings, 1499643 edges, 35561 markings/sec, 10 secs
lola: 653397 markings, 1981979 edges, 28346 markings/sec, 15 secs
lola: 753293 markings, 2496401 edges, 19979 markings/sec, 20 secs
lola: 852077 markings, 2979231 edges, 19757 markings/sec, 25 secs
lola: 1006481 markings, 3459752 edges, 30881 markings/sec, 30 secs
lola: 1159296 markings, 3924078 edges, 30563 markings/sec, 35 secs
lola: 1290057 markings, 4375384 edges, 26152 markings/sec, 40 secs
lola: 1400456 markings, 4896499 edges, 22080 markings/sec, 45 secs
lola: 1476498 markings, 5388261 edges, 15208 markings/sec, 50 secs
lola: 1565718 markings, 5866320 edges, 17844 markings/sec, 55 secs
lola: 1695560 markings, 6363038 edges, 25968 markings/sec, 60 secs
lola: 1822308 markings, 6837337 edges, 25350 markings/sec, 65 secs
lola: 1927110 markings, 7332888 edges, 20960 markings/sec, 70 secs
lola: 2012070 markings, 7847020 edges, 16992 markings/sec, 75 secs
lola: 2092172 markings, 8310109 edges, 16020 markings/sec, 80 secs
lola: 2255565 markings, 8783870 edges, 32679 markings/sec, 85 secs
lola: 2416684 markings, 9226407 edges, 32224 markings/sec, 90 secs
lola: 2534248 markings, 9728164 edges, 23513 markings/sec, 95 secs
lola: 2605238 markings, 10218888 edges, 14198 markings/sec, 100 secs
lola: 2754795 markings, 10679510 edges, 29911 markings/sec, 105 secs
lola: 2922412 markings, 11138447 edges, 33523 markings/sec, 110 secs
lola: 3051514 markings, 11604289 edges, 25820 markings/sec, 115 secs
lola: 3148335 markings, 12103619 edges, 19364 markings/sec, 120 secs
lola: 3247184 markings, 12550628 edges, 19770 markings/sec, 125 secs
lola: 3417230 markings, 13027238 edges, 34009 markings/sec, 130 secs
lola: 3563149 markings, 13459822 edges, 29184 markings/sec, 135 secs
lola: 3671912 markings, 13956446 edges, 21753 markings/sec, 140 secs
lola: 3747817 markings, 14429421 edges, 15181 markings/sec, 145 secs
lola: 3901580 markings, 14886607 edges, 30753 markings/sec, 150 secs
lola: 4062283 markings, 15328602 edges, 32141 markings/sec, 155 secs
lola: 4185201 markings, 15796582 edges, 24584 markings/sec, 160 secs
lola: 4276201 markings, 16280884 edges, 18200 markings/sec, 165 secs
lola: 4377455 markings, 16724709 edges, 20251 markings/sec, 170 secs
lola: 4547237 markings, 17189725 edges, 33956 markings/sec, 175 secs
lola: 4689564 markings, 17620369 edges, 28465 markings/sec, 180 secs
lola: 4794918 markings, 18108539 edges, 21071 markings/sec, 185 secs
lola: 4869390 markings, 18571049 edges, 14894 markings/sec, 190 secs
lola: 5021626 markings, 19021195 edges, 30447 markings/sec, 195 secs
lola: 5180487 markings, 19452929 edges, 31772 markings/sec, 200 secs
lola: 5301361 markings, 19911439 edges, 24175 markings/sec, 205 secs
lola: 5392610 markings, 20390829 edges, 18250 markings/sec, 210 secs
lola: 5488360 markings, 20823470 edges, 19150 markings/sec, 215 secs
lola: 5655056 markings, 21284130 edges, 33339 markings/sec, 220 secs
lola: 5795501 markings, 21689007 edges, 28089 markings/sec, 225 secs
lola: 5900359 markings, 22152375 edges, 20972 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 || 50870 markings, 92665 edges, 10174 markings/sec, 0 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 5 secs || 102720 markings, 186386 edges, 10370 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: 222450 markings, 472088 edges, 44477 markings/sec, 0 secs
lola: 408211 markings, 949100 edges, 37152 markings/sec, 5 secs
lola: 591156 markings, 1423672 edges, 36589 markings/sec, 10 secs
lola: 811669 markings, 1899489 edges, 44103 markings/sec, 15 secs
lola: 986494 markings, 2361405 edges, 34965 markings/sec, 20 secs
lola: 1177447 markings, 2835798 edges, 38191 markings/sec, 25 secs
lola: 1386995 markings, 3301312 edges, 41910 markings/sec, 30 secs
lola: 1563927 markings, 3770866 edges, 35386 markings/sec, 35 secs
lola: 1762579 markings, 4245071 edges, 39730 markings/sec, 40 secs
lola: 1970523 markings, 4723408 edges, 41589 markings/sec, 45 secs
lola: 2143612 markings, 5184877 edges, 34618 markings/sec, 50 secs
lola: 2347723 markings, 5659710 edges, 40822 markings/sec, 55 secs
lola: 2549712 markings, 6136668 edges, 40398 markings/sec, 60 secs
lola: 2727170 markings, 6609680 edges, 35492 markings/sec, 65 secs
lola: 2936077 markings, 7084221 edges, 41781 markings/sec, 70 secs
lola: 3133168 markings, 7559885 edges, 39418 markings/sec, 75 secs
lola: 3310032 markings, 8030974 edges, 35373 markings/sec, 80 secs
lola: 3523341 markings, 8505392 edges, 42662 markings/sec, 85 secs
lola: 3715645 markings, 8980077 edges, 38461 markings/sec, 90 secs
lola: 3891284 markings, 9451286 edges, 35128 markings/sec, 95 secs
lola: 4109521 markings, 9923575 edges, 43647 markings/sec, 100 secs
lola: 4297567 markings, 10398825 edges, 37609 markings/sec, 105 secs
lola: 4474620 markings, 10869080 edges, 35411 markings/sec, 110 secs
lola: 4694909 markings, 11339584 edges, 44058 markings/sec, 115 secs
lola: 4877047 markings, 11813777 edges, 36428 markings/sec, 120 secs
lola: 5062589 markings, 12283143 edges, 37108 markings/sec, 125 secs
lola: 5276351 markings, 12751733 edges, 42752 markings/sec, 130 secs
lola: 5453634 markings, 13221261 edges, 35457 markings/sec, 135 secs
lola: 5646173 markings, 13687830 edges, 38508 markings/sec, 140 secs
lola: 5852035 markings, 14156661 edges, 41172 markings/sec, 145 secs
lola: 6026737 markings, 14622065 edges, 34940 markings/sec, 150 secs
lola: 6227059 markings, 15088303 edges, 40064 markings/sec, 155 secs
lola: 6423752 markings, 15554768 edges, 39339 markings/sec, 160 secs
lola: 6595934 markings, 16017877 edges, 34436 markings/sec, 165 secs
lola: 6805369 markings, 16481961 edges, 41887 markings/sec, 170 secs
lola: 6992967 markings, 16946900 edges, 37520 markings/sec, 175 secs
lola: 7163540 markings, 17408256 edges, 34115 markings/sec, 180 secs
lola: 7380905 markings, 17867762 edges, 43473 markings/sec, 185 secs
lola: 7558314 markings, 18332381 edges, 35482 markings/sec, 190 secs
lola: 7743081 markings, 18792059 edges, 36953 markings/sec, 195 secs
lola: 7948823 markings, 19251398 edges, 41148 markings/sec, 200 secs
lola: 8120414 markings, 19708932 edges, 34318 markings/sec, 205 secs
lola: 8316853 markings, 20167254 edges, 39288 markings/sec, 210 secs
lola: 8509690 markings, 20625399 edges, 38567 markings/sec, 215 secs
lola: 8678016 markings, 21080061 edges, 33665 markings/sec, 220 secs
lola: 8886763 markings, 21535637 edges, 41749 markings/sec, 225 secs
lola: 9066098 markings, 21991611 edges, 35867 markings/sec, 230 secs
lola: 9242746 markings, 22444668 edges, 35330 markings/sec, 235 secs
lola: 9449536 markings, 22896450 edges, 41358 markings/sec, 240 secs
lola: 9618776 markings, 23349743 edges, 33848 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 || 51173 markings, 99958 edges, 10235 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.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 45230 markings, 120061 edges, 9046 markings/sec, 0 secs
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 432 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 432 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: ========================================
lola: subprocess 10 will run for 504 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: 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 || 45765 markings, 121004 edges, 9153 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 503 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: 53354 markings, 112685 edges, 10671 markings/sec, 0 secs
lola: 108917 markings, 220909 edges, 11113 markings/sec, 5 secs
lola: 164641 markings, 326803 edges, 11145 markings/sec, 10 secs
lola: 220701 markings, 433504 edges, 11212 markings/sec, 15 secs
lola: 276462 markings, 539586 edges, 11152 markings/sec, 20 secs
lola: 329888 markings, 641562 edges, 10685 markings/sec, 25 secs
lola: 384751 markings, 745926 edges, 10973 markings/sec, 30 secs
lola: 437692 markings, 848054 edges, 10588 markings/sec, 35 secs
lola: 493556 markings, 953403 edges, 11173 markings/sec, 40 secs
lola: 547942 markings, 1058525 edges, 10877 markings/sec, 45 secs
lola: 602842 markings, 1164643 edges, 10980 markings/sec, 50 secs
lola: 654226 markings, 1259422 edges, 10277 markings/sec, 55 secs
lola: 685889 markings, 1349036 edges, 6333 markings/sec, 60 secs
lola: 733915 markings, 1447197 edges, 9605 markings/sec, 65 secs
lola: 765230 markings, 1521073 edges, 6263 markings/sec, 70 secs
lola: 799390 markings, 1599260 edges, 6832 markings/sec, 75 secs
lola: 838987 markings, 1684858 edges, 7919 markings/sec, 80 secs
lola: 880007 markings, 1773079 edges, 8204 markings/sec, 85 secs
lola: 918533 markings, 1860321 edges, 7705 markings/sec, 90 secs
lola: 972552 markings, 1971296 edges, 10804 markings/sec, 95 secs
lola: 1027071 markings, 2082439 edges, 10904 markings/sec, 100 secs
lola: 1078610 markings, 2187230 edges, 10308 markings/sec, 105 secs
lola: 1126156 markings, 2297577 edges, 9509 markings/sec, 110 secs
lola: 1177263 markings, 2401851 edges, 10221 markings/sec, 115 secs
lola: 1224717 markings, 2498882 edges, 9491 markings/sec, 120 secs
lola: 1271921 markings, 2595508 edges, 9441 markings/sec, 125 secs
lola: 1320176 markings, 2694060 edges, 9651 markings/sec, 130 secs
lola: 1380298 markings, 2813314 edges, 12024 markings/sec, 135 secs
lola: 1439474 markings, 2924641 edges, 11835 markings/sec, 140 secs
lola: 1490517 markings, 3029560 edges, 10209 markings/sec, 145 secs
lola: 1546946 markings, 3145063 edges, 11286 markings/sec, 150 secs
lola: 1603355 markings, 3260246 edges, 11282 markings/sec, 155 secs
lola: 1658299 markings, 3372508 edges, 10989 markings/sec, 160 secs
lola: 1715936 markings, 3490013 edges, 11527 markings/sec, 165 secs
lola: 1772185 markings, 3605032 edges, 11250 markings/sec, 170 secs
lola: 1828900 markings, 3720361 edges, 11343 markings/sec, 175 secs
lola: 1885185 markings, 3835549 edges, 11257 markings/sec, 180 secs
lola: 1899666 markings, 3945240 edges, 2896 markings/sec, 185 secs
lola: 1911778 markings, 4056638 edges, 2422 markings/sec, 190 secs
lola: 1924762 markings, 4167919 edges, 2597 markings/sec, 195 secs
lola: 1938334 markings, 4278078 edges, 2714 markings/sec, 200 secs
lola: 1950455 markings, 4388737 edges, 2424 markings/sec, 205 secs
lola: 1962564 markings, 4499195 edges, 2422 markings/sec, 210 secs
lola: 2030105 markings, 4639880 edges, 13508 markings/sec, 215 secs
lola: 2033581 markings, 4758573 edges, 695 markings/sec, 220 secs
lola: 2092368 markings, 4874725 edges, 11757 markings/sec, 225 secs
lola: 2146453 markings, 4979256 edges, 10817 markings/sec, 230 secs
lola: 2201321 markings, 5085320 edges, 10974 markings/sec, 235 secs
lola: 2242887 markings, 5180779 edges, 8313 markings/sec, 240 secs
lola: 2288689 markings, 5274065 edges, 9160 markings/sec, 245 secs
lola: 2321414 markings, 5350722 edges, 6545 markings/sec, 250 secs
lola: 2352484 markings, 5423783 edges, 6214 markings/sec, 255 secs
lola: 2390734 markings, 5507109 edges, 7650 markings/sec, 260 secs
lola: 2435686 markings, 5599412 edges, 8990 markings/sec, 265 secs
lola: 2466378 markings, 5673031 edges, 6138 markings/sec, 270 secs
lola: 2509108 markings, 5766720 edges, 8546 markings/sec, 275 secs
lola: 2563242 markings, 5877272 edges, 10827 markings/sec, 280 secs
lola: 2616431 markings, 5986318 edges, 10638 markings/sec, 285 secs
lola: 2668214 markings, 6090596 edges, 10357 markings/sec, 290 secs
lola: 2715113 markings, 6200521 edges, 9380 markings/sec, 295 secs
lola: 2765862 markings, 6303941 edges, 10150 markings/sec, 300 secs
lola: 2814107 markings, 6402538 edges, 9649 markings/sec, 305 secs
lola: 2861345 markings, 6498834 edges, 9448 markings/sec, 310 secs
lola: 2909762 markings, 6597940 edges, 9683 markings/sec, 315 secs
lola: 2970452 markings, 6716771 edges, 12138 markings/sec, 320 secs
lola: 3027412 markings, 6825241 edges, 11392 markings/sec, 325 secs
lola: 3078488 markings, 6930218 edges, 10215 markings/sec, 330 secs
lola: 3134639 markings, 7045105 edges, 11230 markings/sec, 335 secs
lola: 3190286 markings, 7158830 edges, 11129 markings/sec, 340 secs
lola: 3247754 markings, 7275816 edges, 11494 markings/sec, 345 secs
lola: 3304230 markings, 7391424 edges, 11295 markings/sec, 350 secs
lola: 3360237 markings, 7505957 edges, 11201 markings/sec, 355 secs
lola: 3414376 markings, 7616246 edges, 10828 markings/sec, 360 secs
lola: 3470463 markings, 7731283 edges, 11217 markings/sec, 365 secs
lola: 3484154 markings, 7841133 edges, 2738 markings/sec, 370 secs
lola: 3496265 markings, 7951907 edges, 2422 markings/sec, 375 secs
lola: 3509406 markings, 8062626 edges, 2628 markings/sec, 380 secs
lola: 3522815 markings, 8171679 edges, 2682 markings/sec, 385 secs
lola: 3534934 markings, 8281758 edges, 2424 markings/sec, 390 secs
lola: 3547041 markings, 8391632 edges, 2421 markings/sec, 395 secs
lola: 3613612 markings, 8531514 edges, 13314 markings/sec, 400 secs
lola: 3618031 markings, 8649514 edges, 884 markings/sec, 405 secs
lola: 3676389 markings, 8767423 edges, 11672 markings/sec, 410 secs
lola: 3730696 markings, 8872390 edges, 10861 markings/sec, 415 secs
lola: 3785902 markings, 8979110 edges, 11041 markings/sec, 420 secs
lola: 3828641 markings, 9076433 edges, 8548 markings/sec, 425 secs
lola: 3875055 markings, 9170940 edges, 9283 markings/sec, 430 secs
lola: 3906335 markings, 9245827 edges, 6256 markings/sec, 435 secs
lola: 3937583 markings, 9319270 edges, 6250 markings/sec, 440 secs
lola: 3980138 markings, 9408628 edges, 8511 markings/sec, 445 secs
lola: 4021017 markings, 9496931 edges, 8176 markings/sec, 450 secs
lola: 4051951 markings, 9570157 edges, 6187 markings/sec, 455 secs
lola: 4098330 markings, 9669617 edges, 9276 markings/sec, 460 secs
lola: 4152136 markings, 9780085 edges, 10761 markings/sec, 465 secs
lola: 4206302 markings, 9891494 edges, 10833 markings/sec, 470 secs
lola: 4252817 markings, 9995719 edges, 9303 markings/sec, 475 secs
lola: 4305250 markings, 10105599 edges, 10487 markings/sec, 480 secs
lola: 4355393 markings, 10208205 edges, 10029 markings/sec, 485 secs
lola: 4404609 markings, 10308448 edges, 9843 markings/sec, 490 secs
lola: 4451182 markings, 10403794 edges, 9315 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 503 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 || 48568 markings, 94613 edges, 9714 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 2508 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 2508 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 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="FlexibleBarrier-PT-18b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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-full"
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 r094-blw7-152650006200206"
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 ;