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 264K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K 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.4K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K 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.8K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K 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.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 22K 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 9 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 92K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is Solitaire-PT-FrnCT7x7, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-152705516900154
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527085741103


BK_STOP 1527085965894

--------------------
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 Solitaire-PT-FrnCT7x7 as instance name.
Using Solitaire 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': None, 'Source Place': None, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': None, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': None, 'Deadlock': True, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 5974, 'Memory': 143.67, 'Tool': 'lola'}, {'Time': 6263, 'Memory': 141.32, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
ReachabilityFireability lola Solitaire-PT-FrnCT7x7...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Solitaire-PT-FrnCT7x7: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
ReachabilityFireability @ Solitaire-PT-FrnCT7x7 @ 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: 167/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 75 places, 92 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 93 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-FrnCT7x7-ReachabilityFireability.task
lola: E (F ((NOT FIREABLE(right25) AND NOT FIREABLE(right34) AND NOT FIREABLE(left45) AND FIREABLE(right63) AND FIREABLE(left23)))) : A (G ((FIREABLE(right44) OR (NOT FIREABLE(left63) AND NOT FIREABLE(right33)) OR FIREABLE(up36) OR FIREABLE(down41) OR NOT FIREABLE(down54) OR NOT FIREABLE(right54) OR NOT FIREABLE(right23)))) : E (F ((FIREABLE(down32) AND FIREABLE(left45) AND (FIREABLE(up42) OR FIREABLE(left25))))) : E (F ((FIREABLE(left35) AND FIREABLE(down23) AND FIREABLE(left14) AND FIREABLE(up65)))) : E (F ((NOT FIREABLE(left64) AND NOT FIREABLE(right63) AND FIREABLE(up53) AND FIREABLE(up63) AND FIREABLE(up56) AND FIREABLE(down53) AND (NOT FIREABLE(right74) OR NOT FIREABLE(left53) OR (FIREABLE(left14) AND NOT FIREABLE(right34)))))) : E (F ((FIREABLE(right44) AND FIREABLE(down32) AND FIREABLE(right64) AND FIREABLE(down45) AND NOT FIREABLE(down52) AND (NOT FIREABLE(left33) OR NOT FIREABLE(up41) OR (FIREABLE(left65) AND FIREABLE(up23) AND (FIREABLE(up23) OR FIREABLE(left23))))))) : E (F ((FIREABLE(up64) AND FIREABLE(right54) AND (NOT FIREABLE(down24) OR NOT FIREABLE(down65)) AND FIREABLE(up47) AND FIREABLE(up25)))) : A (G ((FIREABLE(left52) OR FIREABLE(up56) OR NOT FIREABLE(right36) OR (FIREABLE(down45) AND FIREABLE(up53) AND FIREABLE(down52) AND FIREABLE(down41)) OR FIREABLE(down45) OR (FIREABLE(down63) AND FIREABLE(left52)) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up47))))) : A (G (((NOT FIREABLE(up23) OR NOT FIREABLE(right65)) AND FIREABLE(left53) AND (NOT FIREABLE(right32) OR NOT FIREABLE(up64) OR NOT FIREABLE(down34) OR (FIREABLE(down32) AND FIREABLE(left14)))))) : A (G (FIREABLE(up45))) : E (F (FIREABLE(up44))) : E (F ((((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(right43) OR FIREABLE(left14)) AND (NOT FIREABLE(up34) OR NOT FIREABLE(right74))) OR FIREABLE(right23)))) : E (F (FIREABLE(down36))) : A (G ((NOT FIREABLE(left64) OR NOT FIREABLE(down41)))) : E (F (((NOT FIREABLE(right56) AND NOT FIREABLE(right45) AND ((FIREABLE(up52) AND FIREABLE(left53)) OR (FIREABLE(right53) AND FIREABLE(down24)))) OR (FIREABLE(down54) AND FIREABLE(left55) AND FIREABLE(right42) AND FIREABLE(up45) AND (FIREABLE(down36) OR FIREABLE(down35) OR (FIREABLE(left56) AND FIREABLE(down46))))))) : E (F ((NOT FIREABLE(left56) AND NOT FIREABLE(down24) AND (NOT FIREABLE(down23) OR NOT FIREABLE(up25)) AND NOT FIREABLE(left63))))
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 ((NOT FIREABLE(right25) AND NOT FIREABLE(right34) AND NOT FIREABLE(left45) AND FIREABLE(right63) AND FIREABLE(left23))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: state equation: Generated DNF with 198 literals and 18 conjunctive subformulas
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(right44) OR (NOT FIREABLE(left63) AND NOT FIREABLE(right33)) OR FIREABLE(up36) OR FIREABLE(down41) OR NOT FIREABLE(down54) OR NOT FIREABLE(right54) OR NOT FIREABLE(right23))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1026 literals and 54 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(down32) AND FIREABLE(left45) AND (FIREABLE(up42) OR FIREABLE(left25)))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8 markings, 7 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(left35) AND FIREABLE(down23) AND FIREABLE(left14) AND FIREABLE(up65))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 16 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(left64) AND NOT FIREABLE(right63) AND FIREABLE(up53) AND FIREABLE(up63) AND FIREABLE(up56) AND FIREABLE(down53) AND (NOT FIREABLE(right74) OR NOT FIREABLE(left53) OR (FIREABLE(left14) AND NOT FIREABLE(right34))))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 580 literals and 28 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(right44) AND FIREABLE(down32) AND FIREABLE(right64) AND FIREABLE(down45) AND NOT FIREABLE(down52) AND (NOT FIREABLE(left33) OR NOT FIREABLE(up41) OR (FIREABLE(left65) AND FIREABLE(up23) AND (FIREABLE(up23) OR FIREABLE(left23)))))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 11 markings, 10 edges
lola: state equation: Generated DNF with 444 literals and 21 conjunctive subformulas
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(up64) AND FIREABLE(right54) AND (NOT FIREABLE(down24) OR NOT FIREABLE(down65)) AND FIREABLE(up47) AND FIREABLE(up25))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 102 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 23129 markings, 73671 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(left52) OR FIREABLE(up56) OR NOT FIREABLE(right36) OR (FIREABLE(down45) AND FIREABLE(up53) AND FIREABLE(down52) AND FIREABLE(down41)) OR FIREABLE(down45) OR (FIREABLE(down63) AND FIREABLE(left52)) OR (NOT FIREABLE(down47) AND NOT FIREABLE(up47)))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 30888 literals and 2376 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 492782 markings, 2076717 edges, 98556 markings/sec, 0 secs
lola: sara is running 5 secs || 951722 markings, 4246279 edges, 91788 markings/sec, 5 secs
lola: sara is running 10 secs || 1390269 markings, 6361825 edges, 87709 markings/sec, 10 secs
lola: sara is running 15 secs || 1798117 markings, 8496620 edges, 81570 markings/sec, 15 secs
lola: sara is running 20 secs || 2220749 markings, 10686654 edges, 84526 markings/sec, 20 secs
lola: sara is running 25 secs || 2662850 markings, 12851240 edges, 88420 markings/sec, 25 secs
lola: sara is running 30 secs || 3076777 markings, 14988296 edges, 82785 markings/sec, 30 secs
lola: sara is running 35 secs || 3481102 markings, 17097207 edges, 80865 markings/sec, 35 secs
lola: sara is running 40 secs || 3872655 markings, 19242898 edges, 78311 markings/sec, 40 secs
sara: warning, failure of lp_solve (at job 31)
lola: sara is running 45 secs || 4271340 markings, 21480636 edges, 79737 markings/sec, 45 secs
lola: sara is running 50 secs || 4690465 markings, 23581216 edges, 83825 markings/sec, 50 secs
lola: sara is running 55 secs || 5096701 markings, 25820289 edges, 81247 markings/sec, 55 secs
lola: sara is running 60 secs || 5489654 markings, 28061003 edges, 78591 markings/sec, 60 secs
lola: sara is running 65 secs || 5874745 markings, 30230535 edges, 77018 markings/sec, 65 secs
lola: sara is running 70 secs || 6247126 markings, 32351822 edges, 74476 markings/sec, 70 secs
lola: sara is running 75 secs || 6687335 markings, 34390407 edges, 88042 markings/sec, 75 secs
lola: sara is running 80 secs || 7098603 markings, 36483348 edges, 82254 markings/sec, 80 secs
lola: sara is running 85 secs || 7524723 markings, 38611172 edges, 85224 markings/sec, 85 secs
lola: sara is running 90 secs || 7930825 markings, 40839355 edges, 81220 markings/sec, 90 secs
lola: sara is running 95 secs || 8314376 markings, 43010701 edges, 76710 markings/sec, 95 secs
lola: sara is running 100 secs || 8707164 markings, 45140245 edges, 78558 markings/sec, 100 secs
lola: sara is running 105 secs || 9082374 markings, 47318906 edges, 75042 markings/sec, 105 secs
lola: sara is running 110 secs || 9460113 markings, 49556806 edges, 75548 markings/sec, 110 secs
lola: sara is running 115 secs || 9849959 markings, 51698828 edges, 77969 markings/sec, 115 secs
lola: sara is running 120 secs || 10217631 markings, 53837167 edges, 73534 markings/sec, 120 secs
lola: sara is running 125 secs || 10589318 markings, 55924415 edges, 74337 markings/sec, 125 secs
lola: sara is running 130 secs || 10958919 markings, 58008758 edges, 73920 markings/sec, 130 secs
lola: sara is running 135 secs || 11284325 markings, 60083073 edges, 65081 markings/sec, 135 secs
lola: sara is running 140 secs || 11650218 markings, 62224733 edges, 73179 markings/sec, 140 secs
lola: sara is running 145 secs || 12076663 markings, 64403954 edges, 85289 markings/sec, 145 secs
sara: warning, failure of lp_solve (at job 11)
lola: sara is running 150 secs || 12454300 markings, 66617181 edges, 75527 markings/sec, 150 secs
lola: sara is running 155 secs || 12797554 markings, 68875376 edges, 68651 markings/sec, 155 secs
lola: sara is running 160 secs || 13148518 markings, 71090024 edges, 70193 markings/sec, 160 secs
lola: sara is running 165 secs || 13498522 markings, 73294068 edges, 70001 markings/sec, 165 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 420 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(up23) OR NOT FIREABLE(right65)) AND FIREABLE(left53) AND (NOT FIREABLE(right32) OR NOT FIREABLE(up64) OR NOT FIREABLE(down34) OR (FIREABLE(down32) AND FIREABLE(left14))))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 77 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 9 will run for 480 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(up45)))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 4 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-9.sara
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 560 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(up44)))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 11 will run for 672 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((FIREABLE(down33) OR FIREABLE(down32) OR FIREABLE(right43) OR FIREABLE(left14)) AND (NOT FIREABLE(up34) OR NOT FIREABLE(right74))) OR FIREABLE(right23))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 124 literals and 25 conjunctive subformulas
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 12 will run for 840 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(down36)))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1120 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(left64) OR NOT FIREABLE(down41))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-FrnCT7x7-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-12.sara.
sara: try reading problem file Solitaire-PT-FrnCT7x7-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 14 will run for 1680 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(right56) AND NOT FIREABLE(right45) AND ((FIREABLE(up52) AND FIREABLE(left53)) OR (FIREABLE(right53) AND FIREABLE(down24)))) OR (FIREABLE(down54) AND FIREABLE(left55) AND FIREABLE(right42) AND FIREABLE(up45) AND (FIREABLE(down36) OR FIREABLE(down35) OR (FIREABLE(left56) AND FIREABLE(down46)))))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 10 markings, 9 edges
lola: state equation: Generated DNF with 244 literals and 21 conjunctive subformulas
lola: ========================================

lola: subprocess 15 will run for 3361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(left56) AND NOT FIREABLE(down24) AND (NOT FIREABLE(down23) OR NOT FIREABLE(up25)) AND NOT FIREABLE(left63))))
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 148 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes no no yes yes no no no yes yes yes no yes yes
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-FrnCT7x7-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Solitaire-PT-FrnCT7x7"
export BK_EXAMINATION="ReachabilityFireability"
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/Solitaire-PT-FrnCT7x7.tgz
mv Solitaire-PT-FrnCT7x7 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 Solitaire-PT-FrnCT7x7, 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 r166-smll-152705516900154"
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 ;