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 240K
-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 19K 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 2.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 112 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 350 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.1K 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 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 69K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is Solitaire-PT-EngNC7x7, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r162-smll-152705514000144
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527063250154


BK_STOP 1527063801197

--------------------
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-EngNC7x7 as instance name.
Using Solitaire as model name.
Using algorithm or tool voting-classifier.
Model characteristics are: {'Examination': 'CTLFireability', '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}.
/usr/local/lib/python3.6/dist-packages/sklearn/preprocessing/label.py:151: DeprecationWarning: The truth value of an empty array is ambiguous. Returning False, but in future this will result in an error. Use `array.size > 0` to check that an array is not empty.
if diff:
Known tools are: [{'Time': 570475, 'Memory': 2517.69, 'Tool': 'lola'}, {'Time': 570571, 'Memory': 2529.97, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola Solitaire-PT-EngNC7x7...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
Solitaire-PT-EngNC7x7: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLFireability @ Solitaire-PT-EngNC7x7 @ 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: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 66 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 152 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngNC7x7-CTLFireability.task
lola: ((A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23)))) AND NOT(A (G (NOT FIREABLE(right44))))) OR (FIREABLE(left56) AND E (F (FIREABLE(left74))))) : NOT(((E (G ((FIREABLE(up54) OR FIREABLE(right45)))) OR (A (F (FIREABLE(up41))) AND (FIREABLE(left52) OR NOT FIREABLE(up54)))) AND E (F (A (G (FIREABLE(down45))))))) : A ((E (X (NOT FIREABLE(right55))) U ((FIREABLE(up65) OR FIREABLE(right74)) OR A (X (FIREABLE(up23)))))) : ((A (G (A (F (FIREABLE(down41))))) OR (A (G ((FIREABLE(up45) AND FIREABLE(up65)))) AND E (G ((FIREABLE(left52) OR FIREABLE(down23)))))) AND NOT(A (G ((NOT FIREABLE(right45) OR NOT FIREABLE(down41)))))) : A (F (FIREABLE(left55))) : NOT(E (G (((NOT FIREABLE(right56) OR NOT FIREABLE(left64)) OR A (G (FIREABLE(left74))))))) : A (F (((NOT FIREABLE(left55) AND NOT FIREABLE(down23) AND (NOT FIREABLE(left32) OR NOT FIREABLE(right64))) AND (E (G (FIREABLE(left56))) OR A (F (FIREABLE(left56))))))) : A ((A (F ((FIREABLE(right53) OR FIREABLE(down46)))) U A (G (NOT FIREABLE(left24))))) : NOT(E (G ((NOT FIREABLE(right56) OR FIREABLE(left52) OR FIREABLE(down35) OR NOT FIREABLE(up47))))) : A (G (E (F ((NOT FIREABLE(right33) OR NOT FIREABLE(left24)))))) : ((A (F (FIREABLE(down23))) AND E (G (E (F (FIREABLE(down41)))))) AND ((E ((FIREABLE(up47) U FIREABLE(left34))) OR ((FIREABLE(down33) OR FIREABLE(right35) OR NOT FIREABLE(right53)) AND E (X (FIREABLE(up53))))) OR E (G (NOT FIREABLE(up43))))) : A (X (E (F (FIREABLE(left46))))) : A (F (FIREABLE(up25))) : ((A (F (A (F (FIREABLE(up34))))) OR FIREABLE(left46)) AND A (F (E (G (NOT FIREABLE(right74)))))) : E (((E (X (FIREABLE(left45))) OR (FIREABLE(up25) AND FIREABLE(down44) AND FIREABLE(left74))) U (((FIREABLE(right24) AND FIREABLE(right56)) OR NOT FIREABLE(up23)) AND A (F (FIREABLE(up44)))))) : NOT(A ((A (G (FIREABLE(down24))) U A (F (FIREABLE(down41))))))
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 (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23)))) AND NOT(A (G (NOT FIREABLE(right44))))) OR (FIREABLE(left56) AND E (F (FIREABLE(left74)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23))))
lola: processed formula: A (F ((FIREABLE(up25) OR FIREABLE(left54) OR FIREABLE(down45) OR FIREABLE(up23))))
lola: processed formula length: 85
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 45 markings, 48 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(left56)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(left56)
lola: processed formula length: 16
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((FIREABLE(up54) OR FIREABLE(right45)))) OR (A (F (FIREABLE(up41))) AND (FIREABLE(left52) OR NOT FIREABLE(up54)))) AND E (F (A (G (FIREABLE(down45)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(up54) AND NOT FIREABLE(right45))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(up54) AND NOT FIREABLE(right45))))
lola: processed formula: A (F ((NOT FIREABLE(up54) AND NOT FIREABLE(right45))))
lola: processed formula length: 54
lola: 15 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(up41)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(up41)))
lola: processed formula length: 29
lola: 17 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (X (NOT FIREABLE(right55))) U ((FIREABLE(up65) OR FIREABLE(right74)) OR A (X (FIREABLE(up23))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX(NOT FIREABLE(right55)) U ((FIREABLE(up65) OR FIREABLE(right74)) OR AX(FIREABLE(up23))))
lola: processed formula length: 93
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 36 markings, 39 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (A (F (FIREABLE(down41))))) OR (A (G ((FIREABLE(up45) AND FIREABLE(up65)))) AND E (G ((FIREABLE(left52) OR FIREABLE(down23)))))) AND NOT(A (G ((NOT FIREABLE(right45) OR NOT FIREABLE(down41))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (FIREABLE(down41)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U FIREABLE(down41)))))
lola: processed formula length: 46
lola: 5 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(up45) AND FIREABLE(up65))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(left55)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(left55)))
lola: processed formula: A (F (FIREABLE(left55)))
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (((NOT FIREABLE(right56) OR NOT FIREABLE(left64)) OR A (G (FIREABLE(left74)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((FIREABLE(right56) AND FIREABLE(left64)) AND E(TRUE U NOT FIREABLE(left74))))
lola: processed formula length: 87
lola: 9 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 22 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(left55) AND NOT FIREABLE(down23) AND (NOT FIREABLE(left32) OR NOT FIREABLE(right64))) AND (E (G (FIREABLE(left56))) OR A (F (FIREABLE(left56)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((NOT FIREABLE(left55) AND NOT FIREABLE(down23) AND (NOT FIREABLE(left32) OR NOT FIREABLE(right64))) AND (NOT(A(TRUE U NOT FIREABLE(left56))) OR A(TRUE U FIREABLE(left56)))))
lola: processed formula length: 184
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 23 markings, 90 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((FIREABLE(right53) OR FIREABLE(down46)))) U A (G (NOT FIREABLE(left24)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (FIREABLE(right53) OR FIREABLE(down46))) U NOT(E(TRUE U FIREABLE(left24))))
lola: processed formula length: 87
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 171 markings, 342 edges
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G ((NOT FIREABLE(right56) OR FIREABLE(left52) OR FIREABLE(down35) OR NOT FIREABLE(up47)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((FIREABLE(right56) AND NOT FIREABLE(left52) AND NOT FIREABLE(down35) AND FIREABLE(up47))))
lola: processed formula: A (F ((FIREABLE(right56) AND NOT FIREABLE(left52) AND NOT FIREABLE(down35) AND FIREABLE(up47))))
lola: processed formula length: 96
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 23 markings, 23 edges
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((NOT FIREABLE(right33) OR NOT FIREABLE(left24))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U (NOT FIREABLE(right33) OR NOT FIREABLE(left24))))))
lola: processed formula length: 78
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 835731 markings, 4579704 edges, 3689330178019819520 markings/sec, 0 secs
lola: 1568886 markings, 8869506 edges, 146631 markings/sec, 5 secs
lola: 2196047 markings, 12951994 edges, 125432 markings/sec, 10 secs
lola: 2804250 markings, 16945899 edges, 121641 markings/sec, 15 secs
lola: 3427167 markings, 21007621 edges, 124583 markings/sec, 20 secs
lola: 4004580 markings, 25042534 edges, 115483 markings/sec, 25 secs
lola: 4539694 markings, 28928073 edges, 107023 markings/sec, 30 secs
lola: 5083781 markings, 32845898 edges, 108817 markings/sec, 35 secs
lola: 5509958 markings, 36063881 edges, 85235 markings/sec, 40 secs
lola: 5901715 markings, 39030059 edges, 78351 markings/sec, 45 secs
lola: 6357067 markings, 42357334 edges, 91070 markings/sec, 50 secs
lola: 6944668 markings, 46140988 edges, 117520 markings/sec, 55 secs
lola: 7477953 markings, 49816590 edges, 106657 markings/sec, 60 secs
lola: 8017455 markings, 53474851 edges, 107900 markings/sec, 65 secs
lola: 8516164 markings, 56949732 edges, 99742 markings/sec, 70 secs
lola: 9032276 markings, 60619670 edges, 103222 markings/sec, 75 secs
lola: 9554028 markings, 64282611 edges, 104350 markings/sec, 80 secs
lola: 10096801 markings, 68156306 edges, 108555 markings/sec, 85 secs
lola: 10595358 markings, 71830979 edges, 99711 markings/sec, 90 secs
lola: 11035784 markings, 75385549 edges, 88085 markings/sec, 95 secs
lola: 11504746 markings, 78870523 edges, 93792 markings/sec, 100 secs
lola: 11944856 markings, 82297838 edges, 88022 markings/sec, 105 secs
lola: 12432807 markings, 85905096 edges, 97590 markings/sec, 110 secs
lola: 12871094 markings, 89432817 edges, 87657 markings/sec, 115 secs
lola: 13276697 markings, 92718623 edges, 81121 markings/sec, 120 secs
lola: 13672521 markings, 96045172 edges, 79165 markings/sec, 125 secs
lola: 14057892 markings, 99314201 edges, 77074 markings/sec, 130 secs
lola: 14425331 markings, 102524046 edges, 73488 markings/sec, 135 secs
lola: 14911968 markings, 105886384 edges, 97327 markings/sec, 140 secs
lola: 15409358 markings, 109210477 edges, 99478 markings/sec, 145 secs
lola: 15866839 markings, 112458024 edges, 91496 markings/sec, 150 secs
lola: 16397311 markings, 116033452 edges, 106094 markings/sec, 155 secs
lola: 16914924 markings, 119427884 edges, 103523 markings/sec, 160 secs
lola: 17365106 markings, 122748408 edges, 90036 markings/sec, 165 secs
lola: 17845426 markings, 126227973 edges, 96064 markings/sec, 170 secs
lola: 18312250 markings, 129624023 edges, 93365 markings/sec, 175 secs
lola: 18756603 markings, 132941969 edges, 88871 markings/sec, 180 secs
lola: 19184033 markings, 136128990 edges, 85486 markings/sec, 185 secs
lola: 19598629 markings, 139247922 edges, 82919 markings/sec, 190 secs
lola: 20039792 markings, 142435955 edges, 88233 markings/sec, 195 secs
lola: 20463687 markings, 145655802 edges, 84779 markings/sec, 200 secs
lola: 20853944 markings, 148679868 edges, 78051 markings/sec, 205 secs
lola: 21237884 markings, 151814980 edges, 76788 markings/sec, 210 secs
lola: 21609181 markings, 154868329 edges, 74259 markings/sec, 215 secs
lola: 21975871 markings, 157892154 edges, 73338 markings/sec, 220 secs
lola: 22381471 markings, 160917776 edges, 81120 markings/sec, 225 secs
lola: 22768725 markings, 163896202 edges, 77451 markings/sec, 230 secs
lola: 23127144 markings, 166902710 edges, 71684 markings/sec, 235 secs
lola: 23497756 markings, 169850087 edges, 74122 markings/sec, 240 secs
lola: 23874250 markings, 172861118 edges, 75299 markings/sec, 245 secs
lola: 24305523 markings, 176032663 edges, 86255 markings/sec, 250 secs
lola: 24761268 markings, 179272760 edges, 91149 markings/sec, 255 secs
lola: 25184335 markings, 182465595 edges, 84613 markings/sec, 260 secs
lola: 25566800 markings, 185514300 edges, 76493 markings/sec, 265 secs
lola: 26018844 markings, 188823617 edges, 90409 markings/sec, 270 secs
lola: 26417472 markings, 191860435 edges, 79726 markings/sec, 275 secs
lola: 26780040 markings, 194743220 edges, 72514 markings/sec, 280 secs
lola: 27168759 markings, 197754170 edges, 77744 markings/sec, 285 secs
lola: 27568204 markings, 200853155 edges, 79889 markings/sec, 290 secs
lola: 27948216 markings, 203965027 edges, 76002 markings/sec, 295 secs
lola: 28362084 markings, 207212538 edges, 82774 markings/sec, 300 secs
lola: 28782505 markings, 210441891 edges, 84084 markings/sec, 305 secs
lola: 29204376 markings, 213756839 edges, 84374 markings/sec, 310 secs
lola: 29612471 markings, 216872607 edges, 81619 markings/sec, 315 secs
lola: 29992859 markings, 219956550 edges, 76078 markings/sec, 320 secs
lola: 30329468 markings, 222950318 edges, 67322 markings/sec, 325 secs
lola: 30666464 markings, 225917013 edges, 67399 markings/sec, 330 secs
lola: 31010765 markings, 228802971 edges, 68860 markings/sec, 335 secs
lola: 31397374 markings, 231845402 edges, 77322 markings/sec, 340 secs
lola: 31743677 markings, 234773900 edges, 69261 markings/sec, 345 secs
lola: 32145590 markings, 237790698 edges, 80383 markings/sec, 350 secs
lola: 32524279 markings, 240720646 edges, 75738 markings/sec, 355 secs
lola: 32906674 markings, 243630002 edges, 76479 markings/sec, 360 secs
lola: 33232841 markings, 246442275 edges, 65233 markings/sec, 365 secs
lola: 33557786 markings, 249402829 edges, 64989 markings/sec, 370 secs
lola: 33977158 markings, 252578597 edges, 83874 markings/sec, 375 secs
lola: 34353618 markings, 255653582 edges, 75292 markings/sec, 380 secs
lola: 34700703 markings, 258539172 edges, 69417 markings/sec, 385 secs
lola: 35026429 markings, 261314120 edges, 65145 markings/sec, 390 secs
lola: 35372465 markings, 264047844 edges, 69207 markings/sec, 395 secs
lola: 35697053 markings, 266812317 edges, 64918 markings/sec, 400 secs
lola: 36016424 markings, 269579681 edges, 63874 markings/sec, 405 secs
lola: 36355326 markings, 272317142 edges, 67780 markings/sec, 410 secs
lola: 36655066 markings, 274963032 edges, 59948 markings/sec, 415 secs
lola: 36962313 markings, 277720236 edges, 61449 markings/sec, 420 secs
lola: 37242865 markings, 280443778 edges, 56110 markings/sec, 425 secs
lola: 37530909 markings, 283225733 edges, 57609 markings/sec, 430 secs
lola: 37977706 markings, 286509047 edges, 89359 markings/sec, 435 secs
lola: 38364309 markings, 289531884 edges, 77321 markings/sec, 440 secs
lola: 38748066 markings, 292570135 edges, 76751 markings/sec, 445 secs
lola: 39127255 markings, 295616572 edges, 75838 markings/sec, 450 secs
lola: 39524226 markings, 298709115 edges, 79394 markings/sec, 455 secs
lola: 39961894 markings, 301972351 edges, 87534 markings/sec, 460 secs
lola: 40360204 markings, 305086831 edges, 79662 markings/sec, 465 secs
lola: 40742951 markings, 308141362 edges, 76549 markings/sec, 470 secs
lola: 41107712 markings, 311142763 edges, 72952 markings/sec, 475 secs
lola: 41491951 markings, 314199544 edges, 76848 markings/sec, 480 secs
lola: 41841631 markings, 317153402 edges, 69936 markings/sec, 485 secs
lola: 42176867 markings, 320104570 edges, 67047 markings/sec, 490 secs
lola: 42539153 markings, 323163494 edges, 72457 markings/sec, 495 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (FIREABLE(down23))) AND E (G (E (F (FIREABLE(down41)))))) AND ((E ((FIREABLE(up47) U FIREABLE(left34))) OR ((FIREABLE(down33) OR FIREABLE(right35) OR NOT FIREABLE(right53)) AND E (X (FIREABLE(up53))))) OR E (G (NOT FIREABLE(up43)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(down23)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(down23)))
lola: processed formula: A (F (FIREABLE(down23)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 22 markings, 22 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (FIREABLE(left46)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U FIREABLE(left46)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 2638 markings, 6319 edges
lola: ========================================
lola: subprocess 12 will run for 758 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(up25)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(up25)))
lola: processed formula: A (F (FIREABLE(up25)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 28 markings, 28 edges
lola: ========================================
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (A (F (FIREABLE(up34))))) OR FIREABLE(left46)) AND A (F (E (G (NOT FIREABLE(right74))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1011 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(up34)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(up34)))
lola: processed formula: A (F (FIREABLE(up34)))
lola: processed formula length: 22
lola: 1 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 136 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (NOT FIREABLE(right74)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U FIREABLE(right74))))
lola: processed formula length: 42
lola: 4 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 24 markings, 24 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((E (X (FIREABLE(left45))) OR (FIREABLE(up25) AND FIREABLE(down44) AND FIREABLE(left74))) U (((FIREABLE(right24) AND FIREABLE(right56)) OR NOT FIREABLE(up23)) AND A (F (FIREABLE(up44))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((EX(FIREABLE(left45)) OR (FIREABLE(up25) AND FIREABLE(down44) AND FIREABLE(left74))) U (((FIREABLE(right24) AND FIREABLE(right56)) OR NOT FIREABLE(up23)) AND A(TRUE U FIREABLE(up44))))
lola: processed formula length: 187
lola: 3 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 22 markings, 22 edges
lola: ========================================
lola: subprocess 15 will run for 3034 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A ((A (G (FIREABLE(down24))) U A (F (FIREABLE(down41))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(NOT(E(TRUE U NOT FIREABLE(down24))) U A(TRUE U FIREABLE(down41))))
lola: processed formula length: 72
lola: 13 rewrites
lola: formula mentions 0 of 66 places; total mentions: 0
lola: closed formula file Solitaire-PT-EngNC7x7-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 23 markings, 24 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no unknown no yes no yes no yes
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngNC7x7-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- 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="Solitaire-PT-EngNC7x7"
export BK_EXAMINATION="CTLFireability"
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/Solitaire-PT-EngNC7x7.tgz
mv Solitaire-PT-EngNC7x7 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 Solitaire-PT-EngNC7x7, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r162-smll-152705514000144"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;