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-structural
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 r163-smll-152705514800144
=====================================================================

--------------------
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 1527063069500


BK_STOP 1527063620749

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using Solitaire-PT-EngNC7x7 as instance name.
Using Solitaire as model name.
Using algorithm or tool bmdt.
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}.
Known tools are: [{'Time': 570475, 'Memory': 2517.69, 'Tool': 'lola'}, {'Time': 570571, 'Memory': 2529.97, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'itstools'}].
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: 808197 markings, 4412896 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1518907 markings, 8553463 edges, 142142 markings/sec, 5 secs
lola: 2102584 markings, 12359982 edges, 116735 markings/sec, 10 secs
lola: 2664079 markings, 16049009 edges, 112299 markings/sec, 15 secs
lola: 3257330 markings, 19883495 edges, 118650 markings/sec, 20 secs
lola: 3810803 markings, 23636144 edges, 110695 markings/sec, 25 secs
lola: 4317851 markings, 27291591 edges, 101410 markings/sec, 30 secs
lola: 4803421 markings, 30897926 edges, 97114 markings/sec, 35 secs
lola: 5277641 markings, 34350292 edges, 94844 markings/sec, 40 secs
lola: 5765079 markings, 38016205 edges, 97488 markings/sec, 45 secs
lola: 6195634 markings, 41289743 edges, 86111 markings/sec, 50 secs
lola: 6741541 markings, 44821839 edges, 109181 markings/sec, 55 secs
lola: 7268165 markings, 48315467 edges, 105325 markings/sec, 60 secs
lola: 7778165 markings, 51828372 edges, 102000 markings/sec, 65 secs
lola: 8235122 markings, 55014116 edges, 91391 markings/sec, 70 secs
lola: 8703852 markings, 58266500 edges, 93746 markings/sec, 75 secs
lola: 9186442 markings, 61698407 edges, 96518 markings/sec, 80 secs
lola: 9688914 markings, 65180680 edges, 100494 markings/sec, 85 secs
lola: 10173224 markings, 68736801 edges, 96862 markings/sec, 90 secs
lola: 10629885 markings, 72119087 edges, 91332 markings/sec, 95 secs
lola: 11031013 markings, 75345932 edges, 80226 markings/sec, 100 secs
lola: 11461397 markings, 78542004 edges, 86077 markings/sec, 105 secs
lola: 11857707 markings, 81640416 edges, 79262 markings/sec, 110 secs
lola: 12310453 markings, 84989012 edges, 90549 markings/sec, 115 secs
lola: 12722124 markings, 88315334 edges, 82334 markings/sec, 120 secs
lola: 13092688 markings, 91335878 edges, 74113 markings/sec, 125 secs
lola: 13466935 markings, 94324723 edges, 74849 markings/sec, 130 secs
lola: 13808936 markings, 97208419 edges, 68400 markings/sec, 135 secs
lola: 14152644 markings, 100172107 edges, 68742 markings/sec, 140 secs
lola: 14465553 markings, 102896354 edges, 62582 markings/sec, 145 secs
lola: 14928243 markings, 105980841 edges, 92538 markings/sec, 150 secs
lola: 15373576 markings, 108971981 edges, 89067 markings/sec, 155 secs
lola: 15789317 markings, 111905025 edges, 83148 markings/sec, 160 secs
lola: 16256596 markings, 115073540 edges, 93456 markings/sec, 165 secs
lola: 16731538 markings, 118212059 edges, 94988 markings/sec, 170 secs
lola: 17158215 markings, 121228806 edges, 85335 markings/sec, 175 secs
lola: 17559997 markings, 124247205 edges, 80356 markings/sec, 180 secs
lola: 18029641 markings, 127467769 edges, 93929 markings/sec, 185 secs
lola: 18432888 markings, 130501462 edges, 80649 markings/sec, 190 secs
lola: 18827365 markings, 133464091 edges, 78895 markings/sec, 195 secs
lola: 19207317 markings, 136310255 edges, 75990 markings/sec, 200 secs
lola: 19575813 markings, 139082420 edges, 73699 markings/sec, 205 secs
lola: 19963349 markings, 141899155 edges, 77507 markings/sec, 210 secs
lola: 20346318 markings, 144776688 edges, 76594 markings/sec, 215 secs
lola: 20716956 markings, 147502376 edges, 74128 markings/sec, 220 secs
lola: 21049940 markings, 150207347 edges, 66597 markings/sec, 225 secs
lola: 21369809 markings, 152933090 edges, 63974 markings/sec, 230 secs
lola: 21692093 markings, 155515443 edges, 64457 markings/sec, 235 secs
lola: 22009507 markings, 158165335 edges, 63483 markings/sec, 240 secs
lola: 22364814 markings, 160784844 edges, 71061 markings/sec, 245 secs
lola: 22705838 markings, 163400439 edges, 68205 markings/sec, 250 secs
lola: 23012871 markings, 166038147 edges, 61407 markings/sec, 255 secs
lola: 23352235 markings, 168624678 edges, 67873 markings/sec, 260 secs
lola: 23661604 markings, 171135206 edges, 61874 markings/sec, 265 secs
lola: 24016717 markings, 173853205 edges, 71023 markings/sec, 270 secs
lola: 24386532 markings, 176673349 edges, 73963 markings/sec, 275 secs
lola: 24808784 markings, 179663544 edges, 84450 markings/sec, 280 secs
lola: 25191944 markings, 182520655 edges, 76632 markings/sec, 285 secs
lola: 25538050 markings, 185242409 edges, 69221 markings/sec, 290 secs
lola: 25943736 markings, 188267006 edges, 81137 markings/sec, 295 secs
lola: 26306981 markings, 190988068 edges, 72649 markings/sec, 300 secs
lola: 26639193 markings, 193562987 edges, 66442 markings/sec, 305 secs
lola: 26952449 markings, 196052583 edges, 62651 markings/sec, 310 secs
lola: 27297765 markings, 198713939 edges, 69063 markings/sec, 315 secs
lola: 27636655 markings, 201459563 edges, 67778 markings/sec, 320 secs
lola: 27985739 markings, 204258034 edges, 69817 markings/sec, 325 secs
lola: 28352917 markings, 207141666 edges, 73436 markings/sec, 330 secs
lola: 28721003 markings, 209990153 edges, 73617 markings/sec, 335 secs
lola: 29124736 markings, 213067210 edges, 80747 markings/sec, 340 secs
lola: 29482156 markings, 215866433 edges, 71484 markings/sec, 345 secs
lola: 29836893 markings, 218623558 edges, 70947 markings/sec, 350 secs
lola: 30150163 markings, 221339535 edges, 62654 markings/sec, 355 secs
lola: 30440739 markings, 223937421 edges, 58115 markings/sec, 360 secs
lola: 30738334 markings, 226534886 edges, 59519 markings/sec, 365 secs
lola: 31041270 markings, 229047725 edges, 60587 markings/sec, 370 secs
lola: 31383632 markings, 231736857 edges, 68472 markings/sec, 375 secs
lola: 31695167 markings, 234333526 edges, 62307 markings/sec, 380 secs
lola: 32047119 markings, 236982677 edges, 70390 markings/sec, 385 secs
lola: 32375010 markings, 239555582 edges, 65578 markings/sec, 390 secs
lola: 32690613 markings, 242108011 edges, 63121 markings/sec, 395 secs
lola: 33024173 markings, 244638820 edges, 66712 markings/sec, 400 secs
lola: 33302402 markings, 247076696 edges, 55646 markings/sec, 405 secs
lola: 33609579 markings, 249767374 edges, 61435 markings/sec, 410 secs
lola: 33983925 markings, 252631317 edges, 74869 markings/sec, 415 secs
lola: 34319626 markings, 255383895 edges, 67140 markings/sec, 420 secs
lola: 34629239 markings, 257940869 edges, 61923 markings/sec, 425 secs
lola: 34917052 markings, 260377629 edges, 57563 markings/sec, 430 secs
lola: 35214312 markings, 262769801 edges, 59452 markings/sec, 435 secs
lola: 35505631 markings, 265162443 edges, 58264 markings/sec, 440 secs
lola: 35781516 markings, 267558017 edges, 55177 markings/sec, 445 secs
lola: 36070737 markings, 269975276 edges, 57844 markings/sec, 450 secs
lola: 36361926 markings, 272375304 edges, 58238 markings/sec, 455 secs
lola: 36618464 markings, 274666463 edges, 51308 markings/sec, 460 secs
lola: 36887056 markings, 277061766 edges, 53718 markings/sec, 465 secs
lola: 37139394 markings, 279388633 edges, 50468 markings/sec, 470 secs
lola: 37370657 markings, 281791858 edges, 46253 markings/sec, 475 secs
lola: 37721515 markings, 284557632 edges, 70172 markings/sec, 480 secs
lola: 38099192 markings, 287438684 edges, 75535 markings/sec, 485 secs
lola: 38438493 markings, 290107580 edges, 67860 markings/sec, 490 secs
lola: 38783571 markings, 292855331 edges, 69016 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 607 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 3035 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 stdout -----
----- Kill lola and sara stderr -----
----- 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-EngNC7x7"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/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-structural"
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 r163-smll-152705514800144"
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 ;