fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r148-csrt-149443432900158
Last Updated
June 27, 2017

About the Execution of LoLA for S_RwMutex-PT-r0500w0010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15948.850 220291.00 217544.00 728.60 F?FFFFTTF?FFTFTF 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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool lola
Input is S_RwMutex-PT-r0500w0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432900158
=====================================================================


--------------------
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 RwMutex-PT-r0500w0010-LTLCardinality-0
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-1
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-10
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-11
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-12
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-13
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-14
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-15
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-2
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-3
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-4
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-5
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-6
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-7
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-8
FORMULA_NAME RwMutex-PT-r0500w0010-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496441559490


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_RwMutex-PT-r0500w0010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_RwMutex-PT-r0500w0010: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
LTLCardinality @ S_RwMutex-PT-r0500w0010 @ 3540 seconds
----- 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: 2540/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1520 places, 1020 transitions, 510 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1011 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0500w0010-LTLCardinality.task
lola: A (X ((F ((2 <= p1376)) U X ((p503 <= p1353))))) : A (X (G (((p356 <= p1262) U (p454 <= p338))))) : A (G ((p988 <= p19))) : A (G (X (F ((p1343 <= p135))))) : A ((X (F ((1 <= p1148))) U ((p1317 <= p786) U (3 <= p1091)))) : A (F (G (F (F ((p379 <= p182)))))) : A ((p940 <= p1410)) : A (X (X (((3 <= p1035) U (1 <= p1315))))) : A (F ((p251 <= p308))) : A (((p851 <= p408) U X (X ((2 <= p90))))) : A (G ((p473 <= p1194))) : A (X (X (X (G ((p1236 <= p478)))))) : A (F (X (F (G ((2 <= p1229)))))) : A ((((p1014 <= p1091) U (p143 <= p862)) U X (F ((2 <= p1305))))) : A (((1 <= p1465) U (1 <= p17))) : A ((p458 <= p1321))
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 ((F ((2 <= p1376)) U X ((p503 <= p1353)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((2 <= p1376)) U X ((p503 <= p1353)))))
lola: processed formula: A (X ((F ((2 <= p1376)) U X ((p503 <= p1353)))))
lola: processed formula length: 48
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 29 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: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p356 <= p1262) U (p454 <= p338)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p356 <= p1262) U (p454 <= p338)))))
lola: processed formula: A (X (G (((p356 <= p1262) U (p454 <= p338)))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 466270 markings, 2241827 edges, 93254 markings/sec, 0 secs
lola: 796768 markings, 4785093 edges, 66100 markings/sec, 5 secs
lola: 1110586 markings, 7349564 edges, 62764 markings/sec, 10 secs
lola: 1396847 markings, 9860183 edges, 57252 markings/sec, 15 secs
lola: 1663065 markings, 12211844 edges, 53244 markings/sec, 20 secs
lola: 1959830 markings, 14712193 edges, 59353 markings/sec, 25 secs
lola: 2223705 markings, 17155243 edges, 52775 markings/sec, 30 secs
lola: 2470034 markings, 19495535 edges, 49266 markings/sec, 35 secs
lola: 2749703 markings, 21965552 edges, 55934 markings/sec, 40 secs
lola: 3032085 markings, 24322162 edges, 56476 markings/sec, 45 secs
lola: 3314121 markings, 26747364 edges, 56407 markings/sec, 50 secs
lola: 3546674 markings, 29034780 edges, 46511 markings/sec, 55 secs
lola: 3842051 markings, 31421373 edges, 59075 markings/sec, 60 secs
lola: 4103070 markings, 33743923 edges, 52204 markings/sec, 65 secs
lola: 4349205 markings, 36103648 edges, 49227 markings/sec, 70 secs
lola: 4573043 markings, 38388208 edges, 44768 markings/sec, 75 secs
lola: 4804694 markings, 40719525 edges, 46330 markings/sec, 80 secs
lola: 5082266 markings, 43215841 edges, 55514 markings/sec, 85 secs
lola: 5359416 markings, 45713307 edges, 55430 markings/sec, 90 secs
lola: 5617044 markings, 48181099 edges, 51526 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p988 <= p19)))
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 2040 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F ((p1343 <= p135)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (X (F ((p1343 <= p135)))))
lola: processed formula: A (G (X (F ((p1343 <= p135)))))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 555808 markings, 2019238 edges, 111162 markings/sec, 0 secs
lola: 927152 markings, 4440280 edges, 74269 markings/sec, 5 secs
lola: 1249210 markings, 6902465 edges, 64412 markings/sec, 10 secs
lola: 1568560 markings, 9371566 edges, 63870 markings/sec, 15 secs
lola: 1897375 markings, 11883795 edges, 65763 markings/sec, 20 secs
lola: 2180198 markings, 14344730 edges, 56565 markings/sec, 25 secs
lola: 2443680 markings, 16767601 edges, 52696 markings/sec, 30 secs
lola: 2732926 markings, 19176216 edges, 57849 markings/sec, 35 secs
lola: 2983531 markings, 21503980 edges, 50121 markings/sec, 40 secs
lola: 3242235 markings, 23843387 edges, 51741 markings/sec, 45 secs
lola: 3548632 markings, 26189668 edges, 61279 markings/sec, 50 secs
lola: 3825742 markings, 28616490 edges, 55422 markings/sec, 55 secs
lola: 4094608 markings, 31071439 edges, 53773 markings/sec, 60 secs
lola: 4358612 markings, 33453736 edges, 52801 markings/sec, 65 secs
lola: 4615430 markings, 35858009 edges, 51364 markings/sec, 70 secs
lola: 4877174 markings, 38369335 edges, 52349 markings/sec, 75 secs
lola: 5159024 markings, 40887838 edges, 56370 markings/sec, 80 secs
lola: 5444182 markings, 43407185 edges, 57032 markings/sec, 85 secs
lola: 5714310 markings, 45926655 edges, 54026 markings/sec, 90 secs
lola: 6045062 markings, 48496327 edges, 66150 markings/sec, 95 secs
lola: 6344896 markings, 51079443 edges, 59967 markings/sec, 100 secs
lola: 6578694 markings, 53055362 edges, 46760 markings/sec, 105 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((1 <= p1148))) U ((p1317 <= p786) U (3 <= p1091))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (F ((1 <= p1148))) U ((p1317 <= p786) U (3 <= p1091))))
lola: processed formula: A ((X (F ((1 <= p1148))) U ((p1317 <= p786) U (3 <= p1091))))
lola: processed formula length: 61
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 30 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: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (F (F ((p379 <= p182))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p379 <= p182))))
lola: processed formula: A (G (F ((p379 <= p182))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p940 <= p1410))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p940 <= p1410)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-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: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (((3 <= p1035) U (1 <= p1315)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= p1035) U (1 <= p1315)))))
lola: processed formula: A (X (X (((3 <= p1035) U (1 <= p1315)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 29 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: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p251 <= p308)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((p251 <= p308)))
lola: processed formula: A (F ((p251 <= p308)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p851 <= p408) U X (X ((2 <= p90)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((p851 <= p408) U X (X ((2 <= p90)))))
lola: processed formula: A (((p851 <= p408) U X (X ((2 <= p90)))))
lola: processed formula length: 41
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 29 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: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p473 <= p1194)))
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 2040 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (G ((p1236 <= p478))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (G ((p1236 <= p478))))))
lola: processed formula: A (X (X (X (G ((p1236 <= p478))))))
lola: processed formula length: 35
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 29 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: ========================================
lola: subprocess 12 will run for 830 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (X (F (G ((2 <= p1229))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (X (F (G ((2 <= p1229))))))
lola: processed formula: A (F (X (F (G ((2 <= p1229))))))
lola: processed formula length: 32
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 30 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: ========================================
lola: subprocess 13 will run for 1106 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p1014 <= p1091) U (p143 <= p862)) U X (F ((2 <= p1305)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((p1014 <= p1091) U (p143 <= p862)) U X (F ((2 <= p1305)))))
lola: processed formula: A ((((p1014 <= p1091) U (p143 <= p862)) U X (F ((2 <= p1305)))))
lola: processed formula length: 64
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 29 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: ========================================
lola: subprocess 14 will run for 1660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= p1465) U (1 <= p17)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= p1465) U (1 <= p17)))
lola: processed formula: A (((1 <= p1465) U (1 <= p17)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2044 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((p458 <= p1321))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p458 <= p1321)
lola: processed formula length: 15
lola: 1 rewrites
lola: formula mentions 0 of 1520 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0500w0010-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: ========================================
lola: RESULT
lola:
SUMMARY: no unknown no unknown no no yes no yes no no no no no yes yes
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0500w0010-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496441779781

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_RwMutex-PT-r0500w0010"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
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/S_RwMutex-PT-r0500w0010.tgz
mv S_RwMutex-PT-r0500w0010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_RwMutex-PT-r0500w0010, 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 r148-csrt-149443432900158"
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 ;