Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2019-input.r082-csrt-155246550100814.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-3954
Executing tool lola
Input is HypertorusGrid-PT-d5k3p2b10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-csrt-155246550100814
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 4.7K Feb 11 05:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 11 05:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 7 05:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 7 05:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 114 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 352 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.8K Feb 5 00:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 5 00:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K Feb 4 22:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 3 11:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 3 11:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.2K Jan 31 06:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Jan 31 06:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 4 22:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 0 Jan 29 09:34 model-fix.log
-rwxr-xr-x 1 mcc users 14M Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1552682022644

info: Time: 3600 - MCC
vrfy: Checking CTLCardinality @ HypertorusGrid-PT-d5k3p2b10 @ 3570 seconds

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-06 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-08 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-11 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-14 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-01 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-10 TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA HypertorusGrid-PT-d5k3p2b10-CTLCardinality-03 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
Makefile:16: recipe for target 'verify' failed
vrfy: finished
info: timeLeft: 2717
rslt: Output for CTLCardinality @ HypertorusGrid-PT-d5k3p2b10
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 31833/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 241056
lola: finding significant places
lola: 7533 places, 24300 transitions, 4859 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from CTLCardinality.xml
lola: E (G ((po_d4_n1_2_1_1_1_1 <= pb_d4_n1_3_1_2_1_3))) : ((pi_d2_n1_1_3_3_2_3 <= pb_d4_n2_2_3_3_2_3) AND A (F (((1 <= pb_d2_n1_3_3_3_1_3) AND (pbl_1_3_2_1_2 <= pb_d3_n1_1_3_2_3_3) AND ((3 <= pb_d3_n1_2_3_3_1_1) OR (3 <= pi_d2_n1_3_1_3_3_3)))))) : E (G (E (X (((pi_d3_n1_3_3_1_2_3 <= pb_d2_n1_3_3_2_3_2) AND (3 <= pb_d3_n2_1_1_2_2_3)))))) : A (G (E (F (((pb_d5_n2_3_1_2_3_2 <= pb_d5_n2_1_1_2_1_2) AND (po_d2_n1_3_1_3_1_1 <= po_d3_n1_3_3_1_3_1)))))) : A (F (((2 <= pol_d3_n1_3_1_2_2_2) AND E (X ((1 <= po_d2_n1_3_1_2_3_1)))))) : A (G (E (F ((2 <= pil_d4_n1_1_2_1_1_1))))) : E (F (((((po_d2_n1_1_2_2_2_3 <= po_d2_n1_2_3_1_1_1) OR (2 <= pil_d4_n1_1_2_3_1_3)) AND ((pb_d1_n2_1_3_2_2_3 <= pol_d4_n1_3_3_2_3_3) OR (pb_d2_n1_1_3_1_2_2 <= pb_d4_n2_2_2_3_1_3))) AND A (G ((pol_d2_n1_1_1_2_3_3 <= pil_d2_n1_3_1_2_3_1)))))) : A (X (E (X (((pol_d2_n1_3_3_1_3_3 <= po_d2_n1_1_1_3_1_3) OR (1 <= pb_d5_n1_3_3_3_3_3)))))) : E (G ((A (F ((pi_d4_n1_1_2_3_1_1 <= pb_d2_n2_3_3_3_2_3))) OR A (G ((3 <= pb_d2_n1_3_1_1_2_1)))))) : (A (F ((pil_d4_n1_1_1_2_1_2 + 1 <= pi_d3_n1_1_2_3_3_1))) AND ((A (G ((1 <= pb_d1_n1_3_2_2_1_1))) OR (((po_d4_n1_1_3_1_2_2 <= pb_d2_n1_3_2_2_3_3) AND (pb_d4_n1_2_2_1_1_3 <= pb_d5_n2_3_2_1_3_1)) OR (po_d5_n1_2_1_2_3_2 <= pil_d2_n1_2_2_3_2_1))) OR A (X (((2 <= pbl_3_1_1_3_1) AND (pol_d1_n1_1_2_2_3_1 <= pi_d2_n1_3_1_3_2_2)))))) : (A (G ((1 <= pb_d5_n2_3_1_2_2_3))) OR A ((((3 <= po_d5_n1_1_3_2_1_1) AND (3 <= pb_d2_n2_3_3_2_1_3)) U (pb_d1_n2_3_2_3_3_3 <= pol_d1_n1_3_3_1_1_3)))) : (NOT(E (G (((1 <= pol_d2_n1_3_3_2_2_3) OR (2 <= pil_d2_n1_3_1_1_2_1))))) AND ((pi_d4_n1_3_3_3_3_2 <= 1) OR (po_d5_n1_3_2_2_2_1 <= 1))) : (((A (F ((pol_d5_n1_3_1_3_1_1 <= po_d4_n1_2_2_1_3_1))) OR (pil_d5_n1_3_1_3_2_1 <= po_d5_n1_1_3_1_1_1)) OR A (F (((pb_d2_n2_2_2_3_1_3 <= pol_d4_n1_3_1_3_2_1) AND (2 <= pb_d3_n1_1_1_3_2_1))))) AND (NOT(A (X ((pil_d2_n1_1_1_2_2_3 <= pil_d3_n1_3_3_3_1_3)))) OR E (G ((1 <= pi_d1_n1_1_2_3_1_2))))) : A (X (NOT(A (X ((pol_d2_n1_2_3_2_2_2 <= pi_d5_n1_3_1_3_3_3)))))) : (((2 <= pi_d4_n1_2_1_3_2_1) OR ((po_d4_n1_1_3_1_3_1 <= 0) AND (pil_d2_n1_2_3_2_2_3 <= 0)) OR (pol_d2_n1_3_3_2_1_3 <= 2)) AND (A (G ((pil_d5_n1_3_2_2_1_1 <= 2))) AND (pb_d2_n2_1_2_1_3_3 <= pbl_3_3_3_1_1))) : E (F (NOT(A (F ((2 <= po_d1_n1_3_2_3_2_1))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (E (X (((pi_d3_n1_3_3_1_2_3 <= pb_d2_n1_3_3_2_3_2) AND (3 <= pb_d3_n2_1_1_2_2_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: processed formula: EG(EX(((pi_d3_n1_3_3_1_2_3 <= pb_d2_n1_3_3_2_3_2) AND (3 <= pb_d3_n2_1_1_2_2_3))))
lola: processed formula length: 82
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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 1 will run for 192 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= pol_d3_n1_3_1_2_2_2) AND E (X ((1 <= po_d2_n1_3_1_2_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: processed formula: AF(((2 <= pol_d3_n1_3_1_2_2_2) AND EX((1 <= po_d2_n1_3_1_2_3_1))))
lola: processed formula length: 66
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 130 markings, 130 edges
lola: ========================================
lola: subprocess 2 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (((pol_d2_n1_3_3_1_3_3 <= po_d2_n1_1_1_3_1_3) OR (1 <= pb_d5_n1_3_3_3_3_3))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX(((pol_d2_n1_3_3_1_3_3 <= po_d2_n1_1_1_3_1_3) OR (1 <= pb_d5_n1_3_3_3_3_3))))
lola: processed formula length: 83
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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 3 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((pil_d4_n1_1_1_2_1_2 + 1 <= pi_d3_n1_1_2_3_3_1))) AND (A (G ((1 <= pb_d1_n1_3_2_2_1_1))) OR ((((po_d4_n1_1_3_1_2_2 <= pb_d2_n1_3_2_2_3_3) AND (pb_d4_n1_2_2_1_1_3 <= pb_d5_n2_3_2_1_3_1)) OR (po_d5_n1_2_1_2_3_2 <= pil_d2_n1_2_2_3_2_1)) OR A (X (((2 <= pbl_3_1_1_3_1) AND (pol_d1_n1_1_2_2_3_1 <= pi_d2_n1_3_1_3_2_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((po_d4_n1_1_3_1_2_2 <= pb_d2_n1_3_2_2_3_3) AND (pb_d4_n1_2_2_1_1_3 <= pb_d5_n2_3_2_1_3_1)) OR (po_d5_n1_2_1_2_3_2 <= pil_d2_n1_2_2_3_2_1))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((po_d4_n1_1_3_1_2_2 <= pb_d2_n1_3_2_2_3_3) AND (pb_d4_n1_2_2_1_1_3 <= pb_d5_n2_3_2_1_3_1)) OR (po_d5_n1_2_1_2_3_2 <= pil_d2_n1_2_2_3_2_1))
lola: processed formula length: 141
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
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: subprocess 4 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pil_d4_n1_1_1_2_1_2 + 1 <= pi_d3_n1_1_2_3_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (pi_d3_n1_1_2_3_3_1 <= pil_d4_n1_1_1_2_1_2)
lola: processed formula length: 43
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pil_d4_n1_1_1_2_1_2 + 1 <= pi_d3_n1_1_2_3_3_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-4-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-4-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3006 markings, 3006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((A (F ((pol_d5_n1_3_1_3_1_1 <= po_d4_n1_2_2_1_3_1))) OR ((pil_d5_n1_3_1_3_2_1 <= po_d5_n1_1_3_1_1_1) OR A (F (((pb_d2_n2_2_2_3_1_3 <= pol_d4_n1_3_1_3_2_1) AND (2 <= pb_d3_n1_1_1_3_2_1)))))) AND (E (X ((pil_d3_n1_3_3_3_1_3 + 1 <= pil_d2_n1_1_1_2_2_3))) OR E (G ((1 <= pi_d1_n1_1_2_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 240 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= pi_d1_n1_1_2_3_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((1 <= pi_d1_n1_1_2_3_1_2)))
lola: processed formula length: 33
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pi_d1_n1_1_2_3_1_2 <= 0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pil_d5_n1_3_1_3_2_1 <= po_d5_n1_1_3_1_1_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pil_d5_n1_3_1_3_2_1 <= po_d5_n1_1_3_1_1_1)
lola: processed formula length: 43
lola: 14 rewrites
lola: closed formula file CTLCardinality.xml
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 6 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pol_d5_n1_3_1_3_1_1 <= po_d4_n1_2_2_1_3_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (po_d4_n1_2_2_1_3_1 + 1 <= pol_d5_n1_3_1_3_1_1)
lola: processed formula length: 47
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pol_d5_n1_3_1_3_1_1 <= po_d4_n1_2_2_1_3_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2983 markings, 2983 edges
lola: ========================================
lola: subprocess 7 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((pb_d2_n2_2_2_3_1_3 <= pol_d4_n1_3_1_3_2_1) AND (2 <= pb_d3_n1_1_1_3_2_1))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:584
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: ((pol_d4_n1_3_1_3_2_1 + 1 <= pb_d2_n2_2_2_3_1_3) OR (pb_d3_n1_1_1_3_2_1 <= 1))
lola: processed formula length: 79
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((pb_d2_n2_2_2_3_1_3 <= pol_d4_n1_3_1_3_2_1) AND (2 <= pb_d3_n1_1_1_3_2_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 2963 markings, 2963 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 262 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (X ((pi_d5_n1_3_1_3_3_3 + 1 <= pol_d2_n1_2_3_2_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: processed formula: AX(EX((pi_d5_n1_3_1_3_3_3 + 1 <= pol_d2_n1_2_3_2_2_2)))
lola: processed formula length: 55
lola: 16 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
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 6 will run for 288 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((2 <= pil_d4_n1_1_2_1_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: (2 <= pil_d4_n1_1_2_1_1_1)
lola: processed formula length: 26
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (2 <= pil_d4_n1_1_2_1_1_1)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pil_d4_n1_1_2_1_1_1 <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-6-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-6-1.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: tscc_search
lola: The predicate is not live.
lola: 2185 markings, 2363 edges
lola: ========================================
lola: subprocess 7 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((po_d1_n1_3_2_3_2_1 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:598
lola: rewrite Frontend/Parser/formula_rewrite.k:633
lola: rewrite Frontend/Parser/formula_rewrite.k:730
lola: processed formula: (po_d1_n1_3_2_3_2_1 <= 1)
lola: processed formula length: 25
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (2 <= po_d1_n1_3_2_3_2_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: (po_d1_n1_3_2_3_2_1 <= 1)
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-7-0.sara
lola: state equation: calling and running sara
lola: state equation: write sara problem file to CTLCardinality-7-1.sara
sara: try reading problem file CTLCardinality-7-0.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-7-1.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 3017 markings, 3017 edges
lola: ========================================
lola: subprocess 8 will run for 360 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((po_d4_n1_2_1_1_1_1 <= pb_d4_n1_3_1_2_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:583
lola: processed formula: E (G ((po_d4_n1_2_1_1_1_1 <= pb_d4_n1_3_1_2_1_3)))
lola: processed formula length: 50
lola: 15 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (pb_d4_n1_3_1_2_1_3 + 1 <= po_d4_n1_2_1_1_1_1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-8-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 3030 markings, 3030 edges
lola: ========================================
lola: subprocess 9 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((pb_d5_n2_3_1_2_3_2 <= pb_d5_n2_1_1_2_1_2) AND (po_d2_n1_3_1_3_1_1 <= po_d3_n1_3_3_1_3_1))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: rewrite Frontend/Parser/formula_rewrite.k:603
lola: rewrite Frontend/Parser/formula_rewrite.k:613
lola: rewrite Frontend/Parser/formula_rewrite.k:703
lola: processed formula: ((pb_d5_n2_3_1_2_3_2 <= pb_d5_n2_1_1_2_1_2) AND (po_d2_n1_3_1_3_1_1 <= po_d3_n1_3_3_1_3_1))
lola: processed formula length: 91
lola: 17 rewrites
lola: closed formula file CTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using tscc preserving stubborn set method (--stubborn)
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: Planning: workflow for reachability check: stateequation (--findpath=off)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 1
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 1
lola: state equation task get result unparse finished++ id 1
lola: formula 1: ((pb_d5_n2_3_1_2_3_2 <= pb_d5_n2_1_1_2_1_2) AND (po_d2_n1_3_1_3_1_1 <= po_d3_n1_3_3_1_3_1))
lola: state equation task get result unparse finished id 1
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((pb_d5_n2_1_1_2_1_2 + 1 <= pb_d5_n2_3_1_2_3_2) OR (po_d3_n1_3_3_1_3_1 + 1 <= po_d2_n1_3_1_3_1_1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CTLCardinality-9-0.sara
lola: state equation: write sara problem file to CTLCardinality-9-1.sara
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-1.sara.
lola: state equation: calling and running sara
sara: try reading problem file CTLCardinality-9-0.sara.
lola: sara is running 0 secs || sara is running 0 secs || 42383 markings, 70982 edges, 8477 markings/sec, 0 secs
lola: sara is running 5 secs || sara is running 5 secs || 85289 markings, 144279 edges, 8581 markings/sec, 5 secs
lola: sara is running 10 secs || sara is running 10 secs || 127170 markings, 219506 edges, 8376 markings/sec, 10 secs
lola: sara is running 15 secs || sara is running 15 secs || 167386 markings, 291444 edges, 8043 markings/sec, 15 secs
lola: sara is running 20 secs || sara is running 20 secs || 206386 markings, 362302 edges, 7800 markings/sec, 20 secs
lola: sara is running 25 secs || sara is running 25 secs || 246027 markings, 432966 edges, 7928 markings/sec, 25 secs
lola: sara is running 30 secs || sara is running 30 secs || 277316 markings, 489617 edges, 6258 markings/sec, 30 secs
lola: sara is running 35 secs || sara is running 35 secs || 318799 markings, 564416 edges, 8297 markings/sec, 35 secs
lola: sara is running 40 secs || sara is running 40 secs || 360186 markings, 639323 edges, 8277 markings/sec, 40 secs
lola: sara is running 45 secs || sara is running 45 secs || 401963 markings, 715039 edges, 8355 markings/sec, 45 secs
lola: sara is running 50 secs || sara is running 50 secs || 443774 markings, 793232 edges, 8362 markings/sec, 50 secs
lola: sara is running 55 secs || sara is running 55 secs || 485855 markings, 868570 edges, 8416 markings/sec, 55 secs
lola: sara is running 60 secs || sara is running 60 secs || 519247 markings, 927762 edges, 6678 markings/sec, 60 secs
lola: sara is running 65 secs || sara is running 65 secs || 554655 markings, 991744 edges, 7082 markings/sec, 65 secs
lola: sara is running 70 secs || sara is running 70 secs || 594896 markings, 1064791 edges, 8048 markings/sec, 70 secs
lola: sara is running 75 secs || sara is running 75 secs || 634441 markings, 1140858 edges, 7909 markings/sec, 75 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 80 secs || sara is running 80 secs || 671527 markings, 1208409 edges, 7417 markings/sec, 80 secs
lola: sara is running 85 secs || sara is running 85 secs || 706405 markings, 1271841 edges, 6976 markings/sec, 85 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 90 secs || sara is running 90 secs || 741627 markings, 1339430 edges, 7044 markings/sec, 90 secs
lola: sara is running 95 secs || sara is running 95 secs || 774646 markings, 1398100 edges, 6604 markings/sec, 95 secs
lola: state equation 0: solution produced
lola: sara is running 100 secs || sara is running 100 secs || 813873 markings, 1475880 edges, 7845 markings/sec, 100 secs
lola: sara is running 105 secs || sara is running 105 secs || 854212 markings, 1554430 edges, 8068 markings/sec, 105 secs
lola: sara is running 110 secs || sara is running 110 secs || 894287 markings, 1629443 edges, 8015 markings/sec, 110 secs
lola: state equation 1: solution produced
lola: sara is running 115 secs || sara is running 115 secs || 937175 markings, 1709208 edges, 8578 markings/sec, 115 secs
lola: sara is running 120 secs || sara is running 120 secs || 980547 markings, 1793010 edges, 8674 markings/sec, 120 secs
lola: sara is running 125 secs || sara is running 125 secs || 1022874 markings, 1875402 edges, 8465 markings/sec, 125 secs
lola: sara is running 130 secs || sara is running 130 secs || 1068656 markings, 1957582 edges, 9156 markings/sec, 130 secs
lola: sara is running 135 secs || sara is running 135 secs || 1112446 markings, 2038683 edges, 8758 markings/sec, 135 secs
lola: sara is running 140 secs || sara is running 140 secs || 1157247 markings, 2118495 edges, 8960 markings/sec, 140 secs
lola: sara is running 145 secs || sara is running 145 secs || 1200987 markings, 2199564 edges, 8748 markings/sec, 145 secs
lola: sara is running 150 secs || sara is running 150 secs || 1244295 markings, 2280589 edges, 8662 markings/sec, 150 secs
lola: sara is running 155 secs || sara is running 155 secs || 1274987 markings, 2335022 edges, 6138 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: Cannot launch process for handling subproblem
lola: RESULT
lola:
SUMMARY: yes no unknown no no yes no no yes yes
lola:
preliminary result: yes no unknown no no yes no no yes yes
Segmentation fault
rslt: finished

BK_STOP 1552682875325

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

make: [verify] Error 139 (ignored)

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="HypertorusGrid-PT-d5k3p2b10"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is HypertorusGrid-PT-d5k3p2b10, 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 r082-csrt-155246550100814"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d5k3p2b10.tgz
mv HypertorusGrid-PT-d5k3p2b10 execution
cd execution
if [ "CTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "CTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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 ;