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 376K
-rw-r--r-- 1 mcc users 3.6K 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.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 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.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K 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.1K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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 195K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-structural
Input is RwMutex-PT-r0100w0010, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r155-smll-152685553000154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526986117452


BK_STOP 1526986163706

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using RwMutex-PT-r0100w0010 as instance name.
Using RwMutex as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', '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': 192, 'Memory': 112.66, 'Tool': 'lola'}, {'Time': 284, 'Memory': 110.56, 'Tool': 'lola'}, {'Time': 2400, 'Memory': 2207.31, 'Tool': 'marcie'}, {'Time': 2457, 'Memory': 157.84, 'Tool': 'gspn'}, {'Time': 2785, 'Memory': 2207.7, 'Tool': 'marcie'}, {'Time': 5586, 'Memory': 182.19, 'Tool': 'gspn'}, {'Time': 431805, 'Memory': 7481.93, 'Tool': 'itstools'}, {'Time': 435966, 'Memory': 7198.42, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola RwMutex-PT-r0100w0010...

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


checking for too many tokens
===========================================================================================
RwMutex-PT-r0100w0010: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ RwMutex-PT-r0100w0010 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 540/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 320 places, 220 transitions, 110 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 211 transition conflict sets
lola: TASK
lola: reading formula from RwMutex-PT-r0100w0010-ReachabilityFireability.task
lola: A (G ((FIREABLE(t41) OR FIREABLE(t119) OR FIREABLE(t120) OR NOT FIREABLE(t63) OR FIREABLE(t67)))) : E (F ((FIREABLE(t181) AND FIREABLE(t108) AND (FIREABLE(t146) OR FIREABLE(t175)) AND NOT FIREABLE(t38) AND NOT FIREABLE(t1) AND (FIREABLE(t10) OR FIREABLE(t159) OR NOT FIREABLE(t208) OR (NOT FIREABLE(t46) AND NOT FIREABLE(t122)))))) : E (F (((FIREABLE(t146) OR FIREABLE(t181) OR NOT FIREABLE(t2)) AND FIREABLE(t169) AND FIREABLE(t194) AND FIREABLE(t75)))) : E (F ((NOT FIREABLE(t39) AND ((FIREABLE(t11) AND FIREABLE(t209)) OR (FIREABLE(t144) AND FIREABLE(t178))) AND FIREABLE(t91)))) : E (F ((FIREABLE(t104) AND FIREABLE(t93) AND FIREABLE(t51) AND FIREABLE(t131) AND FIREABLE(t54) AND (FIREABLE(t27) OR FIREABLE(t114)) AND FIREABLE(t50)))) : E (F (((NOT FIREABLE(t64) OR NOT FIREABLE(t176)) AND NOT FIREABLE(t22) AND FIREABLE(t156)))) : A (G ((FIREABLE(t55) OR (NOT FIREABLE(t127) AND NOT FIREABLE(t166)) OR (NOT FIREABLE(t219) AND FIREABLE(t7))))) : E (F ((NOT FIREABLE(t180) AND (NOT FIREABLE(t174) OR NOT FIREABLE(t154)) AND FIREABLE(t138) AND FIREABLE(t149) AND FIREABLE(t133) AND FIREABLE(t42) AND (FIREABLE(t50) OR FIREABLE(t106) OR FIREABLE(t10) OR FIREABLE(t92))))) : A (G (())) : A (G ((FIREABLE(t67) OR FIREABLE(t119) OR FIREABLE(t205) OR NOT FIREABLE(t185)))) : E (F ((FIREABLE(t83) AND NOT FIREABLE(t91) AND NOT FIREABLE(t56)))) : E (F ((NOT FIREABLE(t63) AND FIREABLE(t52) AND (FIREABLE(t19) OR (FIREABLE(t150) AND FIREABLE(t35))) AND FIREABLE(t180)))) : E (F ((NOT FIREABLE(t93) AND (NOT FIREABLE(t163) OR NOT FIREABLE(t180)) AND FIREABLE(t106)))) : A (G ((FIREABLE(t198) OR NOT FIREABLE(t54) OR NOT FIREABLE(t164) OR NOT FIREABLE(t131) OR FIREABLE(t12)))) : E (F ((FIREABLE(t158) AND FIREABLE(t214) AND FIREABLE(t92) AND (NOT FIREABLE(t24) OR NOT FIREABLE(t86) OR (FIREABLE(t12) AND NOT FIREABLE(t160)))))) : E (F ((NOT FIREABLE(t11) AND NOT FIREABLE(t29) AND FIREABLE(t201) AND FIREABLE(t95))))
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 (G ((FIREABLE(t41) OR FIREABLE(t119) OR FIREABLE(t120) OR NOT FIREABLE(t63) OR FIREABLE(t67))))
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 16 bytes per marking, with 18 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 24 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t181) AND FIREABLE(t108) AND (FIREABLE(t146) OR FIREABLE(t175)) AND NOT FIREABLE(t38) AND NOT FIREABLE(t1) AND (FIREABLE(t10) OR FIREABLE(t159) OR NOT FIREABLE(t208) OR (NOT FIREABLE(t46) AND NOT FIREABLE(t122))))))
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 16 bytes per marking, with 18 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 852 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 112 markings, 223 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t146) OR FIREABLE(t181) OR NOT FIREABLE(t2)) AND FIREABLE(t169) AND FIREABLE(t194) AND FIREABLE(t75))))
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 16 bytes per marking, with 18 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-2.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t39) AND ((FIREABLE(t11) AND FIREABLE(t209)) OR (FIREABLE(t144) AND FIREABLE(t178))) AND FIREABLE(t91))))
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 16 bytes per marking, with 18 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 22 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t104) AND FIREABLE(t93) AND FIREABLE(t51) AND FIREABLE(t131) AND FIREABLE(t54) AND (FIREABLE(t27) OR FIREABLE(t114)) AND FIREABLE(t50))))
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 16 bytes per marking, with 18 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 223 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 112 markings, 222 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t64) OR NOT FIREABLE(t176)) AND NOT FIREABLE(t22) AND FIREABLE(t156))))
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 16 bytes per marking, with 18 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-5.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t55) OR (NOT FIREABLE(t127) AND NOT FIREABLE(t166)) OR (NOT FIREABLE(t219) AND FIREABLE(t7)))))
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 16 bytes per marking, with 18 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 36 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t180) AND (NOT FIREABLE(t174) OR NOT FIREABLE(t154)) AND FIREABLE(t138) AND FIREABLE(t149) AND FIREABLE(t133) AND FIREABLE(t42) AND (FIREABLE(t50) OR FIREABLE(t106) OR FIREABLE(t10) OR FIREABLE(t92)))))
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 16 bytes per marking, with 18 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 270 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-7.sara
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 320 places; total mentions: 0
lola: closed formula file RwMutex-PT-r0100w0010-ReachabilityFireability.task
lola: processed formula with 0 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t67) OR FIREABLE(t119) OR FIREABLE(t205) OR NOT FIREABLE(t185))))
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 16 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t83) AND NOT FIREABLE(t91) AND NOT FIREABLE(t56))))
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 16 bytes per marking, with 18 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 16 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t63) AND FIREABLE(t52) AND (FIREABLE(t19) OR (FIREABLE(t150) AND FIREABLE(t35))) AND FIREABLE(t180))))
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 16 bytes per marking, with 18 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 26 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
sara: try reading problem file RwMutex-PT-r0100w0010-ReachabilityFireability-9.sara.
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t93) AND (NOT FIREABLE(t163) OR NOT FIREABLE(t180)) AND FIREABLE(t106))))
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 16 bytes per marking, with 18 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 206 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 111 markings, 220 edges
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t198) OR NOT FIREABLE(t54) OR NOT FIREABLE(t164) OR NOT FIREABLE(t131) OR FIREABLE(t12))))
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 16 bytes per marking, with 18 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 12 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 411 markings, 821 edges
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t158) AND FIREABLE(t214) AND FIREABLE(t92) AND (NOT FIREABLE(t24) OR NOT FIREABLE(t86) OR (FIREABLE(t12) AND NOT FIREABLE(t160))))))
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 16 bytes per marking, with 18 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 27 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 178 markings, 354 edges
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t11) AND NOT FIREABLE(t29) AND FIREABLE(t201) AND FIREABLE(t95))))
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 16 bytes per marking, with 18 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 20 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: state equation: write sara problem file to RwMutex-PT-r0100w0010-ReachabilityFireability-15.sara
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no yes no yes yes no yes yes no yes no yes
sara: place or transition ordering is non-deterministic

FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RwMutex-PT-r0100w0010-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="RwMutex-PT-r0100w0010"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="mcc4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r0100w0010.tgz
mv RwMutex-PT-r0100w0010 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-structural"
echo " Input is RwMutex-PT-r0100w0010, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r155-smll-152685553000154"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;