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 244K
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 28K 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.3K 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 10K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K 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.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 2 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 46K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is LamportFastMutEx-PT-2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-csrt-152666472200112
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527139113753


BK_STOP 1527139157289

--------------------
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 LamportFastMutEx-PT-2 as instance name.
Using LamportFastMutEx as model name.
Using algorithm or tool decision-tree.
Model characteristics are: {'Examination': 'ReachabilityFireability', 'Place/Transition': True, 'Colored': True, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': True, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': False, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': True, 'Deadlock': False, 'Reversible': False, 'Quasi Live': False, 'Live': False}.
Known tools are: [{'Time': 126, 'Memory': 110.64, 'Tool': 'lola'}, {'Time': 243, 'Memory': 111.05, 'Tool': 'lola'}, {'Time': 930, 'Memory': 106, 'Tool': 'gspn'}, {'Time': 1752, 'Memory': 2012.99, 'Tool': 'marcie'}, {'Time': 1835, 'Memory': 1958.74, 'Tool': 'marcie'}, {'Time': 2563, 'Memory': 245.2, 'Tool': 'itstools'}, {'Time': 2613, 'Memory': 244.66, 'Tool': 'itstools'}, {'Time': 2769, 'Memory': 166.23, 'Tool': 'gspn'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola LamportFastMutEx-PT-2...

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


checking for too many tokens
===========================================================================================
LamportFastMutEx-PT-2: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
ReachabilityFireability @ LamportFastMutEx-PT-2 @ 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: 165/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 69 places, 96 transitions, 52 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 137 transition conflict sets
lola: TASK
lola: reading formula from LamportFastMutEx-PT-2-ReachabilityFireability.task
lola: E (F ((FIREABLE(T-fordo_12_1) OR FIREABLE(T-fordo_12_2) OR FIREABLE(T-fordo_12_3)))) : E (F ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9)))) : A (G ((NOT FIREABLE(T-xeqi_10_1) AND NOT FIREABLE(T-xeqi_10_5) AND NOT FIREABLE(T-xeqi_10_9)))) : A (G (((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3) OR FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3)) AND ((NOT FIREABLE(T-await_13_1) AND NOT FIREABLE(T-await_13_2) AND NOT FIREABLE(T-await_13_3) AND NOT FIREABLE(T-await_13_4) AND NOT FIREABLE(T-await_13_5) AND NOT FIREABLE(T-await_13_6) AND NOT FIREABLE(T-await_13_7) AND NOT FIREABLE(T-await_13_8) AND NOT FIREABLE(T-await_13_9)) OR (NOT FIREABLE(T-setbi_24_1) AND NOT FIREABLE(T-setbi_24_2) AND NOT FIREABLE(T-setbi_24_3) AND NOT FIREABLE(T-setbi_24_4) AND NOT FIREABLE(T-setbi_24_5) AND NOT FIREABLE(T-setbi_24_6)) OR (NOT FIREABLE(T-fordo_12_1) AND NOT FIREABLE(T-fordo_12_2) AND NOT FIREABLE(T-fordo_12_3) AND NOT FIREABLE(T-await_13_1) AND NOT FIREABLE(T-await_13_2) AND NOT FIREABLE(T-await_13_3) AND NOT FIREABLE(T-await_13_4) AND NOT FIREABLE(T-await_13_5) AND NOT FIREABLE(T-await_13_6) AND NOT FIREABLE(T-await_13_7) AND NOT FIREABLE(T-await_13_8) AND NOT FIREABLE(T-await_13_9)))))) : E (F ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3)))) : E (F (((FIREABLE(T-xnei_10_2) OR FIREABLE(T-xnei_10_3) OR FIREABLE(T-xnei_10_4) OR FIREABLE(T-xnei_10_6) OR FIREABLE(T-xnei_10_7) OR FIREABLE(T-xnei_10_8)) AND (FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9)) AND (FIREABLE(T-ynei_15_2) OR FIREABLE(T-ynei_15_3) OR FIREABLE(T-ynei_15_4) OR FIREABLE(T-ynei_15_6) OR FIREABLE(T-ynei_15_7) OR FIREABLE(T-ynei_15_8) OR FIREABLE(T-setbi_2_1) OR FIREABLE(T-setbi_2_2) OR FIREABLE(T-setbi_2_3) OR FIREABLE(T-setbi_2_4) OR FIREABLE(T-setbi_2_5) OR FIREABLE(T-setbi_2_6)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3)) AND (FIREABLE(T-setbi_2_1) OR FIREABLE(T-setbi_2_2) OR FIREABLE(T-setbi_2_3) OR FIREABLE(T-setbi_2_4) OR FIREABLE(T-setbi_2_5) OR FIREABLE(T-setbi_2_6))))) : A (G ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3)))) : E (F ((FIREABLE(T-yeqi_15_1) OR FIREABLE(T-yeqi_15_5) OR FIREABLE(T-yeqi_15_9)))) : E (F ((NOT FIREABLE(T-sety0_23_1) AND (NOT FIREABLE(T-setbi_11_6) OR NOT FIREABLE(T-setbi_5_6)) AND (NOT FIREABLE(T-setbi_5_1) OR FIREABLE(T-setbi_11_1)) AND FIREABLE(T-xnei_10_3)))) : E (F (NOT FIREABLE(T-xnei_10_6))) : A (G (((FIREABLE(T-xeqi_10_9) AND FIREABLE(T-sety0_23_5) AND FIREABLE(T-setx_3_5) AND FIREABLE(T-sety0_23_4) AND FIREABLE(T-yeqi_15_5)) OR (NOT FIREABLE(T-ynei_15_8) AND NOT FIREABLE(T-sety0_23_7) AND NOT FIREABLE(T-await_13_7) AND NOT FIREABLE(T-ynei_15_7))))) : A (G (((FIREABLE(T-sety0_23_1) OR FIREABLE(T-sety0_23_4)) AND (FIREABLE(T-setx_3_5) OR FIREABLE(T-setbi_11_1)) AND (FIREABLE(T-setx_3_8) OR (FIREABLE(T-forod_13_1) AND FIREABLE(T-setx_3_1))) AND NOT FIREABLE(T-setbi_2_5) AND FIREABLE(T-await_13_5) AND (NOT FIREABLE(T-setbi_5_2) OR NOT FIREABLE(T-setbi_2_3))))) : E (F (FIREABLE(T-setbi_11_1))) : E (F ((FIREABLE(T-setbi_11_5) OR FIREABLE(T-ynei_15_6) OR (NOT FIREABLE(T-sety0_23_1) AND NOT FIREABLE(T-sety_9_2)) OR (NOT FIREABLE(T-xnei_10_2) AND NOT FIREABLE(T-sety_9_3))))) : A (G ((((NOT FIREABLE(T-setbi_2_1) OR NOT FIREABLE(T-setx_3_5)) AND NOT FIREABLE(T-xeqi_10_9)) OR NOT FIREABLE(T-yne0_4_9)))) : A (G (((FIREABLE(T-ynei_15_3) AND FIREABLE(T-sety0_23_6)) OR NOT FIREABLE(T-setbi_5_3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-fordo_12_1) OR FIREABLE(T-fordo_12_2) OR FIREABLE(T-fordo_12_3))))
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 8 bytes per marking, with 12 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 3 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9))))
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 8 bytes per marking, with 12 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 9 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(T-xeqi_10_1) AND NOT FIREABLE(T-xeqi_10_5) AND NOT FIREABLE(T-xeqi_10_9))))
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 8 bytes per marking, with 12 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 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityFireability-2.sara
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T-awaity_1) OR FIREABLE(T-awaity_2) OR FIREABLE(T-awaity_3) OR FIREABLE(T-sety_9_1) OR FIREABLE(T-sety_9_2) OR FIREABLE(T-sety_9_3) OR FIREABLE(T-sety_9_4) OR FIREABLE(T-sety_9_5) OR FIREABLE(T-sety_9_6) OR FIREABLE(T-sety_9_7) OR FIREABLE(T-sety_9_8) OR FIREABLE(T-sety_9_9)) AND (FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3)) AND ((NOT FIREABLE... (shortened)
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 8 bytes per marking, with 12 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
sara: try reading problem file LamportFastMutEx-PT-2-ReachabilityFireability.sara.
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 8 bytes per marking, with 12 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 6 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityFireability-4.sara
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(T-xnei_10_2) OR FIREABLE(T-xnei_10_3) OR FIREABLE(T-xnei_10_4) OR FIREABLE(T-xnei_10_6) OR FIREABLE(T-xnei_10_7) OR FIREABLE(T-xnei_10_8)) AND (FIREABLE(T-xeqi_10_1) OR FIREABLE(T-xeqi_10_5) OR FIREABLE(T-xeqi_10_9)) AND (FIREABLE(T-ynei_15_2) OR FIREABLE(T-ynei_15_3) OR FIREABLE(T-ynei_15_4) OR FIREABLE(T-ynei_15_6) OR FIREABLE(T-ynei_15_7) OR FIREABLE(T-ynei_15_8) OR... (shortened)
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 8 bytes per marking, with 12 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 unreachable.
lola: 370 markings, 656 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(T-yeq0_4_1) OR FIREABLE(T-yeq0_4_2) OR FIREABLE(T-yeq0_4_3))))
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 8 bytes per marking, with 12 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 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-yeqi_15_1) OR FIREABLE(T-yeqi_15_5) OR FIREABLE(T-yeqi_15_9))))
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 8 bytes per marking, with 12 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 81 markings, 96 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(T-sety0_23_1) AND (NOT FIREABLE(T-setbi_11_6) OR NOT FIREABLE(T-setbi_5_6)) AND (NOT FIREABLE(T-setbi_5_1) OR FIREABLE(T-setbi_11_1)) AND FIREABLE(T-xnei_10_3))))
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 8 bytes per marking, with 12 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 128 literals and 24 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 364 markings, 642 edges
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityFireability-8.sara
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(T-xnei_10_6)))
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 8 bytes per marking, with 12 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T-xeqi_10_9) AND FIREABLE(T-sety0_23_5) AND FIREABLE(T-setx_3_5) AND FIREABLE(T-sety0_23_4) AND FIREABLE(T-yeqi_15_5)) OR (NOT FIREABLE(T-ynei_15_8) AND NOT FIREABLE(T-sety0_23_7) AND NOT FIREABLE(T-await_13_7) AND NOT FIREABLE(T-ynei_15_7)))))
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 8 bytes per marking, with 12 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: 290 markings, 443 edges
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T-sety0_23_1) OR FIREABLE(T-sety0_23_4)) AND (FIREABLE(T-setx_3_5) OR FIREABLE(T-setbi_11_1)) AND (FIREABLE(T-setx_3_8) OR (FIREABLE(T-forod_13_1) AND FIREABLE(T-setx_3_1))) AND NOT FIREABLE(T-setbi_2_5) AND FIREABLE(T-await_13_5) AND (NOT FIREABLE(T-setbi_5_2) OR NOT FIREABLE(T-setbi_2_3)))))
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 8 bytes per marking, with 12 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: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(T-setbi_11_1)))
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 8 bytes per marking, with 12 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 1 markings, 0 edges
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityFireability-12.sara
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(T-setbi_11_5) OR FIREABLE(T-ynei_15_6) OR (NOT FIREABLE(T-sety0_23_1) AND NOT FIREABLE(T-sety_9_2)) OR (NOT FIREABLE(T-xnei_10_2) AND NOT FIREABLE(T-sety_9_3)))))
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 8 bytes per marking, with 12 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: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(T-setbi_2_1) OR NOT FIREABLE(T-setx_3_5)) AND NOT FIREABLE(T-xeqi_10_9)) OR NOT FIREABLE(T-yne0_4_9))))
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 8 bytes per marking, with 12 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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to LamportFastMutEx-PT-2-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 370 markings, 658 edges
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(T-ynei_15_3) AND FIREABLE(T-sety0_23_6)) OR NOT FIREABLE(T-setbi_5_3))))
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 8 bytes per marking, with 12 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: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: 370 markings, 666 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no yes no no yes no yes no no no yes yes yes
lola: ========================================
lola: state equation: calling and running sara
sara: try reading problem file LamportFastMutEx-PT-2-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic

sara: warning, failure of lp_solve (at job 5592)
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA LamportFastMutEx-PT-2-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="LamportFastMutEx-PT-2"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="irma4mcc-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/LamportFastMutEx-PT-2.tgz
mv LamportFastMutEx-PT-2 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 irma4mcc-full"
echo " Input is LamportFastMutEx-PT-2, 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 r114-csrt-152666472200112"
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 ;