Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
...................
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 10 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 469K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-structural
Input is NeighborGrid-PT-d4n3m2c23, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-csrt-152666473800227
=====================================================================

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


BK_STOP 1527152384803

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using NeighborGrid-PT-d4n3m2c23 as instance name.
Using NeighborGrid as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': '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': 'itstools'}].
Learned tool itstools is 8.589396278016116x far from the best tool lola.
CTLCardinality lola NeighborGrid-PT-d4n3m2c23...
----- Start make prepare stderr -----

Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 294 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 353 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: 812385 markings, 2119954 edges, 162477 markings/sec, 0 secs
lola: 1490482 markings, 3883789 edges, 135619 markings/sec, 5 secs
lola: 2073354 markings, 5426163 edges, 116574 markings/sec, 10 secs
lola: 2801922 markings, 7361449 edges, 145714 markings/sec, 15 secs
lola: 3479761 markings, 9135118 edges, 135568 markings/sec, 20 secs
lola: 4193435 markings, 11026629 edges, 142735 markings/sec, 25 secs
lola: 4887421 markings, 12901197 edges, 138797 markings/sec, 30 secs
lola: 5528682 markings, 14586414 edges, 128252 markings/sec, 35 secs
lola: 6187304 markings, 16332305 edges, 131724 markings/sec, 40 secs
lola: 6823577 markings, 18056836 edges, 127255 markings/sec, 45 secs
lola: 7531389 markings, 19930725 edges, 141562 markings/sec, 50 secs
lola: 8178799 markings, 21638131 edges, 129482 markings/sec, 55 secs
lola: 8783831 markings, 23280819 edges, 121006 markings/sec, 60 secs
lola: 9481307 markings, 25120341 edges, 139495 markings/sec, 65 secs
lola: 10110247 markings, 26790007 edges, 125788 markings/sec, 70 secs
lola: 10714369 markings, 28432578 edges, 120824 markings/sec, 75 secs
lola: 11316683 markings, 30022628 edges, 120463 markings/sec, 80 secs
lola: 11914958 markings, 31653667 edges, 119655 markings/sec, 85 secs
lola: 12511677 markings, 33237353 edges, 119344 markings/sec, 90 secs
lola: 13128664 markings, 34920732 edges, 123397 markings/sec, 95 secs
lola: 13807021 markings, 36724966 edges, 135671 markings/sec, 100 secs
lola: 14442930 markings, 38457025 edges, 127182 markings/sec, 105 secs
lola: 15060482 markings, 40156598 edges, 123510 markings/sec, 110 secs
lola: 15593070 markings, 41623635 edges, 106518 markings/sec, 115 secs
lola: 16116720 markings, 43064896 edges, 104730 markings/sec, 120 secs
lola: 16622212 markings, 44498442 edges, 101098 markings/sec, 125 secs
lola: 17122145 markings, 45951454 edges, 99987 markings/sec, 130 secs
lola: 17602632 markings, 47441890 edges, 96097 markings/sec, 135 secs
lola: 18026341 markings, 48805969 edges, 84742 markings/sec, 140 secs
lola: 18410377 markings, 50094108 edges, 76807 markings/sec, 145 secs
lola: 18800259 markings, 51338192 edges, 77976 markings/sec, 150 secs
lola: 19202426 markings, 52616806 edges, 80433 markings/sec, 155 secs
lola: 19582453 markings, 53838729 edges, 76005 markings/sec, 160 secs
lola: 19929137 markings, 54999937 edges, 69337 markings/sec, 165 secs
lola: 20568827 markings, 56744708 edges, 127938 markings/sec, 170 secs
lola: 21423062 markings, 58938548 edges, 170847 markings/sec, 175 secs
lola: 22177977 markings, 60946573 edges, 150983 markings/sec, 180 secs
lola: 22988470 markings, 63095009 edges, 162099 markings/sec, 185 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 418 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: ========================================
lola: subprocess 9 will run for 478 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 478 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: ========================================
lola: subprocess 10 will run for 557 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 10 will run for 557 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 557 seconds at most (--localtimelimit=-1)
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: 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 669 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 669 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 669 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 12 will run for 836 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: ========================================
lola: subprocess 13 will run for 1115 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 1115 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: subprocess 14 will run for 1673 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 3346 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 1673 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, 1535888 edges, 163590 markings/sec, 0 secs
lola: 914038 markings, 3804015 edges, 19218 markings/sec, 5 secs
lola: 1332868 markings, 5454667 edges, 83766 markings/sec, 10 secs
lola: 1733149 markings, 7055171 edges, 80056 markings/sec, 15 secs
lola: 2173643 markings, 8411611 edges, 88099 markings/sec, 20 secs
lola: 2557808 markings, 10113247 edges, 76833 markings/sec, 25 secs
lola: 2910655 markings, 11897526 edges, 70569 markings/sec, 30 secs
lola: 3303062 markings, 13294876 edges, 78481 markings/sec, 35 secs
lola: 3691557 markings, 15016461 edges, 77699 markings/sec, 40 secs
lola: 4107106 markings, 16737157 edges, 83110 markings/sec, 45 secs
lola: 4521263 markings, 18456657 edges, 82831 markings/sec, 50 secs
lola: 4954894 markings, 20193385 edges, 86726 markings/sec, 55 secs
lola: 5403393 markings, 21944389 edges, 89700 markings/sec, 60 secs
lola: 5751545 markings, 23496829 edges, 69630 markings/sec, 65 secs
lola: 6144839 markings, 25156248 edges, 78659 markings/sec, 70 secs
lola: 6503982 markings, 26567823 edges, 71829 markings/sec, 75 secs
lola: 6937983 markings, 28122748 edges, 86800 markings/sec, 80 secs
lola: 7315294 markings, 29816561 edges, 75462 markings/sec, 85 secs
lola: 7652552 markings, 31313360 edges, 67452 markings/sec, 90 secs
lola: 8065117 markings, 32835244 edges, 82513 markings/sec, 95 secs
lola: 8410474 markings, 34405360 edges, 69071 markings/sec, 100 secs
lola: 8774022 markings, 35903712 edges, 72710 markings/sec, 105 secs
lola: 9170899 markings, 37459349 edges, 79375 markings/sec, 110 secs
lola: 9518659 markings, 38925652 edges, 69552 markings/sec, 115 secs
lola: 9917836 markings, 40588341 edges, 79835 markings/sec, 120 secs
lola: 10285096 markings, 42051534 edges, 73452 markings/sec, 125 secs
lola: 10695632 markings, 43651328 edges, 82107 markings/sec, 130 secs
lola: 11048764 markings, 45160298 edges, 70626 markings/sec, 135 secs
lola: 11422966 markings, 46692201 edges, 74840 markings/sec, 140 secs
lola: 11808181 markings, 48098317 edges, 77043 markings/sec, 145 secs
lola: 12169448 markings, 49734318 edges, 72253 markings/sec, 150 secs
lola: 12562270 markings, 51275377 edges, 78564 markings/sec, 155 secs
lola: 12952681 markings, 52842651 edges, 78082 markings/sec, 160 secs
lola: 13345854 markings, 54450394 edges, 78635 markings/sec, 165 secs
lola: 13739497 markings, 56010922 edges, 78729 markings/sec, 170 secs
lola: 14124068 markings, 57546810 edges, 76914 markings/sec, 175 secs
lola: 14501263 markings, 59037219 edges, 75439 markings/sec, 180 secs
lola: 14876593 markings, 60536653 edges, 75066 markings/sec, 185 secs
lola: 15249952 markings, 62005419 edges, 74672 markings/sec, 190 secs
lola: 15616097 markings, 63464120 edges, 73229 markings/sec, 195 secs
lola: 15984996 markings, 64899381 edges, 73780 markings/sec, 200 secs
lola: 16318123 markings, 66212798 edges, 66625 markings/sec, 205 secs
lola: 16647282 markings, 67505240 edges, 65832 markings/sec, 210 secs
lola: 16974951 markings, 68790723 edges, 65534 markings/sec, 215 secs
lola: 17289489 markings, 70073426 edges, 62908 markings/sec, 220 secs
lola: 17584446 markings, 71295652 edges, 58991 markings/sec, 225 secs
lola: 17867176 markings, 72484056 edges, 56546 markings/sec, 230 secs
lola: 18142984 markings, 73682665 edges, 55162 markings/sec, 235 secs
lola: 18412159 markings, 74858937 edges, 53835 markings/sec, 240 secs
lola: 18675736 markings, 75979698 edges, 52715 markings/sec, 245 secs
lola: 18961926 markings, 77182628 edges, 57238 markings/sec, 250 secs
lola: 19238781 markings, 78337726 edges, 55371 markings/sec, 255 secs
lola: 19508033 markings, 79474251 edges, 53850 markings/sec, 260 secs
lola: 19757046 markings, 80566536 edges, 49803 markings/sec, 265 secs
lola: 20006490 markings, 81652472 edges, 49889 markings/sec, 270 secs
lola: 20654778 markings, 82918517 edges, 129658 markings/sec, 275 secs
lola: 21579414 markings, 84394118 edges, 184927 markings/sec, 280 secs
lola: 21579414 markings, 86033637 edges, 0 markings/sec, 285 secs
lola: 21684870 markings, 88351422 edges, 21091 markings/sec, 290 secs
lola: 22131070 markings, 90316697 edges, 89240 markings/sec, 295 secs
lola: 22634530 markings, 92173751 edges, 100692 markings/sec, 300 secs
lola: 23046856 markings, 94065899 edges, 82465 markings/sec, 305 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
----- Kill lola and sara stderr -----
FORMULA NeighborGrid-PT-d4n3m2c23-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

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="irma4mcc-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool irma4mcc-structural"
echo " Input is NeighborGrid-PT-d4n3m2c23, examination is 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 r115-csrt-152666473800227"
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 ;