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 2.5M
-rw-r--r-- 1 mcc users 34K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 128K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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 30K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 107K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K 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 8.3K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 38K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 11K 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 1.8M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is QuasiCertifProtocol-PT-32, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-qhx2-152732127400068
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1528195742320

info: Time: 3600 - MCC
===========================================================================================
prep: translating QuasiCertifProtocol-PT-32 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating QuasiCertifProtocol-PT-32 formula LTLFireability into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLFireability @ QuasiCertifProtocol-PT-32 @ 3569 seconds
lola: LoLA will run for 3569 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 4312/65536 symbol table entries, 134 collisions
lola: preprocessing...
lola: Size of bit vector: 121792
lola: finding significant places
lola: 3806 places, 506 transitions, 505 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 671 transition conflict sets
lola: TASK
lola: reading formula from QuasiCertifProtocol-PT-32-LTLFireability.task
lola: A (X ((F (X (FIREABLE(AendCS))) U (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32))))) : A ((FIREABLE(SsendTS_20) OR FIREABLE(SsendTS_19) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_24) OR FIREABLE(SsendTS_23) OR FIREABLE(SsendTS_22) OR FIREABLE(SsendTS_21) OR FIREABLE(SsendTS_28) OR FIREABLE(SsendTS_27) OR FIREABLE(SsendTS_26) OR FIREABLE(SsendTS_25) OR FIREABLE(SsendTS_32) OR FIREABLE(SsendTS_31) OR FIREABLE(SsendTS_30) OR FIREABLE(SsendTS_29) OR FIREABLE(SsendTS_0) OR FIREABLE(SsendTS_1) OR FIREABLE(SsendTS_2) OR FIREABLE(SsendTS_3) OR FIREABLE(SsendTS_4) OR FIREABLE(SsendTS_5) OR FIREABLE(SsendTS_6) OR FIREABLE(SsendTS_7) OR FIREABLE(SsendTS_8) OR FIREABLE(SsendTS_9) OR FIREABLE(SsendTS_10) OR FIREABLE(SsendTS_11) OR FIREABLE(SsendTS_12) OR FIREABLE(SsendTS_13) OR FIREABLE(SsendTS_14) OR FIREABLE(SsendTS_15) OR FIREABLE(SsendTS_16))) : A ((FIREABLE(malS1_28) OR FIREABLE(malS1_27) OR FIREABLE(malS1_26) OR FIREABLE(malS1_25) OR FIREABLE(malS1_32) OR FIREABLE(malS1_31) OR FIREABLE(malS1_30) OR FIREABLE(malS1_29) OR FIREABLE(malS1_0) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_13) OR FIREABLE(malS1_14) OR FIREABLE(malS1_15) OR FIREABLE(malS1_16) OR FIREABLE(malS1_9) OR FIREABLE(malS1_10) OR FIREABLE(malS1_11) OR FIREABLE(malS1_12) OR FIREABLE(malS1_21) OR FIREABLE(malS1_22) OR FIREABLE(malS1_23) OR FIREABLE(malS1_24) OR FIREABLE(malS1_17) OR FIREABLE(malS1_18) OR FIREABLE(malS1_19) OR FIREABLE(malS1_20))) : A ((G (X (G (FIREABLE(AstartCS)))) U X (((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) OR FIREABLE(SgetTS_32) OR FIREABLE(SgetTS_31) OR FIREABLE(SgetTS_30) OR FIREABLE(SgetTS_29) OR FIREABLE(SgetTS_6) OR FIREABLE(SgetTS_5) OR FIREABLE(SgetTS_8) OR FIREABLE(SgetTS_7) OR FIREABLE(SgetTS_10) OR FIREABLE(SgetTS_9) OR FIREABLE(SgetTS_12) OR FIREABLE(SgetTS_11) OR FIREABLE(SgetTS_0) OR FIREABLE(SgetTS_2) OR FIREABLE(SgetTS_1) OR FIREABLE(SgetTS_4) OR FIREABLE(SgetTS_3)) U (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32)))))) : A ((G (G ((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR FIREABLE(CsendTS1_32) OR FIREABLE(CsendTS1_1) OR FIREABLE(CsendTS1_0) OR FIREABLE(CsendTS1_2) OR FIREABLE(CsendTS1_3) OR FIREABLE(CsendTS1_4) OR FIREABLE(CsendTS1_5) OR FIREABLE(CsendTS1_6) OR FIREABLE(CsendTS1_7) OR FIREABLE(CsendTS1_8) OR FIREABLE(CsendTS1_9) OR FIREABLE(CsendTS1_10) OR FIREABLE(CsendTS1_11) OR FIREABLE(CsendTS1_12) OR FIREABLE(CsendTS1_13) OR FIREABLE(CsendTS1_14) OR FIREABLE(CsendTS1_15) OR FIREABLE(CsendTS1_16) OR FIREABLE(CsendTS1_17)))) U G (X (FIREABLE(malA1))))) : A (X (F (G (G (F (FIREABLE(AackCS))))))) : A ((FIREABLE(malS2_31) OR FIREABLE(malS2_30) OR FIREABLE(malS2_32) OR FIREABLE(malS2_27) OR FIREABLE(malS2_26) OR FIREABLE(malS2_29) OR FIREABLE(malS2_28) OR FIREABLE(malS2_1) OR FIREABLE(malS2_0) OR FIREABLE(malS2_9) OR FIREABLE(malS2_8) OR FIREABLE(malS2_7) OR FIREABLE(malS2_6) OR FIREABLE(malS2_5) OR FIREABLE(malS2_4) OR FIREABLE(malS2_3) OR FIREABLE(malS2_2) OR FIREABLE(malS2_16) OR FIREABLE(malS2_17) OR FIREABLE(malS2_14) OR FIREABLE(malS2_15) OR FIREABLE(malS2_12) OR FIREABLE(malS2_13) OR FIREABLE(malS2_10) OR FIREABLE(malS2_11) OR FIREABLE(malS2_24) OR FIREABLE(malS2_25) OR FIREABLE(malS2_22) OR FIREABLE(malS2_23) OR FIREABLE(malS2_20) OR FIREABLE(malS2_21) OR FIREABLE(malS2_18) OR FIREABLE(malS2_19))) : A ((X (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_21) OR FIREABLE(SackCS_20) OR FIREABLE(SackCS_23) OR FIREABLE(SackCS_22) OR FIREABLE(SackCS_17) OR FIREABLE(SackCS_16) OR FIREABLE(SackCS_19) OR FIREABLE(SackCS_18) OR FIREABLE(SackCS_29) OR FIREABLE(SackCS_28) OR FIREABLE(SackCS_31) OR FIREABLE(SackCS_30) OR FIREABLE(SackCS_25) OR FIREABLE(SackCS_24) OR FIREABLE(SackCS_27) OR FIREABLE(SackCS_26) OR FIREABLE(SackCS_32)) U (FIREABLE(SreqTS_4) OR FIREABLE(SreqTS_5) OR FIREABLE(SreqTS_2) OR FIREABLE(SreqTS_3) OR FIREABLE(SreqTS_0) OR FIREABLE(SreqTS_1) OR FIREABLE(SreqTS_12) OR FIREABLE(SreqTS_13) OR FIREABLE(SreqTS_10) OR FIREABLE(SreqTS_11) OR FIREABLE(SreqTS_8) OR FIREABLE(SreqTS_9) OR FIREABLE(SreqTS_6) OR FIREABLE(SreqTS_7) OR FIREABLE(SreqTS_22) OR FIREABLE(SreqTS_23) OR FIREABLE(SreqTS_24) OR FIREABLE(SreqTS_25) OR FIREABLE(SreqTS_26) OR FIREABLE(SreqTS_27) OR FIREABLE(SreqTS_28) OR FIREABLE(SreqTS_29) OR FIREABLE(SreqTS_14) OR FIREABLE(SreqTS_15) OR FIREABLE(SreqTS_16) OR FIREABLE(SreqTS_17) OR FIREABLE(SreqTS_18) OR FIREABLE(SreqTS_19) OR FIREABLE(SreqTS_20) OR FIREABLE(SreqTS_21) OR FIREABLE(SreqTS_31) OR FIREABLE(SreqTS_30) OR FIREABLE(SreqTS_32)))) U (G ((FIREABLE(Sperform_22) OR FIREABLE(Sperform_21) OR FIREABLE(Sperform_20) OR FIREABLE(Sperform_19) OR FIREABLE(Sperform_18) OR FIREABLE(Sperform_17) OR FIREABLE(Sperform_16) OR FIREABLE(Sperform_15) OR FIREABLE(Sperform_30) OR FIREABLE(Sperform_29) OR FIREABLE(Sperform_28) OR FIREABLE(Sperform_27) OR FIREABLE(Sperform_26) OR FIREABLE(Sperform_25) OR FIREABLE(Sperform_24) OR FIREABLE(Sperform_23) OR FIREABLE(Sperform_31) OR FIREABLE(Sperform_32) OR FIREABLE(Sperform_3) OR FIREABLE(Sperform_4) OR FIREABLE(Sperform_5) OR FIREABLE(Sperform_6) OR FIREABLE(Sperform_0) OR FIREABLE(Sperform_1) OR FIREABLE(Sperform_2) OR FIREABLE(Sperform_11) OR FIREABLE(Sperform_12) OR FIREABLE(Sperform_13) OR FIREABLE(Sperform_14) OR FIREABLE(Sperform_7) OR FIREABLE(Sperform_8) OR FIREABLE(Sperform_9) OR FIREABLE(Sperform_10))) U F (FIREABLE(malA4))))) : A (G ((G (X (FIREABLE(CgenCertif_18))) U FIREABLE(malS2_4)))) : A ((F (F (FIREABLE(malS5_5))) U (F (FIREABLE(SsendTS_18)) U F (FIREABLE(SgetTS_30))))) : A (F (X ((FIREABLE(ScertCS_2) U G (FIREABLE(Sperform_7)))))) : A (G (FIREABLE(malS2_12))) : A ((FIREABLE(malS5_26) U G ((FIREABLE(malS3_2) U FIREABLE(SsendTS_30))))) : A ((X (FIREABLE(malS6_20)) U X (F (FIREABLE(SackCS_29))))) : A (FIREABLE(malS3_14)) : A ((X ((FIREABLE(malS4_5) U FIREABLE(CgenCertif_16))) U G ((FIREABLE(malS4_8) U FIREABLE(malS4_22)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(SsendTS_20) OR FIREABLE(SsendTS_19) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_24) OR FIREABLE(SsendTS_23) OR FIREABLE(SsendTS_22) OR FIREABLE(SsendTS_21) OR FIREABLE(SsendTS_28) OR FIREABLE(SsendTS_27) OR FIREABLE(SsendTS_26) OR FIREABLE(SsendTS_25) OR FIREABLE(SsendTS_32) OR FIREABLE(SsendTS_31) OR FIREABLE(SsendTS_30) OR FIREABLE(SsendTS_29) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(SsendTS_20) OR FIREABLE(SsendTS_19) OR FIREABLE(SsendTS_18) OR FIREABLE(SsendTS_17) OR FIREABLE(SsendTS_24) OR FIREABLE(SsendTS_23) OR FIREABLE(SsendTS_22) OR FIREABLE(SsendTS_21) OR FIREABLE(SsendTS_28) OR FIREABLE(SsendTS_27) OR FIREABLE(SsendTS_26) OR FIREABLE(SsendTS_25) OR FIREABLE(SsendTS_32) OR FIREABLE(SsendTS_31) OR FIREABLE(SsendTS_30) OR FIREABLE(SsendTS_29) OR ... (shortened)
lola: processed formula length: 812
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.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 QuasiCertifProtocol-PT-32-LTLFireability-1 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: (FIREABLE(malS1_28) OR FIREABLE(malS1_27) OR FIREABLE(malS1_26) OR FIREABLE(malS1_25) OR FIREABLE(malS1_32) OR FIREABLE(malS1_31) OR FIREABLE(malS1_30) OR FIREABLE(malS1_29) OR FIREABLE(malS1_0) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_13... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(malS1_28) OR FIREABLE(malS1_27) OR FIREABLE(malS1_26) OR FIREABLE(malS1_25) OR FIREABLE(malS1_32) OR FIREABLE(malS1_31) OR FIREABLE(malS1_30) OR FIREABLE(malS1_29) OR FIREABLE(malS1_0) OR FIREABLE(malS1_6) OR FIREABLE(malS1_5) OR FIREABLE(malS1_8) OR FIREABLE(malS1_7) OR FIREABLE(malS1_2) OR FIREABLE(malS1_1) OR FIREABLE(malS1_4) OR FIREABLE(malS1_3) OR FIREABLE(malS1_13... (shortened)
lola: processed formula length: 746
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.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

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(malS2_31) OR FIREABLE(malS2_30) OR FIREABLE(malS2_32) OR FIREABLE(malS2_27) OR FIREABLE(malS2_26) OR FIREABLE(malS2_29) OR FIREABLE(malS2_28) OR FIREABLE(malS2_1) OR FIREABLE(malS2_0) OR FIREABLE(malS2_9) OR FIREABLE(malS2_8) OR FIREABLE(malS2_7) OR FIREABLE(malS2_6) OR FIREABLE(malS2_5) OR FIREABLE(malS2_4) OR FIREABLE(malS2_3) OR FIREABLE(malS2_2) OR FIREABLE(malS2_16)... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(malS2_31) OR FIREABLE(malS2_30) OR FIREABLE(malS2_32) OR FIREABLE(malS2_27) OR FIREABLE(malS2_26) OR FIREABLE(malS2_29) OR FIREABLE(malS2_28) OR FIREABLE(malS2_1) OR FIREABLE(malS2_0) OR FIREABLE(malS2_9) OR FIREABLE(malS2_8) OR FIREABLE(malS2_7) OR FIREABLE(malS2_6) OR FIREABLE(malS2_5) OR FIREABLE(malS2_4) OR FIREABLE(malS2_3) OR FIREABLE(malS2_2) OR FIREABLE(malS2_16)... (shortened)
lola: processed formula length: 746
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.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 QuasiCertifProtocol-PT-32-LTLFireability-6 FALSE 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: FIREABLE(malS3_14)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(malS3_14)
lola: processed formula length: 18
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.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 QuasiCertifProtocol-PT-32-LTLFireability-14 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 (G (FIREABLE(malA1))) OR (G ((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G (FIREABLE(malA1))) OR (G ((FIREABLE(CsendTS1_19) OR FIREABLE(CsendTS1_18) OR FIREABLE(CsendTS1_21) OR FIREABLE(CsendTS1_20) OR FIREABLE(CsendTS1_23) OR FIREABLE(CsendTS1_22) OR FIREABLE(CsendTS1_25) OR FIREABLE(CsendTS1_24) OR FIREABLE(CsendTS1_27) OR FIREABLE(CsendTS1_26) OR FIREABLE(CsendTS1_29) OR FIREABLE(CsendTS1_28) OR FIREABLE(CsendTS1_31) OR FIREABLE(CsendTS1_30) OR ... (shortened)
lola: processed formula length: 912
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 37 markings, 38 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-4 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: A (X ((X (F (FIREABLE(AendCS))) U (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (F (FIREABLE(AendCS))) U (FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS... (shortened)
lola: processed formula length: 816
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-0 FALSE 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: A ((X (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_2... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (((FIREABLE(SackCS_2) OR FIREABLE(SackCS_3) OR FIREABLE(SackCS_0) OR FIREABLE(SackCS_1) OR FIREABLE(SackCS_6) OR FIREABLE(SackCS_7) OR FIREABLE(SackCS_4) OR FIREABLE(SackCS_5) OR FIREABLE(SackCS_10) OR FIREABLE(SackCS_11) OR FIREABLE(SackCS_8) OR FIREABLE(SackCS_9) OR FIREABLE(SackCS_14) OR FIREABLE(SackCS_15) OR FIREABLE(SackCS_12) OR FIREABLE(SackCS_13) OR FIREABLE(SackCS_2... (shortened)
lola: processed formula length: 2476
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-7 FALSE 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: (A (G (F (FIREABLE(malS2_4)))) AND A (G ((X (G (FIREABLE(CgenCertif_18))) OR FIREABLE(malS2_4)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(malS2_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(malS2_4))))
lola: processed formula length: 29
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F (FIREABLE(SackCS_29))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (FIREABLE(SackCS_29))))
lola: processed formula length: 31
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-13 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 (X ((((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) OR FIREABL... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((FIREABLE(SgetTS_23) OR FIREABLE(SgetTS_24) OR FIREABLE(SgetTS_21) OR FIREABLE(SgetTS_22) OR FIREABLE(SgetTS_27) OR FIREABLE(SgetTS_28) OR FIREABLE(SgetTS_25) OR FIREABLE(SgetTS_26) OR FIREABLE(SgetTS_15) OR FIREABLE(SgetTS_16) OR FIREABLE(SgetTS_13) OR FIREABLE(SgetTS_14) OR FIREABLE(SgetTS_19) OR FIREABLE(SgetTS_20) OR FIREABLE(SgetTS_17) OR FIREABLE(SgetTS_18) OR FIREABL... (shortened)
lola: processed formula length: 2389
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-3 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: A ((X ((FIREABLE(malS4_5) U FIREABLE(CgenCertif_16))) U G ((F (FIREABLE(malS4_22)) AND (FIREABLE(malS4_8) OR FIREABLE(malS4_22))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((FIREABLE(malS4_5) U FIREABLE(CgenCertif_16))) U G ((F (FIREABLE(malS4_22)) AND (FIREABLE(malS4_8) OR FIREABLE(malS4_22))))))
lola: processed formula length: 132
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-15 FALSE 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: A (G (FIREABLE(malS2_12)))
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(malS2_12)))
lola: processed formula length: 26
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: NOT FIREABLE(malS2_12)
lola: The predicate is not invariant.
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(SgetTS_30)))
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(SgetTS_30)
lola: processed formula length: 23
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.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: 46 markings, 45 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (FIREABLE(AackCS))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (FIREABLE(AackCS))))
lola: processed formula length: 28
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 46 markings, 46 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (FIREABLE(Sperform_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (FIREABLE(Sperform_7))))
lola: processed formula length: 32
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 47 markings, 48 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((FIREABLE(malS5_26) U G ((F (FIREABLE(SsendTS_30)) AND (FIREABLE(malS3_2) OR FIREABLE(SsendTS_30))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((FIREABLE(malS5_26) U G ((F (FIREABLE(SsendTS_30)) AND (FIREABLE(malS3_2) OR FIREABLE(SsendTS_30))))))
lola: processed formula length: 105
lola: 36 rewrites
lola: closed formula file QuasiCertifProtocol-PT-32-LTLFireability.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 36 markings, 36 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-32-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no yes no no no no no no no no no no no no no
lola:
preliminary result: no no yes no no no no no no no no no no no no no
lola: memory consumption: 17532 KB
lola: time consumption: 0 seconds

BK_STOP 1528195763733

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