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 mcc4mcc-full
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-csrt-152666478200227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527291678157


BK_STOP 1527292225907

--------------------
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 NeighborGrid-PT-d4n3m2c23 as instance name.
Using NeighborGrid 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': 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': 340786, 'Memory': 15952.82, 'Tool': 'lola'}, {'Time': 2927146, 'Memory': 15950.84, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality 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 CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ NeighborGrid-PT-d4n3m2c23 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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-CTLCardinality.task
lola: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1))))) : E (X (NOT(E (X ((p_1_2_1_2 <= p_0_2_2_0)))))) : (E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1))))) AND E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))) : E (G (E (F (((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0)))))) : A (X (E (X ((1 <= p_2_1_2_2))))) : A (G (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0)))) : NOT(E (X (A (G ((p_2_2_1_1 <= p_1_1_1_1)))))) : A (G (A (F ((p_0_0_1_0 <= 2))))) : E (G ((2 <= p_2_0_1_1))) : (E (G (E (X ((3 <= p_0_0_0_0))))) AND E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))) : (A (F (A (X ((3 <= p_1_0_2_0))))) OR NOT(A (((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2))))) : (NOT((E (G ((p_0_1_0_1 <= p_1_1_0_0))) OR (((p_2_1_1_1 <= p_0_1_1_2) OR (p_0_1_2_1 <= p_1_2_2_2)) AND (p_0_2_2_2 <= 0)))) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2))) : A (G ((1 <= p_0_0_0_2))) : ((E (G ((2 <= p_0_1_1_2))) AND A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))) : A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1)))))) : A (F (A (F (((2 <= p_0_0_0_0) AND (3 <= p_0_2_0_0))))))
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 (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: processed formula: A (((1 <= p_0_1_1_0) U ((p_1_2_0_1 <= 0) OR ((3 <= p_0_0_1_1) AND (p_2_2_1_0 <= p_2_0_2_1)))))
lola: processed formula length: 95
lola: 0 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 140 markings, 140 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(E (X ((p_1_2_1_2 <= p_0_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(AX((p_0_2_2_0 + 1 <= p_1_2_1_2)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((p_0_2_0_1 <= p_1_1_1_1))))) AND E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0))))))
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 (A (X ((p_0_2_0_1 <= p_1_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((p_0_2_0_1 <= p_1_1_1_1)))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 75 markings, 74 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_1_1_1_0 <= p_1_0_2_0) AND (2 <= p_0_2_1_1) AND ((p_0_2_2_0 <= p_2_0_0_1) OR (3 <= p_0_1_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_1_0_2_0 + 1 <= p_1_1_1_0) OR (p_0_2_1_1 <= 1) OR ((p_2_0_0_1 + 1 <= p_0_2_2_0) AND (p_0_1_0_0 <= 2)))))
lola: processed formula length: 122
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 451 markings, 451 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U ((p_1_1_0_0 <= p_1_2_1_2) OR (p_1_2_0_0 <= p_2_2_2_0))))))
lola: processed formula length: 85
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 263 markings, 526 edges
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((1 <= p_2_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX((1 <= p_2_1_2_2)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p_0_2_1_1 <= p_2_0_0_2) OR (p_1_0_2_1 <= p_0_0_0_1) OR (p_2_0_0_0 <= p_0_1_1_2) OR (1 <= p_2_2_2_0))))
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 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: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X (A (G ((p_2_2_1_1 <= p_1_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (p_1_1_1_1 + 1 <= p_2_2_1_1)))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 133647 markings, 134467 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((p_0_0_1_0 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (p_0_0_1_0 <= 2)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 851924 markings, 2219549 edges, 170385 markings/sec, 0 secs
lola: 1540285 markings, 4018643 edges, 137672 markings/sec, 5 secs
lola: 2106479 markings, 5514444 edges, 113239 markings/sec, 10 secs
lola: 2831060 markings, 7439036 edges, 144916 markings/sec, 15 secs
lola: 3451224 markings, 9059348 edges, 124033 markings/sec, 20 secs
lola: 4118009 markings, 10817238 edges, 133357 markings/sec, 25 secs
lola: 4780616 markings, 12619092 edges, 132521 markings/sec, 30 secs
lola: 5455677 markings, 14401799 edges, 135012 markings/sec, 35 secs
lola: 6106843 markings, 16115360 edges, 130233 markings/sec, 40 secs
lola: 6732942 markings, 17793765 edges, 125220 markings/sec, 45 secs
lola: 7381050 markings, 19537205 edges, 129622 markings/sec, 50 secs
lola: 7971750 markings, 21086237 edges, 118140 markings/sec, 55 secs
lola: 8585924 markings, 22726153 edges, 122835 markings/sec, 60 secs
lola: 9222956 markings, 24448659 edges, 127406 markings/sec, 65 secs
lola: 9819333 markings, 26015678 edges, 119275 markings/sec, 70 secs
lola: 10407547 markings, 27606635 edges, 117643 markings/sec, 75 secs
lola: 11012733 markings, 29220645 edges, 121037 markings/sec, 80 secs
lola: 11604286 markings, 30786407 edges, 118311 markings/sec, 85 secs
lola: 12191580 markings, 32390843 edges, 117459 markings/sec, 90 secs
lola: 12777031 markings, 33942102 edges, 117090 markings/sec, 95 secs
lola: 13349661 markings, 35505148 edges, 114526 markings/sec, 100 secs
lola: 13931480 markings, 37066454 edges, 116364 markings/sec, 105 secs
lola: 14492053 markings, 38590257 edges, 112115 markings/sec, 110 secs
lola: 15024053 markings, 40056152 edges, 106400 markings/sec, 115 secs
lola: 15543220 markings, 41470621 edges, 103833 markings/sec, 120 secs
lola: 16044929 markings, 42856460 edges, 100342 markings/sec, 125 secs
lola: 16540637 markings, 44253824 edges, 99142 markings/sec, 130 secs
lola: 17002522 markings, 45593205 edges, 92377 markings/sec, 135 secs
lola: 17421034 markings, 46871425 edges, 83702 markings/sec, 140 secs
lola: 17808439 markings, 48098133 edges, 77481 markings/sec, 145 secs
lola: 18164678 markings, 49271160 edges, 71248 markings/sec, 150 secs
lola: 18508632 markings, 50419158 edges, 68791 markings/sec, 155 secs
lola: 18865078 markings, 51547185 edges, 71289 markings/sec, 160 secs
lola: 19215584 markings, 52655729 edges, 70101 markings/sec, 165 secs
lola: 19558960 markings, 53756790 edges, 68675 markings/sec, 170 secs
lola: 19881952 markings, 54845398 edges, 64598 markings/sec, 175 secs
lola: 20340928 markings, 56181649 edges, 91795 markings/sec, 180 secs
lola: 21121726 markings, 58147833 edges, 156160 markings/sec, 185 secs
lola: 21932324 markings, 60291624 edges, 162120 markings/sec, 190 secs
lola: 22683227 markings, 62284101 edges, 150181 markings/sec, 195 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 416 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_2_0_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_2_0_1_1 <= 1)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 367 markings, 367 edges
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (E (X ((3 <= p_0_0_0_0))))) AND E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 475 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (X ((3 <= p_0_0_0_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(EX((3 <= p_0_0_0_0)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p_2_2_2_0 <= p_1_0_1_1) OR (p_1_1_2_2 <= p_1_2_2_0) OR (p_0_0_0_0 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p_1_0_1_1 + 1 <= p_2_2_2_0) AND (p_1_2_2_0 + 1 <= p_1_1_2_2) AND (2 <= p_0_0_0_0))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 263 markings, 263 edges
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (X ((3 <= p_1_0_2_0))))) OR NOT(A (((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 554 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((3 <= p_1_0_2_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((3 <= p_1_0_2_0)))
lola: processed formula length: 30
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: ========================================
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 315 markings, 315 edges
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p_1_2_1_2 <= 1) R (p_1_0_1_2 + 1 <= p_2_1_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A((2 <= p_1_2_1_2) U (p_2_1_1_1 <= p_1_0_1_2)))
lola: processed formula length: 51
lola: 7 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (G ((p_0_1_0_1 <= p_1_1_0_0))) OR (((p_2_1_1_1 <= p_0_1_1_2) OR (p_0_1_2_1 <= p_1_2_2_2)) AND (p_0_2_2_2 <= 0)))) AND ((E (F ((p_0_0_1_1 <= p_2_1_2_1))) AND (p_0_0_0_1 <= p_1_0_0_1)) OR (2 <= p_1_1_0_2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: processed formula: A (F ((p_1_1_0_0 + 1 <= p_0_1_0_1)))
lola: processed formula length: 36
lola: 6 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 120 markings, 120 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 832 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= p_0_0_0_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 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: subprocess 13 will run for 1109 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((2 <= p_0_1_1_2))) AND A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))) AND A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1109 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p_0_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_0_1_1_2 <= 1)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 263 markings, 263 edges
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: processed formula: A (F (((2 <= p_0_0_1_1) AND (p_0_2_1_0 <= p_1_1_1_0))))
lola: processed formula length: 55
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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 15 will run for 3328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: processed formula: A ((((2 <= p_1_0_2_2) OR (1 <= p_1_1_1_0)) U ((p_2_2_0_2 <= p_2_2_2_2) AND (1 <= p_0_0_1_0))))
lola: processed formula length: 95
lola: 1 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 14 will run for 1664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((2 <= p_2_0_2_1) AND (1 <= p_1_2_0_1))))))
lola: processed formula length: 69
lola: 2 rewrites
lola: formula mentions 0 of 81 places; total mentions: 0
lola: closed formula file NeighborGrid-PT-d4n3m2c23-CTLCardinality.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: 817949 markings, 1339806 edges, 163590 markings/sec, 0 secs
lola: 848759 markings, 3564368 edges, 6162 markings/sec, 5 secs
lola: 1244437 markings, 5125614 edges, 79136 markings/sec, 10 secs
lola: 1624391 markings, 6644713 edges, 75991 markings/sec, 15 secs
lola: 1972396 markings, 7949248 edges, 69601 markings/sec, 20 secs
lola: 2368181 markings, 9609424 edges, 79157 markings/sec, 25 secs
lola: 2791534 markings, 11277685 edges, 84671 markings/sec, 30 secs
lola: 3131172 markings, 12705325 edges, 67928 markings/sec, 35 secs
lola: 3515783 markings, 14303122 edges, 76922 markings/sec, 40 secs
lola: 3929632 markings, 15917213 edges, 82770 markings/sec, 45 secs
lola: 4333823 markings, 17331614 edges, 80838 markings/sec, 50 secs
lola: 4715086 markings, 18983382 edges, 76253 markings/sec, 55 secs
lola: 5062108 markings, 20592041 edges, 69404 markings/sec, 60 secs
lola: 5425107 markings, 22221801 edges, 72600 markings/sec, 65 secs
lola: 5866653 markings, 23690972 edges, 88309 markings/sec, 70 secs
lola: 6210979 markings, 25407538 edges, 68865 markings/sec, 75 secs
lola: 6618512 markings, 26892346 edges, 81507 markings/sec, 80 secs
lola: 6965391 markings, 28518582 edges, 69376 markings/sec, 85 secs
lola: 7356147 markings, 30158758 edges, 78151 markings/sec, 90 secs
lola: 7706296 markings, 31505923 edges, 70030 markings/sec, 95 secs
lola: 8092780 markings, 33087560 edges, 77297 markings/sec, 100 secs
lola: 8446084 markings, 34539690 edges, 70661 markings/sec, 105 secs
lola: 8863100 markings, 36050842 edges, 83403 markings/sec, 110 secs
lola: 9217297 markings, 37762842 edges, 70839 markings/sec, 115 secs
lola: 9604175 markings, 39208891 edges, 77376 markings/sec, 120 secs
lola: 9969001 markings, 40779402 edges, 72965 markings/sec, 125 secs
lola: 10360955 markings, 42244313 edges, 78391 markings/sec, 130 secs
lola: 10727083 markings, 43843103 edges, 73226 markings/sec, 135 secs
lola: 11092436 markings, 45313642 edges, 73071 markings/sec, 140 secs
lola: 11501215 markings, 46893046 edges, 81756 markings/sec, 145 secs
lola: 11840067 markings, 48372141 edges, 67770 markings/sec, 150 secs
lola: 12206459 markings, 49871924 edges, 73278 markings/sec, 155 secs
lola: 12557730 markings, 51259176 edges, 70254 markings/sec, 160 secs
lola: 12910657 markings, 52627455 edges, 70585 markings/sec, 165 secs
lola: 13255607 markings, 54090378 edges, 68990 markings/sec, 170 secs
lola: 13614551 markings, 55443152 edges, 71789 markings/sec, 175 secs
lola: 13958517 markings, 56819875 edges, 68793 markings/sec, 180 secs
lola: 14300602 markings, 58259534 edges, 68417 markings/sec, 185 secs
lola: 14656952 markings, 59625355 edges, 71270 markings/sec, 190 secs
lola: 14976465 markings, 60942160 edges, 63903 markings/sec, 195 secs
lola: 15329068 markings, 62324099 edges, 70521 markings/sec, 200 secs
lola: 15646549 markings, 63585398 edges, 63496 markings/sec, 205 secs
lola: 15974184 markings, 64857686 edges, 65527 markings/sec, 210 secs
lola: 16290407 markings, 66106218 edges, 63245 markings/sec, 215 secs
lola: 16604412 markings, 67329642 edges, 62801 markings/sec, 220 secs
lola: 16910650 markings, 68532750 edges, 61248 markings/sec, 225 secs
lola: 17202569 markings, 69711185 edges, 58384 markings/sec, 230 secs
lola: 17479535 markings, 70859250 edges, 55393 markings/sec, 235 secs
lola: 17745534 markings, 71971116 edges, 53200 markings/sec, 240 secs
lola: 18001438 markings, 73061966 edges, 51181 markings/sec, 245 secs
lola: 18243454 markings, 74121051 edges, 48403 markings/sec, 250 secs
lola: 18485252 markings, 75176470 edges, 48360 markings/sec, 255 secs
lola: 18733885 markings, 76218502 edges, 49727 markings/sec, 260 secs
lola: 18979879 markings, 77261094 edges, 49199 markings/sec, 265 secs
lola: 19230282 markings, 78302474 edges, 50081 markings/sec, 270 secs
lola: 19477699 markings, 79343577 edges, 49483 markings/sec, 275 secs
lola: 19712672 markings, 80369370 edges, 46995 markings/sec, 280 secs
lola: 19942825 markings, 81375843 edges, 46031 markings/sec, 285 secs
lola: 20344186 markings, 82461711 edges, 80272 markings/sec, 290 secs
lola: 21244723 markings, 83846558 edges, 180107 markings/sec, 295 secs
lola: 21579414 markings, 85236486 edges, 66938 markings/sec, 300 secs
lola: 21579414 markings, 87199012 edges, 0 markings/sec, 305 secs
lola: 21859293 markings, 89198041 edges, 55976 markings/sec, 310 secs
lola: 22277406 markings, 91059254 edges, 83623 markings/sec, 315 secs
lola: 22835143 markings, 92973359 edges, 111547 markings/sec, 320 secs
lola: 23163330 markings, 94726879 edges, 65637 markings/sec, 325 secs
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 NeighborGrid-PT-d4n3m2c23-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA NeighborGrid-PT-d4n3m2c23-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="NeighborGrid-PT-d4n3m2c23"
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/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 mcc4mcc-full"
echo " Input is NeighborGrid-PT-d4n3m2c23, 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 r118-csrt-152666478200227"
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 ;