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 700K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K 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.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.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 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K 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 522K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is HypertorusGrid-PT-d3k3p2b06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800150
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526759461191

info: Time: 3600 - MCC
===========================================================================================
prep: translating HypertorusGrid-PT-d3k3p2b06 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating HypertorusGrid-PT-d3k3p2b06 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ HypertorusGrid-PT-d3k3p2b06 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 1485/65536 symbol table entries, 20 collisions
lola: preprocessing...
lola: Size of bit vector: 16416
lola: finding significant places
lola: 513 places, 972 transitions, 323 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1161 transition conflict sets
lola: TASK
lola: reading formula from HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= po_d2_n1_1_3_1)
lola: LP says that atomic proposition is always false: (2 <= pi_d2_n1_1_2_1)
lola: LP says that atomic proposition is always false: (2 <= pi_d1_n1_3_1_3)
lola: LP says that atomic proposition is always false: (2 <= pil_d2_n1_3_3_3)
lola: LP says that atomic proposition is always false: (2 <= pil_d1_n1_1_2_2)
lola: LP says that atomic proposition is always false: (2 <= pil_d3_n1_3_2_3)
lola: LP says that atomic proposition is always false: (3 <= pi_d2_n1_1_1_1)
lola: LP says that atomic proposition is always false: (2 <= pil_d1_n1_1_1_3)
lola: LP says that atomic proposition is always false: (2 <= pi_d3_n1_3_2_1)
lola: LP says that atomic proposition is always false: (2 <= pil_d2_n1_2_3_2)
lola: LP says that atomic proposition is always false: (2 <= pi_d1_n1_2_3_1)
lola: LP says that atomic proposition is always false: (2 <= pol_d3_n1_2_1_2)
lola: LP says that atomic proposition is always false: (2 <= pi_d1_n1_1_1_3)
lola: LP says that atomic proposition is always false: (2 <= pi_d3_n1_2_3_3)
lola: LP says that atomic proposition is always false: (2 <= pil_d1_n1_3_2_2)
lola: LP says that atomic proposition is always false: (2 <= pi_d2_n1_3_3_3)
lola: LP says that atomic proposition is always false: (3 <= pol_d3_n1_1_2_1)
lola: (E (F (E (F (FALSE)))) OR NOT(A (F (TRUE)))) : A (F ((((pil_d1_n1_1_3_2 <= 0) OR (pbl_1_2_1 + 1 <= pb_d1_n2_3_2_3)) AND ((pil_d1_n1_1_2_3 <= pol_d3_n1_3_1_1))))) : NOT(A (X (E (X ((pil_d3_n1_3_3_3 <= pil_d3_n1_1_2_1)))))) : E (X (A (((1 <= pbl_1_2_1) U FALSE)))) : ((A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2))) AND A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))) AND (pbl_2_3_1 <= pbl_1_2_1)) : ((po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2) AND (E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3))) AND (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2))))) : E (F (((pb_d3_n2_2_3_3 <= 0) AND ((pol_d1_n1_3_1_3 <= 0) OR (pb_d1_n2_2_2_2 + 1 <= pi_d3_n1_2_3_1))))) : A (F ((pb_d2_n1_2_1_3 <= pil_d3_n1_1_2_1))) : E (F ((pb_d2_n2_3_1_2 <= po_d3_n1_3_1_3))) : E (G (E (G ((pil_d2_n1_1_2_2 <= pil_d2_n1_2_1_1))))) : NOT(A ((TRUE U ()))) : A (((pb_d1_n2_2_2_3 <= pbl_2_2_3) U A (F ((1 <= pi_d2_n1_2_3_2))))) : (NOT((E (F (FALSE)) OR (((3 <= pb_d1_n1_1_2_3))))) AND A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))) : ((E (X ((1 <= pb_d2_n1_1_3_2))) AND (E (G (FALSE)) OR E (F (FALSE)))) OR A (X (A (G ((pil_d1_n1_2_3_2 <= pil_d1_n1_2_1_3)))))) : E (G (A ((FALSE U (po_d2_n1_3_2_2 <= pbl_1_1_2))))) : E (F (((pil_d2_n1_2_1_3 + 1 <= pi_d1_n1_2_3_2) AND (po_d2_n1_3_3_2 + 1 <= pi_d3_n1_2_3_3) AND (pb_d1_n1_3_2_1 <= pb_d1_n1_2_1_2))))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:133
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:184
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: processed formula with 0 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: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (A (X ((pil_d3_n1_1_2_1 + 1 <= pil_d3_n1_3_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(AX((pil_d3_n1_1_2_1 + 1 <= pil_d3_n1_3_3_3)))
lola: processed formula length: 48
lola: 46 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (G ((pil_d1_n1_2_3_2 <= pil_d1_n1_2_1_3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:663
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (pil_d1_n1_2_1_3 + 1 <= pil_d1_n1_2_3_2)
lola: processed formula length: 40
lola: 46 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEF
lola: The predicate is not invariant from successors.
lola: 2 markings, 1 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((pb_d2_n2_3_1_2 <= po_d3_n1_3_1_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((pb_d2_n2_3_1_2 <= po_d3_n1_3_1_3)))
lola: processed formula length: 42
lola: 45 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (pb_d2_n2_3_1_2 <= po_d3_n1_3_1_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-5-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((pb_d3_n2_2_3_3 <= 0) AND ((pol_d1_n1_3_1_3 <= 0) OR (pb_d1_n2_2_2_2 + 1 <= pi_d3_n1_2_3_1)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((pb_d3_n2_2_3_3 <= 0) AND ((pol_d1_n1_3_1_3 <= 0) OR (pb_d1_n2_2_2_2 + 1 <= pi_d3_n1_2_3_1)))))
lola: processed formula length: 103
lola: 45 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((pb_d3_n2_2_3_3 <= 0) AND ((pol_d1_n1_3_1_3 <= 0) OR (pb_d1_n2_2_2_2 + 1 <= pi_d3_n1_2_3_1)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 5 markings, 4 edges
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-6-0.sara
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((pil_d2_n1_2_1_3 + 1 <= pi_d1_n1_2_3_2) AND (po_d2_n1_3_3_2 + 1 <= pi_d3_n1_2_3_3) AND (pb_d1_n1_3_2_1 <= pb_d1_n1_2_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((pil_d2_n1_2_1_3 + 1 <= pi_d1_n1_2_3_2) AND (po_d2_n1_3_3_2 + 1 <= pi_d3_n1_2_3_3) AND (pb_d1_n1_3_2_1 <= pb_d1_n1_2_1_2))))
lola: processed formula length: 131
lola: 45 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((pil_d2_n1_2_1_3 + 1 <= pi_d1_n1_2_3_2) AND (po_d2_n1_3_3_2 + 1 <= pi_d3_n1_2_3_3) AND (pb_d1_n1_3_2_1 <= pb_d1_n1_2_1_2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to HypertorusGrid-PT-d3k3p2b06-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: calling and running sara
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= pi_d2_n1_2_3_2)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (pi_d2_n1_2_3_2 <= 0)
lola: processed formula length: 21
lola: 46 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
sara: try reading problem file HypertorusGrid-PT-d3k3p2b06-CTLCardinality-7-0.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 425 markings, 425 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((pb_d2_n1_2_1_3 <= pil_d3_n1_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (pil_d3_n1_1_2_1 + 1 <= pb_d2_n1_2_1_3)
lola: processed formula length: 39
lola: 46 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 419 markings, 419 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((po_d2_n1_3_2_2 <= pbl_1_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((po_d2_n1_3_2_2 <= pbl_1_1_2)))
lola: processed formula length: 37
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 417 markings, 417 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((pil_d2_n1_1_2_2 <= pil_d2_n1_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((pil_d2_n1_1_2_2 <= pil_d2_n1_2_1_1)))
lola: processed formula length: 44
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 427 markings, 427 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((pil_d1_n1_1_3_2 <= 0) OR (pbl_1_2_1 + 1 <= pb_d1_n2_3_2_3)) AND ((pil_d1_n1_1_2_3 <= pol_d3_n1_3_1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (((1 <= pil_d1_n1_1_3_2) AND (pb_d1_n2_3_2_3 <= pbl_1_2_1)) OR ((pol_d3_n1_3_1_1 + 1 <= pil_d1_n1_1_2_3)))
lola: processed formula length: 107
lola: 46 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 380 markings, 380 edges
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((pb_d1_n1_1_2_3 <= 2))) AND A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((pb_d1_n1_1_2_3 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pb_d1_n1_1_2_3 <= 2)))
lola: processed formula length: 25
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= pol_d2_n1_2_2_3) U ((1 <= pb_d3_n1_1_1_3) OR (pol_d1_n1_3_2_2 <= pi_d3_n1_1_2_2))))
lola: processed formula length: 94
lola: 48 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2) AND (E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3))) AND (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2)
lola: processed formula length: 39
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2)))
lola: processed formula length: 79
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2))) AND (A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1))) AND (pbl_2_3_1 <= pbl_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (pbl_2_3_1 <= pbl_1_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pbl_2_3_1 <= pbl_1_2_1)
lola: processed formula length: 24
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2)))
lola: processed formula length: 64
lola: 48 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2) AND (E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3))) AND (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (po_d2_n1_2_2_2 + 1 <= pol_d3_n1_1_1_2)
lola: processed formula length: 39
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: ========================================
lola: ...considering subproblem: (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((pil_d1_n1_2_2_3 <= pil_d3_n1_1_2_2) OR (pb_d2_n2_1_1_1 <= pb_d2_n1_3_1_2)))
lola: processed formula length: 79
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: ========================================
lola: ...considering subproblem: E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((po_d2_n1_1_2_1 + 1 <= pil_d2_n1_1_2_3)))
lola: processed formula length: 47
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 421 markings, 421 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: ...considering subproblem: (A (((1 <= pb_d3_n2_2_2_2) U (pb_d1_n2_3_2_1 <= pb_d2_n2_1_2_2))) AND (A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1))) AND (pbl_2_3_1 <= pbl_1_2_1)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (pbl_2_3_1 <= pbl_1_2_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (pbl_2_3_1 <= pbl_1_2_1)
lola: processed formula length: 24
lola: 44 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-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: ========================================
lola: ...considering subproblem: A (F ((pb_d2_n1_2_1_1 + 1 <= pil_d2_n1_2_1_1)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (pil_d2_n1_2_1_1 <= pb_d2_n1_2_1_1)
lola: processed formula length: 35
lola: 46 rewrites
lola: closed formula file HypertorusGrid-PT-d3k3p2b06-CTLCardinality.task
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: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 405 markings, 405 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA HypertorusGrid-PT-d3k3p2b06-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no no no yes yes no yes yes yes no yes no yes yes
lola:
preliminary result: no no no no no yes yes no yes yes yes no yes no yes yes
lola: memory consumption: 25420 KB
lola: time consumption: 7 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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="HypertorusGrid-PT-d3k3p2b06"
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

tar xzf /home/mcc/BenchKit/INPUTS/HypertorusGrid-PT-d3k3p2b06.tgz
mv HypertorusGrid-PT-d3k3p2b06 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 lola"
echo " Input is HypertorusGrid-PT-d3k3p2b06, 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 r100-smll-152658630800150"
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 ;