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 25M
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K 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.1K 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 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.3K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 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 2.8K 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.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 25M May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is Dekker-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r076-blw3-152649936800110
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1526629903288

info: Time: 3600 - MCC
===========================================================================================
prep: translating Dekker-PT-200 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: added safe information to the net based on GenericPropertiesVerdict
prep: check for too many tokens
===========================================================================================
prep: translating Dekker-PT-200 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ Dekker-PT-200 @ 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: 41400/65536 symbol table entries, 18535 collisions
lola: preprocessing...
lola: Size of bit vector: 1000
lola: finding significant places
lola: 1000 places, 40400 transitions, 400 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 80600 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-200-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (3 <= p1_174)
lola: LP says that atomic proposition is always false: (3 <= p1_44)
lola: LP says that atomic proposition is always false: (2 <= p0_29)
lola: LP says that atomic proposition is always false: (2 <= flag_0_61)
lola: LP says that atomic proposition is always false: (2 <= p3_154)
lola: LP says that atomic proposition is always false: (2 <= p3_111)
lola: LP says that atomic proposition is always false: (3 <= p1_57)
lola: LP says that atomic proposition is always false: (3 <= p1_109)
lola: LP says that atomic proposition is always false: (3 <= p3_43)
lola: LP says that atomic proposition is always false: (3 <= p1_97)
lola: LP says that atomic proposition is always false: (3 <= p0_25)
lola: LP says that atomic proposition is always false: (2 <= p3_29)
lola: LP says that atomic proposition is always false: (3 <= p1_47)
lola: LP says that atomic proposition is always false: (2 <= flag_0_153)
lola: LP says that atomic proposition is always false: (3 <= p1_98)
lola: LP says that atomic proposition is always false: (2 <= p3_24)
lola: LP says that atomic proposition is always false: (2 <= flag_1_76)
lola: LP says that atomic proposition is always false: (3 <= p3_85)
lola: LP says that atomic proposition is always false: (3 <= p0_146)
lola: LP says that atomic proposition is always false: (3 <= flag_1_62)
lola: LP says that atomic proposition is always false: (2 <= p1_28)
lola: A (G ((flag_1_129 <= flag_0_175))) : E (F (((1 <= p1_80) AND (p0_189 + 1 <= p1_160)))) : E (F ((((1 <= p1_6) OR (1 <= flag_1_72) OR ((p0_157 <= p1_74) AND (flag_1_101 <= p1_177))) AND (flag_0_48 <= p3_50)))) : E (F (())) : E (F (FALSE)) : A (G (())) : E (F (())) : E (F ((p1_193 + 1 <= p3_112))) : E (F (((flag_1_42 + 1 <= flag_0_21) AND (p1_168 + 1 <= p3_47)))) : A (G (())) : E (F (FALSE)) : E (F ((((p0_83 + 1 <= p3_181))))) : E (F (FALSE)) : E (F (())) : A (G (TRUE)) : E (F (()))
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:148
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
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: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:148
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:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 218 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 233 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 250 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 269 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 4 will run for 291 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 318 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 350 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 389 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 437 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 500 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: 30 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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 Dekker-PT-200-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((p1_193 + 1 <= p3_112)))
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 ((p1_193 + 1 <= p3_112)))
lola: processed formula length: 30
lola: 31 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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: (p1_193 + 1 <= p3_112)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityCardinality-10-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityCardinality-10-0.sara.
lola: sara is running 0 secs || 646 markings, 1947 edges, 129 markings/sec, 0 secs
lola: sara is running 5 secs || 1288 markings, 4519 edges, 128 markings/sec, 5 secs
lola: sara is running 10 secs || 1926 markings, 6960 edges, 128 markings/sec, 10 secs
lola: sara is running 15 secs || 2565 markings, 9328 edges, 128 markings/sec, 15 secs
lola: sara is running 20 secs || 3203 markings, 12103 edges, 128 markings/sec, 20 secs
lola: sara is running 25 secs || 3846 markings, 14813 edges, 129 markings/sec, 25 secs
lola: sara is running 30 secs || 4487 markings, 17637 edges, 128 markings/sec, 30 secs
lola: sara is running 35 secs || 5107 markings, 20290 edges, 124 markings/sec, 35 secs
lola: sara is running 40 secs || 5733 markings, 22910 edges, 125 markings/sec, 40 secs
lola: sara is running 45 secs || 6373 markings, 25843 edges, 128 markings/sec, 45 secs
lola: sara is running 50 secs || 7013 markings, 28568 edges, 128 markings/sec, 50 secs
lola: sara is running 55 secs || 7655 markings, 31642 edges, 128 markings/sec, 55 secs
lola: sara is running 60 secs || 8292 markings, 34845 edges, 127 markings/sec, 60 secs
lola: sara is running 65 secs || 8932 markings, 38092 edges, 128 markings/sec, 65 secs
lola: sara is running 70 secs || 9572 markings, 41466 edges, 128 markings/sec, 70 secs
lola: sara is running 75 secs || 10207 markings, 44690 edges, 127 markings/sec, 75 secs
lola: sara is running 80 secs || 10822 markings, 48076 edges, 123 markings/sec, 80 secs
lola: sara is running 85 secs || 11464 markings, 50561 edges, 128 markings/sec, 85 secs
lola: sara is running 90 secs || 12104 markings, 53183 edges, 128 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 95 secs || 12732 markings, 55723 edges, 126 markings/sec, 95 secs
lola: sara is running 100 secs || 13360 markings, 58291 edges, 126 markings/sec, 100 secs
lola: sara is running 105 secs || 14002 markings, 61140 edges, 128 markings/sec, 105 secs
lola: sara is running 110 secs || 14642 markings, 64352 edges, 128 markings/sec, 110 secs
lola: sara is running 115 secs || 15283 markings, 67232 edges, 128 markings/sec, 115 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Dekker-PT-200-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 676 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p0_83 + 1 <= p3_181)))))
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 ((((p0_83 + 1 <= p3_181)))))
lola: processed formula length: 33
lola: 31 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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: (((p0_83 + 1 <= p3_181)))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityCardinality-11-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityCardinality-11-0.sara.
lola: sara is running 0 secs || 646 markings, 2336 edges, 129 markings/sec, 0 secs
lola: sara is running 5 secs || 1288 markings, 4852 edges, 128 markings/sec, 5 secs
lola: sara is running 10 secs || 1925 markings, 8135 edges, 127 markings/sec, 10 secs
lola: sara is running 15 secs || 2564 markings, 11398 edges, 128 markings/sec, 15 secs
lola: sara is running 20 secs || 3201 markings, 14500 edges, 127 markings/sec, 20 secs
lola: sara is running 25 secs || 3842 markings, 17623 edges, 128 markings/sec, 25 secs
lola: sara is running 30 secs || 4482 markings, 20639 edges, 128 markings/sec, 30 secs
lola: sara is running 35 secs || 5096 markings, 23818 edges, 123 markings/sec, 35 secs
lola: sara is running 40 secs || 5724 markings, 27568 edges, 126 markings/sec, 40 secs
lola: sara is running 45 secs || 6362 markings, 31605 edges, 128 markings/sec, 45 secs
lola: sara is running 50 secs || 7003 markings, 35216 edges, 128 markings/sec, 50 secs
lola: sara is running 55 secs || 7645 markings, 38133 edges, 128 markings/sec, 55 secs
lola: sara is running 60 secs || 8282 markings, 41477 edges, 127 markings/sec, 60 secs
lola: sara is running 65 secs || 8923 markings, 44488 edges, 128 markings/sec, 65 secs
lola: sara is running 70 secs || 9574 markings, 47085 edges, 130 markings/sec, 70 secs
lola: sara is running 75 secs || 10213 markings, 49908 edges, 128 markings/sec, 75 secs
lola: sara is running 80 secs || 10829 markings, 53489 edges, 123 markings/sec, 80 secs
lola: sara is running 85 secs || 11470 markings, 56745 edges, 128 markings/sec, 85 secs
lola: sara is running 90 secs || 12108 markings, 60451 edges, 128 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 95 secs || 12729 markings, 65029 edges, 124 markings/sec, 95 secs
lola: sara is running 100 secs || 13364 markings, 68979 edges, 127 markings/sec, 100 secs
lola: sara is running 105 secs || 14023 markings, 72420 edges, 132 markings/sec, 105 secs
lola: sara is running 110 secs || 14683 markings, 75923 edges, 132 markings/sec, 110 secs
lola: sara is running 115 secs || 15343 markings, 79900 edges, 132 markings/sec, 115 secs
lola: state equation 0: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================

FORMULA Dekker-PT-200-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 815 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((flag_1_129 <= flag_0_175)))
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 ((flag_1_129 <= flag_0_175)))
lola: processed formula length: 34
lola: 32 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (flag_0_175 + 1 <= flag_1_129)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityCardinality-12-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA Dekker-PT-200-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1086 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1_80) AND (p0_189 + 1 <= p1_160))))
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 (((1 <= p1_80) AND (p0_189 + 1 <= p1_160))))
lola: processed formula length: 49
lola: 31 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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: ((1 <= p1_80) AND (p0_189 + 1 <= p1_160))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 4 markings, 3 edges
lola: ========================================

FORMULA Dekker-PT-200-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((flag_1_42 + 1 <= flag_0_21) AND (p1_168 + 1 <= p3_47))))
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 (((flag_1_42 + 1 <= flag_0_21) AND (p1_168 + 1 <= p3_47))))
lola: processed formula length: 64
lola: 31 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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: ((flag_1_42 + 1 <= flag_0_21) AND (p1_168 + 1 <= p3_47))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 6 markings, 5 edges
lola: ========================================

FORMULA Dekker-PT-200-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3260 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p1_6) OR (1 <= flag_1_72) OR ((p0_157 <= p1_74) AND (flag_1_101 <= p1_177))) AND (flag_0_48 <= p3_50))))
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 ((((1 <= p1_6) OR (1 <= flag_1_72) OR ((p0_157 <= p1_74) AND (flag_1_101 <= p1_177))) AND (flag_0_48 <= p3_50))))
lola: processed formula length: 120
lola: 31 rewrites
lola: closed formula file Dekker-PT-200-ReachabilityCardinality.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: (((1 <= p1_6) OR (1 <= flag_1_72) OR ((p0_157 <= p1_74) AND (flag_1_101 <= p1_177))) AND (flag_0_48 <= p3_50))
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Dekker-PT-200-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
sara: try reading problem file Dekker-PT-200-ReachabilityCardinality-15-0.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: ========================================

FORMULA Dekker-PT-200-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no yes yes no no yes no yes yes yes no yes no no yes no
lola:
preliminary result: no yes yes no no yes no yes yes yes no yes no no yes no
lola: memory consumption: 295776 KB
lola: time consumption: 310 seconds

BK_STOP 1526630214060

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