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 CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-qhx2-152673578700059
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526921182798

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 CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ QuasiCertifProtocol-PT-02 @ 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: 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-CTLCardinality.task
lola: LP says that atomic proposition is always true: (Astart <= Sstart_2 + Sstart_1 + Sstart_0)
lola: LP says that atomic proposition is always false: (2 <= Astart)
lola: LP says that atomic proposition is always true: (s3_1 + s3_0 + s3_2 <= Cstart_0 + Cstart_1 + Cstart_2)
lola: LP says that atomic proposition is always false: (3 <= a4)
lola: LP says that atomic proposition is always false: (3 <= n1_2)
lola: LP says that atomic proposition is always false: (2 <= s6_2)
lola: LP says that atomic proposition is always false: (3 <= n4_2)
lola: LP says that atomic proposition is always false: (3 <= n7_2_0)
lola: LP says that atomic proposition is always false: (3 <= Cstart_0)
lola: LP says that atomic proposition is always false: (2 <= s5_2)
lola: LP says that atomic proposition is always false: (3 <= SstopOK_0)
lola: LP says that atomic proposition is always false: (3 <= n7_1_2)
lola: (((1 <= a4) OR E (F (((2 <= s4_0 + s4_1 + s4_2) AND (1 <= SstopOK_0 + SstopOK_1 + SstopOK_2))))) OR E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2)))) : A (F (E (((1 <= CstopAbort) U (1 <= AstopOK))))) : A (F (((SstopAbort + 1 <= c1_2 + c1_1 + c1_0) AND (n6_0 + n6_1 + n6_2 + 1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1) AND ((s5_0 + s5_1 + s5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (s5_0 + s5_1 + s5_2 <= a2))))) : ((A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort))) OR E (((2 <= s5_0 + s5_1 + s5_2) U (1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1)))) AND E (G (E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)))))) : A (F (NOT(E (F (TRUE))))) : ((A (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0))) AND (A (X (FALSE)) OR ((1 <= a3) AND (2 <= n3_2 + n3_1 + n3_0) AND (Cstart_0 + Cstart_1 + Cstart_2 <= 2)))) OR A (X (A (F ((n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0)))))) : E (G (E (F ((1 <= CstopAbort))))) : E (G (TRUE)) : NOT(A (F (FALSE))) : E (G (((1 <= s6_1) OR (n2_0 <= s2_2)))) : A (X ((TRUE AND A (F (FALSE))))) : A (F (FALSE)) : NOT(E (G ((AstopAbort <= s5_0)))) : (A (F (())) OR (A (X (((1 <= n9_0_1) OR (Astart <= n9_0_0)))) AND ())) : A (F ((n4_1 + 1 <= n9_0_0))) : ((A (G ((n8_1_2 <= Cstart_1))) OR E (G ((c1_2 <= n5_0)))) OR FALSE)
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:139
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:326
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:121
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-4 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: DEADLOCK
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: DEADLOCK
lola: processed formula length: 8
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-10 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-11 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 (((CstopAbort <= s5_0 + s5_1 + s5_2) U (2 <= n3_2 + n3_1 + n3_0))) AND (DEADLOCK OR ((1 <= a3) AND (2 <= n3_2 + n3_1 + n3_0) AND (Cstart_0 + Cstart_1 + Cstart_2 <= 2)))) OR A (X (A (F ((n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (DEADLOCK OR ((1 <= a3) AND (2 <= n3_2 + n3_1 + n3_0) AND (Cstart_0 + Cstart_1 + Cstart_2 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:704
lola: processed formula: (DEADLOCK OR ((1 <= a3) AND (2 <= n3_2 + n3_1 + n3_0) AND (Cstart_0 + Cstart_1 + Cstart_2 <= 2)))
lola: processed formula length: 97
lola: 39 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (A (F ((n1_0 + n1_1 + n1_2 <= c1_2 + c1_1 + c1_0)))))
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: (c1_2 + c1_1 + c1_0 + 1 <= n1_0 + n1_1 + n1_2)
lola: processed formula length: 46
lola: 40 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.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-CTLCardinality-5 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 (((1 <= n9_0_1) OR (Astart <= n9_0_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: processed formula: AX(((1 <= n9_0_1) OR (Astart <= n9_0_0)))
lola: processed formula length: 42
lola: 39 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-13 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 (F ((s5_0 + 1 <= AstopAbort)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:695
lola: processed formula: (AstopAbort <= s5_0)
lola: processed formula length: 20
lola: 40 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 36 markings, 39 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-12 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 (F ((n4_1 + 1 <= n9_0_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: (n9_0_0 <= n4_1)
lola: processed formula length: 16
lola: 40 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-14 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: E (G (((1 <= s6_1) OR (n2_0 <= s2_2))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((1 <= s6_1) OR (n2_0 <= s2_2))))
lola: processed formula length: 40
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 9 markings, 8 edges
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-9 TRUE 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 (F (((SstopAbort + 1 <= c1_2 + c1_1 + c1_0) AND (n6_0 + n6_1 + n6_2 + 1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1) AND ((s5_0 + s5_1 + s5_2 + 1 <= n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1) OR (s5_0 + s5_1 + s5_2 <= a2)))))
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: ((c1_2 + c1_1 + c1_0 <= SstopAbort) OR (n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1 <= n6_0 + n6_1 + n6_2) OR ((n8_0_0 + n8_0_1 + n8_0_2 + n8_1_0 + n8_2_0 + n8_2_2 + n8_2_1 + n8_1_2 + n8_1_1 <= s5_0 + s5_1 + s5_2) AND (a2 + 1 <= s5_0 + s5_1 + s5_2)))
lola: processed formula length: 287
lola: 40 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 6 markings, 5 edges
lola:
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-2 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 (F (E (((1 <= CstopAbort) U (1 <= AstopOK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U E((1 <= CstopAbort) U (1 <= AstopOK)))
lola: processed formula length: 47
lola: 40 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 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: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-1 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: E (G (E (F ((1 <= CstopAbort)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation of reachability
lola: rewrite Frontend/Parser/formula_rewrite.k:641
lola: processed formula: (1 <= CstopAbort)
lola: processed formula length: 17
lola: 39 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.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: yes
lola: produced by: state space /EGEF
lola: Reachability of the predicate is possibly preserved.
lola: 230 markings, 417 edges
lola:
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-6 TRUE 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 ((n8_1_2 <= Cstart_1))) OR E (G ((c1_2 <= n5_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((c1_2 <= n5_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((c1_2 <= n5_0)))
lola: processed formula length: 22
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-15 TRUE 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: ((1 <= a4) OR (E (F (((2 <= s4_0 + s4_1 + s4_2) AND (1 <= SstopOK_0 + SstopOK_1 + SstopOK_2)))) OR E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((c1_2 + c1_1 + c1_0 <= n1_0 + n1_1 + n1_2)))
lola: processed formula length: 50
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola:
FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-0 TRUE 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 (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort))) OR E (((2 <= s5_0 + s5_1 + s5_2) U (1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1)))) AND E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
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 (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
lola: processed formula length: 57
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: 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 (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort))) OR E (((2 <= s5_0 + s5_1 + s5_2) U (1 <= n7_0_0 + n7_1_0 + n7_2_0 + n7_1_2 + n7_2_1 + n7_2_2 + n7_1_1 + n7_0_2 + n7_0_1)))) AND E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
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 (((3 <= n6_0 + n6_1 + n6_2) U (AstopOK <= SstopAbort)))
lola: processed formula length: 57
lola: 42 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((CstopOK_2 + CstopOK_1 + CstopOK_0 <= n9_0_0 + n9_0_1 + n9_0_2 + n9_2_2 + n9_2_1 + n9_2_0 + n9_1_2 + n9_1_1 + n9_1_0)))
lola: processed formula length: 125
lola: 38 rewrites
lola: closed formula file QuasiCertifProtocol-PT-02-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 6 markings, 5 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA QuasiCertifProtocol-PT-02-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no yes no no yes yes yes yes no no no no no yes
lola:
preliminary result: yes no no yes no no yes yes yes yes no no no no no yes
lola: memory consumption: 23828 KB
lola: time consumption: 1 seconds

BK_STOP 1526921204154

--------------------
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="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/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 CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-qhx2-152673578700059"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;