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 236K
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 24K 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 6.4K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.8K 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 11K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 116 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 354 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K 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.2K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 55K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700060
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526921222772

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-02 formula CTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLFireability @ QuasiCertifProtocol-PT-02 @ 3558 seconds
lola: LoLA will run for 3558 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 142/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 2752
lola: finding significant places
lola: 86 places, 56 transitions, 55 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 71 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-02-CTLFireability.task
lola: (FIREABLE(malA4) OR A (F (((FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2) OR FIREABLE(AackCS) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)))))) : NOT((A (F (((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2)) AND FIREABLE(malA3) AND (FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1))))) AND NOT(A (G ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))))) : (A (F ((((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND FIREABLE(malA2) AND NOT FIREABLE(AreqTS)) AND E (F ((FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0))))))) AND A (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)))))) : ((((FIREABLE(AackCS) AND A (G (FIREABLE(AreqTS)))) OR (E (X (FIREABLE(AendCS))) AND FIREABLE(malA5))) OR NOT(A (F ((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)))))) OR NOT((NOT(A (X ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))) OR (((NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_2)) OR NOT FIREABLE(AstartCS)) AND E (X ((FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1)))))))) : (A ((E (G ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)))) U A (F (FIREABLE(AgetTS))))) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AreqCS))) : (E (F ((A (F ((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)))) OR (FIREABLE(malA4) OR FIREABLE(malA1))))) AND A (((NOT FIREABLE(malS3_1) AND NOT FIREABLE(malS3_2) AND NOT FIREABLE(malS3_0) AND (FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0)) AND (FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0))) U A (F ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0))))))) : (((((NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AendCS))) AND E (F ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0))))) AND NOT(A (F ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)))))) OR E (X ((((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2)) AND (FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1))) OR ((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))))) OR ((A (X ((FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(AreqCS)))) OR E (X ((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(AgetTS))))) OR A (F ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)))))) : A (X (E (G (A (F ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))))) : ((NOT FIREABLE(malS5_2) AND NOT((FIREABLE(SackCS_2) OR A (F (FIREABLE(malS2_1)))))) AND NOT(A (G (A (X (FIREABLE(ScertCS_0))))))) : (A (F ((((FIREABLE(Sperform_1) AND FIREABLE(SreqTS_2)) OR NOT FIREABLE(SackCS_1)) AND A (G (FIREABLE(SreqTS_2)))))) OR FIREABLE(Sperform_2)) : A (F (FIREABLE(malA5))) : A (X (A (F ((FIREABLE(malS5_0) OR FIREABLE(malS2_1) OR (FIREABLE(malS2_0) AND FIREABLE(malS1_1))))))) : A (F ((E (F ((FIREABLE(malA5) OR FIREABLE(SsendTS_2)))) AND NOT(E (X (FIREABLE(SsendTS_0))))))) : (E (F (A (F ((FIREABLE(malA2) AND FIREABLE(malS3_2)))))) OR A (X ((A (F (FIREABLE(malA5))) AND (NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(AackCS)))))) : A (F (A (G (A (G (FIREABLE(malA5))))))) : A (F (FIREABLE(AendCS)))
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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: 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:318
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:470
lola: rewrite Frontend/Parser/formula_rewrite.k:548
lola: rewrite Frontend/Parser/formula_rewrite.k:455
lola: rewrite Frontend/Parser/formula_rewrite.k:470
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: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:318
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: rewrite Frontend/Parser/formula_rewrite.k:398
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:251
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:455
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:389
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(AackCS) AND A (G (FIREABLE(AreqTS)))) OR ((E (X (FIREABLE(AendCS))) AND FIREABLE(malA5)) OR (E (G ((NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1)))) OR (A (X ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0)))) AND (((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND FIREABLE(AstartCS)) OR A (X ((NOT FIREABLE(malS2_2) AND ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND FIREABLE(AstartCS))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_2)) AND FIREABLE(AstartCS))
lola: processed formula length: 94
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(malA5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(malA5)
lola: processed formula length: 15
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(AackCS)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(AackCS)
lola: processed formula length: 16
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((NOT FIREABLE(malS4_2) AND NOT FIREABLE(malS4_0) AND NOT FIREABLE(malS4_1))))
lola: processed formula length: 83
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-3 TRUE 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: (((NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AendCS))) AND (E (F ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)))) AND E (G ((NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_2)))))) OR (E (X ((((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(ScertCS_1) OR FIREABLE(ScertCS_0) OR FIREABLE(ScertCS_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: (NOT FIREABLE(ScertCS_1) AND NOT FIREABLE(ScertCS_0) AND NOT FIREABLE(ScertCS_2))
lola: processed formula length: 81
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AendCS)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AendCS)))
lola: processed formula length: 164
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(AgetTS))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2) OR FIREABLE(AgetTS)))
lola: processed formula length: 88
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(AreqCS))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((FIREABLE(Sperform_2) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_0) OR FIREABLE(AreqCS)))
lola: processed formula length: 97
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X ((((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2)) AND (FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1))) OR ((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX((((FIREABLE(malS5_0) OR FIREABLE(malS5_1) OR FIREABLE(malS5_2)) AND (FIREABLE(malS2_2) OR FIREABLE(malS2_0) OR FIREABLE(malS2_1))) OR ((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))
lola: processed formula length: 277
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-6 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: A (X (E (G (A (F ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(NOT(A(TRUE U NOT(A(TRUE U (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))))
lola: processed formula length: 97
lola: 60 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 67 markings, 177 edges

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (NOT FIREABLE(malS5_2) AND (NOT FIREABLE(SackCS_2) AND (E (G (NOT FIREABLE(malS2_1))) AND E (X (E (F (NOT FIREABLE(ScertCS_0))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 273 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(SackCS_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(SackCS_2)
lola: processed formula length: 22
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(malS5_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(malS5_2)
lola: processed formula length: 21
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(malS2_1)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (NOT FIREABLE(malS2_1)))
lola: processed formula length: 29
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (NOT FIREABLE(ScertCS_0)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: NOT FIREABLE(ScertCS_0)
lola: processed formula length: 23
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 296 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((FIREABLE(malS5_0) OR FIREABLE(malS2_1) OR (FIREABLE(malS2_0) AND FIREABLE(malS1_1)))))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS2_1) AND (NOT FIREABLE(malS2_0) OR NOT FIREABLE(malS1_1)))
lola: processed formula length: 103
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 5 markings, 4 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 323 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (F ((FIREABLE(malA5) OR FIREABLE(SsendTS_2)))) AND A (X (NOT FIREABLE(SsendTS_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (E(TRUE U (FIREABLE(malA5) OR FIREABLE(SsendTS_2))) AND AX(NOT FIREABLE(SsendTS_0))))
lola: processed formula length: 95
lola: 60 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 10 markings, 24 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((FIREABLE(malA2) AND FIREABLE(malS3_2)))) OR (A (X (A (F (FIREABLE(malA5))))) AND A (X ((NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(AackCS))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 355 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malA2) AND FIREABLE(malS3_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 ((FIREABLE(malA2) AND FIREABLE(malS3_2))))
lola: processed formula length: 47
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: (FIREABLE(malA2) AND FIREABLE(malS3_2))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 49 markings, 64 edges
lola: ========================================
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(AackCS))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX((NOT FIREABLE(CsendTS1_2) AND NOT FIREABLE(AackCS)))
lola: processed formula length: 55
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (FIREABLE(malA5)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence from all successors
lola: rewrite Frontend/Parser/formula_rewrite.k:664
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(malA5)
lola: processed formula length: 19
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEG)
lola: state space: using reachability graph (EXEG version) (--search=depth)
lola: state space: using invisibility based stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EXEG
lola: The predicate does not eventually occur from all successors.
lola: 5 markings, 4 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(malA5)))
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: NOT FIREABLE(malA5)
lola: processed formula length: 19
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 444 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(AendCS)))
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: NOT FIREABLE(AendCS)
lola: processed formula length: 20
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (FIREABLE(AgetTS))) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AreqCS)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AreqCS))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0) OR FIREABLE(AreqCS))
lola: processed formula length: 84
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(AgetTS)))
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: NOT FIREABLE(AgetTS)
lola: processed formula length: 20
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(malA4) OR A (F (((FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2) OR FIREABLE(AackCS) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 592 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(malA4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(malA4)
lola: processed formula length: 15
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_2) OR FIREABLE(AackCS) OR FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_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: ((NOT FIREABLE(SreqTS_1) AND NOT FIREABLE(SreqTS_0) AND NOT FIREABLE(SreqTS_2) AND NOT FIREABLE(AackCS) AND NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)))
lola: processed formula length: 183
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 711 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (FIREABLE(malA5)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: NOT FIREABLE(malA5)
lola: processed formula length: 19
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(Sperform_1) AND FIREABLE(SreqTS_2)) OR NOT FIREABLE(SackCS_1)) AND A (G (FIREABLE(SreqTS_2)))))) OR FIREABLE(Sperform_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(Sperform_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(Sperform_2)
lola: processed formula length: 20
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(Sperform_1) AND FIREABLE(SreqTS_2)) OR NOT FIREABLE(SackCS_1)) AND A (G (FIREABLE(SreqTS_2))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: A(TRUE U (((FIREABLE(Sperform_1) AND FIREABLE(SreqTS_2)) OR NOT FIREABLE(SackCS_1)) AND NOT(E(TRUE U NOT FIREABLE(SreqTS_2)))))
lola: processed formula length: 128
lola: 60 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 11 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (G (((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1))))) OR A (G ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1185 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))))
lola: processed formula length: 71
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (NOT FIREABLE(malS1_1) AND NOT FIREABLE(malS1_2) AND NOT FIREABLE(malS1_0))
lola: state equation: Generated DNF with 24 literals and 8 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2 markings, 1 edges
lola: state equation: write sara problem file to QuasiCertifProtocol-PT-02-CTLFireability-13-0.sara
lola: ========================================
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((NOT FIREABLE(malS5_0) AND NOT FIREABLE(malS5_1) AND NOT FIREABLE(malS5_2)) OR NOT FIREABLE(malA3) OR (NOT FIREABLE(malC1_0) AND NOT FIREABLE(malC1_2) AND NOT FIREABLE(malC1_1)))))
lola: processed formula length: 189
lola: 57 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((E (F ((FIREABLE(malS4_2) OR FIREABLE(malS4_0) OR FIREABLE(malS4_1)))) OR E (F ((FIREABLE(malA4) OR FIREABLE(malA1))))) AND A (F ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1778 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(malA4) OR FIREABLE(malA1))))
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 ((FIREABLE(malA4) OR FIREABLE(malA1))))
lola: processed formula length: 45
lola: 58 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: (FIREABLE(malA4) OR FIREABLE(malA1))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 2 markings, 1 edges
lola: ========================================
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0))))
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: (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))
lola: processed formula length: 78
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND FIREABLE(malA2) AND NOT FIREABLE(AreqTS)) AND E (F ((FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0))))))) AND A (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3557 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)))))
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 (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)))))
lola: processed formula length: 379
lola: 61 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: 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: ========================================
lola: ...considering subproblem: (A (F ((((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND FIREABLE(malA2) AND NOT FIREABLE(AreqTS)) AND E (F ((FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0))))))) AND A (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)))))
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 (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_0) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0))) U (((FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1)) AND (FIREABLE(malS1_1) OR FIREABLE(malS1_2) OR FIREABLE(malS1_0))) OR (NOT FIREABLE(SackCS_2) AND NOT FIREABLE(SackCS_1) AND NOT FIREABLE(SackCS_0)))))
lola: processed formula length: 379
lola: 61 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND FIREABLE(malA2) AND NOT FIREABLE(AreqTS)) AND E (F ((FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (((FIREABLE(malC1_0) OR FIREABLE(malC1_2) OR FIREABLE(malC1_1)) AND FIREABLE(malA2) AND NOT FIREABLE(AreqTS)) AND E(TRUE U (FIREABLE(malS3_1) OR FIREABLE(malS3_2) OR FIREABLE(malS3_0)))))
lola: processed formula length: 200
lola: 59 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLFireability.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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes no yes no no no no yes no no no no no no no
lola:
preliminary result: no yes no yes no no no no yes no no no no no no no
lola: memory consumption: 15032 KB
lola: time consumption: 1 seconds

BK_STOP 1526921261895

--------------------
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="QuasiCertifProtocol-PT-02"
export BK_EXAMINATION="CTLFireability"
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/QuasiCertifProtocol-PT-02.tgz
mv QuasiCertifProtocol-PT-02 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 QuasiCertifProtocol-PT-02, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-qhx2-152673578700060"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;