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 644K
-rw-r--r-- 1 mcc users 3.8K 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 3.6K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 469K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473800228
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527151875428


BK_STOP 1527152045234

--------------------
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 NeighborGrid-PT-d4n3m2c23 as instance name.
Using NeighborGrid 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': True, 'Extended Free Choice': True, 'State Machine': True, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': True, 'Sub-Conservative': True, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 355718, 'Memory': 14316.07, 'Tool': 'lola'}, {'Time': 3511096, 'Memory': 15652.04, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'itstools'}].
Learned tool itstools is 9.870447939097824x far from the best tool lola.
CTLFireability lola NeighborGrid-PT-d4n3m2c23...

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


checking for too many tokens
===========================================================================================
NeighborGrid-PT-d4n3m2c23: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ NeighborGrid-PT-d4n3m2c23 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1713/65536 symbol table entries, 509 collisions
lola: preprocessing...
lola: finding significant places
lola: 81 places, 1632 transitions, 80 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 81 transition conflict sets
lola: TASK
lola: reading formula from NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: ((A (G (A (X (FIREABLE(ti_1_1_0_1v_1_2_1_2))))) AND NOT(E (G (FIREABLE(ti_0_2_2_2v_1_2_2_1))))) AND E (G (((FIREABLE(ti_1_2_0_0v_1_2_1_1) AND FIREABLE(to_2_1_1_1v_2_2_2_0) AND (FIREABLE(to_1_0_1_1v_2_0_2_1) OR FIREABLE(ti_2_1_1_0v_2_2_0_0))) OR FIREABLE(ti_0_0_1_1v_1_0_2_2))))) : E (G (E (F (A (X (FIREABLE(ti_1_1_0_0v_1_2_1_1))))))) : A (F (A (G (((FIREABLE(ti_1_2_2_0v_2_1_1_0) OR FIREABLE(ti_0_2_1_0v_0_2_2_1)) AND FIREABLE(to_2_0_0_2v_2_0_1_1)))))) : E (G (NOT((A (G (FIREABLE(ti_0_1_0_2v_1_2_0_1))) AND A (G (FIREABLE(to_1_0_0_0v_1_0_1_1))))))) : (FIREABLE(to_2_0_2_1v_2_1_1_0) AND ((FIREABLE(to_1_2_2_0v_2_2_2_1) AND (A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1))) OR A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1))))) AND (E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0))) AND E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))))) : A (F (((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (A (G (FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0)))))) : ((NOT(E (F (NOT FIREABLE(to_0_1_0_0v_1_1_1_1)))) AND (E (X ((FIREABLE(ti_1_1_1_1v_1_1_2_2) OR FIREABLE(ti_1_0_1_0v_2_0_2_0)))) AND E (F (NOT FIREABLE(ti_1_0_2_2v_2_1_1_2))))) AND FIREABLE(ti_0_1_2_2v_1_0_2_2)) : NOT(NOT(E (X (E (G (FIREABLE(to_0_2_1_0v_1_2_2_1))))))) : E (G (E (X (FIREABLE(to_1_1_1_1v_2_0_2_1))))) : NOT(A (F ((E (G (FIREABLE(to_1_2_2_2v_2_1_2_2))) AND FIREABLE(ti_0_1_2_0v_1_0_1_0))))) : E (G (E (X (FIREABLE(to_0_1_0_1v_1_2_1_1))))) : A (F ((NOT FIREABLE(ti_0_1_1_2v_0_2_2_2) AND NOT FIREABLE(to_0_1_1_1v_0_2_2_0) AND (NOT FIREABLE(ti_0_0_1_2v_1_1_1_2) OR NOT FIREABLE(ti_0_0_1_2v_1_0_0_2)) AND (FIREABLE(ti_1_0_1_2v_1_1_2_1) OR FIREABLE(to_1_1_0_0v_1_2_0_1))))) : A (G ((E (X ((FIREABLE(to_0_0_1_2v_1_1_1_2) AND FIREABLE(to_0_1_0_2v_1_0_0_2)))) OR (NOT FIREABLE(to_0_1_1_2v_0_2_0_2) AND FIREABLE(to_1_0_2_1v_1_1_2_2))))) : E ((NOT(E (G (FIREABLE(ti_2_1_0_1v_2_2_1_2)))) U (A (G (FIREABLE(ti_0_1_1_1v_1_2_0_1))) AND A (F (FIREABLE(ti_0_2_1_1v_0_2_2_0)))))) : (((E (G (NOT FIREABLE(ti_1_2_0_2v_2_2_0_1))) AND FIREABLE(ti_1_1_2_1v_2_0_1_1)) AND E (F (E (F (FIREABLE(to_1_1_1_1v_2_1_0_1)))))) OR E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2)))))) : (E (X ((A (X (FIREABLE(to_0_0_0_1v_1_0_0_2))) OR A (G (FIREABLE(to_1_1_2_1v_1_2_2_2)))))) AND E (G (A ((FIREABLE(ti_1_0_1_2v_1_0_2_1) U FIREABLE(to_0_1_0_2v_1_1_1_1))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G (A (X (FIREABLE(ti_1_1_0_1v_1_2_1_2))))) AND NOT(E (G (FIREABLE(ti_0_2_2_2v_1_2_2_1))))) AND E (G (((FIREABLE(ti_1_2_0_0v_1_2_1_1) AND FIREABLE(to_2_1_1_1v_2_2_2_0) AND (FIREABLE(to_1_0_1_1v_2_0_2_1) OR FIREABLE(ti_2_1_1_0v_2_2_0_0))) OR FIREABLE(ti_0_0_1_1v_1_0_2_2)))))
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 (G (A (X (FIREABLE(ti_1_1_0_1v_1_2_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(FIREABLE(ti_1_1_0_1v_1_2_1_2)))))
lola: processed formula length: 53
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 128 markings, 127 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (A (X (FIREABLE(ti_1_1_0_0v_1_2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U AX(FIREABLE(ti_1_1_0_0v_1_2_1_1))))))
lola: processed formula length: 63
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 651276 markings, 1053038 edges, 130255 markings/sec, 0 secs
lola: 1198807 markings, 1920452 edges, 109506 markings/sec, 5 secs
lola: 1702437 markings, 2755729 edges, 100726 markings/sec, 10 secs
lola: 2194832 markings, 3554125 edges, 98479 markings/sec, 15 secs
lola: 2837329 markings, 4618363 edges, 128499 markings/sec, 20 secs
lola: 3362437 markings, 5460834 edges, 105022 markings/sec, 25 secs
lola: 3927286 markings, 6391191 edges, 112970 markings/sec, 30 secs
lola: 4442794 markings, 7256751 edges, 103102 markings/sec, 35 secs
lola: 4987683 markings, 8177649 edges, 108978 markings/sec, 40 secs
lola: 5557883 markings, 9106721 edges, 114040 markings/sec, 45 secs
lola: 6106911 markings, 10008768 edges, 109806 markings/sec, 50 secs
lola: 6588507 markings, 10814891 edges, 96319 markings/sec, 55 secs
lola: 7118439 markings, 11718923 edges, 105986 markings/sec, 60 secs
lola: 7674462 markings, 12626744 edges, 111205 markings/sec, 65 secs
lola: 8203854 markings, 13500341 edges, 105878 markings/sec, 70 secs
lola: 8697963 markings, 14333025 edges, 98822 markings/sec, 75 secs
lola: 9213438 markings, 15207857 edges, 103095 markings/sec, 80 secs
lola: 9690919 markings, 15988946 edges, 95496 markings/sec, 85 secs
lola: 10180687 markings, 16799767 edges, 97954 markings/sec, 90 secs
lola: 10712468 markings, 17715319 edges, 106356 markings/sec, 95 secs
lola: 11255881 markings, 18610405 edges, 108683 markings/sec, 100 secs
lola: 11788991 markings, 19508310 edges, 106622 markings/sec, 105 secs
lola: 12309795 markings, 20392827 edges, 104161 markings/sec, 110 secs
lola: 12783153 markings, 21174490 edges, 94672 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (((FIREABLE(ti_1_2_2_0v_2_1_1_0) OR FIREABLE(ti_0_2_1_0v_0_2_2_1)) AND FIREABLE(to_2_0_0_2v_2_0_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G (((FIREABLE(ti_1_2_2_0v_2_1_1_0) OR FIREABLE(ti_0_2_1_0v_0_2_2_1)) AND FIREABLE(to_2_0_0_2v_2_0_1_1))))))
lola: processed formula: A (F (A (G (((FIREABLE(ti_1_2_2_0v_2_1_1_0) OR FIREABLE(ti_0_2_1_0v_0_2_2_1)) AND FIREABLE(to_2_0_0_2v_2_0_1_1))))))
lola: processed formula length: 117
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 30 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: 777 markings, 782 edges
lola: ========================================
lola: subprocess 3 will run for 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT((A (G (FIREABLE(ti_0_1_0_2v_1_2_0_1))) AND A (G (FIREABLE(to_1_0_0_0v_1_0_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(E(TRUE U NOT FIREABLE(ti_0_1_0_2v_1_2_0_1))) AND NOT(E(TRUE U NOT FIREABLE(to_1_0_0_0v_1_0_1_1))))))
lola: processed formula length: 118
lola: 11 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 263 markings, 610 edges
lola: ========================================
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(to_2_0_2_1v_2_1_1_0) AND ((FIREABLE(to_1_2_2_0v_2_2_2_1) AND (A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1))) OR A (G (FIREABLE(ti_0_0_1_0v_0_1_1_1))))) AND (E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0))) AND E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_2_0_2_1v_2_1_1_0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_2_0_2_1v_2_1_1_0)
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to_1_2_2_0v_2_2_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to_1_2_2_0v_2_2_2_1)
lola: processed formula length: 29
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1)))
lola: processed formula: A (F (FIREABLE(ti_1_1_0_0v_2_1_0_1)))
lola: processed formula length: 37
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 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 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(ti_1_2_0_0v_2_1_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(to_1_2_0_0v_2_1_1_0) AND FIREABLE(ti_2_1_2_0v_2_2_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(to_1_2_0_0v_2_1_1_0) OR NOT FIREABLE(ti_2_1_2_0v_2_2_1_1))))
lola: processed formula length: 88
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 628 markings, 628 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (A (G (FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (A (G (FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0))))))
lola: processed formula: A (F (((FIREABLE(ti_0_0_0_1v_1_0_1_0) OR FIREABLE(to_0_1_1_2v_1_0_1_1) OR (FIREABLE(to_0_0_0_1v_0_0_1_0) AND FIREABLE(to_0_1_1_0v_1_2_1_1)) OR (NOT FIREABLE(ti_2_1_0_0v_2_2_1_1) AND FIREABLE(to_0_2_2_0v_1_2_2_1))) AND (A (G (FIREABLE(ti_1_2_1_2v_2_2_2_1))) AND (NOT FIREABLE(ti_0_0_1_1v_0_0_2_2) OR NOT FIREABLE(to_0_0_2_1v_0_1_1_0))))))
lola: processed formula length: 341
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 30 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: 273 markings, 273 edges
lola: ========================================
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (F (NOT FIREABLE(to_0_1_0_0v_1_1_1_1)))) AND (E (X ((FIREABLE(ti_1_1_1_1v_1_1_2_2) OR FIREABLE(ti_1_0_1_0v_2_0_2_0)))) AND E (F (NOT FIREABLE(ti_1_0_2_2v_2_1_1_2))))) AND FIREABLE(ti_0_1_2_2v_1_0_2_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 341 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(to_0_1_0_0v_1_1_1_1)))
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 320 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (X (E (G (FIREABLE(to_0_2_1_0v_1_2_2_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U NOT FIREABLE(to_0_2_1_0v_1_2_2_1))))
lola: processed formula length: 52
lola: 13 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 262 markings, 262 edges
lola: ========================================
lola: subprocess 8 will run for 426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (FIREABLE(to_1_1_1_1v_2_0_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX(FIREABLE(to_1_1_1_1v_2_0_2_1)))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 263 markings, 263 edges
lola: ========================================
lola: subprocess 9 will run for 487 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((E (G (FIREABLE(to_1_2_2_2v_2_1_2_2))) AND FIREABLE(ti_0_1_2_0v_1_0_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U NOT FIREABLE(to_1_2_2_2v_2_1_2_2))) AND FIREABLE(ti_0_1_2_0v_1_0_1_0))))
lola: processed formula length: 99
lola: 11 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 353 markings, 354 edges
lola: ========================================
lola: subprocess 10 will run for 569 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (FIREABLE(to_0_1_0_1v_1_2_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX(FIREABLE(to_0_1_0_1v_1_2_1_1)))))
lola: processed formula length: 53
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 263 markings, 263 edges
lola: ========================================
lola: subprocess 11 will run for 682 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((NOT FIREABLE(ti_0_1_1_2v_0_2_2_2) AND NOT FIREABLE(to_0_1_1_1v_0_2_2_0) AND (NOT FIREABLE(ti_0_0_1_2v_1_1_1_2) OR NOT FIREABLE(ti_0_0_1_2v_1_0_0_2)) AND (FIREABLE(ti_1_0_1_2v_1_1_2_1) OR FIREABLE(to_1_1_0_0v_1_2_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((NOT FIREABLE(ti_0_1_1_2v_0_2_2_2) AND NOT FIREABLE(to_0_1_1_1v_0_2_2_0) AND (NOT FIREABLE(ti_0_0_1_2v_1_1_1_2) OR NOT FIREABLE(ti_0_0_1_2v_1_0_0_2)) AND (FIREABLE(ti_1_0_1_2v_1_1_2_1) OR FIREABLE(to_1_1_0_0v_1_2_0_1)))))
lola: processed formula: A (F ((NOT FIREABLE(ti_0_1_1_2v_0_2_2_2) AND NOT FIREABLE(to_0_1_1_1v_0_2_2_0) AND (NOT FIREABLE(ti_0_0_1_2v_1_1_1_2) OR NOT FIREABLE(ti_0_0_1_2v_1_0_0_2)) AND (FIREABLE(ti_1_0_1_2v_1_1_2_1) OR FIREABLE(to_1_1_0_0v_1_2_0_1)))))
lola: processed formula length: 229
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 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: 283 markings, 283 edges
lola: ========================================
lola: subprocess 12 will run for 853 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X ((FIREABLE(to_0_0_1_2v_1_1_1_2) AND FIREABLE(to_0_1_0_2v_1_0_0_2)))) OR (NOT FIREABLE(to_0_1_1_2v_0_2_0_2) AND FIREABLE(to_1_0_2_1v_1_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(EX((FIREABLE(to_0_0_1_2v_1_1_1_2) AND FIREABLE(to_0_1_0_2v_1_0_0_2)))) AND (FIREABLE(to_0_1_1_2v_0_2_0_2) OR NOT FIREABLE(to_1_0_2_1v_1_1_2_2)))))
lola: processed formula length: 165
lola: 4 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 13488 markings, 20071 edges
lola: ========================================
lola: subprocess 13 will run for 1137 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((NOT(E (G (FIREABLE(ti_2_1_0_1v_2_2_1_2)))) U (A (G (FIREABLE(ti_0_1_1_1v_1_2_0_1))) AND A (F (FIREABLE(ti_0_2_1_1v_0_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U NOT FIREABLE(ti_2_1_0_1v_2_2_1_2)) U (NOT(E(TRUE U NOT FIREABLE(ti_0_1_1_1v_1_2_0_1))) AND A(TRUE U FIREABLE(ti_0_2_1_1v_0_2_2_0))))
lola: processed formula length: 143
lola: 8 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 4 significant temporal operators and needs 17 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: 792 markings, 823 edges
lola: ========================================
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G (NOT FIREABLE(ti_1_2_0_2v_2_2_0_1))) AND FIREABLE(ti_1_1_2_1v_2_0_1_1)) AND E (F (E (F (FIREABLE(to_1_1_1_1v_2_1_0_1)))))) OR E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(ti_1_2_0_2v_2_2_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(ti_1_2_0_2v_2_2_0_1)))
lola: processed formula length: 44
lola: 4 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 3413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(to_0_2_0_1v_1_2_0_0) AND FIREABLE(to_2_1_2_1v_2_2_2_0) AND FIREABLE(to_1_1_1_0v_2_2_2_0) AND (NOT FIREABLE(ti_1_1_0_1v_1_1_1_2) OR NOT FIREABLE(to_0_2_0_2v_1_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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: 3 markings, 2 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 3413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((A (X (FIREABLE(to_0_0_0_1v_1_0_0_2))) OR A (G (FIREABLE(to_1_1_2_1v_1_2_2_2)))))) AND E (G (A ((FIREABLE(ti_1_0_1_2v_1_0_2_1) U FIREABLE(to_0_1_0_2v_1_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (X (FIREABLE(to_0_0_0_1v_1_0_0_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX(FIREABLE(to_0_0_0_1v_1_0_0_2)))
lola: processed formula length: 37
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 320 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 0 significant temporal operators and needs 0 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: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
what(): parse error at position 0: unexpected character, last read: '\ufffd'
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no unknown no yes yes no no yes yes no yes no no no yes unknown
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLFireability-15 CANNOT_COMPUTE 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="NeighborGrid-PT-d4n3m2c23"
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/NeighborGrid-PT-d4n3m2c23.tgz
mv NeighborGrid-PT-d4n3m2c23 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 NeighborGrid-PT-d4n3m2c23, 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 r115-csrt-152666473800228"
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 ;