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 irma4mcc-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 r102-smll-152658632900108
=====================================================================

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


BK_STOP 1526716294821

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

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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: state equation: write sara problem file to HypercubeGrid-PT-C3K4P4B12-CTLCardinality-3.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
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: 161874 markings, 746371 edges, 32375 markings/sec, 0 secs
lola: 304967 markings, 1418513 edges, 28619 markings/sec, 5 secs
lola: 448850 markings, 2099885 edges, 28777 markings/sec, 10 secs
lola: 576308 markings, 2724516 edges, 25492 markings/sec, 15 secs
lola: 663874 markings, 3307885 edges, 17513 markings/sec, 20 secs
lola: 828660 markings, 4085116 edges, 32957 markings/sec, 25 secs
lola: 965530 markings, 4806370 edges, 27374 markings/sec, 30 secs
lola: 1077410 markings, 5464803 edges, 22376 markings/sec, 35 secs
lola: 1213752 markings, 6189832 edges, 27268 markings/sec, 40 secs
lola: 1339943 markings, 6776406 edges, 25238 markings/sec, 45 secs
lola: 1442212 markings, 7360892 edges, 20454 markings/sec, 50 secs
lola: 1545994 markings, 7910880 edges, 20756 markings/sec, 55 secs
lola: 1660680 markings, 8539135 edges, 22937 markings/sec, 60 secs
lola: 1742485 markings, 9046265 edges, 16361 markings/sec, 65 secs
lola: 1846164 markings, 9636014 edges, 20736 markings/sec, 70 secs
lola: 1945517 markings, 10239786 edges, 19871 markings/sec, 75 secs
lola: 2056862 markings, 10783147 edges, 22269 markings/sec, 80 secs
lola: 2156491 markings, 11371594 edges, 19926 markings/sec, 85 secs
lola: 2243616 markings, 11836695 edges, 17425 markings/sec, 90 secs
lola: 2335449 markings, 12402128 edges, 18367 markings/sec, 95 secs
lola: 2435929 markings, 12963994 edges, 20096 markings/sec, 100 secs
lola: 2514117 markings, 13429716 edges, 15638 markings/sec, 105 secs
lola: 2618019 markings, 14078773 edges, 20780 markings/sec, 110 secs
lola: 2731236 markings, 14546972 edges, 22643 markings/sec, 115 secs
lola: 2827917 markings, 15052122 edges, 19336 markings/sec, 120 secs
lola: 2903889 markings, 15561912 edges, 15194 markings/sec, 125 secs
lola: 3038454 markings, 16122869 edges, 26913 markings/sec, 130 secs
lola: 3224529 markings, 16599754 edges, 37215 markings/sec, 135 secs
lola: 3396552 markings, 17060435 edges, 34405 markings/sec, 140 secs
lola: 3553070 markings, 17503590 edges, 31304 markings/sec, 145 secs
lola: 3704614 markings, 17939912 edges, 30309 markings/sec, 150 secs
lola: 3849979 markings, 18370459 edges, 29073 markings/sec, 155 secs
lola: 3988418 markings, 18797558 edges, 27688 markings/sec, 160 secs
lola: 4123062 markings, 19222471 edges, 26929 markings/sec, 165 secs
lola: 4257254 markings, 19645947 edges, 26838 markings/sec, 170 secs
lola: 4388353 markings, 20066822 edges, 26220 markings/sec, 175 secs
lola: 4515342 markings, 20484677 edges, 25398 markings/sec, 180 secs
lola: 4641420 markings, 20898493 edges, 25216 markings/sec, 185 secs
lola: 4768008 markings, 21311868 edges, 25318 markings/sec, 190 secs
lola: 4890340 markings, 21719902 edges, 24466 markings/sec, 195 secs
lola: 5012691 markings, 22127324 edges, 24470 markings/sec, 200 secs
lola: 5131713 markings, 22532647 edges, 23804 markings/sec, 205 secs
lola: 5248339 markings, 22935230 edges, 23325 markings/sec, 210 secs
lola: 5361580 markings, 23335684 edges, 22648 markings/sec, 215 secs
lola: 5472712 markings, 23737736 edges, 22226 markings/sec, 220 secs
lola: 5583463 markings, 24137417 edges, 22150 markings/sec, 225 secs
lola: 5691477 markings, 24535000 edges, 21603 markings/sec, 230 secs
lola: 5799616 markings, 24932658 edges, 21628 markings/sec, 235 secs
lola: 5903584 markings, 25327872 edges, 20794 markings/sec, 240 secs
lola: 6006729 markings, 25721129 edges, 20629 markings/sec, 245 secs
lola: 6110821 markings, 26115671 edges, 20818 markings/sec, 250 secs
lola: 6213123 markings, 26506763 edges, 20460 markings/sec, 255 secs
lola: 6315377 markings, 26895822 edges, 20451 markings/sec, 260 secs
lola: 6417757 markings, 27286380 edges, 20476 markings/sec, 265 secs
lola: 6519169 markings, 27674027 edges, 20282 markings/sec, 270 secs
lola: 6617662 markings, 28058814 edges, 19699 markings/sec, 275 secs
lola: 6715123 markings, 28443291 edges, 19492 markings/sec, 280 secs
lola: 6807911 markings, 28813024 edges, 18558 markings/sec, 285 secs
lola: 6898689 markings, 29172237 edges, 18156 markings/sec, 290 secs
lola: 6987845 markings, 29532537 edges, 17831 markings/sec, 295 secs
lola: 7074860 markings, 29891555 edges, 17403 markings/sec, 300 secs
lola: 7159288 markings, 30247262 edges, 16886 markings/sec, 305 secs
lola: 7242977 markings, 30605414 edges, 16738 markings/sec, 310 secs
lola: 7325077 markings, 30963464 edges, 16420 markings/sec, 315 secs
lola: 7403964 markings, 31318521 edges, 15777 markings/sec, 320 secs
lola: 7482018 markings, 31671961 edges, 15611 markings/sec, 325 secs
lola: 7560041 markings, 32028713 edges, 15605 markings/sec, 330 secs
lola: 7638342 markings, 32384328 edges, 15660 markings/sec, 335 secs
lola: 7715379 markings, 32737036 edges, 15407 markings/sec, 340 secs
lola: 7792142 markings, 33091595 edges, 15353 markings/sec, 345 secs
lola: 7869983 markings, 33444027 edges, 15568 markings/sec, 350 secs
lola: 7935980 markings, 33749050 edges, 13199 markings/sec, 355 secs
lola: 8002921 markings, 34064057 edges, 13388 markings/sec, 360 secs
lola: 8068311 markings, 34378889 edges, 13078 markings/sec, 365 secs
lola: 8130882 markings, 34683748 edges, 12514 markings/sec, 370 secs
lola: 8191212 markings, 34990178 edges, 12066 markings/sec, 375 secs
lola: 8250120 markings, 35298449 edges, 11782 markings/sec, 380 secs
lola: 8309044 markings, 35612106 edges, 11785 markings/sec, 385 secs
lola: 8367406 markings, 35924993 edges, 11672 markings/sec, 390 secs
lola: 8425809 markings, 36240101 edges, 11681 markings/sec, 395 secs
lola: 8484496 markings, 36550433 edges, 11737 markings/sec, 400 secs
lola: 8543213 markings, 36858854 edges, 11743 markings/sec, 405 secs
lola: 8598780 markings, 37162587 edges, 11113 markings/sec, 410 secs
lola: 8655038 markings, 37461595 edges, 11252 markings/sec, 415 secs
lola: 8707779 markings, 37757493 edges, 10548 markings/sec, 420 secs
lola: 8755379 markings, 38028506 edges, 9520 markings/sec, 425 secs
lola: 8804827 markings, 38322585 edges, 9890 markings/sec, 430 secs
lola: 8855155 markings, 38633104 edges, 10066 markings/sec, 435 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
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: The predicate is reachable.
lola: 80 markings, 79 edges
lola: ========================================
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: 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).
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
lola: 3341 markings, 3340 edges, 668 markings/sec, 0 secs
lola: 4179 markings, 4178 edges, 168 markings/sec, 5 secs
lola: 5866 markings, 5865 edges, 337 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 3070 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: 2191 markings, 2190 edges, 438 markings/sec, 0 secs
lola: 2757 markings, 2756 edges, 113 markings/sec, 5 secs
lola: 3900 markings, 3899 edges, 229 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
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 -----
----- Kill lola and sara stderr -----
----- 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="irma4mcc-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 irma4mcc-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 r102-smll-152658632900108"
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 ;