fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r102-smll-152658632900115
Last Updated
June 26, 2018

About the Execution of Irma.full for HypercubeGrid-PT-C4K3P3B12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15895.260 177740.00 182661.00 2051.40 ???????????????? normal

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 3.1M
-rw-r--r-- 1 mcc users 4.7K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K 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 3.0M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is HypercubeGrid-PT-C4K3P3B12, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r102-smll-152658632900115
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1526716382038


BK_STOP 1526716559778

--------------------
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-C4K3P3B12 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': 161779, 'Memory': 15942.33, 'Tool': 'lola'}, {'Time': 1784367, 'Memory': 15945.07, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola HypercubeGrid-PT-C4K3P3B12...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
HypercubeGrid-PT-C4K3P3B12: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ HypercubeGrid-PT-C4K3P3B12 @ 3540 seconds
make: [verify] Error 134 (ignored)
----- Start make result stderr -----
Makefile:222: recipe for target 'verify' failed
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 7857/65536 symbol table entries, 1827 collisions
lola: preprocessing...
lola: finding significant places
lola: 2457 places, 5400 transitions, 1511 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 6345 transition conflict sets
lola: TASK
lola: reading formula from HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: A (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1)))) : A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2))))) : (E (F (((3 <= pol_d2_n1_1_1_1_3) AND ((2 <= po_d1_n1_1_2_2_2) OR (3 <= pbl_3_1_1_2))))) OR (NOT(A (F ((pil_d3_n1_2_3_3_1 <= po_d4_n1_1_3_2_1)))) AND (A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3))) OR ((pb_d1_n2_2_1_2_1 <= po_d4_n1_3_2_1_1) OR (pil_d4_n1_3_3_3_2 <= pol_d1_n1_1_2_1_3) OR ((3 <= po_d1_n1_1_2_3_2) AND (1 <= pol_d3_n1_1_2_2_2)))))) : E (F (A (X (((3 <= po_d2_n1_2_1_3_3) OR (1 <= pil_d3_n1_2_1_3_2)))))) : A (G (E (F (((3 <= po_d3_n1_3_2_4_1) OR (pb_d3_n1_2_3_2_2 <= pil_d2_n1_3_4_2_2)))))) : (E (((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1)))) AND E (F (E (G ((1 <= pil_d4_n1_2_2_3_2)))))) : NOT(E (G (A (F ((1 <= pi_d1_n1_2_3_1_2)))))) : A (X (E (F (((2 <= pi_d2_n1_1_1_1_1) OR (pol_d1_n1_2_3_3_2 <= pi_d1_n1_2_3_2_3)))))) : NOT(A (F (((pb_d3_n1_1_1_1_2 <= po_d4_n1_3_1_2_3) AND (1 <= pb_d2_n2_1_3_3_1) AND ((pol_d4_n1_2_2_2_2 <= pi_d2_n1_2_2_1_2) OR (1 <= po_d4_n1_1_2_2_1)))))) : (((E (G ((pb_d2_n2_3_3_1_1 <= pil_d4_n1_3_2_2_2))) AND A (X ((pil_d1_n1_1_1_1_3 <= po_d2_n1_2_2_3_1)))) OR ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))) AND (((3 <= pil_d2_n1_2_1_3_2) OR A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))) OR A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3))))) : E (((((1 <= pil_d3_n1_3_1_4_3) OR (2 <= po_d4_n1_3_3_1_1)) AND (1 <= pil_d3_n1_1_3_2_3)) U ((pb_d3_n2_3_1_3_3 <= 0) OR (pb_d2_n1_2_3_1_1 <= 0)))) : E (G ((1 <= pil_d1_n1_4_2_1_1))) : E (F ((3 <= pol_d2_n1_3_3_2_1))) : A ((E (F ((3 <= pol_d2_n1_3_3_1_3))) U E (G ((pi_d2_n1_2_4_2_2 <= pi_d3_n1_1_1_3_2))))) : E (G ((((pil_d2_n1_3_1_2_3 <= 2) AND (pi_d3_n1_3_1_3_2 <= 0)) OR ((pol_d2_n1_3_2_3_2 <= 1) AND (pb_d2_n2_1_3_3_1 <= 1))))) : (A (F (A (F ((1 <= pi_d1_n1_1_1_2_2))))) OR A (F ((2 <= pil_d4_n1_1_1_2_2))))
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 (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1))))
lola: processed formula: A (F ((((po_d1_n1_1_1_3_1 <= po_d3_n1_1_3_3_2) OR (pil_d4_n1_1_2_2_2 <= pb_d3_n1_2_3_3_3)) AND (po_d2_n1_2_1_2_2 <= pb_d1_n1_2_3_1_2) AND (2 <= pil_d2_n1_1_3_2_1))))
lola: processed formula length: 166
lola: 0 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1079 markings, 1079 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2)))))
lola: processed formula: A (F (((pb_d1_n1_1_3_1_1 + 1 <= pb_d2_n1_3_2_1_2) OR (pb_d1_n1_1_3_2_3 <= 2) OR ((pil_d4_n1_3_3_1_3 <= 0) AND (po_d1_n1_4_3_2_1 <= 2)))))
lola: processed formula length: 139
lola: 0 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1080 markings, 1080 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((3 <= pol_d2_n1_1_1_1_3) AND ((2 <= po_d1_n1_1_2_2_2) OR (3 <= pbl_3_1_1_2))))) OR (NOT(A (F ((pil_d3_n1_2_3_3_1 <= po_d4_n1_1_3_2_1)))) AND (A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3))) OR ((pb_d1_n2_2_1_2_1 <= po_d4_n1_3_2_1_1) OR (pil_d4_n1_3_3_3_2 <= pol_d1_n1_1_2_1_3) OR ((3 <= po_d1_n1_1_2_3_2) AND (1 <= pol_d3_n1_1_2_2_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: E (F (((3 <= pol_d2_n1_1_1_1_3) AND ((2 <= po_d1_n1_1_2_2_2) OR (3 <= pbl_3_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 6044 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-C4K3P3B12-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file HypercubeGrid-PT-C4K3P3B12-CTLCardinality-2.sara.
lola: sara is running 0 secs || 153090 markings, 161217 edges, 30618 markings/sec, 0 secs
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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((po_d4_n1_1_3_2_1 + 1 <= pil_d3_n1_2_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil_d3_n1_2_3_3_1 <= po_d4_n1_1_3_2_1)))
lola: processed formula length: 54
lola: 5 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 2485 markings, 2485 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3)))
lola: processed formula: A (X ((pi_d1_n1_2_3_1_2 <= pb_d1_n1_2_2_1_3)))
lola: processed formula length: 46
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 649 markings, 648 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (((3 <= po_d2_n1_2_1_3_3) OR (1 <= pil_d3_n1_2_1_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(((3 <= po_d2_n1_2_1_3_3) OR (1 <= pil_d3_n1_2_1_3_2))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 21303 markings, 22546 edges
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= po_d3_n1_3_2_4_1) OR (pb_d3_n1_2_3_2_2 <= pil_d2_n1_3_4_2_2))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= po_d3_n1_3_2_4_1) OR (pb_d3_n1_2_3_2_2 <= pil_d2_n1_3_4_2_2))))))
lola: processed formula length: 99
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 318557 markings, 398889 edges, 2963413634786525184 markings/sec, 0 secs
lola: 640260 markings, 802417 edges, 64341 markings/sec, 5 secs
lola: 963841 markings, 1211276 edges, 64716 markings/sec, 10 secs
lola: 1286025 markings, 1643951 edges, 64437 markings/sec, 15 secs
lola: 1619709 markings, 2089502 edges, 66737 markings/sec, 20 secs
lola: 1950706 markings, 2540240 edges, 66199 markings/sec, 25 secs
lola: 2298220 markings, 3015032 edges, 69503 markings/sec, 30 secs
lola: 2675931 markings, 3523730 edges, 75542 markings/sec, 35 secs
lola: 3086840 markings, 4049110 edges, 82182 markings/sec, 40 secs
lola: 3486201 markings, 4570027 edges, 79872 markings/sec, 45 secs
lola: 3891711 markings, 5099185 edges, 81102 markings/sec, 50 secs
lola: 4292349 markings, 5621649 edges, 80128 markings/sec, 55 secs
lola: 4685985 markings, 6134768 edges, 78727 markings/sec, 60 secs
lola: 5017951 markings, 6566761 edges, 66393 markings/sec, 65 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1)))) AND E (F (E (G ((1 <= pil_d4_n1_2_2_3_2))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((pi_d3_n1_3_3_3_3 + 1 <= pi_d4_n1_1_1_3_2) U ((pi_d2_n1_1_1_3_1 <= po_d4_n1_1_3_3_4) AND (pol_d3_n1_3_1_3_3 <= pil_d2_n1_1_4_1_1)))
lola: processed formula length: 133
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((1 <= pil_d4_n1_2_2_3_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (pil_d4_n1_2_2_3_2 <= 0))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 2494 markings, 2495 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 345 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (G (A (F ((1 <= pi_d1_n1_2_3_1_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (1 <= pi_d1_n1_2_3_1_2))))
lola: processed formula length: 48
lola: 8 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 2483 markings, 2484 edges
lola: ========================================
lola: subprocess 7 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (((2 <= pi_d2_n1_1_1_1_1) OR (pol_d1_n1_2_3_3_2 <= pi_d1_n1_2_3_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U ((2 <= pi_d2_n1_1_1_1_1) OR (pol_d1_n1_2_3_3_2 <= pi_d1_n1_2_3_2_3))))
lola: processed formula length: 83
lola: 2 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 241915 markings, 242063 edges, 2963413634786525184 markings/sec, 0 secs
lola: 423626 markings, 423775 edges, 36342 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 434527 markings, 434675 edges
lola: ========================================
lola: subprocess 8 will run for 430 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (((pb_d3_n1_1_1_1_2 <= po_d4_n1_3_1_2_3) AND (1 <= pb_d2_n2_1_3_3_1) AND ((pol_d4_n1_2_2_2_2 <= pi_d2_n1_2_2_1_2) OR (1 <= po_d4_n1_1_2_2_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((pb_d3_n1_1_1_1_2 <= po_d4_n1_3_1_2_3) AND (1 <= pb_d2_n2_1_3_3_1) AND ((pol_d4_n1_2_2_2_2 <= pi_d2_n1_2_2_1_2) OR (1 <= po_d4_n1_1_2_2_1)))))
lola: processed formula length: 157
lola: 5 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 2483 markings, 2483 edges
lola: ========================================
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (G ((pb_d2_n2_3_3_1_1 <= pil_d4_n1_3_2_2_2))) AND A (X ((pil_d1_n1_1_1_1_3 <= po_d2_n1_2_2_3_1)))) OR ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))) AND (((3 <= pil_d2_n1_2_1_3_2) OR A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))) OR A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((pb_d2_n2_3_3_1_1 <= pil_d4_n1_3_2_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (pil_d4_n1_3_2_2_2 + 1 <= pb_d2_n2_3_3_1_1)))
lola: processed formula length: 58
lola: 3 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((pb_d4_n2_1_3_3_2 <= po_d4_n1_2_3_3_1) OR (pol_d4_n1_1_3_1_1 <= pb_d1_n1_3_2_1_3))
lola: processed formula length: 84
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-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 11 will run for 688 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= pil_d2_n1_2_1_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= pil_d2_n1_2_1_3_2)
lola: processed formula length: 24
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 860 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))
lola: processed formula: A (X ((pil_d4_n1_3_3_3_1 <= pi_d2_n1_3_1_3_3)))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 6551 markings, 6551 edges
lola: ========================================
lola: subprocess 13 will run for 1147 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))
lola: processed formula: A (((pi_d1_n1_2_3_2_1 <= pb_d1_n2_3_2_2_1) U (3 <= pi_d3_n1_2_2_2_3)))
lola: processed formula length: 70
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6048 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 1085 markings, 1085 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((1 <= pil_d3_n1_3_1_4_3) OR (2 <= po_d4_n1_3_3_1_1)) AND (1 <= pil_d3_n1_1_3_2_3)) U ((pb_d3_n2_3_1_3_3 <= 0) OR (pb_d2_n1_2_3_1_1 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((1 <= pil_d3_n1_3_1_4_3) OR (2 <= po_d4_n1_3_3_1_1)) AND (1 <= pil_d3_n1_1_3_2_3)) U ((pb_d3_n2_3_1_3_3 <= 0) OR (pb_d2_n1_2_3_1_1 <= 0)))
lola: processed formula length: 144
lola: 1 rewrites
lola: formula mentions 0 of 2457 places; total mentions: 0
lola: closed formula file HypercubeGrid-PT-C4K3P3B12-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6044 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: 317261 markings, 399239 edges, 2963413634786525184 markings/sec, 0 secs
lola: 636646 markings, 801819 edges, 63877 markings/sec, 5 secs
lola: 955620 markings, 1212117 edges, 63795 markings/sec, 10 secs
lola: 1320068 markings, 1674426 edges, 72890 markings/sec, 15 secs
lola: 1726611 markings, 2192552 edges, 81309 markings/sec, 20 secs
lola: 2137175 markings, 2716288 edges, 82113 markings/sec, 25 secs
lola: 2546505 markings, 3238373 edges, 81866 markings/sec, 30 secs
lola: 2952465 markings, 3756228 edges, 81192 markings/sec, 35 secs
lola: 3354468 markings, 4269074 edges, 80401 markings/sec, 40 secs
lola: 3760476 markings, 4784537 edges, 81202 markings/sec, 45 secs
lola: 4203687 markings, 5349046 edges, 88642 markings/sec, 50 secs
lola: 4644602 markings, 5910997 edges, 88183 markings/sec, 55 secs
lola: 5081748 markings, 6467734 edges, 87429 markings/sec, 60 secs
lola: Child process aborted or communication problem between parent and child process
terminate called after throwing an instance of 'std::runtime_error'
----- Kill lola and sara stderr -----
what(): parse error at position 0: unexpected character, last read: '
'
Aborted (core dumped)
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-5 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-6 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-13 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA HypercubeGrid-PT-C4K3P3B12-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HypercubeGrid-PT-C4K3P3B12"
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-C4K3P3B12.tgz
mv HypercubeGrid-PT-C4K3P3B12 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-C4K3P3B12, 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-152658632900115"
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 ;