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 360K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K 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 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K 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.8K 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 5 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 183K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is TriangularGrid-PT-5020, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748600403
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527212147733


BK_STOP 1527212426935

--------------------
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 TriangularGrid-PT-5020 as instance name.
Using TriangularGrid 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': 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': 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': 321710, 'Memory': 3884.75, 'Tool': 'lola'}, {'Time': 321933, 'Memory': 3890.86, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLFireability lola TriangularGrid-PT-5020...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
TriangularGrid-PT-5020: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLFireability @ TriangularGrid-PT-5020 @ 3539 seconds
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
make: [verify] Error 134 (ignored)
----- 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: 520/65536 symbol table entries, 4 collisions
lola: preprocessing...
lola: finding significant places
lola: 280 places, 240 transitions, 164 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 355 transition conflict sets
lola: TASK
lola: reading formula from TriangularGrid-PT-5020-CTLFireability.task
lola: E (G (E (G (FIREABLE(to3_4_5))))) : ((((NOT FIREABLE(ti2_3_4_3) AND NOT FIREABLE(ti1_2_3_2) AND NOT FIREABLE(ti3_1_5_5) AND NOT FIREABLE(ti2_1_5_6)) AND A ((FIREABLE(to3_4_3) U FIREABLE(ti2_1_5_3)))) OR ((A (F (FIREABLE(ti2_1_3_5))) AND FIREABLE(ti2_3_3_2)) OR (A (G (FIREABLE(to3_5_3))) OR E (G (FIREABLE(to2_3_5)))))) AND FIREABLE(to1_5_9)) : (((E (F ((FIREABLE(ti3_1_4_7) AND FIREABLE(to1_1_1)))) AND E ((FIREABLE(ti3_2_5_4) U FIREABLE(ti1_2_4_1)))) OR (E ((FIREABLE(ti2_3_1_1) U FIREABLE(ti3_2_3_3))) OR FIREABLE(ti3_1_2_1))) OR A (F (E ((FIREABLE(ti3_1_3_2) U FIREABLE(ti1_3_3_4)))))) : E ((E ((FIREABLE(ti1_2_4_3) U FIREABLE(to3_3_4))) U (E (G (FIREABLE(to3_5_1))) AND A (G (FIREABLE(ti1_3_5_9)))))) : (NOT(E (G (FIREABLE(t_5_0)))) AND A (F (A (G ((FIREABLE(ti1_2_4_2) AND FIREABLE(ti2_3_3_4))))))) : A (F (A (G (((FIREABLE(ti1_2_4_5) OR FIREABLE(t_2_6)) AND FIREABLE(ti2_3_2_1)))))) : ((NOT(E ((FIREABLE(ti2_1_5_9) U FIREABLE(to1_5_1)))) AND E (F ((NOT FIREABLE(to3_2_2) AND NOT FIREABLE(ti2_1_3_5))))) OR E (G (NOT FIREABLE(ti1_3_5_5)))) : E ((A (G (FIREABLE(to3_3_4))) U E (G (NOT FIREABLE(ti3_2_4_5))))) : (A (G (NOT(E (G (FIREABLE(to3_4_4)))))) AND ((NOT FIREABLE(ti3_2_4_4) AND (FIREABLE(ti3_1_5_8) OR FIREABLE(ti1_2_3_5))) OR A (G ((NOT FIREABLE(ti3_2_5_8) OR NOT FIREABLE(ti3_2_5_7)))))) : ((((NOT FIREABLE(ti2_3_4_7) OR NOT FIREABLE(ti1_3_4_6)) AND A (X (FIREABLE(ti3_2_5_7)))) AND A ((NOT FIREABLE(ti2_3_3_4) U (FIREABLE(ti2_1_5_8) OR FIREABLE(ti2_3_3_3))))) OR E (X ((FIREABLE(t_6_9) AND E (F (FIREABLE(ti1_2_4_4))))))) : E (((A (F (FIREABLE(ti2_1_5_8))) OR FIREABLE(ti2_3_4_1)) U FIREABLE(ti3_1_4_7))) : (A (G (NOT(E (G (FIREABLE(to2_5_5)))))) OR A ((FIREABLE(to3_5_8) U E (X (FIREABLE(ti3_2_5_2)))))) : E ((FIREABLE(ti2_1_4_2) U (E (G (FIREABLE(to1_5_7))) OR FIREABLE(t_4_0)))) : A (F (FIREABLE(ti3_2_2_3))) : E (F (E (G (FIREABLE(t_5_0))))) : E (X (A (X (A (F (FIREABLE(to1_5_2)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (FIREABLE(to3_4_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U NOT FIREABLE(to3_4_5))))
lola: processed formula length: 46
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 911 markings, 2733 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((NOT FIREABLE(ti2_3_4_3) AND NOT FIREABLE(ti1_2_3_2) AND NOT FIREABLE(ti3_1_5_5) AND NOT FIREABLE(ti2_1_5_6)) AND A ((FIREABLE(to3_4_3) U FIREABLE(ti2_1_5_3)))) OR ((A (F (FIREABLE(ti2_1_3_5))) AND FIREABLE(ti2_3_3_2)) OR (A (G (FIREABLE(to3_5_3))) OR E (G (FIREABLE(to2_3_5)))))) AND FIREABLE(to1_5_9))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(ti2_3_4_3) AND NOT FIREABLE(ti1_2_3_2) AND NOT FIREABLE(ti3_1_5_5) AND NOT FIREABLE(ti2_1_5_6))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(ti2_3_4_3) AND NOT FIREABLE(ti1_2_3_2) AND NOT FIREABLE(ti3_1_5_5) AND NOT FIREABLE(ti2_1_5_6))
lola: processed formula length: 109
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(to3_4_3) U FIREABLE(ti2_1_5_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((FIREABLE(to3_4_3) U FIREABLE(ti2_1_5_3)))
lola: processed formula: A ((FIREABLE(to3_4_3) U FIREABLE(ti2_1_5_3)))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 640 markings, 640 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(ti2_1_3_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (FIREABLE(ti2_1_3_5)))
lola: processed formula: A (F (FIREABLE(ti2_1_3_5)))
lola: processed formula length: 27
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 660 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: 482 markings, 482 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(to3_5_3)))
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 656 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (FIREABLE(to2_3_5)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT FIREABLE(to2_3_5)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 1009 markings, 1009 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(to1_5_9)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(to1_5_9)
lola: processed formula length: 17
lola: 0 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-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: 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: (((E (F ((FIREABLE(ti3_1_4_7) AND FIREABLE(to1_1_1)))) AND E ((FIREABLE(ti3_2_5_4) U FIREABLE(ti1_2_4_1)))) OR (E ((FIREABLE(ti2_3_1_1) U FIREABLE(ti3_2_3_3))) OR FIREABLE(ti3_1_2_1))) OR A (F (E ((FIREABLE(ti3_1_3_2) U FIREABLE(ti1_3_3_4))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(ti3_1_4_7) AND FIREABLE(to1_1_1))))
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 656 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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(ti3_2_5_4) U FIREABLE(ti1_2_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(ti3_2_5_4) U FIREABLE(ti1_2_4_1))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(ti2_3_1_1) U FIREABLE(ti3_2_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(FIREABLE(ti2_3_1_1) U FIREABLE(ti3_2_3_3))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(ti3_1_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(ti3_1_2_1)
lola: processed formula length: 19
lola: 2 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-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: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E ((FIREABLE(ti3_1_3_2) U FIREABLE(ti1_3_3_4)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(FIREABLE(ti3_1_3_2) U FIREABLE(ti1_3_3_4)))
lola: processed formula length: 54
lola: 4 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 5735 markings, 7272 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E ((FIREABLE(ti1_2_4_3) U FIREABLE(to3_3_4))) U (E (G (FIREABLE(to3_5_1))) AND A (G (FIREABLE(ti1_3_5_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(FIREABLE(ti1_2_4_3) U FIREABLE(to3_3_4)) U (NOT(A(TRUE U NOT FIREABLE(to3_5_1))) AND NOT(E(TRUE U NOT FIREABLE(ti1_3_5_9)))))
lola: processed formula length: 129
lola: 6 rewrites
lola: formula mentions 0 of 280 places; total mentions: 0
lola: closed formula file TriangularGrid-PT-5020-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 656 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: 744943 markings, 3220870 edges, 3689329903141912576 markings/sec, 0 secs
lola: 1431807 markings, 6312306 edges, 137373 markings/sec, 5 secs
lola: 2058826 markings, 9314450 edges, 125404 markings/sec, 10 secs
lola: 2628301 markings, 12203567 edges, 113895 markings/sec, 15 secs
lola: 3163650 markings, 14948511 edges, 107070 markings/sec, 20 secs
lola: 3674091 markings, 17639006 edges, 102088 markings/sec, 25 secs
lola: 4249490 markings, 20526806 edges, 115080 markings/sec, 30 secs
lola: 4852673 markings, 23401718 edges, 120637 markings/sec, 35 secs
lola: 5389433 markings, 26184467 edges, 107352 markings/sec, 40 secs
lola: 5896341 markings, 28914678 edges, 101382 markings/sec, 45 secs
lola: 6500011 markings, 31702401 edges, 120734 markings/sec, 50 secs
lola: 7072870 markings, 34398111 edges, 114572 markings/sec, 55 secs
lola: 7612233 markings, 37064451 edges, 107873 markings/sec, 60 secs
lola: 8098389 markings, 39620877 edges, 97231 markings/sec, 65 secs
lola: 8531383 markings, 42094517 edges, 86599 markings/sec, 70 secs
lola: 9062570 markings, 44718981 edges, 106237 markings/sec, 75 secs
lola: 9542401 markings, 47253860 edges, 95966 markings/sec, 80 secs
lola: 10034443 markings, 49783153 edges, 98408 markings/sec, 85 secs
lola: 10450115 markings, 52169706 edges, 83134 markings/sec, 90 secs
lola: 10908004 markings, 54682754 edges, 91578 markings/sec, 95 secs
lola: 11410999 markings, 57090347 edges, 100599 markings/sec, 100 secs
lola: 11762983 markings, 58994020 edges, 70397 markings/sec, 105 secs
lola: 12091957 markings, 60828087 edges, 65795 markings/sec, 110 secs
lola: 12493213 markings, 62842077 edges, 80251 markings/sec, 115 secs
lola: 12827408 markings, 64774469 edges, 66839 markings/sec, 120 secs
lola: 13131690 markings, 66691419 edges, 60856 markings/sec, 125 secs
lola: 13470667 markings, 68559987 edges, 67795 markings/sec, 130 secs
lola: 13858580 markings, 70519072 edges, 77583 markings/sec, 135 secs
lola: 14205451 markings, 72520978 edges, 69374 markings/sec, 140 secs
lola: 14557515 markings, 74543707 edges, 70413 markings/sec, 145 secs
lola: 14859075 markings, 76329549 edges, 60312 markings/sec, 150 secs
lola: 15236136 markings, 78345676 edges, 75412 markings/sec, 155 secs
lola: 15534369 markings, 80197508 edges, 59647 markings/sec, 160 secs
lola: 15826329 markings, 82115239 edges, 58392 markings/sec, 165 secs
lola: 16286159 markings, 84621496 edges, 91966 markings/sec, 170 secs
lola: 16730633 markings, 87050219 edges, 88895 markings/sec, 175 secs
lola: 17194765 markings, 89529559 edges, 92826 markings/sec, 180 secs
lola: 17612202 markings, 91756357 edges, 83487 markings/sec, 185 secs
lola: 17999045 markings, 93890815 edges, 77369 markings/sec, 190 secs
lola: 18425782 markings, 96190774 edges, 85347 markings/sec, 195 secs
lola: 18793867 markings, 98351577 edges, 73617 markings/sec, 200 secs
lola: 19229993 markings, 100748996 edges, 87225 markings/sec, 205 secs
lola: 19713463 markings, 103337715 edges, 96694 markings/sec, 210 secs
lola: 20115890 markings, 105760417 edges, 80485 markings/sec, 215 secs
lola: 20527940 markings, 108152824 edges, 82410 markings/sec, 220 secs
lola: 20869919 markings, 110464709 edges, 68396 markings/sec, 225 secs
lola: 21373906 markings, 113108562 edges, 100797 markings/sec, 230 secs
lola: 21819734 markings, 115487556 edges, 89166 markings/sec, 235 secs
lola: 22329620 markings, 118173297 edges, 101977 markings/sec, 240 secs
lola: 22784601 markings, 120525180 edges, 90996 markings/sec, 245 secs
lola: 23181224 markings, 122964485 edges, 79325 markings/sec, 250 secs
lola: 23553504 markings, 125180763 edges, 74456 markings/sec, 255 secs
lola: 23999995 markings, 127749252 edges, 89298 markings/sec, 260 secs
lola: 24466713 markings, 130360334 edges, 93344 markings/sec, 265 secs
lola: local time limit reached - aborting
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: '
'
Aborted (core dumped)
FORMULA TriangularGrid-PT-5020-CTLFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-CTLFireability-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TriangularGrid-PT-5020-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="TriangularGrid-PT-5020"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/TriangularGrid-PT-5020.tgz
mv TriangularGrid-PT-5020 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is TriangularGrid-PT-5020, 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 r178-smll-152708748600403"
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 ;