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.5M
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 117 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 355 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 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K 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 1.3M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is HypercubeGrid-PT-C3K4P4B12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r106-smll-152658636700108
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526760715741


BK_STOP 1526761248523

--------------------
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 HypercubeGrid-PT-C3K4P4B12 as instance name.
Using HypercubeGrid 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': False, 'Reversible': False, 'Quasi Live': True, 'Live': False}.
Known tools are: [{'Time': 1690363, 'Memory': 15953, 'Tool': 'lola'}, {'Time': 1700643, 'Memory': 15921.93, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola HypercubeGrid-PT-C3K4P4B12...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
HypercubeGrid-PT-C3K4P4B12: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ HypercubeGrid-PT-C3K4P4B12 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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: 3808/65536 symbol table entries, 269 collisions
lola: preprocessing...
lola: finding significant places
lola: 1408 places, 2400 transitions, 863 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2944 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: A (X (A (F ((2 <= pol_d1_n1_5_4_3))))) : A (X (A (F (((1 <= pol_d3_n1_4_2_4) OR (3 <= pi_d2_n1_1_1_1)))))) : (((pol_d3_n1_4_2_5 <= pb_d2_n2_3_2_4) OR (3 <= pol_d1_n1_2_1_1) OR (pbl_3_1_4 <= po_d1_n1_1_2_3) OR (pi_d3_n1_2_1_2 <= pbl_4_2_1)) AND E (F ((((3 <= pi_d3_n1_2_4_2) AND (1 <= pi_d3_n1_4_2_2)) OR ((2 <= po_d2_n1_2_4_2) AND (3 <= pbl_1_1_2)))))) : ((NOT(A (G ((pi_d3_n1_2_3_2 <= pb_d1_n1_3_4_3)))) AND ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))) AND (((pol_d3_n1_2_4_5 <= 1) OR E (G ((2 <= po_d1_n1_1_1_2)))) AND (((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2))) OR E (F ((1 <= po_d3_n1_4_4_2)))))) : (E (X ((((1 <= pb_d2_n1_4_1_2) AND (1 <= po_d1_n1_1_2_4)) OR (pb_d3_n2_3_2_4 <= 1)))) AND E (F ((2 <= pi_d3_n1_3_2_3)))) : (E (((po_d1_n1_5_1_4 <= 2) U (pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3))) OR (pol_d2_n1_3_4_2 <= po_d1_n1_3_2_3)) : (A (G (E (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1))))) OR A (X (E (G ((3 <= pol_d1_n1_1_4_1)))))) : A (G ((pol_d1_n1_5_4_1 <= 1))) : (E (X (E (F ((pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3))))) OR A (G ((pil_d3_n1_2_3_3 <= po_d2_n1_3_2_3)))) : E (F ((3 <= pi_d3_n1_3_3_1))) : E (F ((pb_d1_n1_1_4_4 <= po_d1_n1_2_3_2))) : E (G (A (((3 <= pi_d3_n1_3_2_2) U (3 <= pb_d2_n1_3_3_3))))) : (NOT((A (F ((1 <= pi_d3_n1_3_2_2))) AND E (F ((3 <= po_d1_n1_5_2_2))))) OR E (F (E (G ((1 <= pb_d3_n2_3_1_2)))))) : A (F ((pb_d3_n1_4_1_2 <= pi_d3_n1_1_1_2))) : E (G (E (G (((1 <= pb_d3_n1_2_1_4) OR (3 <= pbl_2_1_1)))))) : A (F ((pil_d2_n1_4_4_1 <= po_d3_n1_4_4_5)))
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 (X (A (F ((2 <= pol_d1_n1_5_4_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (2 <= pol_d1_n1_5_4_3)))
lola: processed formula length: 36
lola: 2 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 11426 markings, 11425 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (((1 <= pol_d3_n1_4_2_4) OR (3 <= pi_d2_n1_1_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((1 <= pol_d3_n1_4_2_4) OR (3 <= pi_d2_n1_1_1_1))))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 26405 markings, 26406 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((pol_d3_n1_4_2_5 <= pb_d2_n2_3_2_4) OR (3 <= pol_d1_n1_2_1_1) OR (pbl_3_1_4 <= po_d1_n1_1_2_3) OR (pi_d3_n1_2_1_2 <= pbl_4_2_1)) AND E (F ((((3 <= pi_d3_n1_2_4_2) AND (1 <= pi_d3_n1_4_2_2)) OR ((2 <= po_d2_n1_2_4_2) AND (3 <= pbl_1_1_2))))))
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: ((pol_d3_n1_4_2_5 <= pb_d2_n2_3_2_4) OR (3 <= pol_d1_n1_2_1_1) OR (pbl_3_1_4 <= po_d1_n1_1_2_3) OR (pi_d3_n1_2_1_2 <= pbl_4_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pol_d3_n1_4_2_5 <= pb_d2_n2_3_2_4) OR (3 <= pol_d1_n1_2_1_1) OR (pbl_3_1_4 <= po_d1_n1_1_2_3) OR (pi_d3_n1_2_1_2 <= pbl_4_2_1))
lola: processed formula length: 132
lola: 0 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 4 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= pi_d3_n1_2_4_2) AND (1 <= pi_d3_n1_4_2_2)) OR ((2 <= po_d2_n1_2_4_2) AND (3 <= pbl_1_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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 2 conjunctive subformulas
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C3K4P4B12-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(A (G ((pi_d3_n1_2_3_2 <= pb_d1_n1_3_4_3)))) AND ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))) AND (((pol_d3_n1_2_4_5 <= 1) OR E (G ((2 <= po_d1_n1_1_1_2)))) AND (((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2))) OR E (F ((1 <= po_d3_n1_4_4_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n1_3_4_3 + 1 <= pi_d3_n1_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: yes
lola: produced by: state space
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-3.sara
lola: The predicate is reachable.
lola: 9 markings, 8 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi_d1_n1_3_1_3 <= pb_d3_n1_3_2_3) AND (po_d2_n1_4_4_3 <= pol_d3_n1_4_1_3))
lola: processed formula length: 76
lola: 4 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (pol_d3_n1_2_4_5 <= 1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pol_d3_n1_2_4_5 <= 1)
lola: processed formula length: 22
lola: 4 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pi_d2_n1_4_1_1 <= pi_d2_n1_4_5_1) OR ((pb_d1_n2_4_3_2 <= pb_d2_n2_4_3_1) AND (pi_d2_n1_3_2_3 <= pol_d3_n1_4_4_2)))
lola: processed formula length: 117
lola: 4 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X ((((1 <= pb_d2_n1_4_1_2) AND (1 <= po_d1_n1_1_2_4)) OR (pb_d3_n2_3_2_4 <= 1)))) AND E (F ((2 <= pi_d3_n1_3_2_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: E (X ((((1 <= pb_d2_n1_4_1_2) AND (1 <= po_d1_n1_1_2_4)) OR (pb_d3_n2_3_2_4 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((((1 <= pb_d2_n1_4_1_2) AND (1 <= po_d1_n1_1_2_4)) OR (pb_d3_n2_3_2_4 <= 1)))
lola: processed formula length: 81
lola: 1 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: E (F ((2 <= pi_d3_n1_3_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C3K4P4B12-CTLCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
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: (E (((po_d1_n1_5_1_4 <= 2) U (pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3))) OR (pol_d2_n1_3_4_2 <= po_d1_n1_3_2_3))
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: E (((po_d1_n1_5_1_4 <= 2) U (pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((po_d1_n1_5_1_4 <= 2) U (pil_d1_n1_5_1_1 + 1 <= po_d1_n1_1_3_3))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 4466 markings, 4465 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 (G (E (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1))))) OR A (X (E (G ((3 <= pol_d1_n1_1_4_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((pi_d1_n1_3_1_1 <= pbl_3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (pbl_3_1_1 + 1 <= pi_d1_n1_3_1_1))))
lola: processed formula length: 58
lola: 4 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 9465 markings, 27905 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G ((3 <= pol_d1_n1_1_4_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U (pol_d1_n1_1_4_1 <= 2))))
lola: processed formula length: 41
lola: 3 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((pol_d1_n1_5_4_1 <= 1)))
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 3452 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: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C3K4P4B12-CTLCardinality-7.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 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3))))) OR A (G ((pil_d3_n1_2_3_3 <= po_d2_n1_3_2_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (pb_d3_n1_1_4_1 <= pi_d1_n1_1_2_3)))
lola: processed formula length: 48
lola: 2 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 163800 markings, 751556 edges, 32760 markings/sec, 0 secs
lola: 305081 markings, 1425405 edges, 28256 markings/sec, 5 secs
lola: 449155 markings, 2109511 edges, 28815 markings/sec, 10 secs
lola: 588027 markings, 2794152 edges, 27774 markings/sec, 15 secs
lola: 717192 markings, 3473177 edges, 25833 markings/sec, 20 secs
lola: 868479 markings, 4259551 edges, 30257 markings/sec, 25 secs
lola: 1001091 markings, 4956398 edges, 26522 markings/sec, 30 secs
lola: 1133028 markings, 5648378 edges, 26387 markings/sec, 35 secs
lola: 1259657 markings, 6346793 edges, 25326 markings/sec, 40 secs
lola: 1348656 markings, 6931614 edges, 17800 markings/sec, 45 secs
lola: 1478680 markings, 7510939 edges, 26005 markings/sec, 50 secs
lola: 1571189 markings, 8104496 edges, 18502 markings/sec, 55 secs
lola: 1678812 markings, 8751003 edges, 21525 markings/sec, 60 secs
lola: 1800959 markings, 9327061 edges, 24429 markings/sec, 65 secs
lola: 1894751 markings, 9927576 edges, 18758 markings/sec, 70 secs
lola: 2000268 markings, 10579402 edges, 21103 markings/sec, 75 secs
lola: 2126124 markings, 11239838 edges, 25171 markings/sec, 80 secs
lola: 2230726 markings, 11784698 edges, 20920 markings/sec, 85 secs
lola: 2339918 markings, 12418216 edges, 21838 markings/sec, 90 secs
lola: 2439516 markings, 13060021 edges, 19920 markings/sec, 95 secs
lola: 2546315 markings, 13560984 edges, 21360 markings/sec, 100 secs
lola: 2652266 markings, 14192612 edges, 21190 markings/sec, 105 secs
lola: 2768872 markings, 14695356 edges, 23321 markings/sec, 110 secs
lola: 2832415 markings, 15203103 edges, 12709 markings/sec, 115 secs
lola: 2949816 markings, 15752356 edges, 23480 markings/sec, 120 secs
lola: 3104911 markings, 16288992 edges, 31019 markings/sec, 125 secs
lola: 3286609 markings, 16764700 edges, 36340 markings/sec, 130 secs
lola: 3455280 markings, 17226465 edges, 33734 markings/sec, 135 secs
lola: 3613975 markings, 17674425 edges, 31739 markings/sec, 140 secs
lola: 3763565 markings, 18112526 edges, 29918 markings/sec, 145 secs
lola: 3908203 markings, 18548093 edges, 28928 markings/sec, 150 secs
lola: 4047793 markings, 18981313 edges, 27918 markings/sec, 155 secs
lola: 4184441 markings, 19412843 edges, 27330 markings/sec, 160 secs
lola: 4316694 markings, 19839195 edges, 26451 markings/sec, 165 secs
lola: 4447339 markings, 20263481 edges, 26129 markings/sec, 170 secs
lola: 4576096 markings, 20684476 edges, 25751 markings/sec, 175 secs
lola: 4704361 markings, 21104528 edges, 25653 markings/sec, 180 secs
lola: 4830495 markings, 21520322 edges, 25227 markings/sec, 185 secs
lola: 4954977 markings, 21933497 edges, 24896 markings/sec, 190 secs
lola: 5074933 markings, 22338550 edges, 23991 markings/sec, 195 secs
lola: 5194154 markings, 22746215 edges, 23844 markings/sec, 200 secs
lola: 5310924 markings, 23152721 edges, 23354 markings/sec, 205 secs
lola: 5423015 markings, 23556947 edges, 22418 markings/sec, 210 secs
lola: 5533948 markings, 23960380 edges, 22187 markings/sec, 215 secs
lola: 5645301 markings, 24362733 edges, 22271 markings/sec, 220 secs
lola: 5753876 markings, 24764010 edges, 21715 markings/sec, 225 secs
lola: 5859439 markings, 25162391 edges, 21113 markings/sec, 230 secs
lola: 5964822 markings, 25560438 edges, 21077 markings/sec, 235 secs
lola: 6068499 markings, 25956661 edges, 20735 markings/sec, 240 secs
lola: 6172828 markings, 26352802 edges, 20866 markings/sec, 245 secs
lola: 6277137 markings, 26748492 edges, 20862 markings/sec, 250 secs
lola: 6379061 markings, 27140590 edges, 20385 markings/sec, 255 secs
lola: 6482905 markings, 27532239 edges, 20769 markings/sec, 260 secs
lola: 6581951 markings, 27919930 edges, 19809 markings/sec, 265 secs
lola: 6681476 markings, 28307620 edges, 19905 markings/sec, 270 secs
lola: 6777613 markings, 28693109 edges, 19227 markings/sec, 275 secs
lola: 6873378 markings, 29074448 edges, 19153 markings/sec, 280 secs
lola: 6969809 markings, 29458284 edges, 19286 markings/sec, 285 secs
lola: 7062551 markings, 29841105 edges, 18548 markings/sec, 290 secs
lola: 7153475 markings, 30221384 edges, 18185 markings/sec, 295 secs
lola: 7242406 markings, 30602739 edges, 17786 markings/sec, 300 secs
lola: 7329473 markings, 30982389 edges, 17413 markings/sec, 305 secs
lola: 7412743 markings, 31357503 edges, 16654 markings/sec, 310 secs
lola: 7495203 markings, 31730849 edges, 16492 markings/sec, 315 secs
lola: 7577230 markings, 32106868 edges, 16405 markings/sec, 320 secs
lola: 7659285 markings, 32480522 edges, 16411 markings/sec, 325 secs
lola: 7740602 markings, 32851512 edges, 16263 markings/sec, 330 secs
lola: 7821614 markings, 33222166 edges, 16202 markings/sec, 335 secs
lola: 7901712 markings, 33589674 edges, 16020 markings/sec, 340 secs
lola: 7979178 markings, 33956214 edges, 15493 markings/sec, 345 secs
lola: 8055701 markings, 34317361 edges, 15305 markings/sec, 350 secs
lola: 8129911 markings, 34679192 edges, 14842 markings/sec, 355 secs
lola: 8200880 markings, 35040444 edges, 14194 markings/sec, 360 secs
lola: 8270372 markings, 35405051 edges, 13898 markings/sec, 365 secs
lola: 8339113 markings, 35770338 edges, 13748 markings/sec, 370 secs
lola: 8406746 markings, 36137578 edges, 13527 markings/sec, 375 secs
lola: 8474772 markings, 36499815 edges, 13605 markings/sec, 380 secs
lola: 8543424 markings, 36860183 edges, 13730 markings/sec, 385 secs
lola: 8608223 markings, 37214082 edges, 12960 markings/sec, 390 secs
lola: 8673584 markings, 37562565 edges, 13072 markings/sec, 395 secs
lola: 8734909 markings, 37911278 edges, 12265 markings/sec, 400 secs
lola: 8794352 markings, 38260024 edges, 11889 markings/sec, 405 secs
lola: 8852747 markings, 38617729 edges, 11679 markings/sec, 410 secs
lola: 8907271 markings, 38975365 edges, 10905 markings/sec, 415 secs
lola: 8958118 markings, 39328364 edges, 10169 markings/sec, 420 secs
lola: 9009150 markings, 39672752 edges, 10206 markings/sec, 425 secs
lola: 9058442 markings, 40019435 edges, 9858 markings/sec, 430 secs
lola: 9106031 markings, 40353195 edges, 9518 markings/sec, 435 secs
lola: lola: local time limit reached - aborting
local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= pi_d3_n1_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C3K4P4B12-CTLCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d1_n1_1_4_4 <= po_d1_n1_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: The predicate is reachable.
lola: 80 markings, 79 edges
lola: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-10.sara
lola: subprocess 11 will run for 618 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((3 <= pi_d3_n1_3_2_2) U (3 <= pb_d2_n1_3_3_3)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: state equation: calling and running sara
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((3 <= pi_d3_n1_3_2_2) U (3 <= pb_d2_n1_3_3_3)))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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).
sara: try reading problem file HypercubeGrid-PT-C3K4P4B12-CTLCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 9439 markings, 18885 edges
lola: ========================================
lola: subprocess 12 will run for 772 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((A (F ((1 <= pi_d3_n1_3_2_2))) AND E (F ((3 <= po_d1_n1_5_2_2))))) OR E (F (E (G ((1 <= pb_d3_n2_3_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 772 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pi_d3_n1_3_2_2 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (1 <= pi_d3_n1_3_2_2)))
lola: processed formula length: 36
lola: 10 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 9358 markings, 9360 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1030 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d3_n1_4_1_2 <= pi_d3_n1_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pb_d3_n1_4_1_2 <= pi_d3_n1_1_1_2)))
lola: processed formula: A (F ((pb_d3_n1_4_1_2 <= pi_d3_n1_1_1_2)))
lola: processed formula length: 42
lola: 0 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3456 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
sara: place or transition ordering is non-deterministic

lola: 3359 markings, 3358 edges, 672 markings/sec, 0 secs
lola: 4185 markings, 4184 edges, 165 markings/sec, 5 secs
lola: 5853 markings, 5852 edges, 334 markings/sec, 10 secs
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: 10774 markings, 10774 edges
lola: ========================================
lola: subprocess 14 will run for 1535 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (G (((1 <= pb_d3_n1_2_1_4) OR (3 <= pbl_2_1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U A(TRUE U ((pb_d3_n1_2_1_4 <= 0) AND (pbl_2_1_1 <= 2)))))
lola: processed formula length: 69
lola: 4 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3452 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: 9947 markings, 29835 edges
lola: ========================================
lola: subprocess 15 will run for 3071 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((pil_d2_n1_4_4_1 <= po_d3_n1_4_4_5)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((pil_d2_n1_4_4_1 <= po_d3_n1_4_4_5)))
lola: processed formula: A (F ((pil_d2_n1_4_4_1 <= po_d3_n1_4_4_5)))
lola: processed formula length: 43
lola: 0 rewrites
lola: formula mentions 0 of 1408 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C3K4P4B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3456 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: 2215 markings, 2214 edges, 443 markings/sec, 0 secs
lola: 2806 markings, 2805 edges, 118 markings/sec, 5 secs
lola: 3937 markings, 3936 edges, 226 markings/sec, 10 secs
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: 10880 markings, 10881 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no yes no yes unknown no yes yes yes no yes no
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C3K4P4B12-CTLCardinality-15 FALSE 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="HypercubeGrid-PT-C3K4P4B12"
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/HypercubeGrid-PT-C3K4P4B12.tgz
mv HypercubeGrid-PT-C3K4P4B12 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 HypercubeGrid-PT-C3K4P4B12, 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-152658636700108"
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 ;