About the Execution of LoLA for SafeBus-PT-03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
148.240 | 591.00 | 90.00 | 0.00 | TFFFTFFTFFFFFTFF | normal |
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 316K
-rw-r--r-- 1 mcc users 5.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K 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.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 7.4K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 93K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is SafeBus-PT-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-smll-152685547200227
=====================================================================
--------------------
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 SafeBus-PT-03-CTLCardinality-00
FORMULA_NAME SafeBus-PT-03-CTLCardinality-01
FORMULA_NAME SafeBus-PT-03-CTLCardinality-02
FORMULA_NAME SafeBus-PT-03-CTLCardinality-03
FORMULA_NAME SafeBus-PT-03-CTLCardinality-04
FORMULA_NAME SafeBus-PT-03-CTLCardinality-05
FORMULA_NAME SafeBus-PT-03-CTLCardinality-06
FORMULA_NAME SafeBus-PT-03-CTLCardinality-07
FORMULA_NAME SafeBus-PT-03-CTLCardinality-08
FORMULA_NAME SafeBus-PT-03-CTLCardinality-09
FORMULA_NAME SafeBus-PT-03-CTLCardinality-10
FORMULA_NAME SafeBus-PT-03-CTLCardinality-11
FORMULA_NAME SafeBus-PT-03-CTLCardinality-12
FORMULA_NAME SafeBus-PT-03-CTLCardinality-13
FORMULA_NAME SafeBus-PT-03-CTLCardinality-14
FORMULA_NAME SafeBus-PT-03-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1527026232508
info: Time: 3600 - MCC
===========================================================================================
prep: translating SafeBus-PT-03 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating SafeBus-PT-03 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ SafeBus-PT-03 @ 3570 seconds
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 148/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 1824
lola: finding significant places
lola: 57 places, 91 transitions, 37 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 108 transition conflict sets
lola: TASK
lola: reading formula from SafeBus-PT-03-CTLCardinality.task
lola: LP says that atomic proposition is always false: (2 <= T_out)
lola: place invariant simplifies atomic proposition
lola: before: (msgl_1 + msgl_2 + msgl_3 <= cable_used_1 + cable_used_2 + cable_used_3)
lola: after: (3 <= cable_used_1 + cable_used_2 + cable_used_3)
lola: LP says that atomic proposition is always false: (3 <= cable_used_1 + cable_used_2 + cable_used_3)
lola: place invariant simplifies atomic proposition
lola: before: (1 <= msgl_1 + msgl_2 + msgl_3)
lola: after: (0 <= 2)
lola: always true
lola: always true
lola: always true
lola: always true
lola: LP says that atomic proposition is always false: (3 <= ACK)
lola: place invariant simplifies atomic proposition
lola: before: (FMC_1 + FMC_2 + FMC_3 <= Cpt2_1 + Cpt2_2 + Cpt2_3)
lola: after: (FMC_1 + FMC_2 + FMC_3 <= 1)
lola: LP says that atomic proposition is always true: (FMC_1 + FMC_2 + FMC_3 <= 1)
lola: LP says that atomic proposition is always false: (3 <= FMC_1 + FMC_2 + FMC_3)
lola: LP says that atomic proposition is always false: (2 <= ACK)
lola: LP says that atomic proposition is always false: (2 <= FMC_1 + FMC_2 + FMC_3)
lola: LP says that atomic proposition is always true: (PMC_3 + PMC_2 + PMC_1 <= cable_used_1 + cable_used_2 + cable_used_3)
lola: place invariant simplifies atomic proposition
lola: before: (2 <= Cpt2_1 + Cpt2_2 + Cpt2_3)
lola: after: (1 <= 0)
lola: always false
lola: LP says that atomic proposition is always true: (ACK <= FMCb)
lola: place invariant simplifies atomic proposition
lola: before: (cable_free <= msgl_1 + msgl_2 + msgl_3)
lola: after: (cable_free <= 3)
lola: LP says that atomic proposition is always true: (cable_free <= 3)
lola: LP says that atomic proposition is always false: (3 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2)
lola: LP says that atomic proposition is always false: (2 <= AMC_2_3)
lola: LP says that atomic proposition is always false: (3 <= wait_cable_2)
lola: LP says that atomic proposition is always false: (3 <= listen_2)
lola: LP says that atomic proposition is always false: (3 <= wait_msg_2)
lola: LP says that atomic proposition is always false: (3 <= AMC_2_2)
lola: LP says that atomic proposition is always false: (3 <= wait_msg_2)
lola: LP says that atomic proposition is always false: (2 <= cable_used_2)
lola: LP says that atomic proposition is always false: (3 <= FMC_2)
lola: place invariant simplifies atomic proposition
lola: before: (ACK <= msgl_3)
lola: after: (ACK <= 1)
lola: LP says that atomic proposition is always true: (ACK <= 1)
lola: LP says that atomic proposition is always false: (2 <= cable_used_2)
lola: (NOT((((S_tout <= 0)) AND A (F ((1 <= RMC_1 + RMC_2 + RMC_3))))) AND ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))) : NOT(((PMC_3 + PMC_2 + PMC_1 + 1 <= wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2) OR (A (G (TRUE)) AND ((PMC_3 + PMC_2 + PMC_1 + 1 <= FMCb))))) : E (X (A (F ((R_tout <= 0))))) : ((3 <= wait_msg_1 + wait_msg_2 + wait_msg_3) OR A (F (A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))))) : ((NOT(A (F ((1 <= loop_em_1 + loop_em_2 + loop_em_3)))) AND E (G (TRUE))) AND (E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3))) AND (() OR E (X ((cable_free <= T_out)))))) : A (F (NOT(A (F ((MSG_1 + MSG_2 + MSG_3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3)))))) : ((A (F (TRUE)) AND A (F (()))) AND (A ((FALSE U TRUE)) OR A (G (())))) : (E (G (((RMC_1 + RMC_2 + RMC_3 <= 2) AND (S_tout <= 0)))) AND (() OR A (F (TRUE)))) : (A (X (E (G ((1 <= T_out))))) OR A (F (()))) : A (F (A (G ((ACK <= listen_3))))) : ((E (((RMC_3 <= RMC_2) U FALSE)) OR ((1 <= loop_em_1))) AND (1 <= FMCb)) : A (F (A (((1 <= cable_used_3) U FALSE)))) : A (F (((wait_msg_1 + 1 <= FMC_3) AND (Cpt1_1 + 1 <= T_out) AND (listen_2 + 1 <= Cpt1_3)))) : E (G (E (G (TRUE)))) : E (F (FALSE)) : (A (F (())) AND (E (((wait_msg_1 <= RMC_2) U FALSE)) AND (AMC_3_1 <= Cpt2_1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:392
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:115
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:121
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
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: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: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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= PMC_3 + PMC_2 + PMC_1) AND ((FMCb <= PMC_3 + PMC_2 + PMC_1)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: ((wait_ack_1_2 + wait_ack_1_3 + wait_ack_2_1 + wait_ack_2_3 + wait_ack_3_1 + wait_ack_3_2 <= PMC_3 + PMC_2 + PMC_1) AND ((FMCb <= PMC_3 + PMC_2 + PMC_1)))
lola: processed formula length: 154
lola: 78 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 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 SafeBus-PT-03-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 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: 77 rewrites
lola: closed formula file SafeBus-PT-03-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 SafeBus-PT-03-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((1 <= loop_em_1)) AND (1 <= FMCb))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: rewrite Frontend/Parser/formula_rewrite.k:700
lola: processed formula: (((1 <= loop_em_1)) AND (1 <= FMCb))
lola: processed formula length: 36
lola: 78 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 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 SafeBus-PT-03-CTLCardinality-10 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-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 SafeBus-PT-03-CTLCardinality-11 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: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-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
FORMULA SafeBus-PT-03-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 5 will run for 324 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: 77 rewrites
lola: closed formula file SafeBus-PT-03-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 SafeBus-PT-03-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 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: 77 rewrites
lola: closed formula file SafeBus-PT-03-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 SafeBus-PT-03-CTLCardinality-15 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 (X (E (G ((1 <= T_out)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U (T_out <= 0))))
lola: processed formula length: 31
lola: 80 rewrites
lola: closed formula file SafeBus-PT-03-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-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: E (X (A (F ((R_tout <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: processed formula: EX(A(TRUE U (R_tout <= 0)))
lola: processed formula length: 27
lola: 79 rewrites
lola: closed formula file SafeBus-PT-03-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 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 132 markings, 134 edges
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((RMC_1 + RMC_2 + RMC_3 <= 2) AND (S_tout <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((RMC_1 + RMC_2 + RMC_3 <= 2) AND (S_tout <= 0))))
lola: processed formula length: 56
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-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: 33 markings, 33 edges
FORMULA SafeBus-PT-03-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((wait_msg_1 + 1 <= FMC_3) AND (Cpt1_1 + 1 <= T_out) AND (listen_2 + 1 <= Cpt1_3))))
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: ((FMC_3 <= wait_msg_1) OR (T_out <= Cpt1_1) OR (Cpt1_3 <= listen_2))
lola: processed formula length: 70
lola: 79 rewrites
lola: closed formula file SafeBus-PT-03-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: 37 markings, 37 edges
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-12 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 (G ((AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3 + 1 <= MSG_1 + MSG_2 + MSG_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: processed formula: A(TRUE U NOT(A(TRUE U (MSG_1 + MSG_2 + MSG_3 <= AMC_1_1 + AMC_1_2 + AMC_1_3 + AMC_2_1 + AMC_2_2 + AMC_2_3 + AMC_3_1 + AMC_3_2 + AMC_3_3))))
lola: processed formula length: 139
lola: 80 rewrites
lola: closed formula file SafeBus-PT-03-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: 39 markings, 86 edges
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-5 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: ((3 <= wait_msg_1 + wait_msg_2 + wait_msg_3) OR A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= wait_msg_1 + wait_msg_2 + wait_msg_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= wait_msg_1 + wait_msg_2 + wait_msg_3)
lola: processed formula length: 43
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= wait_msg_1 + wait_msg_2 + wait_msg_3)))
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: (wait_msg_1 + wait_msg_2 + wait_msg_3 <= 1)
lola: processed formula length: 43
lola: 79 rewrites
lola: closed formula file SafeBus-PT-03-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: 82 markings, 84 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-3 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 (F (A (G ((ACK <= listen_3)))))
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: (listen_3 + 1 <= ACK)
lola: processed formula length: 21
lola: 79 rewrites
lola: closed formula file SafeBus-PT-03-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: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 39 markings, 39 edges
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-9 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: (E (G ((loop_em_1 + loop_em_2 + loop_em_3 <= 0))) AND E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3))))
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 ((loop_em_1 + loop_em_2 + loop_em_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((loop_em_1 + loop_em_2 + loop_em_3 <= 0)))
lola: processed formula length: 48
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-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: 493 markings, 888 edges
lola: ========================================
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((FMCb + 1 <= FMC_1 + FMC_2 + FMC_3)))
lola: processed formula length: 43
lola: 78 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (FMCb + 1 <= FMC_1 + FMC_2 + FMC_3)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to SafeBus-PT-03-CTLCardinality-15-0.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: state equation: calling and running sara
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-4 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: ((((1 <= S_tout)) OR E (G ((RMC_1 + RMC_2 + RMC_3 <= 0)))) AND ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free)))
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: ((1 <= S_tout))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= S_tout))
lola: processed formula length: 15
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))
lola: processed formula length: 126
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((((1 <= S_tout)) OR E (G ((RMC_1 + RMC_2 + RMC_3 <= 0)))) AND ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: ((1 <= S_tout))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= S_tout))
lola: processed formula length: 15
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (G ((RMC_1 + RMC_2 + RMC_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((RMC_1 + RMC_2 + RMC_3 <= 0)))
lola: processed formula length: 36
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-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: 52 markings, 65 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((cable_used_1 + cable_used_2 + cable_used_3 + 1 <= listen_3 + listen_2 + listen_1) OR (MSG_1 + MSG_2 + MSG_3 <= cable_free))
lola: processed formula length: 126
lola: 77 rewrites
lola: closed formula file SafeBus-PT-03-CTLCardinality.task
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
FORMULA SafeBus-PT-03-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no no no yes no no yes no no no no no yes no no
lola:
preliminary result: yes no no no yes no no yes no no no no no yes no no
sara: try reading problem file SafeBus-PT-03-CTLCardinality-15-0.sara.
lola: memory consumption: 24392 KB
lola: time consumption: 1 seconds
sara: place or transition ordering is non-deterministic
BK_STOP 1527026233099
--------------------
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="SafeBus-PT-03"
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/SafeBus-PT-03.tgz
mv SafeBus-PT-03 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 SafeBus-PT-03, 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 r148-smll-152685547200227"
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 '
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 ;