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 4.1M
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K 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 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K 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 11 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 3.9M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is RwMutex-PT-r2000w0010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r154-smll-152685551700171
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526955988794


BK_STOP 1526956183978

--------------------
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 RwMutex-PT-r2000w0010 as instance name.
Using RwMutex as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': True, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 150041, 'Memory': 15937.91, 'Tool': 'lola'}, {'Time': 276136, 'Memory': 15723.54, 'Tool': 'lola'}, {'Time': 1046095, 'Memory': 11316.53, 'Tool': 'marcie'}, {'Time': 1070028, 'Memory': 11316.77, 'Tool': 'marcie'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola RwMutex-PT-r2000w0010...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
RwMutex-PT-r2000w0010: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ RwMutex-PT-r2000w0010 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 10040/65536 symbol table entries, 2691 collisions
lola: preprocessing...
lola: finding significant places
lola: 6020 places, 4020 transitions, 2010 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4011 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r2000w0010-CTLCardinality.task
lola: NOT(A (G (A (F ((3 <= p3817)))))) : E (G ((A (X ((3 <= p3692))) OR E (X ((1 <= p4644)))))) : A (F ((E (X ((3 <= p2782))) OR (1 <= p3876)))) : A (G (A (F (((p3739 <= p2802) AND (3 <= p6014)))))) : E (G (((p2634 <= p4859) AND ((1 <= p4077) OR (p5446 <= p3357) OR (3 <= p5844) OR (p2271 <= p3325))))) : A (F ((p1664 <= p3712))) : A (G ((p5829 <= p2007))) : E (F ((A (X ((p2120 <= p5361))) AND ((p1617 <= p1265) AND ((p1953 <= p457) OR (2 <= p5011)))))) : A (G ((E (F ((p1147 <= p3495))) OR E (X ((2 <= p2444)))))) : A (F ((p5175 <= p3384))) : A (G ((((p4560 <= 0) AND ((1 <= p5429) OR (1 <= p2752))) OR A (F ((1 <= p3919)))))) : NOT(E (X ((3 <= p5822)))) : E (F ((E (F ((3 <= p3416))) AND ((1 <= p1728) OR (p3808 <= p3841) OR (p4246 + 1 <= p2834))))) : A (G (E (F (((p276 <= p1692) OR (p5968 <= p5536)))))) : E (G ((E (F ((2 <= p1141))) OR ((2 <= p5349) OR (3 <= p4263) OR (p3071 <= 1))))) : E (F (((2 <= p2283) AND (2 <= p913))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (G (A (F ((3 <= p3817))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (3 <= p3817))))
lola: processed formula length: 37
lola: 8 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2 markings, 3 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (X ((3 <= p3692))) OR E (X ((1 <= p4644))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(AX((3 <= p3692))) AND NOT(EX((1 <= p4644))))))
lola: processed formula length: 64
lola: 4 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 513 markings, 513 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((3 <= p2782))) OR (1 <= p3876))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (EX((3 <= p2782)) OR (1 <= p3876)))
lola: processed formula length: 44
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 213 markings, 212 edges, 41 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 513 markings, 513 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((p3739 <= p2802) AND (3 <= p6014))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((p3739 <= p2802) AND (3 <= p6014))))))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 3 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2634 <= p4859) AND ((1 <= p4077) OR (p5446 <= p3357) OR (3 <= p5844) OR (p2271 <= p3325)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p4859 + 1 <= p2634) OR ((p4077 <= 0) AND (p3357 + 1 <= p5446) AND (p5844 <= 2) AND (p3325 + 1 <= p2271)))))
lola: processed formula length: 123
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p1664 <= p3712)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p1664 <= p3712)))
lola: processed formula: A (F ((p1664 <= p3712)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 5 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p5829 <= p2007)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r2000w0010-CTLCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r2000w0010-CTLCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 4010 markings, 9388 edges
lola: ========================================
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (X ((p2120 <= p5361))) AND ((p1617 <= p1265) AND ((p1953 <= p457) OR (2 <= p5011))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (AX((p2120 <= p5361)) AND ((p1617 <= p1265) AND ((p1953 <= p457) OR (2 <= p5011)))))
lola: processed formula length: 94
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (F ((p1147 <= p3495))) OR E (X ((2 <= p2444))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(E(TRUE U (p1147 <= p3495))) AND NOT(EX((2 <= p2444))))))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 122553 markings, 567880 edges, 3689329903141912576 markings/sec, 0 secs
lola: 235905 markings, 1156951 edges, 22670 markings/sec, 5 secs
lola: 348960 markings, 1738646 edges, 22611 markings/sec, 10 secs
lola: 458129 markings, 2300295 edges, 21834 markings/sec, 15 secs
lola: 570978 markings, 2929503 edges, 22570 markings/sec, 20 secs
lola: 682656 markings, 3561938 edges, 22336 markings/sec, 25 secs
lola: 800664 markings, 4184793 edges, 23602 markings/sec, 30 secs
lola: 913950 markings, 4813340 edges, 22657 markings/sec, 35 secs
lola: 1025228 markings, 5445289 edges, 22256 markings/sec, 40 secs
lola: 1137155 markings, 6041048 edges, 22385 markings/sec, 45 secs
lola: 1245855 markings, 6632213 edges, 21740 markings/sec, 50 secs
lola: 1351560 markings, 7227648 edges, 21141 markings/sec, 55 secs
lola: 1456427 markings, 7824003 edges, 20973 markings/sec, 60 secs
lola: 1559360 markings, 8420913 edges, 20587 markings/sec, 65 secs
lola: 1657199 markings, 9032116 edges, 19568 markings/sec, 70 secs
lola: 1756069 markings, 9639164 edges, 19774 markings/sec, 75 secs
lola: 1861224 markings, 10240003 edges, 21031 markings/sec, 80 secs
lola: 1963654 markings, 10857123 edges, 20486 markings/sec, 85 secs
lola: 1965291 markings, 10867900 edges, 327 markings/sec, 90 secs
lola: 1965403 markings, 10868652 edges, 22 markings/sec, 95 secs
lola: 1965570 markings, 10869685 edges, 33 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 486 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p5175 <= p3384)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p5175 <= p3384)))
lola: processed formula: A (F ((p5175 <= p3384)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 5 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: 2 markings, 2 edges
lola: ========================================
lola: subprocess 10 will run for 567 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p4560 <= 0) AND ((1 <= p5429) OR (1 <= p2752))) OR A (F ((1 <= p3919))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (((1 <= p4560) OR ((p5429 <= 0) AND (p2752 <= 0))) AND NOT(A(TRUE U (1 <= p3919))))))
lola: processed formula length: 99
lola: 4 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 2 markings, 3 edges
lola: ========================================
lola: subprocess 11 will run for 681 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X ((3 <= p5822))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((p5822 <= 2)))
lola: processed formula: A (X ((p5822 <= 2)))
lola: processed formula length: 20
lola: 3 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 4 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: 2011 markings, 2010 edges
lola: ========================================
lola: subprocess 12 will run for 851 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((E (F ((3 <= p3416))) AND ((1 <= p1728) OR (p3808 <= p3841) OR (p4246 + 1 <= p2834)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (E(TRUE U (3 <= p3416)) AND ((1 <= p1728) OR (p3808 <= p3841) OR (p4246 + 1 <= p2834))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 127427 markings, 255109 edges, 3096159597753270272 markings/sec, 0 secs
lola: 127690 markings, 505959 edges, 53 markings/sec, 5 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 127690 markings, 638962 edges
lola: ========================================
lola: subprocess 13 will run for 1131 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((p276 <= p1692) OR (p5968 <= p5536))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((p276 <= p1692) OR (p5968 <= p5536))))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 31962 markings, 98215 edges
lola: ========================================
lola: subprocess 14 will run for 1696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((E (F ((2 <= p1141))) OR ((2 <= p5349) OR (3 <= p4263) OR (p3071 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U (2 <= p1141))) AND ((p5349 <= 1) AND (p4263 <= 2) AND (2 <= p3071)))))
lola: processed formula length: 97
lola: 4 rewrites
lola: formula mentions 0 of 6020 places; total mentions: 0
lola: closed formula file RwMutex-PT-r2000w0010-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 31962 markings, 63960 edges
lola: ========================================
lola: subprocess 15 will run for 3392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2283) AND (2 <= p913))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 252 bytes per marking, with 6 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r2000w0010-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file RwMutex-PT-r2000w0010-CTLCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 4010 markings, 8018 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no yes yes unknown no no yes no yes yes no
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r2000w0010-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- 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="RwMutex-PT-r2000w0010"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r2000w0010.tgz
mv RwMutex-PT-r2000w0010 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 RwMutex-PT-r2000w0010, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r154-smll-152685551700171"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;