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 1.1M
-rw-r--r-- 1 mcc users 4.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K 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 9.8K 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.4K 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 111 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 349 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.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 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 873K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HexagonalGrid-PT-410, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636600031
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526742309445


BK_STOP 1526742820787

--------------------
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 HexagonalGrid-PT-410 as instance name.
Using HexagonalGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', '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}.
Known tools are: [{'Time': 1216516, 'Memory': 15950.04, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola HexagonalGrid-PT-410...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
HexagonalGrid-PT-410: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ HexagonalGrid-PT-410 @ 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: 2161/65536 symbol table entries, 431 collisions
lola: preprocessing...
lola: finding significant places
lola: 787 places, 1374 transitions, 485 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1675 transition conflict sets
lola: TASK
lola: reading formula from HexagonalGrid-PT-410-CTLCardinality.task
lola: E (X (A (G ((pb1_2_4 + 1 <= pol1_4_3))))) : NOT(E (F (E (G ((pb6_3_4 <= pil2_7_1)))))) : A (F (A (((pbl_7_1 <= po1_6_2) U (pil5_5_1 <= po2_1_3))))) : NOT(E (F ((((2 <= po2_7_3) AND (pb2_6_1 <= pol1_4_2)) OR (3 <= pol1_3_2))))) : (NOT(E (G (((pil2_2_2 <= pb4_5_5) OR (2 <= pb4_6_4))))) AND (A (((pil1_5_4 <= pol1_4_6) U (po3_5_1 <= pil2_4_2))) OR NOT(A (G ((pol1_4_6 <= pol3_6_3)))))) : NOT(((E (G ((2 <= pb2_4_4))) OR ((1 <= pi5_2_1) OR (2 <= po2_3_1))) OR (A (F ((pil1_4_1 <= pbl_3_2))) AND E (F ((2 <= pb3_3_5)))))) : A ((A (F ((pbl_6_5 <= pil3_2_5))) U ((po1_3_5 + 1 <= po3_2_5) OR (pi3_3_5 + 1 <= pi1_2_4)))) : (NOT(E (F (((2 <= pb5_4_3) AND (pil2_6_4 <= pil2_6_2))))) AND A (F (E (X ((1 <= po1_1_3)))))) : (E ((((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5)))) OR E ((((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6)))) : E ((E (X ((pb4_3_5 <= pol3_4_2))) U ((3 <= pi1_3_6) AND (pbl_4_5 <= po5_1_1) AND (pb3_5_2 + 1 <= po3_4_7)))) : (E (G (((pol5_4_1 <= pb2_2_1) OR (3 <= pb4_2_5) OR ((pil1_4_2 <= pil1_6_1) AND (1 <= pol1_3_2))))) OR (A (X ((2 <= pi2_5_1))) OR (E (G ((pb3_4_4 <= pi2_5_5))) AND ((3 <= pb6_2_3) AND (pil2_2_4 <= pb6_2_2) AND (2 <= po1_5_3) AND (pi2_4_1 <= po6_4_1))))) : A (X (E (F ((3 <= pil2_5_2))))) : (E (X (A (G ((pb4_1_2 <= pil2_2_3))))) OR NOT(E (G ((pi3_7_3 + 1 <= pol1_1_1))))) : (((A (G ((2 <= pol4_7_1))) OR (((po1_4_7 <= po2_7_4) OR (1 <= pi6_3_1)) AND (pol2_6_2 <= po3_4_4))) AND E (X (((po3_4_4 <= pil2_6_2) AND (3 <= pb1_2_2))))) OR E (F (A (G ((3 <= pb3_2_1)))))) : E (G ((((pil3_3_5 <= po1_3_3) OR ((2 <= pol2_4_1) AND (pil1_3_2 <= po3_5_1))) OR E (X ((pi3_6_5 <= po3_3_1)))))) : (A (X (((pb4_4_4 <= 1) OR (pol3_4_3 <= pil3_5_5)))) AND (E (((pb3_1_2 <= pi3_7_1) U (1 <= po1_4_4))) OR E (G (((3 <= pil1_5_4) OR (po2_7_1 <= pol5_4_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: E (X (A (G ((pb1_2_4 + 1 <= pol1_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(E(TRUE U (pol1_4_3 <= pb1_2_4))))
lola: processed formula length: 40
lola: 3 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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: 1424 markings, 1423 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (E (G ((pb6_3_4 <= pil2_7_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (pil2_7_1 + 1 <= pb6_3_4)))))
lola: processed formula length: 55
lola: 7 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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: 1257 markings, 1257 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (((pbl_7_1 <= po1_6_2) U (pil5_5_1 <= po2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U A((pbl_7_1 <= po1_6_2) U (pil5_5_1 <= po2_1_3)))
lola: processed formula length: 57
lola: 2 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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: 1296 markings, 3741 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((((2 <= po2_7_3) AND (pb2_6_1 <= pol1_4_2)) OR (3 <= pol1_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-410-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file HexagonalGrid-PT-410-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((pil2_2_2 <= pb4_5_5) OR (2 <= pb4_6_4))))) AND (A (((pil1_5_4 <= pol1_4_6) U (po3_5_1 <= pil2_4_2))) OR NOT(A (G ((pol1_4_6 <= pol3_6_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb4_5_5 + 1 <= pil2_2_2) AND (pb4_6_4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pb4_5_5 + 1 <= pil2_2_2) AND (pb4_6_4 <= 1))))
lola: processed formula: A (F (((pb4_5_5 + 1 <= pil2_2_2) AND (pb4_6_4 <= 1))))
lola: processed formula length: 54
lola: 6 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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: 1325 markings, 1325 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((E (G ((2 <= pb2_4_4))) OR ((1 <= pi5_2_1) OR (2 <= po2_3_1))) OR (A (F ((pil1_4_1 <= pbl_3_2))) AND E (F ((2 <= pb3_3_5))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb2_4_4 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pb2_4_4 <= 1)))
lola: processed formula: A (F ((pb2_4_4 <= 1)))
lola: processed formula length: 22
lola: 14 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi5_2_1 <= 0) AND (po2_3_1 <= 1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi5_2_1 <= 0) AND (po2_3_1 <= 1))
lola: processed formula length: 35
lola: 14 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: processed formula with 2 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pbl_3_2 + 1 <= pil1_4_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil1_4_1 <= pbl_3_2)))
lola: processed formula length: 36
lola: 16 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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: 1610 markings, 1610 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((pbl_6_5 <= pil3_2_5))) U ((po1_3_5 + 1 <= po3_2_5) OR (pi3_3_5 + 1 <= pi1_2_4))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (pbl_6_5 <= pil3_2_5)) U ((po1_3_5 + 1 <= po3_2_5) OR (pi3_3_5 + 1 <= pi1_2_4)))
lola: processed formula length: 92
lola: 2 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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: 1291 markings, 2526 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (F (((2 <= pb5_4_3) AND (pil2_6_4 <= pil2_6_2))))) AND A (F (E (X ((1 <= po1_1_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pb5_4_3 <= 1) OR (pil2_6_2 + 1 <= pil2_6_4))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HexagonalGrid-PT-410-CTLCardinality-7.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: lola: The Boolean predicate is false.state equation: calling and running sara

lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5)))) OR E ((((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
sara: try reading problem file HexagonalGrid-PT-410-CTLCardinality-7.sara.
lola: processed formula: E(((pb3_2_4 <= pb3_4_5) AND (pil2_5_3 <= pi4_5_1)) U ((pil1_1_2 <= pi5_7_1) OR (3 <= pb6_3_5)))
lola: processed formula length: 96
lola: 1 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((1 <= pil6_2_1) OR (3 <= pi3_4_1)) U (pol2_3_2 + 1 <= pbl_3_6))
lola: processed formula length: 67
lola: 1 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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: 1211 markings, 1210 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X ((pb4_3_5 <= pol3_4_2))) U ((3 <= pi1_3_6) AND (pbl_4_5 <= po5_1_1) AND (pb3_5_2 + 1 <= po3_4_7))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX((pb4_3_5 <= pol3_4_2)) U ((3 <= pi1_3_6) AND (pbl_4_5 <= po5_1_1) AND (pb3_5_2 + 1 <= po3_4_7)))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 787 places; total mentions: 0
lola: closed formula file HexagonalGrid-PT-410-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1940 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).
sara: place or transition ordering is non-deterministic

lola: 260261 markings, 1263029 edges, 3689329903141912576 markings/sec, 0 secs
lola: 502473 markings, 2450932 edges, 48442 markings/sec, 5 secs
lola: 721490 markings, 3346520 edges, 43803 markings/sec, 10 secs
lola: 834200 markings, 4195612 edges, 22542 markings/sec, 15 secs
lola: 844856 markings, 5160859 edges, 2131 markings/sec, 20 secs
lola: 970788 markings, 6208387 edges, 25186 markings/sec, 25 secs
lola: 1194370 markings, 7352169 edges, 44716 markings/sec, 30 secs
lola: 1417085 markings, 8339749 edges, 44543 markings/sec, 35 secs
lola: 1607169 markings, 9207702 edges, 38017 markings/sec, 40 secs
lola: 1696149 markings, 9983100 edges, 17796 markings/sec, 45 secs
lola: 1704352 markings, 10919117 edges, 1641 markings/sec, 50 secs
lola: 1844395 markings, 11999992 edges, 28009 markings/sec, 55 secs
lola: 2076678 markings, 13207574 edges, 46457 markings/sec, 60 secs
lola: 2319579 markings, 14188107 edges, 48580 markings/sec, 65 secs
lola: 2508083 markings, 15114306 edges, 37701 markings/sec, 70 secs
lola: 2546201 markings, 16080739 edges, 7624 markings/sec, 75 secs
lola: 2568363 markings, 17039148 edges, 4432 markings/sec, 80 secs
lola: 2812107 markings, 18274441 edges, 48749 markings/sec, 85 secs
lola: 3055962 markings, 19353269 edges, 48771 markings/sec, 90 secs
lola: 3213111 markings, 20294789 edges, 31430 markings/sec, 95 secs
lola: 3221079 markings, 21198701 edges, 1594 markings/sec, 100 secs
lola: 3377557 markings, 22109785 edges, 31296 markings/sec, 105 secs
lola: 3566199 markings, 23112204 edges, 37728 markings/sec, 110 secs
lola: 3760845 markings, 23895651 edges, 38929 markings/sec, 115 secs
lola: 3921477 markings, 24653870 edges, 32126 markings/sec, 120 secs
lola: 4013619 markings, 25407430 edges, 18428 markings/sec, 125 secs
lola: 4022322 markings, 26231800 edges, 1741 markings/sec, 130 secs
lola: 4093178 markings, 27071031 edges, 14171 markings/sec, 135 secs
lola: 4312685 markings, 28196047 edges, 43901 markings/sec, 140 secs
lola: 4542617 markings, 29160343 edges, 45986 markings/sec, 145 secs
lola: 4730372 markings, 30063520 edges, 37551 markings/sec, 150 secs
lola: 4793199 markings, 30976050 edges, 12565 markings/sec, 155 secs
lola: 4797684 markings, 31891422 edges, 897 markings/sec, 160 secs
lola: 4941153 markings, 32813735 edges, 28694 markings/sec, 165 secs
lola: 5090370 markings, 33745232 edges, 29843 markings/sec, 170 secs
lola: 5255066 markings, 34553609 edges, 32939 markings/sec, 175 secs
lola: 5414544 markings, 35212273 edges, 31896 markings/sec, 180 secs
lola: 5536841 markings, 35921259 edges, 24459 markings/sec, 185 secs
lola: 5566049 markings, 36645311 edges, 5842 markings/sec, 190 secs
lola: 5570496 markings, 37355655 edges, 889 markings/sec, 195 secs
lola: 5585418 markings, 38030874 edges, 2984 markings/sec, 200 secs
lola: 5790912 markings, 39075773 edges, 41099 markings/sec, 205 secs
lola: 5994907 markings, 40023505 edges, 40799 markings/sec, 210 secs
lola: 6186550 markings, 40808307 edges, 38329 markings/sec, 215 secs
lola: 6305924 markings, 41601400 edges, 23875 markings/sec, 220 secs
lola: 6316397 markings, 42425055 edges, 2095 markings/sec, 225 secs
lola: 6343082 markings, 43196901 edges, 5337 markings/sec, 230 secs
lola: 6479995 markings, 44033785 edges, 27383 markings/sec, 235 secs
lola: 6632532 markings, 45004504 edges, 30507 markings/sec, 240 secs
lola: 6778131 markings, 45705290 edges, 29120 markings/sec, 245 secs
lola: 6914337 markings, 46397058 edges, 27241 markings/sec, 250 secs
lola: 7027248 markings, 47114370 edges, 22582 markings/sec, 255 secs
lola: 7059651 markings, 47827160 edges, 6481 markings/sec, 260 secs
lola: 7064425 markings, 48555000 edges, 955 markings/sec, 265 secs
lola: 7176082 markings, 49452641 edges, 22331 markings/sec, 270 secs
lola: 7385346 markings, 50570576 edges, 41853 markings/sec, 275 secs
lola: 7600443 markings, 51356209 edges, 43019 markings/sec, 280 secs
lola: 7762433 markings, 52209484 edges, 32398 markings/sec, 285 secs
lola: 7781562 markings, 53040369 edges, 3826 markings/sec, 290 secs
lola: 7784841 markings, 53842590 edges, 656 markings/sec, 295 secs
lola: 7932897 markings, 54759142 edges, 29611 markings/sec, 300 secs
lola: 8091417 markings, 55753375 edges, 31704 markings/sec, 305 secs
lola: 8247891 markings, 56462552 edges, 31295 markings/sec, 310 secs
lola: 8389546 markings, 57235775 edges, 28331 markings/sec, 315 secs
lola: 8491235 markings, 57942332 edges, 20338 markings/sec, 320 secs
lola: 8501563 markings, 58724464 edges, 2066 markings/sec, 325 secs
lola: 8504524 markings, 59469185 edges, 592 markings/sec, 330 secs
lola: 8646845 markings, 60263995 edges, 28464 markings/sec, 335 secs
lola: 8811603 markings, 61149118 edges, 32952 markings/sec, 340 secs
lola: 8980463 markings, 61744155 edges, 33772 markings/sec, 345 secs
lola: 9118341 markings, 62442226 edges, 27576 markings/sec, 350 secs
lola: 9199435 markings, 63099892 edges, 16219 markings/sec, 355 secs
lola: 9208854 markings, 63792201 edges, 1884 markings/sec, 360 secs
lola: 9212779 markings, 64457206 edges, 785 markings/sec, 365 secs
lola: 9363544 markings, 65222321 edges, 30153 markings/sec, 370 secs
lola: 9519748 markings, 66044954 edges, 31241 markings/sec, 375 secs
lola: 9683148 markings, 66618324 edges, 32680 markings/sec, 380 secs
lola: 9811252 markings, 67276638 edges, 25621 markings/sec, 385 secs
lola: 9892466 markings, 67904279 edges, 16243 markings/sec, 390 secs
lola: 9901872 markings, 68569017 edges, 1881 markings/sec, 395 secs
lola: 9904247 markings, 69198520 edges, 475 markings/sec, 400 secs
lola: 10077186 markings, 70176462 edges, 34588 markings/sec, 405 secs
lola: 10286576 markings, 71079608 edges, 41878 markings/sec, 410 secs
lola: 10470695 markings, 71923812 edges, 36824 markings/sec, 415 secs
lola: 10562410 markings, 72682135 edges, 18343 markings/sec, 420 secs
lola: 10570910 markings, 73516435 edges, 1700 markings/sec, 425 secs
lola: 10631119 markings, 74334962 edges, 12042 markings/sec, 430 secs
lola: 10778846 markings, 75274975 edges, 29545 markings/sec, 435 secs
lola: 10923968 markings, 76027910 edges, 29024 markings/sec, 440 secs
lola: 11064945 markings, 76711439 edges, 28195 markings/sec, 445 secs
lola: 11176676 markings, 77411720 edges, 22346 markings/sec, 450 secs
lola: 11231714 markings, 78102204 edges, 11008 markings/sec, 455 secs
lola: 11238652 markings, 78872973 edges, 1388 markings/sec, 460 secs
lola: 11300538 markings, 79669262 edges, 12377 markings/sec, 465 secs
lola: 11510588 markings, 80733067 edges, 42010 markings/sec, 470 secs
lola: 11726299 markings, 81548577 edges, 43142 markings/sec, 475 secs
lola: 11868757 markings, 82360602 edges, 28492 markings/sec, 480 secs
lola: 11880210 markings, 83212228 edges, 2291 markings/sec, 485 secs
lola: 11901337 markings, 84032877 edges, 4225 markings/sec, 490 secs
lola: 12053183 markings, 84996595 edges, 30369 markings/sec, 495 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 HexagonalGrid-PT-410-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HexagonalGrid-PT-410-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HexagonalGrid-PT-410"
export BK_EXAMINATION="CTLCardinality"
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/HexagonalGrid-PT-410.tgz
mv HexagonalGrid-PT-410 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 HexagonalGrid-PT-410, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r106-smll-152658636600031"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;