About the Execution of M4M.full for FlexibleBarrier-PT-06b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
9026.470 | 436579.00 | 400321.00 | 220.70 | FTTTFFT?FFFTFFTF | 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 304K
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K 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 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 141K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is FlexibleBarrier-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r250-blw7-152732552200035
=====================================================================
--------------------
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-06b-LTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1528009389864
BK_STOP 1528009826443
--------------------
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-06b 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': 18449, 'Memory': 880.4, 'Tool': 'itstools'}, {'Time': 388530, 'Memory': 7466.36, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 21.05967803132961x far from the best tool itstools.
LTLCardinality lola FlexibleBarrier-PT-06b...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
FlexibleBarrier-PT-06b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-06b: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ FlexibleBarrier-PT-06b @ 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: 1163/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 542 places, 621 transitions, 534 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 635 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-06b-LTLCardinality.task
lola: A (X ((X ((p314 <= p508)) U G ((3 <= p400))))) : A (X ((p115 <= p60))) : A ((p244 <= p239)) : A (X ((X ((p526 <= p323)) U (p385 <= p156)))) : A (X (F (G (F ((p196 <= p383)))))) : A ((3 <= p111)) : A ((p1 <= p331)) : A (G (F (F (G ((p450 <= p456)))))) : A (F (G (X (X ((1 <= p87)))))) : A ((2 <= p41)) : A (X (F (G ((p401 <= p473))))) : A (F ((p95 <= p128))) : A (G ((p174 <= p129))) : A (G ((p15 <= p380))) : A ((p204 <= p253)) : A (X ((3 <= p213)))
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 (X ((X ((p314 <= p508)) U G ((3 <= p400)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((p314 <= p508)) U G ((3 <= p400)))))
lola: processed formula: A (X ((X ((p314 <= p508)) U G ((3 <= p400)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 31 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((p115 <= p60)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p115 <= p60)))
lola: processed formula: A (X ((p115 <= p60)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p244 <= p239))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p244 <= p239)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((X ((p526 <= p323)) U (p385 <= p156))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((X ((p526 <= p323)) U (p385 <= p156))))
lola: processed formula: A (X ((X ((p526 <= p323)) U (p385 <= p156))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 7 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G (F ((p196 <= p383))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (F ((p196 <= p383)))))
lola: processed formula: A (X (G (F ((p196 <= p383)))))
lola: processed formula length: 30
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 244 markings, 306 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((3 <= p111))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p111)
lola: processed formula length: 11
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p1 <= p331))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1 <= p331)
lola: processed formula length: 12
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G ((p450 <= p456))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G ((p450 <= p456))))
lola: processed formula: A (F (G ((p450 <= p456))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 913598 markings, 1535766 edges, 182720 markings/sec, 0 secs
lola: 1808747 markings, 3050314 edges, 179030 markings/sec, 5 secs
lola: 2647749 markings, 4492359 edges, 167800 markings/sec, 10 secs
lola: 3526660 markings, 5985046 edges, 175782 markings/sec, 15 secs
lola: 4407276 markings, 7480733 edges, 176123 markings/sec, 20 secs
lola: 5283202 markings, 8968764 edges, 175185 markings/sec, 25 secs
lola: 6117069 markings, 10369534 edges, 166773 markings/sec, 30 secs
lola: 6911140 markings, 11714012 edges, 158814 markings/sec, 35 secs
lola: 7676876 markings, 13025634 edges, 153147 markings/sec, 40 secs
lola: 8459342 markings, 14366441 edges, 156493 markings/sec, 45 secs
lola: 9329698 markings, 15832189 edges, 174071 markings/sec, 50 secs
lola: 10180852 markings, 17268086 edges, 170231 markings/sec, 55 secs
lola: 10980134 markings, 18618444 edges, 159856 markings/sec, 60 secs
lola: 11767614 markings, 19956649 edges, 157496 markings/sec, 65 secs
lola: 12575510 markings, 21345373 edges, 161579 markings/sec, 70 secs
lola: 13374692 markings, 22738111 edges, 159836 markings/sec, 75 secs
lola: 14172015 markings, 24105133 edges, 159465 markings/sec, 80 secs
lola: 14920743 markings, 25372901 edges, 149746 markings/sec, 85 secs
lola: 15686740 markings, 26697398 edges, 153199 markings/sec, 90 secs
lola: 16454548 markings, 28037674 edges, 153562 markings/sec, 95 secs
lola: 17241332 markings, 29401756 edges, 157357 markings/sec, 100 secs
lola: 18008314 markings, 30719565 edges, 153396 markings/sec, 105 secs
lola: 18779906 markings, 32060745 edges, 154318 markings/sec, 110 secs
lola: 19525515 markings, 33337983 edges, 149122 markings/sec, 115 secs
lola: 20244476 markings, 34554298 edges, 143792 markings/sec, 120 secs
lola: 20996834 markings, 35836796 edges, 150472 markings/sec, 125 secs
lola: 21723744 markings, 37088798 edges, 145382 markings/sec, 130 secs
lola: 22461050 markings, 38347468 edges, 147461 markings/sec, 135 secs
lola: 23181094 markings, 39590251 edges, 144009 markings/sec, 140 secs
lola: 23909310 markings, 40865600 edges, 145643 markings/sec, 145 secs
lola: 24618155 markings, 42112131 edges, 141769 markings/sec, 150 secs
lola: 25251184 markings, 43341263 edges, 126606 markings/sec, 155 secs
lola: 26058345 markings, 44757907 edges, 161432 markings/sec, 160 secs
lola: 26864848 markings, 46168855 edges, 161301 markings/sec, 165 secs
lola: 27634923 markings, 47473345 edges, 154015 markings/sec, 170 secs
lola: 28377973 markings, 48751885 edges, 148610 markings/sec, 175 secs
lola: 29158281 markings, 50094690 edges, 156062 markings/sec, 180 secs
lola: 29952077 markings, 51472963 edges, 158759 markings/sec, 185 secs
lola: 30744704 markings, 52847474 edges, 158525 markings/sec, 190 secs
lola: 31485263 markings, 54141668 edges, 148112 markings/sec, 195 secs
lola: 32240450 markings, 55476712 edges, 151037 markings/sec, 200 secs
lola: 32991401 markings, 56816400 edges, 150190 markings/sec, 205 secs
lola: 33739295 markings, 58131058 edges, 149579 markings/sec, 210 secs
lola: 34482558 markings, 59419293 edges, 148653 markings/sec, 215 secs
lola: 35212943 markings, 60726378 edges, 146077 markings/sec, 220 secs
lola: 35952930 markings, 62035968 edges, 147997 markings/sec, 225 secs
lola: 36688434 markings, 63311523 edges, 147101 markings/sec, 230 secs
lola: 37387144 markings, 64532279 edges, 139742 markings/sec, 235 secs
lola: 38081749 markings, 65731596 edges, 138921 markings/sec, 240 secs
lola: 38772948 markings, 66939817 edges, 138240 markings/sec, 245 secs
lola: 39463049 markings, 68145383 edges, 138020 markings/sec, 250 secs
lola: 40173512 markings, 69384062 edges, 142093 markings/sec, 255 secs
lola: 40891969 markings, 70638676 edges, 143691 markings/sec, 260 secs
lola: 41619258 markings, 71939895 edges, 145458 markings/sec, 265 secs
lola: 42349248 markings, 73235719 edges, 145998 markings/sec, 270 secs
lola: 42962052 markings, 74379109 edges, 122561 markings/sec, 275 secs
lola: 43657030 markings, 75706735 edges, 138996 markings/sec, 280 secs
lola: 44456930 markings, 77094329 edges, 159980 markings/sec, 285 secs
lola: 45248104 markings, 78472256 edges, 158235 markings/sec, 290 secs
lola: 45991053 markings, 79784318 edges, 148590 markings/sec, 295 secs
lola: 46730065 markings, 81094001 edges, 147802 markings/sec, 300 secs
lola: 47468351 markings, 82397465 edges, 147657 markings/sec, 305 secs
lola: 48200868 markings, 83675243 edges, 146503 markings/sec, 310 secs
lola: 48946634 markings, 84982169 edges, 149153 markings/sec, 315 secs
lola: 49678633 markings, 86284686 edges, 146400 markings/sec, 320 secs
lola: 50406978 markings, 87585229 edges, 145669 markings/sec, 325 secs
lola: 51133143 markings, 88842605 edges, 145233 markings/sec, 330 secs
lola: 51832664 markings, 90051537 edges, 139904 markings/sec, 335 secs
lola: 52530710 markings, 91256973 edges, 139609 markings/sec, 340 secs
lola: 53226639 markings, 92478295 edges, 139186 markings/sec, 345 secs
lola: 53924945 markings, 93692875 edges, 139661 markings/sec, 350 secs
lola: 54633935 markings, 94938718 edges, 141798 markings/sec, 355 secs
lola: 55352002 markings, 96199466 edges, 143613 markings/sec, 360 secs
lola: 56077239 markings, 97492909 edges, 145047 markings/sec, 365 secs
lola: 56773824 markings, 98748334 edges, 139317 markings/sec, 370 secs
lola: 57351884 markings, 99916683 edges, 115612 markings/sec, 375 secs
lola: 58124313 markings, 101262524 edges, 154486 markings/sec, 380 secs
lola: 58911297 markings, 102615438 edges, 157397 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (X ((1 <= p87))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (X ((1 <= p87))))))
lola: processed formula: A (F (G (X (X ((1 <= p87))))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 7 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20 markings, 21 edges
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((2 <= p41))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p41)
lola: processed formula length: 10
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 10 will run for 524 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (G ((p401 <= p473)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (F (G ((p401 <= p473)))))
lola: processed formula: A (X (F (G ((p401 <= p473)))))
lola: processed formula length: 30
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 13988 markings, 39714 edges
lola: ========================================
lola: subprocess 11 will run for 629 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p95 <= p128)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p95 <= p128)))
lola: processed formula: A (F ((p95 <= p128)))
lola: processed formula length: 21
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 9 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 786 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p174 <= p129)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 22 markings, 21 edges
lola: ========================================
lola: subprocess 13 will run for 1049 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p15 <= p380)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 10 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 27 markings, 26 edges
lola: ========================================
lola: subprocess 14 will run for 1573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p204 <= p253))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p204 <= p253)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-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 15 will run for 3147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= p213)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((3 <= p213)))
lola: processed formula: A (X ((3 <= p213)))
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 542 places; total mentions: 0
lola: closed formula file FlexibleBarrier-PT-06b-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 14 markings, 14 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes no no yes unknown no no no yes no no yes no
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-06b-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
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-06b"
export BK_EXAMINATION="LTLCardinality"
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-06b.tgz
mv FlexibleBarrier-PT-06b 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-06b, 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 r250-blw7-152732552200035"
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 '
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 ;