fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r251-blw7-152732552900039
Last Updated
June 26, 2018

About the Execution of M4M.struct for FlexibleBarrier-PT-08b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3355.350 313230.00 287499.00 233.60 FT?TFFFFFTFTFTFT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 404K
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K 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.7K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K 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 9.1K 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 16K 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.7K 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.7K 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 241K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is FlexibleBarrier-PT-08b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r251-blw7-152732552900039
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1528020449983


BK_STOP 1528020763213

--------------------
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-08b as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', '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': 69415, 'Memory': 2499.5, 'Tool': 'itstools'}, {'Time': 1945858, 'Memory': 5893.43, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 28.032240870128934x far from the best tool itstools.
LTLCardinality lola FlexibleBarrier-PT-08b...

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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-08b: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ FlexibleBarrier-PT-08b @ 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: 1977/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 920 places, 1057 transitions, 910 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1075 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-08b-LTLCardinality.task
lola: A ((F (G ((3 <= p804))) U ((p718 <= p381) U (1 <= p296)))) : A ((X ((3 <= p461)) U ((p912 <= p437) U (p201 <= p611)))) : A (X ((G ((p732 <= p290)) U G ((p385 <= p60))))) : A (X (X (F (F ((p315 <= p243)))))) : A ((2 <= p624)) : A ((1 <= p849)) : A (F (G (((3 <= p467) U (p73 <= p301))))) : A (G (G ((p229 <= p580)))) : A ((F (F ((p45 <= p885))) U G (G ((1 <= p380))))) : A ((p692 <= p300)) : A (G (F (F (F ((3 <= p20)))))) : A (F ((p773 <= p309))) : A (G ((G ((p428 <= p120)) U F ((1 <= p389))))) : A ((G ((p40 <= p181)) U ((p768 <= p318) U (p800 <= p863)))) : A (G (G (F (F ((p618 <= p704)))))) : A (F (F (((p20 <= p5) U (p771 <= p547)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (G ((3 <= p804))) U ((p718 <= p381) U (1 <= p296))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F (G ((3 <= p804))) U ((p718 <= p381) U (1 <= p296))))
lola: processed formula: A ((F (G ((3 <= p804))) U ((p718 <= p381) U (1 <= p296))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 60 markings, 61 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((3 <= p461)) U ((p912 <= p437) U (p201 <= p611))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X ((3 <= p461)) U ((p912 <= p437) U (p201 <= p611))))
lola: processed formula: A ((X ((3 <= p461)) U ((p912 <= p437) U (p201 <= p611))))
lola: processed formula length: 57
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((G ((p732 <= p290)) U G ((p385 <= p60)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((G ((p732 <= p290)) U G ((p385 <= p60)))))
lola: processed formula: A (X ((G ((p732 <= p290)) U G ((p385 <= p60)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 431276 markings, 1670743 edges, 86255 markings/sec, 0 secs
lola: 860377 markings, 3469439 edges, 85820 markings/sec, 5 secs
lola: 1306538 markings, 5388766 edges, 89232 markings/sec, 10 secs
lola: 1751594 markings, 7281070 edges, 89011 markings/sec, 15 secs
lola: 2193361 markings, 8997253 edges, 88353 markings/sec, 20 secs
lola: 2643825 markings, 10715598 edges, 90093 markings/sec, 25 secs
lola: 3066883 markings, 12350473 edges, 84612 markings/sec, 30 secs
lola: 3445917 markings, 14078386 edges, 75807 markings/sec, 35 secs
lola: 3827951 markings, 15828908 edges, 76407 markings/sec, 40 secs
lola: 4192389 markings, 17638712 edges, 72888 markings/sec, 45 secs
lola: 4531989 markings, 19462453 edges, 67920 markings/sec, 50 secs
lola: 4835750 markings, 21300313 edges, 60752 markings/sec, 55 secs
lola: 5090535 markings, 22819793 edges, 50957 markings/sec, 60 secs
lola: 5258627 markings, 24372720 edges, 33618 markings/sec, 65 secs
lola: 5614570 markings, 26113712 edges, 71189 markings/sec, 70 secs
lola: 6002322 markings, 27913364 edges, 77550 markings/sec, 75 secs
lola: 6400724 markings, 29695444 edges, 79680 markings/sec, 80 secs
lola: 6779748 markings, 31489059 edges, 75805 markings/sec, 85 secs
lola: 7153113 markings, 33153889 edges, 74673 markings/sec, 90 secs
lola: 7547152 markings, 34773230 edges, 78808 markings/sec, 95 secs
lola: 7948364 markings, 36464955 edges, 80242 markings/sec, 100 secs
lola: 8352608 markings, 38120444 edges, 80849 markings/sec, 105 secs
lola: 8735510 markings, 39708561 edges, 76580 markings/sec, 110 secs
lola: 9104719 markings, 41287309 edges, 73842 markings/sec, 115 secs
lola: 9469390 markings, 43036149 edges, 72934 markings/sec, 120 secs
lola: 9840148 markings, 44832818 edges, 74152 markings/sec, 125 secs
lola: 10186015 markings, 46580289 edges, 69173 markings/sec, 130 secs
lola: 10509335 markings, 48379155 edges, 64664 markings/sec, 135 secs
lola: 10816068 markings, 50128231 edges, 61347 markings/sec, 140 secs
lola: 11094395 markings, 51909037 edges, 55665 markings/sec, 145 secs
lola: 11350461 markings, 53435006 edges, 51213 markings/sec, 150 secs
lola: 11542796 markings, 54852459 edges, 38467 markings/sec, 155 secs
lola: 11660065 markings, 56373700 edges, 23454 markings/sec, 160 secs
lola: 12058221 markings, 58167240 edges, 79631 markings/sec, 165 secs
lola: 12462886 markings, 59965403 edges, 80933 markings/sec, 170 secs
lola: 12859414 markings, 61716888 edges, 79306 markings/sec, 175 secs
lola: 13241378 markings, 63471107 edges, 76393 markings/sec, 180 secs
lola: 13669092 markings, 65287037 edges, 85543 markings/sec, 185 secs
lola: 14089825 markings, 67024063 edges, 84147 markings/sec, 190 secs
lola: 14478629 markings, 68649942 edges, 77761 markings/sec, 195 secs
lola: 14848949 markings, 70248574 edges, 74064 markings/sec, 200 secs
lola: 15222096 markings, 72031384 edges, 74629 markings/sec, 205 secs
lola: 15586467 markings, 73806674 edges, 72874 markings/sec, 210 secs
lola: 15916367 markings, 75595265 edges, 65980 markings/sec, 215 secs
lola: 16228786 markings, 77351751 edges, 62484 markings/sec, 220 secs
lola: 16504467 markings, 79103707 edges, 55136 markings/sec, 225 secs
lola: 16748328 markings, 80580527 edges, 48772 markings/sec, 230 secs
lola: 16913136 markings, 82101526 edges, 32962 markings/sec, 235 secs
lola: 17231138 markings, 83787322 edges, 63600 markings/sec, 240 secs
lola: 17574674 markings, 85546060 edges, 68707 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((p315 <= p243))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((p315 <= p243)))))
lola: processed formula: A (X (X (F ((p315 <= p243)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 4 will run for 274 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p624))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p624)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.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: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= p849))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p849)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.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: subprocess 6 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (((3 <= p467) U (p73 <= p301)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (((3 <= p467) U (p73 <= p301)))))
lola: processed formula: A (F (G (((3 <= p467) U (p73 <= p301)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 16 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 535068 markings, 833084 edges, 107014 markings/sec, 0 secs
lola: 1063605 markings, 1678259 edges, 105707 markings/sec, 5 secs
lola: 1621800 markings, 2679881 edges, 111639 markings/sec, 10 secs
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: 1879906 markings, 3127207 edges
lola: ========================================
lola: subprocess 7 will run for 363 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G ((p229 <= p580))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G ((p229 <= p580))))
lola: processed formula: A (G (G ((p229 <= p580))))
lola: processed formula length: 26
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 16 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: 7914 markings, 11834 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((F (F ((p45 <= p885))) U G (G ((1 <= p380)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((F ((p45 <= p885)) U G (G ((1 <= p380)))))
lola: processed formula: A ((F ((p45 <= p885)) U G (G ((1 <= p380)))))
lola: processed formula length: 45
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 60 markings, 61 edges
lola: ========================================
lola: subprocess 9 will run for 467 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p692 <= p300))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p692 <= p300)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 545 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (F ((3 <= p20))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (F ((3 <= p20))))
lola: processed formula: A (G (F ((3 <= p20))))
lola: processed formula length: 22
lola: 2 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 16 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: 74 markings, 74 edges
lola: subprocess 11 will run for 654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((p773 <= p309)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p773 <= p309)))
lola: processed formula: A (F ((p773 <= p309)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 817 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((p428 <= p120)) U F ((1 <= p389)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G ((G ((p428 <= p120)) U F ((1 <= p389)))))
lola: processed formula: A (G ((G ((p428 <= p120)) U F ((1 <= p389)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 16 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: 55 markings, 55 edges
lola: ========================================
lola: subprocess 13 will run for 1090 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((p40 <= p181)) U ((p768 <= p318) U (p800 <= p863))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((p40 <= p181)) U ((p768 <= p318) U (p800 <= p863))))
lola: processed formula: A ((G ((p40 <= p181)) U ((p768 <= p318) U (p800 <= p863))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 15 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1635 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (F (F ((p618 <= p704))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (F ((p618 <= p704)))))
lola: processed formula: A (G (G (F ((p618 <= p704)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 16 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: 4437 markings, 6561 edges
lola: ========================================
lola: subprocess 15 will run for 3270 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (((p20 <= p5) U (p771 <= p547)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((p20 <= p5) U (p771 <= p547))))
lola: processed formula: A (F (((p20 <= p5) U (p771 <= p547))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 920 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-08b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 116 bytes per marking, with 17 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes unknown yes no no no no no yes no yes no yes no yes
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-08b-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FlexibleBarrier-PT-08b"
export BK_EXAMINATION="LTLCardinality"
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-08b.tgz
mv FlexibleBarrier-PT-08b 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-08b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r251-blw7-152732552900039"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;